details

property	value
status	complete
benchmark	countall.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n049.star.cs.uiowa.edu
space	Euler_queensu-cs260

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.73825907707 seconds
cpu usage	3.870118593
max memory	2.7414528E8

stage attributes

key	value
output-size	22197
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 YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern countAll(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UnifyTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) UndefinedPredicateHandlerProof [SOUND, 0 ms] (4) Prolog (5) PrologToPiTRSProof [SOUND, 20 ms] (6) PiTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) PiDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 26 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: countAll(Item, [], 0). countAll(Item, Other, 1) :- ','(atomic(Other), =(Other, Item)). countAll(Item, Other, 0) :- ','(atomic(Other), ','(\=(Other, []), \=(Other, Item))). countAll(Item, .(X, Xs), Result) :- ','(countAll(Item, X, HeadCount), ','(countAll(Item, Xs, TailCount), is(Result, +(HeadCount, TailCount)))). Query: countAll(g,g,a) ---------------------------------------- (1) UnifyTransformerProof (EQUIVALENT) Added a fact for the built-in = predicate [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: countAll(Item, [], 0). countAll(Item, Other, 1) :- ','(atomic(Other), =(Other, Item)). countAll(Item, Other, 0) :- ','(atomic(Other), ','(\=(Other, []), \=(Other, Item))). countAll(Item, .(X, Xs), Result) :- ','(countAll(Item, X, HeadCount), ','(countAll(Item, Xs, TailCount), is(Result, +(HeadCount, TailCount)))). =(X, X). Query: countAll(g,g,a) ---------------------------------------- (3) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (4) Obligation: Clauses: countAll(Item, [], 0). countAll(Item, Other, 1) :- ','(atomic(Other), =(Other, Item)). countAll(Item, Other, 0) :- ','(atomic(Other), ','(\=(Other, []), \=(Other, Item))). countAll(Item, .(X, Xs), Result) :- ','(countAll(Item, X, HeadCount), ','(countAll(Item, Xs, TailCount), is(Result, +(HeadCount, TailCount)))). =(X, X). atomic(X0). \=(X0, X1). is(X0, X1). Query: countAll(g,g,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: countAll_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: popout

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

job log

popout

actions

all output return to Logic Progr 19030