Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997144
details
property
value
status
complete
benchmark
PEANO-NAT_nokinds.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n127.star.cs.uiowa.edu
space
Mixed_C
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.5827 seconds
cpu usage
16.4133
user time
15.5872
system time
0.826128
max virtual memory
1.8320524E7
max residence set size
2336868.0
stage attributes
key
value
starexec-result
MAYBE
output
16.24/10.53 MAYBE 16.24/10.54 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 16.24/10.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.24/10.54 16.24/10.54 16.24/10.54 Termination of the given ETRS could not be shown: 16.24/10.54 16.24/10.54 (0) ETRS 16.24/10.54 (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] 16.24/10.54 (2) EDP 16.24/10.54 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 16.24/10.54 (4) AND 16.24/10.54 (5) EDP 16.24/10.54 (6) ESharpUsableEquationsProof [EQUIVALENT, 12 ms] 16.24/10.54 (7) EDP 16.24/10.54 (8) EUsableRulesReductionPairsProof [EQUIVALENT, 77 ms] 16.24/10.54 (9) EDP 16.24/10.54 (10) EDependencyGraphProof [EQUIVALENT, 0 ms] 16.24/10.54 (11) TRUE 16.24/10.54 (12) EDP 16.24/10.54 (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 16.24/10.54 (14) EDP 16.24/10.54 (15) EUsableRulesReductionPairsProof [EQUIVALENT, 37 ms] 16.24/10.54 (16) EDP 16.24/10.54 (17) EDependencyGraphProof [EQUIVALENT, 0 ms] 16.24/10.54 (18) TRUE 16.24/10.54 (19) EDP 16.24/10.54 (20) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 16.24/10.54 (21) EDP 16.24/10.54 (22) EUsableRulesReductionPairsProof [EQUIVALENT, 40 ms] 16.24/10.54 (23) EDP 16.24/10.54 (24) EDependencyGraphProof [EQUIVALENT, 0 ms] 16.24/10.54 (25) TRUE 16.24/10.54 (26) EDP 16.24/10.54 (27) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 16.24/10.54 (28) EDP 16.24/10.54 (29) EUsableRulesReductionPairsProof [EQUIVALENT, 41 ms] 16.24/10.54 (30) EDP 16.24/10.54 (31) PisEmptyProof [EQUIVALENT, 0 ms] 16.24/10.54 (32) YES 16.24/10.54 (33) EDP 16.24/10.54 (34) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 16.24/10.54 (35) EDP 16.24/10.54 (36) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 16.24/10.54 (37) EDP 16.24/10.54 (38) PisEmptyProof [EQUIVALENT, 0 ms] 16.24/10.54 (39) YES 16.24/10.54 (40) EDP 16.24/10.54 (41) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 16.24/10.54 (42) EDP 16.24/10.54 (43) EUsableRulesProof [EQUIVALENT, 0 ms] 16.24/10.54 (44) EDP 16.24/10.54 (45) EDP 16.24/10.54 16.24/10.54 16.24/10.54 ---------------------------------------- 16.24/10.54 16.24/10.54 (0) 16.24/10.54 Obligation: 16.24/10.54 Equational rewrite system: 16.24/10.54 The TRS R consists of the following rules: 16.24/10.54 16.24/10.54 1 -> s_(0) 16.24/10.54 2 -> s_(s_(0)) 16.24/10.54 3 -> s_(s_(s_(0))) 16.24/10.54 4 -> s_(s_(s_(s_(0)))) 16.24/10.54 5 -> s_(s_(s_(s_(s_(0))))) 16.24/10.54 6 -> s_(s_(s_(s_(s_(s_(0)))))) 16.24/10.54 7 -> s_(s_(s_(s_(s_(s_(s_(0))))))) 16.24/10.54 U101(tt, M, N) -> d(N, M) 16.24/10.54 U11(tt) -> 0 16.24/10.54 U111(tt) -> 0 16.24/10.54 U121(tt, M', N') -> U122(equal(_>_(N', M'), true), M', N') 16.24/10.54 U122(tt, M', N') -> gcd(d(N', M'), M') 16.24/10.54 U131(tt, N') -> N' 16.24/10.54 U141(tt, N) -> N 16.24/10.54 U151(tt) -> s_(0) 16.24/10.54 U161(tt, M', N) -> U162(equal(_>_(M', N), true)) 16.24/10.54 U162(tt) -> 0 16.24/10.54 U171(tt, M', N) -> U172(equal(_>_(N, M'), true), M', N) 16.24/10.54 U172(tt, M', N) -> s_(quot(d(N, M'), M')) 16.24/10.54 U21(tt, M, N) -> s_(_+_(N, _+_(M, _*_(N, M)))) 16.24/10.54 U31(tt, N) -> N 16.24/10.54 U41(tt, M, N) -> s_(s_(_+_(N, M))) 16.24/10.54 U51(tt, M, N) -> _>_(M, N) 16.24/10.54 U61(tt) -> false 16.24/10.54 U71(tt) -> true 16.24/10.54 U81(tt, M, N) -> _>_(N, M) 16.24/10.54 U91(tt, N) -> N 16.24/10.54 _*_(N, 0) -> U11(isNat(N)) 16.24/10.54 _*_(s_(N), s_(M)) -> U21(and(isNat(M), isNat(N)), M, N) 16.24/10.54 _+_(N, 0) -> U31(isNat(N), N) 16.24/10.54 _+_(s_(N), s_(M)) -> U41(and(isNat(M), isNat(N)), M, N) 16.24/10.54 _<_(N, M) -> U51(and(isNat(M), isNat(N)), M, N) 16.24/10.54 _>_(0, M) -> U61(isNat(M)) 16.24/10.54 _>_(N', 0) -> U71(isNzNat(N')) 16.24/10.54 _>_(s_(N), s_(M)) -> U81(and(isNat(M), isNat(N)), M, N) 16.24/10.54 and(tt, X) -> X 16.24/10.54 d(0, N) -> U91(isNat(N), N) 16.24/10.54 d(s_(N), s_(M)) -> U101(and(isNat(M), isNat(N)), M, N)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Equational 2019-03-21 05.09