Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713204
details
property
value
status
complete
benchmark
Ex1_GL02a.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.23288798332 seconds
cpu usage
5.131946032
max memory
3.121152E8
stage attributes
key
value
output-size
14109
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) AAECC Innermost [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) TransformationProof [EQUIVALENT, 0 ms] (27) QDP (28) TransformationProof [EQUIVALENT, 0 ms] (29) QDP (30) NonTerminationLoopProof [COMPLETE, 0 ms] (31) NO (32) QDP (33) UsableRulesProof [EQUIVALENT, 0 ms] (34) QDP (35) QReductionProof [EQUIVALENT, 0 ms] (36) QDP (37) QDPSizeChangeProof [EQUIVALENT, 0 ms] (38) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: eq(0, 0) -> true eq(s(X), s(Y)) -> eq(X, Y) eq(X, Y) -> false inf(X) -> cons(X, inf(s(X))) take(0, X) -> nil take(s(X), cons(Y, L)) -> cons(Y, take(X, L)) length(nil) -> 0 length(cons(X, L)) -> s(length(L)) Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is length(nil) -> 0 length(cons(X, L)) -> s(length(L)) inf(X) -> cons(X, inf(s(X))) take(0, X) -> nil take(s(X), cons(Y, L)) -> cons(Y, take(X, L)) The TRS R 2 is eq(0, 0) -> true eq(s(X), s(Y)) -> eq(X, Y) eq(X, Y) -> false The signature Sigma is {eq_2, true, false} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: eq(0, 0) -> true eq(s(X), s(Y)) -> eq(X, Y) eq(X, Y) -> false inf(X) -> cons(X, inf(s(X))) take(0, X) -> nil
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472