Logic Progr 19030 pair #381919981

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.1478869915 seconds
cpu usage	5.474141945
max memory	4.453376E8

stage attributes

key	value
output-size	18220
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


Graph construction failed
Graph construction failed
Graph construction failed
MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

q(a,a)

w.r.t. the given Prolog program could not be shown:

(0) Prolog
(1) CutEliminatorProof [SOUND, 0 ms]
(2) Prolog
(3) UndefinedPredicateHandlerProof [SOUND, 0 ms]
(4) Prolog
(5) PrologToPiTRSProof [SOUND, 0 ms]
(6) PiTRS
    (7) DependencyPairsProof [EQUIVALENT, 0 ms]
    (8) PiDP
    (9) DependencyGraphProof [EQUIVALENT, 0 ms]
    (10) PiDP
    (11) UsableRulesProof [EQUIVALENT, 0 ms]
    (12) PiDP
    (13) PiDPToQDPProof [SOUND, 0 ms]
    (14) QDP
    (15) NonTerminationLoopProof [COMPLETE, 0 ms]
    (16) NO
(17) PrologToPiTRSProof [SOUND, 0 ms]
(18) PiTRS
    (19) DependencyPairsProof [EQUIVALENT, 0 ms]
    (20) PiDP
    (21) DependencyGraphProof [EQUIVALENT, 0 ms]
    (22) PiDP
    (23) UsableRulesProof [EQUIVALENT, 0 ms]
    (24) PiDP
    (25) PiDPToQDPProof [SOUND, 0 ms]
    (26) QDP
    (27) NonTerminationLoopProof [COMPLETE, 0 ms]
    (28) NO


----------------------------------------

(0)
Obligation:
Clauses:

q(X, Y) :- ','(==(X, Y), p(X, Y)).
p(X, Y) :- ','(==(X, Y), !).
p(X, Y) :- p(X, Y).


Query: q(a,a)
----------------------------------------

(1) CutEliminatorProof (SOUND)
Eliminated all cuts by simply ignoring them[PROLOG].
----------------------------------------

(2)
Obligation:
Clauses:

q(X, Y) :- ','(==(X, Y), p(X, Y)).
p(X, Y) :- ==(X, Y).
p(X, Y) :- p(X, Y).


Query: q(a,a)
----------------------------------------

(3) UndefinedPredicateHandlerProof (SOUND)
Added facts for all undefined predicates [PROLOG].
----------------------------------------

(4)
Obligation:
Clauses:

q(X, Y) :- ','(==(X, Y), p(X, Y)).
p(X, Y) :- ==(X, Y).
p(X, Y) :- p(X, Y).
==(X0, X1).


Query: q(a,a)
----------------------------------------

(5) PrologToPiTRSProof (SOUND)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:

popout

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

job log

popout

actions all output return to Logic Progr 19030