Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432293923
details
property
value
status
complete
benchmark
aprove07.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.54522 seconds
cpu usage
33.4052
user time
31.5349
system time
1.87035
max virtual memory
5.9199988E7
max residence set size
4499124.0
stage attributes
key
value
starexec-result
YES
output
31.01/8.91 YES 32.96/9.46 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 32.96/9.46 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 32.96/9.46 32.96/9.46 32.96/9.46 Termination w.r.t. Q of the given QTRS could be proven: 32.96/9.46 32.96/9.46 (0) QTRS 32.96/9.46 (1) DependencyPairsProof [EQUIVALENT, 33 ms] 32.96/9.46 (2) QDP 32.96/9.46 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 32.96/9.46 (4) AND 32.96/9.46 (5) QDP 32.96/9.46 (6) UsableRulesProof [EQUIVALENT, 0 ms] 32.96/9.46 (7) QDP 32.96/9.46 (8) QDPSizeChangeProof [EQUIVALENT, 2 ms] 32.96/9.46 (9) YES 32.96/9.46 (10) QDP 32.96/9.46 (11) MNOCProof [EQUIVALENT, 0 ms] 32.96/9.46 (12) QDP 32.96/9.46 (13) UsableRulesProof [EQUIVALENT, 0 ms] 32.96/9.46 (14) QDP 32.96/9.46 (15) QDPOrderProof [EQUIVALENT, 447 ms] 32.96/9.46 (16) QDP 32.96/9.46 (17) DependencyGraphProof [EQUIVALENT, 0 ms] 32.96/9.46 (18) TRUE 32.96/9.46 32.96/9.46 32.96/9.46 ---------------------------------------- 32.96/9.46 32.96/9.46 (0) 32.96/9.46 Obligation: 32.96/9.46 Q restricted rewrite system: 32.96/9.46 The TRS R consists of the following rules: 32.96/9.46 32.96/9.46 foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1)))))))))) 32.96/9.46 foo(s(x1)) -> p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) 32.96/9.46 bar(0(x1)) -> 0(p(s(s(s(x1))))) 32.96/9.46 bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) 32.96/9.46 p(p(s(x1))) -> p(x1) 32.96/9.46 p(s(x1)) -> x1 32.96/9.46 p(0(x1)) -> 0(s(s(s(s(x1))))) 32.96/9.46 32.96/9.46 Q is empty. 32.96/9.46 32.96/9.46 ---------------------------------------- 32.96/9.46 32.96/9.46 (1) DependencyPairsProof (EQUIVALENT) 32.96/9.46 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 32.96/9.46 ---------------------------------------- 32.96/9.46 32.96/9.46 (2) 32.96/9.46 Obligation: 32.96/9.46 Q DP problem: 32.96/9.46 The TRS P consists of the following rules: 32.96/9.46 32.96/9.46 FOO(0(x1)) -> P(p(p(s(s(s(p(s(x1)))))))) 32.96/9.46 FOO(0(x1)) -> P(p(s(s(s(p(s(x1))))))) 32.96/9.46 FOO(0(x1)) -> P(s(s(s(p(s(x1)))))) 32.96/9.46 FOO(0(x1)) -> P(s(x1)) 32.96/9.46 FOO(s(x1)) -> P(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))) 32.96/9.46 FOO(s(x1)) -> FOO(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))) 32.96/9.46 FOO(s(x1)) -> P(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))) 32.96/9.46 FOO(s(x1)) -> P(s(bar(p(p(s(s(p(s(x1))))))))) 32.96/9.46 FOO(s(x1)) -> BAR(p(p(s(s(p(s(x1))))))) 32.96/9.46 FOO(s(x1)) -> P(p(s(s(p(s(x1)))))) 32.96/9.46 FOO(s(x1)) -> P(s(s(p(s(x1))))) 32.96/9.46 FOO(s(x1)) -> P(s(x1)) 32.96/9.46 BAR(0(x1)) -> P(s(s(s(x1)))) 32.96/9.46 BAR(s(x1)) -> P(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) 32.96/9.46 BAR(s(x1)) -> P(p(s(s(foo(s(p(p(s(s(x1)))))))))) 32.96/9.46 BAR(s(x1)) -> P(s(s(foo(s(p(p(s(s(x1))))))))) 32.96/9.46 BAR(s(x1)) -> FOO(s(p(p(s(s(x1)))))) 32.96/9.46 BAR(s(x1)) -> P(p(s(s(x1)))) 32.96/9.46 BAR(s(x1)) -> P(s(s(x1))) 32.96/9.46 P(p(s(x1))) -> P(x1) 32.96/9.46 32.96/9.46 The TRS R consists of the following rules: 32.96/9.46 32.96/9.46 foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1)))))))))) 32.96/9.46 foo(s(x1)) -> p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) 32.96/9.46 bar(0(x1)) -> 0(p(s(s(s(x1))))) 32.96/9.46 bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) 32.96/9.46 p(p(s(x1))) -> p(x1) 32.96/9.46 p(s(x1)) -> x1 32.96/9.46 p(0(x1)) -> 0(s(s(s(s(x1))))) 32.96/9.46 32.96/9.46 Q is empty. 32.96/9.46 We have to consider all minimal (P,Q,R)-chains. 32.96/9.46 ---------------------------------------- 32.96/9.46 32.96/9.46 (3) DependencyGraphProof (EQUIVALENT) 32.96/9.46 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 22 less nodes. 32.96/9.46 ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Standard 2019-03-29 03.29