Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516968458
details
property
value
status
complete
benchmark
z066.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n173.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
5.46882510185 seconds
cpu usage
18.594749965
max memory
1.304195072E9
stage attributes
key
value
output-size
11818
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 23 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 3 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 2 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 19 ms] (10) QDP (11) MRRProof [EQUIVALENT, 100 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 3 ms] (14) AND (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) MRRProof [EQUIVALENT, 12 ms] (27) QDP (28) PisEmptyProof [EQUIVALENT, 0 ms] (29) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(x1))) -> c(b(a(x1))) C(B(A(x1))) -> A(B(C(x1))) b(a(C(x1))) -> C(a(b(x1))) c(A(B(x1))) -> B(A(c(x1))) A(c(b(x1))) -> b(c(A(x1))) B(C(a(x1))) -> a(C(B(x1))) a(A(x1)) -> x1 A(a(x1)) -> x1 b(B(x1)) -> x1 B(b(x1)) -> x1 c(C(x1)) -> x1 C(c(x1)) -> 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(b(a(x1))) -> a(b(c(x1))) A(B(C(x1))) -> C(B(A(x1))) C(a(b(x1))) -> b(a(C(x1))) B(A(c(x1))) -> c(A(B(x1))) b(c(A(x1))) -> A(c(b(x1))) a(C(B(x1))) -> B(C(a(x1))) A(a(x1)) -> x1 a(A(x1)) -> x1 B(b(x1)) -> x1 b(B(x1)) -> x1 C(c(x1)) -> x1 c(C(x1)) -> x1 Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = 1 + x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard