details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.67037200928 seconds
cpu usage	3.539644402
max memory	1.84639488E8

stage attributes

key	value
output-size	3916
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern factorial(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToTRSTransformerProof [SOUND, 0 ms] (2) QTRS (3) RisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: factorial1(N, F) :- ','(>(N, 0), ','(is(N1, -(N, 1)), ','(factorial1(N1, F1), is(F, *(N, F1))))). factorial1(0, 1). factorial2(N, F) :- factorial2(0, N, 1, F). factorial2(I, N, T, F) :- ','(<(I, N), ','(is(I1, +(I, 1)), ','(is(T1, *(T, I1)), factorial2(I1, N, T1, F)))). factorial2(N, N, F, F). factorial3(N, F) :- factorial3(N, 1, F). factorial3(N, T, F) :- ','(>(N, 0), ','(is(T1, *(T, N)), ','(is(N1, -(N, 1)), factorial3(N1, T1, F)))). factorial3(0, F, F). Query: factorial(g,a) ---------------------------------------- (1) PrologToTRSTransformerProof (SOUND) Transformed Prolog program to TRS. { "root": 2, "program": { "directives": [], "clauses": [ [ "(factorial1 N F)", "(',' (> N (0)) (',' (is N1 (- N (1))) (',' (factorial1 N1 F1) (is F (* N F1)))))" ], [ "(factorial1 (0) (1))", null ], [ "(factorial2 N F)", "(factorial2 (0) N (1) F)" ], [ "(factorial2 I N T F)", "(',' (< I N) (',' (is I1 (+ I (1))) (',' (is T1 (* T I1)) (factorial2 I1 N T1 F))))" ], [ "(factorial2 N N F F)", null ], [ "(factorial3 N F)", "(factorial3 N (1) F)" ], [ "(factorial3 N T F)", "(',' (> N (0)) (',' (is T1 (* T N)) (',' (is N1 (- N (1))) (factorial3 N1 T1 F))))" ], [ "(factorial3 (0) F F)", null ] ] }, "graph": { "nodes": { "2": { "goal": [{ "clause": -1, "scope": -1, "term": "(factorial T2 T3)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, popout

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

job log

popout

actions

all output return to Logic Progr 19030