Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381722752
details
property
value
status
complete
benchmark
231604.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.36055707932 seconds
cpu usage
9.710151158
max memory
1.2680192E9
stage attributes
key
value
output-size
14270
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 152 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 2 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 1 ms] (10) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(x1) -> 1(x1) 0(0(x1)) -> 0(x1) 3(4(5(x1))) -> 4(3(5(x1))) 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 0(0(1(0(1(0(0(0(0(1(0(0(0(1(0(1(1(1(1(1(1(1(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(0(1(0(0(0(1(0(1(0(1(0(0(0(0(1(1(1(1(0(0(0(1(0(1(0(0(1(0(0(0(1(1(0(0(1(0(0(0(1(1(1(0(1(1(1(0(0(1(1(1(1(1(1(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(0(1(0(0(0(0(1(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(0(0(1(1(1(0(0(0(0(1(1(1(0(0(1(0(1(1(0(0(1(1(1(0(1(0(1(1(1(1(1(0(1(0(0(0(0(1(0(0(1(0(0(0(0(0(0(1(0(1(0(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(0(1(1(1(0(0(1(0(1(1(0(1(0(1(0(1(1(0(0(0(0(1(1(0(1(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(1(1(1(0(0(1(1(0(1(1(0(0(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(1(1(0(0(1(1(1(1(0(0(1(1(1(1(0(1(0(1(0(0(0(1(1(1(0(1(0(0(0(0(0(0(0(0(1(0(1(0(1(1(1(0(1(0(0(1(0(1(1(1(0(1(0(1(0(0(1(1(0(0(0(0(1(1(1(0(1(1(1(0(0(1(1(0(1(1(1(0(1(1(1(0(1(0(0(0(0(0(1(1(0(0(0(0(1(0(0(1(0(0(1(1(1(0(1(0(1(0(0(0(0(1(1(0(1(0(0(0(1(1(0(1(1(1(1(1(0(0(0(1(0(1(1(0(1(0(1(1(0(1(1(0(1(1(0(0(1(0(1(0(1(1(0(0(1(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(1(1(0(1(0(1(0(0(1(1(1(1(0(0(0(1(1(1(0(1(0(1(1(0(1(0(1(1(1(0(1(1(1(0(1(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(1(1(0(0(1(1(0(0(1(1(1(1(0(0(1(1(0(1(0(1(0(0(1(0(1(1(0(0(0(0(0(1(0(0(0(1(0(0(1(0(1(1(1(0(1(1(1(0(0(0(0(1(1(0(0(1(0(0(1(0(0(1(0(0(0(0(0(0(0(0(0(0(0(0(1(0(1(1(0(0(0(1(0(0(1(1(0(0(1(1(1(0(0(1(0(0(0(0(0(0(0(0(1(0(1(0(0(0(0(0(1(1(0(0(0(1(0(0(0(1(1(0(0(0(0(0(1(1(0(1(1(1(0(0(0(1(1(1(1(0(1(1(1(1(1(1(1(0(0(1(0(1(1(1(0(0(1(1(0(1(0(1(0(1(0(0(1(1(1(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(1(1(0(0(0(1(0(0(1(0(1(1(1(0(0(0(1(0(1(1(1(1(0(1(0(0(1(0(0(0(0(0(1(0(0(0(0(0(0(1(1(0(0(1(1(1(0(0(1(0(0(1(1(0(1(0(1(0(1(1(1(1(0(0(1(0(1(1(1(1(0(1(1(0(0(1(0(0(1(0(0(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(1(0(1(0(1(1(1(0(0(1(0(1(1(1(0(0(0(1(1(0(1(1(0(1(1(0(1(0(0(1(0(1(1(0(0(1(1(1(1(1(1(0(0(1(0(0(0(1(1(1(0(0(1(0(0(1(0(1(0(0(1(1(1(1(1(1(1(1(1(0(1(1(1(0(1(1(1(1(1(0(1(0(0(0(1(0(1(1(0(0(1(1(1(0(0(0(0(0(1(0(0(1(0(0(1(0(0(0(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(x1) -> 1(x1) 0(0(x1)) -> 0(x1) 5(4(3(x1))) -> 5(3(4(x1))) 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 1(0(0(1(1(0(1(0(1(0(0(1(1(0(1(1(0(1(1(0(1(0(1(1(0(1(0(0(0(1(1(1(1(1(0(1(1(0(0(0(1(0(1(1(0(0(0(0(1(0(1(0(1(1(1(0(0(1(0(0(1(0(0(0(0(1(1(0(0(0(0(0(1(0(1(1(1(0(1(1(1(0(1(1(0(0(1(1(1(0(1(1(1(0(0(0(0(1(1(0(0(1(0(1(0(1(1(1(0(1(0(0(1(0(1(1(1(0(1(0(1(0(0(0(0(0(0(0(0(1(0(1(1(1(0(0(0(1(0(1(0(1(1(1(1(0(0(1(1(1(1(0(0(1(1(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(0(0(1(0(1(0(1(0(1(0(0(0(0(1(1(0(1(1(0(0(1(1(1(0(1(0(1(0(0(0(0(0(1(1(0(1(1(1(1(0(1(1(0(0(1(0(1(1(0(0(0(0(1(1(0(1(0(1(0(1(1(0(1(0(0(1(1(1(0(1(1(1(0(1(0(1(1(0(0(1(1(1(0(0(0(1(1(0(1(0(1(0(0(0(0(0(0(1(0(0(1(0(0(0(0(1(0(1(1(1(1(1(0(1(0(1(1(1(0(0(1(1(0(1(0(0(1(1(1(0(0(0(0(1(1(1(0(0(0(1(1(0(0(0(1(0(1(0(1(0(1(0(0(1(0(0(0(0(1(0(0(1(0(1(1(1(1(1(0(1(0(1(1(0(0(1(1(1(0(0(0(1(1(1(1(1(1(1(1(0(0(1(1(1(0(1(1(1(0(0(0(1(0(0(1(1(0(0(0(1(0(0(1(0(1(0(0(0(1(1(1(1(0(0(0(0(1(0(1(0(1(0(0(0(1(0(0(1(0(1(0(0(0(0(0(1(1(0(1(1(1(1(1(1(1(1(1(1(1(0(1(0(0(0(1(0(0(0(0(1(0(1(0(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(0(0(0(1(0(0(1(0(0(1(0(0(0(0(0(1(1(1(0(0(1(1(0(1(0(0(0(1(0(1(1(1(1(1(0(1(1(1(0(1(1(1(1(1(1(1(1(1(0(0(1(0(1(0(0(1(0(0(1(1(1(0(0(0(1(0(0(1(1(1(1(1(1(0(0(1(1(0(1(0(0(1(0(1(1(0(1(1(0(1(1(0(0(0(1(1(1(0(1(0(0(1(1(1(0(1(0(1(0(1(0(1(1(1(1(1(0(1(0(1(1(0(0(1(0(0(1(0(0(1(0(0(1(1(0(1(1(1(1(0(1(0(0(1(1(1(1(0(1(0(1(0(1(1(0(0(1(0(0(1(1(1(0(0(1(1(0(0(0(0(0(0(1(0(0(0(0(0(1(0(0(1(0(1(1(1(1(0(1(0(0(0(1(1(1(0(1(0(0(1(0(0(0(1(1(1(0(0(0(0(0(1(1(0(1(1(1(1(0(1(1(1(1(1(0(0(1(0(1(0(1(0(1(1(0(0(1(1(1(0(1(0(0(1(1(1(1(1(1(1(0(1(1(1(1(0(0(0(1(1(1(0(1(1(0(0(0(0(0(1(1(0(0(0(1(0(0(0(1(1(0(0(0(0(0(1(0(1(0(0(0(0(0(0(0(0(1(0(0(1(1(1(0(0(1(1(0(0(1(0(0(0(1(1(0(1(0(0(0(0(0(0(0(0(0(0(0(0(1(0(0(1(0(0(1(0(0(1(1(0(0(0(0(1(1(1(0(1(1(1(0(1(0(0(1(0(0(0(1(0(0(0(0(0(1(1(0(1(0(0(1(0(1(0(1(1(0(0(1(1(1(1(0(0(1(1(0(0(1(1(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(1(0(1(1(1(0(1(1(1(0(1(0(1(1(0(1(0(1(1(1(0(0(0(1(1(1(1(0(0(1(0(1(0(1(1(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = 9 + x_1 POL(1(x_1)) = 8 + x_1 POL(2(x_1)) = 22 + x_1 POL(3(x_1)) = x_1 POL(4(x_1)) = x_1 POL(5(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 0(x1) -> 1(x1) 0(0(x1)) -> 0(x1) 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 1(0(0(1(1(0(1(0(1(0(0(1(1(0(1(1(0(1(1(0(1(0(1(1(0(1(0(0(0(1(1(1(1(1(0(1(1(0(0(0(1(0(1(1(0(0(0(0(1(0(1(0(1(1(1(0(0(1(0(0(1(0(0(0(0(1(1(0(0(0(0(0(1(0(1(1(1(0(1(1(1(0(1(1(0(0(1(1(1(0(1(1(1(0(0(0(0(1(1(0(0(1(0(1(0(1(1(1(0(1(0(0(1(0(1(1(1(0(1(0(1(0(0(0(0(0(0(0(0(1(0(1(1(1(0(0(0(1(0(1(0(1(1(1(1(0(0(1(1(1(1(0(0(1(1(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(0(0(1(0(1(0(1(0(1(0(0(0(0(1(1(0(1(1(0(0(1(1(1(0(1(0(1(0(0(0(0(0(1(1(0(1(1(1(1(0(1(1(0(0(1(0(1(1(0(0(0(0(1(1(0(1(0(1(0(1(1(0(1(0(0(1(1(1(0(1(1(1(0(1(0(1(1(0(0(1(1(1(0(0(0(1(1(0(1(0(1(0(0(0(0(0(0(1(0(0(1(0(0(0(0(1(0(1(1(1(1(1(0(1(0(1(1(1(0(0(1(1(0(1(0(0(1(1(1(0(0(0(0(1(1(1(0(0(0(1(1(0(0(0(1(0(1(0(1(0(1(0(0(1(0(0(0(0(1(0(0(1(0(1(1(1(1(1(0(1(0(1(1(0(0(1(1(1(0(0(0(1(1(1(1(1(1(1(1(0(0(1(1(1(0(1(1(1(0(0(0(1(0(0(1(1(0(0(0(1(0(0(1(0(1(0(0(0(1(1(1(1(0(0(0(0(1(0(1(0(1(0(0(0(1(0(0(1(0(1(0(0(0(0(0(1(1(0(1(1(1(1(1(1(1(1(1(1(1(0(1(0(0(0(1(0(0(0(0(1(0(1(0(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(0(0(0(1(0(0(1(0(0(1(0(0(0(0(0(1(1(1(0(0(1(1(0(1(0(0(0(1(0(1(1(1(1(1(0(1(1(1(0(1(1(1(1(1(1(1(1(1(0(0(1(0(1(0(0(1(0(0(1(1(1(0(0(0(1(0(0(1(1(1(1(1(1(0(0(1(1(0(1(0(0(1(0(1(1(0(1(1(0(1(1(0(0(0(1(1(1(0(1(0(0(1(1(1(0(1(0(1(0(1(0(1(1(1(1(1(0(1(0(1(1(0(0(1(0(0(1(0(0(1(0(0(1(1(0(1(1(1(1(0(1(0(0(1(1(1(1(0(1(0(1(0(1(1(0(0(1(0(0(1(1(1(0(0(1(1(0(0(0(0(0(0(1(0(0(0(0(0(1(0(0(1(0(1(1(1(1(0(1(0(0(0(1(1(1(0(1(0(0(1(0(0(0(1(1(1(0(0(0(0(0(1(1(0(1(1(1(1(0(1(1(1(1(1(0(0(1(0(1(0(1(0(1(1(0(0(1(1(1(0(1(0(0(1(1(1(1(1(1(1(0(1(1(1(1(0(0(0(1(1(1(0(1(1(0(0(0(0(0(1(1(0(0(0(1(0(0(0(1(1(0(0(0(0(0(1(0(1(0(0(0(0(0(0(0(0(1(0(0(1(1(1(0(0(1(1(0(0(1(0(0(0(1(1(0(1(0(0(0(0(0(0(0(0(0(0(0(0(1(0(0(1(0(0(1(0(0(1(1(0(0(0(0(1(1(1(0(1(1(1(0(1(0(0(1(0(0(0(1(0(0(0(0(0(1(1(0(1(0(0(1(0(1(0(1(1(0(0(1(1(1(1(0(0(1(1(0(0(1(1(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(1(0(1(1(1(0(1(1(1(0(1(0(1(1(0(1(0(1(1(1(0(0(0(1(1(1(1(0(0(1(0(1(0(1(1(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 5(4(3(x1))) -> 5(3(4(x1))) Q is empty. ---------------------------------------- (5) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none The TRS R 2 is 5(4(3(x1))) -> 5(3(4(x1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685