Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716472
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
n074.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
45.2465128899 seconds
cpu usage
170.171714528
max memory
4.344475648E9
stage attributes
key
value
output-size
172376
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) DependencyPairsProof [EQUIVALENT, 19 ms] (2) QDP (3) TransformationProof [EQUIVALENT, 30 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 382 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 339 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 280 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 337 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 328 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 185 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 295 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 227 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 261 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 289 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 218 ms] (34) QDP (35) QDPOrderProof [EQUIVALENT, 248 ms] (36) QDP (37) QDPOrderProof [EQUIVALENT, 231 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 278 ms] (40) QDP (41) QDPOrderProof [EQUIVALENT, 360 ms] (42) QDP (43) DependencyGraphProof [EQUIVALENT, 0 ms] (44) AND (45) QDP (46) QDPOrderProof [EQUIVALENT, 133 ms] (47) QDP (48) QDPOrderProof [EQUIVALENT, 200 ms] (49) QDP (50) QDPOrderProof [EQUIVALENT, 139 ms] (51) QDP (52) QDPOrderProof [EQUIVALENT, 88 ms] (53) QDP (54) QDPOrderProof [EQUIVALENT, 371 ms] (55) QDP (56) QDPOrderProof [EQUIVALENT, 246 ms] (57) QDP (58) PisEmptyProof [EQUIVALENT, 0 ms] (59) YES (60) QDP (61) QDPOrderProof [EQUIVALENT, 285 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))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472