Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487514789
details
property
value
status
complete
benchmark
211915.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n134.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.5284268856 seconds
cpu usage
30.238701491
max memory
3.534774272E9
stage attributes
key
value
output-size
32518
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 230 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPOrderProof [EQUIVALENT, 44 ms] (9) QDP (10) PisEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPOrderProof [EQUIVALENT, 167 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 128 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 83 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(2(x1))) -> 1(3(0(2(x1)))) 0(1(2(x1))) -> 3(1(2(0(x1)))) 0(1(2(x1))) -> 2(0(4(1(3(x1))))) 0(1(2(x1))) -> 3(0(2(1(3(x1))))) 0(1(2(x1))) -> 3(3(0(2(1(x1))))) 0(1(2(x1))) -> 1(3(3(0(2(3(x1)))))) 0(1(2(x1))) -> 2(0(4(3(1(3(x1)))))) 0(1(2(x1))) -> 3(0(1(3(1(2(x1)))))) 0(1(2(x1))) -> 3(0(5(3(1(2(x1)))))) 0(5(2(x1))) -> 1(5(0(2(x1)))) 0(5(2(x1))) -> 3(5(0(2(x1)))) 0(5(2(x1))) -> 3(0(5(1(2(x1))))) 0(5(2(x1))) -> 3(5(3(0(2(x1))))) 0(5(2(x1))) -> 1(5(5(3(0(2(x1)))))) 0(5(2(x1))) -> 5(0(4(3(1(2(x1)))))) 1(5(2(x1))) -> 5(3(1(2(x1)))) 1(5(2(x1))) -> 1(5(3(1(2(x1))))) 0(0(5(4(x1)))) -> 5(3(0(4(0(0(x1)))))) 0(1(0(1(x1)))) -> 1(1(3(0(3(0(x1)))))) 0(1(1(2(x1)))) -> 2(1(1(3(0(2(x1)))))) 0(1(2(5(x1)))) -> 3(0(5(1(2(x1))))) 0(1(2(5(x1)))) -> 3(5(3(1(2(0(x1)))))) 0(1(3(2(x1)))) -> 3(0(2(1(3(5(x1)))))) 0(1(4(2(x1)))) -> 3(0(0(4(1(2(x1)))))) 0(1(4(2(x1)))) -> 4(0(1(3(1(2(x1)))))) 0(5(2(4(x1)))) -> 5(5(3(0(2(4(x1)))))) 0(5(2(5(x1)))) -> 0(2(3(5(5(x1))))) 0(5(3(2(x1)))) -> 3(0(2(1(5(x1))))) 0(5(3(2(x1)))) -> 5(3(1(4(0(2(x1)))))) 1(0(3(4(x1)))) -> 1(0(4(1(3(x1))))) 1(5(3(2(x1)))) -> 3(1(3(5(2(x1))))) 5(0(1(2(x1)))) -> 1(5(0(4(1(2(x1)))))) 5(1(0(2(x1)))) -> 3(1(5(0(2(x1))))) 5(1(1(2(x1)))) -> 1(3(5(2(1(3(x1)))))) 5(1(5(2(x1)))) -> 1(3(5(5(2(x1))))) 0(0(1(3(2(x1))))) -> 0(3(1(2(0(3(x1)))))) 0(0(5(3(2(x1))))) -> 0(3(0(3(2(5(x1)))))) 0(1(0(3(4(x1))))) -> 4(0(1(3(0(3(x1)))))) 0(1(0(5(4(x1))))) -> 3(0(4(0(1(5(x1)))))) 0(1(2(4(4(x1))))) -> 0(4(1(2(1(4(x1)))))) 0(1(5(3(2(x1))))) -> 1(2(3(0(4(5(x1)))))) 0(5(4(2(4(x1))))) -> 4(5(3(0(4(2(x1)))))) 0(5(4(4(2(x1))))) -> 0(4(4(3(5(2(x1)))))) 1(0(1(3(4(x1))))) -> 4(1(1(3(0(3(x1)))))) 1(0(3(4(5(x1))))) -> 2(1(3(0(4(5(x1)))))) 1(1(3(4(2(x1))))) -> 2(5(1(3(1(4(x1)))))) 1(5(3(2(2(x1))))) -> 2(3(5(3(1(2(x1)))))) 5(0(5(2(4(x1))))) -> 5(1(5(0(4(2(x1)))))) 5(1(0(5(2(x1))))) -> 1(5(0(2(3(5(x1)))))) 5(1(1(2(1(x1))))) -> 3(1(2(5(1(1(x1)))))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard