Logic_Programming 2019-04-02 08.22 pair #434324461

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.56209 seconds
cpu usage	6.8563
user time	6.52022
system time	0.336082
max virtual memory	1.8810244E7
max residence set size	771688.0

stage attributes

key	value
starexec-result	YES

output

6.26/2.36	YES
6.54/2.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
6.54/2.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.54/2.49	
6.54/2.49	
6.54/2.49	Left Termination of the query pattern
6.54/2.49	
6.54/2.49	times(g,g,a)
6.54/2.49	
6.54/2.49	w.r.t. the given Prolog program could successfully be proven:
6.54/2.49	
6.54/2.49	(0) Prolog
6.54/2.49	(1) PrologToPiTRSProof [SOUND, 23 ms]
6.54/2.49	(2) PiTRS
6.54/2.49	(3) DependencyPairsProof [EQUIVALENT, 69 ms]
6.54/2.49	(4) PiDP
6.54/2.49	(5) DependencyGraphProof [EQUIVALENT, 0 ms]
6.54/2.49	(6) AND
6.54/2.49	    (7) PiDP
6.54/2.49	        (8) UsableRulesProof [EQUIVALENT, 0 ms]
6.54/2.49	        (9) PiDP
6.54/2.49	        (10) PiDPToQDPProof [EQUIVALENT, 0 ms]
6.54/2.49	        (11) QDP
6.54/2.49	        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.54/2.49	        (13) YES
6.54/2.49	    (14) PiDP
6.54/2.49	        (15) UsableRulesProof [EQUIVALENT, 0 ms]
6.54/2.49	        (16) PiDP
6.54/2.49	        (17) PiDPToQDPProof [SOUND, 0 ms]
6.54/2.49	        (18) QDP
6.54/2.49	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.54/2.49	        (20) YES
6.54/2.49	    (21) PiDP
6.54/2.49	        (22) UsableRulesProof [EQUIVALENT, 0 ms]
6.54/2.49	        (23) PiDP
6.54/2.49	        (24) PiDPToQDPProof [SOUND, 0 ms]
6.54/2.49	        (25) QDP
6.54/2.49	        (26) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.54/2.49	        (27) YES
6.54/2.49	    (28) PiDP
6.54/2.49	        (29) UsableRulesProof [EQUIVALENT, 0 ms]
6.54/2.49	        (30) PiDP
6.54/2.49	        (31) PiDPToQDPProof [SOUND, 0 ms]
6.54/2.49	        (32) QDP
6.54/2.49	        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.54/2.49	        (34) YES
6.54/2.49	
6.54/2.49	
6.54/2.49	----------------------------------------
6.54/2.49	
6.54/2.49	(0)
6.54/2.49	Obligation:
6.54/2.49	Clauses:
6.54/2.49	
6.54/2.49	add(b, b, b).
6.54/2.49	add(X, b, X) :- binaryZ(X).
6.54/2.49	add(b, Y, Y) :- binaryZ(Y).
6.54/2.49	add(X, Y, Z) :- addz(X, Y, Z).
6.54/2.49	addx(one(X), b, one(X)) :- binary(X).
6.54/2.49	addx(zero(X), b, zero(X)) :- binaryZ(X).
6.54/2.49	addx(X, Y, Z) :- addz(X, Y, Z).
6.54/2.49	addy(b, one(Y), one(Y)) :- binary(Y).
6.54/2.49	addy(b, zero(Y), zero(Y)) :- binaryZ(Y).
6.54/2.49	addy(X, Y, Z) :- addz(X, Y, Z).
6.54/2.49	addz(zero(X), zero(Y), zero(Z)) :- addz(X, Y, Z).
6.54/2.49	addz(zero(X), one(Y), one(Z)) :- addx(X, Y, Z).
6.54/2.49	addz(one(X), zero(Y), one(Z)) :- addy(X, Y, Z).
6.54/2.49	addz(one(X), one(Y), zero(Z)) :- addc(X, Y, Z).
6.54/2.49	addc(b, b, one(b)).
6.54/2.49	addc(X, b, Z) :- succZ(X, Z).
6.54/2.49	addc(b, Y, Z) :- succZ(Y, Z).
6.54/2.49	addc(X, Y, Z) :- addC(X, Y, Z).
6.54/2.49	addX(zero(X), b, one(X)) :- binaryZ(X).
6.54/2.49	addX(one(X), b, zero(Z)) :- succ(X, Z).
6.54/2.49	addX(X, Y, Z) :- addC(X, Y, Z).
6.54/2.49	addY(b, zero(Y), one(Y)) :- binaryZ(Y).
6.54/2.49	addY(b, one(Y), zero(Z)) :- succ(Y, Z).
6.54/2.49	addY(X, Y, Z) :- addC(X, Y, Z).
6.54/2.49	addC(zero(X), zero(Y), one(Z)) :- addz(X, Y, Z).
6.54/2.49	addC(zero(X), one(Y), zero(Z)) :- addX(X, Y, Z).
6.54/2.49	addC(one(X), zero(Y), zero(Z)) :- addY(X, Y, Z).
6.54/2.49	addC(one(X), one(Y), one(Z)) :- addc(X, Y, Z).
6.54/2.49	binary(b).
6.54/2.49	binary(zero(X)) :- binaryZ(X).
6.54/2.49	binary(one(X)) :- binary(X).
6.54/2.49	binaryZ(zero(X)) :- binaryZ(X).
6.54/2.49	binaryZ(one(X)) :- binary(X).
6.54/2.49	succ(b, one(b)).
6.54/2.49	succ(zero(X), one(X)) :- binaryZ(X).
6.54/2.49	succ(one(X), zero(Z)) :- succ(X, Z).
6.54/2.49	succZ(zero(X), one(X)) :- binaryZ(X).
6.54/2.49	succZ(one(X), zero(Z)) :- succ(X, Z).
6.54/2.49	times(one(b), X, X).
6.54/2.49	times(zero(R), S, zero(RS)) :- times(R, S, RS).
6.54/2.49	times(one(R), S, RSS) :- ','(times(R, S, RS), add(S, zero(RS), RSS)).
6.54/2.49	
6.54/2.49	
6.54/2.49	Query: times(g,g,a)
6.54/2.49	----------------------------------------
6.54/2.49

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