Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516972640
details
property
value
status
timeout (wallclock)
benchmark
41843.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
ICFP_2010
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
301.008178949 seconds
cpu usage
1127.6807567
max memory
1.749233664E10
stage attributes
unavailable
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 544 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 556 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 2 ms] (8) AND (9) QDP (10) QDPOrderProof [EQUIVALENT, 180 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPOrderProof [EQUIVALENT, 132 ms] (16) QDP (17) PisEmptyProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) QDPOrderProof [EQUIVALENT, 151 ms] (21) QDP (22) DependencyGraphProof [EQUIVALENT, 0 ms] (23) QDP (24) QDPOrderProof [EQUIVALENT, 161 ms] (25) QDP (26) TransformationProof [EQUIVALENT, 0 ms] (27) QDP (28) DependencyGraphProof [EQUIVALENT, 0 ms] (29) QDP (30) TransformationProof [EQUIVALENT, 0 ms] (31) QDP (32) DependencyGraphProof [EQUIVALENT, 0 ms] (33) QDP (34) QDPOrderProof [EQUIVALENT, 2700 ms] (35) QDP (36) SplitQDPProof [EQUIVALENT, 0 ms] (37) AND (38) QDP (39) SemLabProof [SOUND, 0 ms] (40) QDP (41) DependencyGraphProof [EQUIVALENT, 0 ms] (42) QDP (43) PisEmptyProof [SOUND, 0 ms] (44) TRUE (45) QDP (46) QDPOrderProof [EQUIVALENT, 93 ms] (47) QDP (48) QDPOrderProof [EQUIVALENT, 65 ms] (49) QDP (50) PisEmptyProof [EQUIVALENT, 0 ms] (51) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(1(2(x1)))) -> 0(3(1(0(2(x1))))) 0(1(2(2(x1)))) -> 1(2(0(3(2(2(x1)))))) 0(1(2(4(x1)))) -> 0(3(2(3(1(4(x1)))))) 0(5(0(5(x1)))) -> 0(3(0(5(5(x1))))) 0(5(1(2(x1)))) -> 1(0(1(5(2(x1))))) 0(5(1(2(x1)))) -> 0(1(0(1(5(2(x1)))))) 0(5(1(2(x1)))) -> 0(3(2(3(1(5(x1)))))) 0(5(4(2(x1)))) -> 0(4(5(3(2(x1))))) 0(5(5(2(x1)))) -> 5(0(1(5(2(x1))))) 1(0(0(5(x1)))) -> 1(1(0(0(1(5(4(x1))))))) 1(0(1(2(x1)))) -> 1(1(3(0(2(x1))))) 1(0(1(2(x1)))) -> 1(1(0(3(2(2(x1)))))) 1(0(1(2(x1)))) -> 1(1(0(3(2(3(x1)))))) 1(0(5(4(x1)))) -> 0(1(1(5(4(x1))))) 1(2(0(5(x1)))) -> 0(3(2(3(1(5(x1)))))) 1(2(0(5(x1)))) -> 5(0(3(3(2(1(x1)))))) 1(5(0(2(x1)))) -> 1(1(0(1(1(5(2(x1))))))) 1(5(1(2(x1)))) -> 0(1(1(5(2(x1))))) 1(5(1(2(x1)))) -> 1(0(1(5(3(2(x1)))))) 5(0(0(2(x1)))) -> 5(0(3(0(2(x1))))) 5(0(1(2(x1)))) -> 5(1(0(3(2(x1))))) 5(0(1(2(x1)))) -> 5(1(0(3(2(3(x1)))))) 0(0(0(1(2(x1))))) -> 0(2(0(1(0(3(3(4(x1)))))))) 0(0(2(5(2(x1))))) -> 0(3(2(0(5(2(x1)))))) 0(1(2(5(0(x1))))) -> 3(3(2(2(0(0(1(5(x1)))))))) 0(1(2(5(2(x1))))) -> 0(3(2(1(5(3(2(x1)))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard