Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487510667
details
property
value
status
complete
benchmark
random-222.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n108.star.cs.uiowa.edu
space
Waldmann_19
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.09220409393 seconds
cpu usage
12.909260022
max memory
1.920512E9
stage attributes
key
value
output-size
12199
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 6 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 3 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 7 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) AND (13) QDP (14) QDPOrderProof [EQUIVALENT, 10 ms] (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPOrderProof [EQUIVALENT, 0 ms] (19) QDP (20) PisEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) UsableRulesProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 10 ms] (26) QDP (27) PisEmptyProof [EQUIVALENT, 0 ms] (28) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(x1)))) -> a(b(b(b(x1)))) b(b(a(a(x1)))) -> a(b(a(b(x1)))) b(a(a(b(x1)))) -> b(a(b(a(x1)))) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(x1)))) -> a(b(b(b(x1)))) b(a(a(b(x1)))) -> b(a(b(a(x1)))) a(b(b(a(a(x1))))) -> a(a(b(a(b(x1))))) b(b(b(a(a(x1))))) -> b(a(b(a(b(x1))))) Q is empty. ---------------------------------------- (3) 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. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1))))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1))))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1))))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1))))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard