details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.60609388351 seconds
cpu usage	3.43052733
max memory	2.19471872E8

stage attributes

key	value
output-size	3999
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 isPrime(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) BuiltinConflictTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) PrologToTRSTransformerProof [SOUND, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Clauses: is_prime(2). is_prime(3). is_prime(P) :- ','(integer(P), ','(>(P, 3), ','(=\=(mod(P, 2), 0), \+(has_factor(P, 3))))). integer(X1). has_factor(N, L) :- =:=(mod(N, L), 0). has_factor(N, L) :- ','(<(*(L, L), N), ','(is(L2, +(L, 2)), has_factor(N, L2))). Query: isPrime(g) ---------------------------------------- (1) BuiltinConflictTransformerProof (EQUIVALENT) Renamed defined predicates conflicting with built-in predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: is_prime(2). is_prime(3). is_prime(P) :- ','(user_defined_integer(P), ','(>(P, 3), ','(=\=(mod(P, 2), 0), \+(has_factor(P, 3))))). user_defined_integer(X1). has_factor(N, L) :- =:=(mod(N, L), 0). has_factor(N, L) :- ','(<(*(L, L), N), ','(is(L2, +(L, 2)), has_factor(N, L2))). Query: isPrime(g) ---------------------------------------- (3) PrologToTRSTransformerProof (SOUND) Transformed Prolog program to TRS. { "root": 2, "program": { "directives": [], "clauses": [ [ "(is_prime (2))", null ], [ "(is_prime (3))", null ], [ "(is_prime P)", "(',' (user_defined_integer P) (',' (> P (3)) (',' (=\\= (mod P (2)) (0)) (\\+ (has_factor P (3))))))" ], [ "(user_defined_integer X1)", null ], [ "(has_factor N L)", "(=:= (mod N L) (0))" ], [ "(has_factor N L)", "(',' (< (* L L) N) (',' (is L2 (+ L (2))) (has_factor N L2)))" ] ] }, "graph": { "nodes": { "2": { "goal": [{ popout

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

job log

popout

actions

all output return to Logic Progr 19030