Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718092
details
property
value
status
complete
benchmark
dup14.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Trafo_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.8622400761 seconds
cpu usage
29.991682166
max memory
3.773669376E9
stage attributes
key
value
output-size
61756
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, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 388 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 301 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(b(b(b(a(a(x1)))))))) -> a(a(c(c(a(a(b(b(x1)))))))) a(a(c(c(x1)))) -> c(c(c(c(a(a(x1)))))) c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(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: a(a(b(b(b(b(a(a(x1)))))))) -> b(b(a(a(c(c(a(a(x1)))))))) c(c(a(a(x1)))) -> a(a(c(c(c(c(x1)))))) c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(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: a(a(a(b(b(b(b(a(a(x1))))))))) -> a(b(b(a(a(c(c(a(a(x1))))))))) b(a(a(b(b(b(b(a(a(x1))))))))) -> b(b(b(a(a(c(c(a(a(x1))))))))) c(a(a(b(b(b(b(a(a(x1))))))))) -> c(b(b(a(a(c(c(a(a(x1))))))))) a(c(c(a(a(x1))))) -> a(a(a(c(c(c(c(x1))))))) b(c(c(a(a(x1))))) -> b(a(a(c(c(c(c(x1))))))) c(c(c(a(a(x1))))) -> c(a(a(c(c(c(c(x1))))))) a(c(c(c(c(c(c(x1))))))) -> a(b(b(c(c(b(b(x1))))))) b(c(c(c(c(c(c(x1))))))) -> b(b(b(c(c(b(b(x1))))))) c(c(c(c(c(c(c(x1))))))) -> c(b(b(c(c(b(b(x1))))))) Q is empty. ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685