Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718938
details
property
value
status
complete
benchmark
secr5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
39.3302299976 seconds
cpu usage
153.369997883
max memory
6.506565632E9
stage attributes
key
value
output-size
106592
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) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 134 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 170 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 426 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) AND (17) QDP (18) UsableRulesProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPOrderProof [EQUIVALENT, 0 ms] (21) QDP (22) PisEmptyProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) QDPOrderProof [EQUIVALENT, 63 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 507 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 6118 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 43 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 41 ms] (34) QDP (35) PisEmptyProof [EQUIVALENT, 0 ms] (36) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(c(x1)) -> a(x1) d(a(x1)) -> a(c(b(c(d(x1))))) a(c(b(c(x1)))) -> c(b(c(c(x1)))) c(x1) -> b(a(a(x1))) d(c(x1)) -> a(c(d(a(x1)))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(a(x1)) -> a(x1) a(d(x1)) -> d(c(b(c(a(x1))))) c(b(c(a(x1)))) -> c(c(b(c(x1)))) c(x1) -> a(a(b(x1))) c(d(x1)) -> a(d(c(a(x1)))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(b(c(a(x1)))) -> c(c(b(c(x1))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685