Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919627
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
n056.star.cs.uiowa.edu
space
talp_talp
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.58151483536 seconds
cpu usage
7.121068847
max memory
7.6558336E8
stage attributes
key
value
output-size
93172
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern times(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 27 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 75 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) PiDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) PiDP (24) PiDPToQDPProof [SOUND, 5 ms] (25) QDP (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] (27) YES (28) PiDP (29) UsableRulesProof [EQUIVALENT, 0 ms] (30) PiDP (31) PiDPToQDPProof [SOUND, 0 ms] (32) QDP (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] (34) YES ---------------------------------------- (0) Obligation: Clauses: add(b, b, b). add(X, b, X) :- binaryZ(X). add(b, Y, Y) :- binaryZ(Y). add(X, Y, Z) :- addz(X, Y, Z). addx(one(X), b, one(X)) :- binary(X). addx(zero(X), b, zero(X)) :- binaryZ(X). addx(X, Y, Z) :- addz(X, Y, Z). addy(b, one(Y), one(Y)) :- binary(Y). addy(b, zero(Y), zero(Y)) :- binaryZ(Y). addy(X, Y, Z) :- addz(X, Y, Z). addz(zero(X), zero(Y), zero(Z)) :- addz(X, Y, Z). addz(zero(X), one(Y), one(Z)) :- addx(X, Y, Z). addz(one(X), zero(Y), one(Z)) :- addy(X, Y, Z). addz(one(X), one(Y), zero(Z)) :- addc(X, Y, Z). addc(b, b, one(b)). addc(X, b, Z) :- succZ(X, Z). addc(b, Y, Z) :- succZ(Y, Z). addc(X, Y, Z) :- addC(X, Y, Z). addX(zero(X), b, one(X)) :- binaryZ(X). addX(one(X), b, zero(Z)) :- succ(X, Z). addX(X, Y, Z) :- addC(X, Y, Z). addY(b, zero(Y), one(Y)) :- binaryZ(Y). addY(b, one(Y), zero(Z)) :- succ(Y, Z). addY(X, Y, Z) :- addC(X, Y, Z). addC(zero(X), zero(Y), one(Z)) :- addz(X, Y, Z). addC(zero(X), one(Y), zero(Z)) :- addX(X, Y, Z). addC(one(X), zero(Y), zero(Z)) :- addY(X, Y, Z). addC(one(X), one(Y), one(Z)) :- addc(X, Y, Z). binary(b). binary(zero(X)) :- binaryZ(X). binary(one(X)) :- binary(X). binaryZ(zero(X)) :- binaryZ(X). binaryZ(one(X)) :- binary(X). succ(b, one(b)). succ(zero(X), one(X)) :- binaryZ(X). succ(one(X), zero(Z)) :- succ(X, Z). succZ(zero(X), one(X)) :- binaryZ(X). succZ(one(X), zero(Z)) :- succ(X, Z). times(one(b), X, X). times(zero(R), S, zero(RS)) :- times(R, S, RS).
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030