Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381722822
details
property
value
status
timeout (wallclock)
benchmark
43621.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
AProVE
configuration
standard
runtime (wallclock)
301.010602951 seconds
cpu usage
1225.63460145
max memory
1.9583717376E10
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 25 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 789 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 113 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 2176 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 1456 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 993 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 709 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 992 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) AND (21) QDP (22) QDPOrderProof [EQUIVALENT, 44 ms] (23) QDP (24) QDPOrderProof [EQUIVALENT, 40 ms] (25) QDP (26) PisEmptyProof [EQUIVALENT, 0 ms] (27) YES (28) QDP (29) QDPOrderProof [EQUIVALENT, 91 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 0 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 55 ms] (34) QDP (35) QDPOrderProof [EQUIVALENT, 2480 ms] (36) QDP (37) PisEmptyProof [EQUIVALENT, 0 ms] (38) YES (39) QDP (40) QDPOrderProof [EQUIVALENT, 3359 ms] (41) QDP (42) PisEmptyProof [EQUIVALENT, 0 ms] (43) YES (44) QDP (45) QDPOrderProof [EQUIVALENT, 48 ms] (46) QDP (47) QDPOrderProof [EQUIVALENT, 62 ms] (48) QDP (49) QDPOrderProof [EQUIVALENT, 11 ms] (50) QDP (51) PisEmptyProof [EQUIVALENT, 0 ms] (52) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(0(0(0(0(1(0(1(0(1(1(0(1(0(1(0(1(0(x1)))))))))))))))))))) -> 0(0(0(0(1(0(0(0(1(0(0(0(1(1(1(1(1(1(0(0(x1)))))))))))))))))))) 0(0(0(0(0(0(0(1(1(0(1(0(1(0(0(1(1(1(0(0(x1)))))))))))))))))))) -> 0(0(0(0(0(0(0(0(1(0(1(0(1(0(1(1(0(1(0(0(x1)))))))))))))))))))) 0(0(0(0(0(0(0(1(1(1(0(1(1(0(0(1(1(1(1(0(x1)))))))))))))))))))) -> 0(0(1(1(0(0(0(0(1(1(1(0(0(0(0(0(0(1(1(1(x1)))))))))))))))))))) 0(0(0(0(0(1(1(0(1(1(1(1(0(1(0(0(0(0(1(0(x1)))))))))))))))))))) -> 0(1(1(1(1(0(0(0(0(1(1(0(0(0(0(0(0(1(1(0(x1)))))))))))))))))))) 0(0(0(0(1(0(0(0(0(0(1(1(1(1(0(0(1(1(1(1(x1)))))))))))))))))))) -> 0(0(1(0(0(0(0(0(0(1(0(0(0(1(0(1(0(0(1(0(x1)))))))))))))))))))) 0(0(0(0(1(0(1(0(1(0(1(1(1(1(1(0(1(0(0(0(x1)))))))))))))))))))) -> 0(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(1(0(0(0(x1)))))))))))))))))))) 0(0(0(0(1(0(1(0(1(1(1(0(0(0(1(0(1(0(1(1(x1)))))))))))))))))))) -> 0(1(1(1(1(0(1(0(0(0(0(0(0(0(1(1(0(1(1(1(x1)))))))))))))))))))) 0(0(0(0(1(1(0(0(1(0(1(1(1(1(0(0(0(1(1(1(x1)))))))))))))))))))) -> 1(0(0(1(1(0(0(0(0(0(0(0(0(1(1(1(0(0(1(1(x1)))))))))))))))))))) 0(0(0(1(0(0(0(0(1(1(1(0(0(0(1(1(0(1(1(0(x1)))))))))))))))))))) -> 1(1(1(1(0(0(0(1(0(1(0(0(0(0(0(0(0(0(0(0(x1)))))))))))))))))))) 0(0(0(1(0(0(0(1(0(0(0(1(1(0(1(0(0(1(0(1(x1)))))))))))))))))))) -> 0(0(1(1(1(1(0(0(1(0(0(0(0(0(0(0(0(0(1(1(x1)))))))))))))))))))) 0(0(0(1(0(0(0(1(0(1(0(0(0(1(0(0(1(0(1(0(x1)))))))))))))))))))) -> 0(1(1(0(0(1(0(0(1(0(0(0(0(0(0(0(1(1(1(0(x1)))))))))))))))))))) 0(0(0(1(0(0(0(1(1(1(0(1(1(1(0(0(0(0(0(1(x1)))))))))))))))))))) -> 0(0(0(1(0(0(0(0(0(0(0(1(1(0(1(0(1(0(0(0(x1)))))))))))))))))))) 0(0(0(1(0(1(0(0(0(0(1(0(0(1(1(0(1(0(1(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(0(0(0(0(0(0(1(0(1(1(1(1(1(0(x1)))))))))))))))))))) 0(0(0(1(0(1(0(0(1(1(0(0(1(1(0(0(0(1(0(0(x1)))))))))))))))))))) -> 0(0(0(1(0(0(0(0(0(1(0(0(0(1(1(1(1(0(0(1(x1)))))))))))))))))))) 0(0(0(1(0(1(0(1(0(1(1(1(0(1(0(0(0(1(0(1(x1)))))))))))))))))))) -> 0(0(1(0(1(1(1(1(0(0(1(1(1(0(0(0(1(0(0(1(x1)))))))))))))))))))) 0(0(0(1(0(1(1(1(0(0(0(1(0(1(1(1(0(1(1(0(x1)))))))))))))))))))) -> 0(1(1(0(0(1(0(0(0(1(0(0(1(1(0(1(1(0(0(1(x1)))))))))))))))))))) 0(0(0(1(1(0(0(1(1(0(0(0(0(0(0(1(1(0(0(1(x1)))))))))))))))))))) -> 0(0(1(0(0(0(0(0(1(0(0(0(0(0(1(1(0(0(0(1(x1)))))))))))))))))))) 0(0(0(1(1(0(1(1(0(1(0(0(0(1(0(1(0(1(0(0(x1)))))))))))))))))))) -> 0(1(0(1(1(0(1(1(0(0(0(0(1(1(0(0(0(0(1(0(x1)))))))))))))))))))) 0(0(0(1(1(0(1(1(1(0(1(0(0(0(0(0(0(0(1(1(x1)))))))))))))))))))) -> 0(0(0(0(1(0(0(0(0(0(0(0(0(1(0(1(0(0(1(1(x1)))))))))))))))))))) 0(0(0(1(1(1(0(1(0(0(1(0(1(1(1(1(1(1(0(1(x1)))))))))))))))))))) -> 1(0(0(1(0(0(1(0(1(0(0(0(0(1(0(1(1(0(1(1(x1)))))))))))))))))))) 0(0(0(1(1(1(0(1(1(0(0(1(1(0(0(0(1(1(1(1(x1)))))))))))))))))))) -> 1(1(1(0(0(0(1(0(0(0(0(1(0(0(1(0(0(1(0(0(x1)))))))))))))))))))) 0(0(1(0(0(0(0(1(0(1(1(1(0(0(1(0(1(0(0(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(0(1(0(0(1(1(1(1(0(1(0(0(0(0(x1)))))))))))))))))))) 0(0(1(0(0(0(0(1(1(0(0(1(1(1(0(0(0(0(1(1(x1)))))))))))))))))))) -> 0(0(0(0(1(1(1(1(0(0(1(0(0(0(0(1(0(0(0(0(x1)))))))))))))))))))) 0(0(1(0(0(0(1(1(0(0(0(1(0(0(1(0(1(0(0(1(x1)))))))))))))))))))) -> 0(1(1(0(0(0(0(0(1(1(0(0(0(0(0(1(0(1(0(1(x1)))))))))))))))))))) 0(0(1(0(0(0(1(1(1(1(1(1(0(0(0(0(1(1(1(1(x1)))))))))))))))))))) -> 0(0(1(0(0(1(1(1(0(0(1(1(0(1(0(1(0(0(0(0(x1))))))))))))))))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685