Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719042
details
property
value
status
complete
benchmark
135659.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
105.368000984 seconds
cpu usage
384.246309917
max memory
1.6412803072E10
stage attributes
key
value
output-size
620997
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: 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) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 20 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 970 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 49 ms] (10) QTRS (11) DependencyPairsProof [EQUIVALENT, 1155 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 1863 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) AND (17) QDP (18) QDPOrderProof [EQUIVALENT, 149 ms] (19) QDP (20) DependencyGraphProof [EQUIVALENT, 0 ms] (21) AND (22) QDP (23) QDPOrderProof [EQUIVALENT, 49 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 44 ms] (26) QDP (27) PisEmptyProof [EQUIVALENT, 0 ms] (28) YES (29) QDP (30) QDPOrderProof [EQUIVALENT, 107 ms] (31) QDP (32) QDPOrderProof [EQUIVALENT, 51 ms] (33) QDP (34) QDPOrderProof [EQUIVALENT, 6511 ms] (35) QDP (36) PisEmptyProof [EQUIVALENT, 0 ms] (37) YES (38) QDP (39) QDPOrderProof [EQUIVALENT, 52 ms] (40) QDP (41) PisEmptyProof [EQUIVALENT, 0 ms] (42) YES (43) QDP (44) QDPOrderProof [EQUIVALENT, 55 ms] (45) QDP (46) QDPOrderProof [EQUIVALENT, 42 ms] (47) QDP (48) PisEmptyProof [EQUIVALENT, 0 ms] (49) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(0(0(0(0(0(1(0(0(0(0(0(1(1(1(0(1(0(x1)))))))))))))))))))) -> 0(0(0(1(0(1(0(0(1(0(0(1(0(0(0(1(0(0(0(0(x1)))))))))))))))))))) 0(0(0(0(0(0(0(0(1(0(0(1(0(1(0(1(1(1(1(1(x1)))))))))))))))))))) -> 1(1(0(0(0(0(0(0(0(0(0(0(1(0(0(0(1(0(1(0(x1)))))))))))))))))))) 0(0(0(0(0(0(0(1(1(1(1(0(0(0(0(1(0(1(0(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(0(0(1(0(0(1(0(0(0(0(0(0(0(1(x1)))))))))))))))))))) 0(0(0(0(0(0(1(0(0(0(0(1(1(1(1(1(0(0(0(1(x1)))))))))))))))))))) -> 0(0(1(0(0(0(0(0(1(1(0(0(0(0(0(0(1(0(0(1(x1)))))))))))))))))))) 0(0(0(0(0(0(1(0(0(1(0(1(0(1(1(1(1(0(1(1(x1)))))))))))))))))))) -> 0(1(1(0(1(0(1(0(0(1(1(0(0(0(0(0(0(1(1(1(x1)))))))))))))))))))) 0(0(0(0(0(0(1(0(0(1(0(1(1(0(1(1(1(0(0(1(x1)))))))))))))))))))) -> 0(1(0(0(1(0(1(0(1(0(0(1(0(1(0(0(0(1(1(0(x1)))))))))))))))))))) 0(0(0(0(0(0(1(1(0(1(1(0(0(0(0(0(1(1(0(1(x1)))))))))))))))))))) -> 0(0(1(0(1(1(0(0(0(1(0(1(0(1(0(0(0(1(0(0(x1)))))))))))))))))))) 0(0(0(0(0(1(1(1(0(0(0(1(0(0(1(1(1(0(1(0(x1)))))))))))))))))))) -> 1(1(1(0(0(1(0(0(0(1(0(0(0(0(1(0(0(0(0(1(x1)))))))))))))))))))) 0(0(0(0(1(0(0(0(1(1(0(0(1(0(1(1(0(1(1(1(x1)))))))))))))))))))) -> 0(0(1(0(1(0(0(0(1(0(0(1(1(1(1(0(1(0(0(0(x1)))))))))))))))))))) 0(0(0(0(1(1(1(0(0(0(0(1(0(0(0(1(0(1(1(1(x1)))))))))))))))))))) -> 0(1(0(0(1(1(0(1(0(1(1(0(0(0(0(0(0(0(1(1(x1)))))))))))))))))))) 0(0(0(1(0(0(0(0(0(0(1(0(1(0(1(1(1(1(0(0(x1)))))))))))))))))))) -> 1(1(0(0(0(1(0(1(0(0(0(0(0(1(0(0(1(0(0(0(x1)))))))))))))))))))) 0(0(0(1(0(0(0(1(0(1(1(1(0(0(1(0(1(0(1(1(x1)))))))))))))))))))) -> 0(0(0(0(0(1(1(1(0(0(0(0(1(1(1(0(0(1(0(0(x1)))))))))))))))))))) 0(0(0(1(0(1(1(1(0(1(0(0(0(1(1(0(0(1(0(1(x1)))))))))))))))))))) -> 1(0(0(0(1(0(1(1(0(0(0(0(0(0(0(1(1(1(0(0(x1)))))))))))))))))))) 0(0(0(1(1(0(0(0(1(1(0(0(1(1(0(0(0(1(0(1(x1)))))))))))))))))))) -> 0(0(0(1(0(0(1(1(0(0(0(0(1(0(0(0(1(0(0(0(x1)))))))))))))))))))) 0(0(0(1(1(0(1(0(1(1(0(0(1(0(1(0(1(0(0(1(x1)))))))))))))))))))) -> 1(0(0(0(1(1(0(1(0(1(0(0(0(0(0(1(0(1(0(0(x1)))))))))))))))))))) 0(0(0(1(1(1(1(1(0(0(0(1(0(0(0(0(1(0(0(0(x1)))))))))))))))))))) -> 0(1(1(0(0(0(1(0(0(0(1(0(0(1(0(1(1(0(0(0(x1)))))))))))))))))))) 0(0(1(0(0(0(0(1(0(0(0(1(0(0(0(1(0(1(1(1(x1)))))))))))))))))))) -> 0(1(0(1(0(0(0(0(0(0(0(0(1(1(0(0(0(0(1(1(x1)))))))))))))))))))) 0(0(1(0(0(0(0(1(0(0(0(1(1(1(0(1(1(0(0(0(x1)))))))))))))))))))) -> 0(1(0(0(0(1(0(1(1(0(0(1(0(0(0(1(0(0(1(0(x1)))))))))))))))))))) 0(0(1(0(0(0(1(0(0(1(0(1(1(1(0(0(1(0(0(1(x1)))))))))))))))))))) -> 0(0(0(1(0(0(1(0(0(0(0(0(1(0(0(0(0(1(0(0(x1)))))))))))))))))))) 0(0(1(0(0(1(0(1(1(1(0(0(0(0(1(1(0(0(0(1(x1)))))))))))))))))))) -> 1(0(0(1(0(0(1(1(0(1(0(0(1(0(0(1(0(0(0(1(x1)))))))))))))))))))) 0(0(1(0(0(1(1(0(0(0(0(1(0(1(1(0(0(1(0(1(x1)))))))))))))))))))) -> 1(0(0(0(0(0(0(0(0(0(0(1(0(1(0(0(0(0(0(1(x1)))))))))))))))))))) 0(0(1(0(0(1(1(0(0(1(0(0(0(1(1(0(1(0(0(1(x1)))))))))))))))))))) -> 0(1(0(1(0(1(0(0(0(0(0(1(0(0(1(0(1(0(1(0(x1)))))))))))))))))))) 0(0(1(0(1(0(0(1(1(0(1(0(1(0(0(0(1(1(1(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(1(1(0(1(1(0(1(0(0(1(1(0(1(0(x1)))))))))))))))))))) 0(0(1(0(1(0(1(0(0(0(1(0(1(1(1(0(1(1(0(0(x1)))))))))))))))))))) -> 1(0(0(0(1(1(1(0(0(1(0(0(0(0(0(1(1(0(1(0(x1)))))))))))))))))))) 0(0(1(0(1(0(1(0(1(1(0(0(1(0(1(0(0(0(1(1(x1)))))))))))))))))))) -> 1(0(0(0(0(0(0(0(0(1(1(0(0(0(0(0(0(0(0(1(x1)))))))))))))))))))) 0(0(1(0(1(1(0(0(0(0(0(1(1(0(0(0(1(0(1(1(x1)))))))))))))))))))) -> 0(0(0(1(0(0(0(0(1(0(0(0(0(0(1(0(0(0(0(1(x1)))))))))))))))))))) 0(0(1(0(1(1(0(0(1(1(1(1(0(0(0(0(0(0(0(1(x1)))))))))))))))))))) -> 0(1(0(0(1(0(1(1(1(0(0(0(1(0(1(1(0(0(0(0(x1)))))))))))))))))))) 0(0(1(0(1(1(1(0(0(0(0(0(0(1(1(0(0(1(0(1(x1)))))))))))))))))))) -> 1(0(1(0(0(0(0(1(0(0(1(1(0(1(0(1(0(0(0(1(x1))))))))))))))))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685