details

property	value
status	complete
benchmark	ways.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n050.star.cs.uiowa.edu
space	terminweb_new

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.71874 seconds
cpu usage	18.7875
user time	17.8611
system time	0.926398
max virtual memory	3.99097E7
max residence set size	1819296.0

stage attributes

key	value
starexec-result	YES

output

18.55/5.64 YES 18.55/5.65 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 18.55/5.65 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 18.55/5.65 18.55/5.65 18.55/5.65 Left Termination of the query pattern 18.55/5.65 18.55/5.65 ways(g,g,a) 18.55/5.65 18.55/5.65 w.r.t. the given Prolog program could successfully be proven: 18.55/5.65 18.55/5.65 (0) Prolog 18.55/5.65 (1) UnifyTransformerProof [EQUIVALENT, 0 ms] 18.55/5.65 (2) Prolog 18.55/5.65 (3) PrologToPiTRSProof [SOUND, 34 ms] 18.55/5.65 (4) PiTRS 18.55/5.65 (5) DependencyPairsProof [EQUIVALENT, 32 ms] 18.55/5.65 (6) PiDP 18.55/5.65 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 18.55/5.65 (8) AND 18.55/5.65 (9) PiDP 18.55/5.65 (10) UsableRulesProof [EQUIVALENT, 0 ms] 18.55/5.65 (11) PiDP 18.55/5.65 (12) PiDPToQDPProof [EQUIVALENT, 0 ms] 18.55/5.65 (13) QDP 18.55/5.65 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.55/5.65 (15) YES 18.55/5.65 (16) PiDP 18.55/5.65 (17) UsableRulesProof [EQUIVALENT, 0 ms] 18.55/5.65 (18) PiDP 18.55/5.65 (19) PiDPToQDPProof [SOUND, 0 ms] 18.55/5.65 (20) QDP 18.55/5.65 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.55/5.65 (22) YES 18.55/5.65 (23) PiDP 18.55/5.65 (24) UsableRulesProof [EQUIVALENT, 0 ms] 18.55/5.65 (25) PiDP 18.55/5.65 (26) PiDPToQDPProof [SOUND, 0 ms] 18.55/5.65 (27) QDP 18.55/5.65 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.55/5.65 (29) YES 18.55/5.65 (30) PiDP 18.55/5.65 (31) PiDPToQDPProof [SOUND, 0 ms] 18.55/5.65 (32) QDP 18.55/5.65 (33) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (34) QDP 18.55/5.65 (35) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (36) QDP 18.55/5.65 (37) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (38) QDP 18.55/5.65 (39) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (40) QDP 18.55/5.65 (41) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (42) QDP 18.55/5.65 (43) TransformationProof [EQUIVALENT, 0 ms] 18.55/5.65 (44) QDP 18.55/5.65 (45) QDPOrderProof [EQUIVALENT, 169 ms] 18.55/5.65 (46) QDP 18.55/5.65 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 18.55/5.65 (48) QDP 18.55/5.65 (49) QDPOrderProof [EQUIVALENT, 49 ms] 18.55/5.65 (50) QDP 18.55/5.65 (51) DependencyGraphProof [EQUIVALENT, 0 ms] 18.55/5.65 (52) TRUE 18.55/5.65 18.55/5.65 18.55/5.65 ---------------------------------------- 18.55/5.65 18.55/5.65 (0) 18.55/5.65 Obligation: 18.55/5.65 Clauses: 18.55/5.65 18.55/5.65 nat(0). 18.55/5.65 nat(s(X)) :- nat(X). 18.55/5.65 plus(0, X, X) :- nat(X). 18.55/5.65 plus(s(X), Y, s(Z)) :- plus(X, Y, Z). 18.55/5.65 ways(0, X1, s(0)). 18.55/5.65 ways(X2, [], 0). 18.55/5.65 ways(Amount, .(s(C), Coins), N) :- ','(=(Amount, s(X3)), ','(plus(s(C), NewAmount, Amount), ','(ways(Amount, Coins, N1), ','(ways(NewAmount, .(s(C), Coins), N2), plus(N1, N2, N))))). 18.55/5.65 ways(Amount, .(s(C), Coins), N) :- ','(=(Amount, s(X4)), ','(plus(Amount, s(X5), s(C)), ways(Amount, Coins, N))). 18.55/5.65 18.55/5.65 18.55/5.65 Query: ways(g,g,a) 18.55/5.65 ---------------------------------------- 18.55/5.65 18.55/5.65 (1) UnifyTransformerProof (EQUIVALENT) 18.55/5.65 Added a fact for the built-in = predicate [PROLOG]. 18.55/5.65 ---------------------------------------- 18.55/5.65 18.55/5.65 (2) 18.55/5.65 Obligation: 18.55/5.65 Clauses: 18.55/5.65 18.55/5.65 nat(0). 18.55/5.65 nat(s(X)) :- nat(X). 18.55/5.65 plus(0, X, X) :- nat(X). 18.55/5.65 plus(s(X), Y, s(Z)) :- plus(X, Y, Z). 18.55/5.65 ways(0, X1, s(0)). 18.55/5.65 ways(X2, [], 0). 18.55/5.65 ways(Amount, .(s(C), Coins), N) :- ','(=(Amount, s(X3)), ','(plus(s(C), NewAmount, Amount), ','(ways(Amount, Coins, N1), ','(ways(NewAmount, .(s(C), Coins), N2), plus(N1, N2, N))))). popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic_Programming 2019-04-02 08.22