Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072013
details
property
value
status
complete
benchmark
Ex1_2_AEL03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.31597 seconds
cpu usage
5.36815
user time
5.11962
system time
0.248532
max virtual memory
1.8545116E7
max residence set size
389216.0
stage attributes
key
value
starexec-result
NO
output
NO 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 disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) QDP (24) QReductionProof [EQUIVALENT, 0 ms] (25) QDP (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] (27) YES (28) QDP (29) UsableRulesProof [EQUIVALENT, 0 ms] (30) QDP (31) QReductionProof [EQUIVALENT, 0 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) NonTerminationLoopProof [COMPLETE, 0 ms] (38) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, from(s(X))) 2ndspos(0, Z) -> rnil 2ndspos(s(N), cons(X, cons(Y, Z))) -> rcons(posrecip(Y), 2ndsneg(N, Z)) 2ndsneg(0, Z) -> rnil 2ndsneg(s(N), cons(X, cons(Y, Z))) -> rcons(negrecip(Y), 2ndspos(N, Z)) pi(X) -> 2ndspos(X, from(0)) plus(0, Y) -> Y plus(s(X), Y) -> s(plus(X, Y)) times(0, Y) -> 0 times(s(X), Y) -> plus(Y, times(X, Y)) square(X) -> times(X, X) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, from(s(X))) 2ndspos(0, Z) -> rnil 2ndspos(s(N), cons(X, cons(Y, Z))) -> rcons(posrecip(Y), 2ndsneg(N, Z)) 2ndsneg(0, Z) -> rnil 2ndsneg(s(N), cons(X, cons(Y, Z))) -> rcons(negrecip(Y), 2ndspos(N, Z)) pi(X) -> 2ndspos(X, from(0)) plus(0, Y) -> Y plus(s(X), Y) -> s(plus(X, Y)) times(0, Y) -> 0 times(s(X), Y) -> plus(Y, times(X, Y)) square(X) -> times(X, X) The set Q consists of the following terms: from(x0) 2ndspos(0, x0) 2ndspos(s(x0), cons(x1, cons(x2, x3))) 2ndsneg(0, x0) 2ndsneg(s(x0), cons(x1, cons(x2, x3))) pi(x0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard