Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381723887
details
property
value
status
complete
benchmark
160234.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.951736927 seconds
cpu usage
37.781809741
max memory
3.988668416E9
stage attributes
key
value
output-size
28942
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) DependencyPairsProof [EQUIVALENT, 169 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPOrderProof [EQUIVALENT, 234 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) UsableRulesProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(2(x1))) -> 2(3(0(3(1(x1))))) 0(0(0(2(x1)))) -> 3(0(0(3(0(2(x1)))))) 0(0(2(2(x1)))) -> 2(3(0(0(3(2(x1)))))) 0(1(1(2(x1)))) -> 2(3(0(3(1(1(x1)))))) 0(1(2(1(x1)))) -> 0(1(2(4(1(3(x1)))))) 0(1(2(2(x1)))) -> 2(3(0(3(1(2(x1)))))) 0(1(2(5(x1)))) -> 2(0(5(3(1(x1))))) 0(1(5(1(x1)))) -> 1(0(3(5(3(1(x1)))))) 0(1(5(2(x1)))) -> 2(4(1(0(3(5(x1)))))) 0(1(5(2(x1)))) -> 2(4(3(1(0(5(x1)))))) 0(1(5(2(x1)))) -> 3(1(3(0(5(2(x1)))))) 0(1(5(5(x1)))) -> 1(3(0(5(5(x1))))) 0(2(1(2(x1)))) -> 2(2(3(0(3(1(x1)))))) 0(2(5(2(x1)))) -> 2(2(3(0(5(x1))))) 1(1(4(5(x1)))) -> 5(4(1(3(1(x1))))) 1(5(1(5(x1)))) -> 1(3(5(5(3(1(x1)))))) 1(5(5(1(x1)))) -> 1(5(3(1(5(3(x1)))))) 2(0(1(2(x1)))) -> 2(2(3(0(3(1(x1)))))) 2(0(1(5(x1)))) -> 2(1(3(0(5(x1))))) 5(0(1(2(x1)))) -> 3(0(5(3(1(2(x1)))))) 5(0(1(2(x1)))) -> 4(2(3(0(5(1(x1)))))) 0(0(0(0(1(x1))))) -> 0(0(1(0(0(3(x1)))))) 0(0(1(2(5(x1))))) -> 2(0(0(5(3(1(x1)))))) 0(0(1(5(2(x1))))) -> 0(1(0(3(5(2(x1)))))) 0(1(0(4(5(x1))))) -> 5(4(0(0(3(1(x1)))))) 0(1(1(1(2(x1))))) -> 1(0(3(1(1(2(x1)))))) 0(1(2(1(5(x1))))) -> 2(1(0(5(3(1(x1)))))) 0(1(3(5(2(x1))))) -> 3(0(4(1(5(2(x1)))))) 0(1(4(2(5(x1))))) -> 2(4(3(0(5(1(x1)))))) 0(1(4(4(2(x1))))) -> 1(0(4(4(4(2(x1)))))) 0(1(5(0(1(x1))))) -> 0(1(1(0(5(3(x1)))))) 0(1(5(0(5(x1))))) -> 3(5(1(0(5(0(x1)))))) 0(2(4(2(1(x1))))) -> 2(1(2(4(3(0(x1)))))) 0(4(0(2(1(x1))))) -> 3(0(4(1(2(0(x1)))))) 0(5(0(1(5(x1))))) -> 0(5(0(5(3(1(x1)))))) 1(0(0(1(5(x1))))) -> 5(1(0(0(3(1(x1)))))) 1(0(1(4(5(x1))))) -> 1(4(4(1(0(5(x1)))))) 1(4(0(1(5(x1))))) -> 1(4(1(3(0(5(x1)))))) 2(0(1(5(2(x1))))) -> 2(1(0(3(5(2(x1)))))) 2(0(4(2(1(x1))))) -> 2(1(4(2(3(0(x1)))))) 2(0(5(1(2(x1))))) -> 0(3(1(5(2(2(x1)))))) 2(2(1(1(2(x1))))) -> 2(2(1(3(1(2(x1)))))) 2(5(1(5(2(x1))))) -> 2(4(1(5(5(2(x1)))))) 5(0(1(4(5(x1))))) -> 4(1(0(3(5(5(x1)))))) 5(1(0(1(5(x1))))) -> 3(1(5(1(0(5(x1)))))) 5(4(0(2(1(x1))))) -> 4(1(3(5(2(0(x1)))))) 5(5(1(4(5(x1))))) -> 5(4(1(3(5(5(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685