Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709620
details
property
value
status
complete
benchmark
nonterm.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
AProVE_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.32717704773 seconds
cpu usage
5.902111854
max memory
3.64384256E8
stage attributes
key
value
output-size
15131
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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 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) TransformationProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) TransformationProof [EQUIVALENT, 0 ms] (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) TransformationProof [EQUIVALENT, 0 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) MNOCProof [EQUIVALENT, 0 ms] (36) QDP (37) NonTerminationLoopProof [COMPLETE, 5 ms] (38) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) id(s(x)) -> s(id(x)) id(0) -> 0 Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is id(s(x)) -> s(id(x)) id(0) -> 0 The TRS R 2 is f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) The signature Sigma is {f_3} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) id(s(x)) -> s(id(x)) id(0) -> 0 The set Q consists of the following terms: f(s(s(s(s(s(s(s(s(x0)))))))), x1, x1) id(s(x0)) id(0) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472