Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093403
details
property
value
status
complete
benchmark
Ex1_2_AEL03_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
48.7057 seconds
cpu usage
175.381
user time
171.911
system time
3.46928
max virtual memory
5.600598E7
max residence set size
4129456.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/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) DependencyPairsProof [EQUIVALENT, 32 ms] (2) QDP (3) TransformationProof [EQUIVALENT, 135 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 313 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 347 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 316 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 360 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 336 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 314 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 303 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 257 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 265 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 241 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 239 ms] (34) QDP (35) QDPOrderProof [EQUIVALENT, 301 ms] (36) QDP (37) QDPOrderProof [EQUIVALENT, 252 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 290 ms] (40) QDP (41) QDPOrderProof [EQUIVALENT, 362 ms] (42) QDP (43) DependencyGraphProof [EQUIVALENT, 0 ms] (44) AND (45) QDP (46) QDPOrderProof [EQUIVALENT, 231 ms] (47) QDP (48) QDPOrderProof [EQUIVALENT, 151 ms] (49) QDP (50) QDPOrderProof [EQUIVALENT, 221 ms] (51) QDP (52) QDPQMonotonicMRRProof [EQUIVALENT, 66 ms] (53) QDP (54) QDPOrderProof [EQUIVALENT, 338 ms] (55) QDP (56) QDPOrderProof [EQUIVALENT, 245 ms] (57) QDP (58) PisEmptyProof [EQUIVALENT, 0 ms] (59) YES (60) QDP (61) QDPOrderProof [EQUIVALENT, 276 ms] (62) QDP (63) PisEmptyProof [EQUIVALENT, 0 ms] (64) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__from(X) -> cons(mark(X), from(s(X))) a__2ndspos(0, Z) -> rnil a__2ndspos(s(N), cons(X, cons(Y, Z))) -> rcons(posrecip(mark(Y)), a__2ndsneg(mark(N), mark(Z))) a__2ndsneg(0, Z) -> rnil a__2ndsneg(s(N), cons(X, cons(Y, Z))) -> rcons(negrecip(mark(Y)), a__2ndspos(mark(N), mark(Z))) a__pi(X) -> a__2ndspos(mark(X), a__from(0)) a__plus(0, Y) -> mark(Y) a__plus(s(X), Y) -> s(a__plus(mark(X), mark(Y))) a__times(0, Y) -> 0 a__times(s(X), Y) -> a__plus(mark(Y), a__times(mark(X), mark(Y))) a__square(X) -> a__times(mark(X), mark(X)) mark(from(X)) -> a__from(mark(X)) mark(2ndspos(X1, X2)) -> a__2ndspos(mark(X1), mark(X2)) mark(2ndsneg(X1, X2)) -> a__2ndsneg(mark(X1), mark(X2)) mark(pi(X)) -> a__pi(mark(X)) mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) mark(times(X1, X2)) -> a__times(mark(X1), mark(X2)) mark(square(X)) -> a__square(mark(X)) mark(0) -> 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost