details

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

run statistics

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

stage attributes

key	value
output-size	4808
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 deriv(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 0 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: d(+(U, V), X, +(DU, DV)) :- ','(!, ','(d(U, X, DU), d(V, X, DV))). d(-(U, V), X, -(DU, DV)) :- ','(!, ','(d(U, X, DU), d(V, X, DV))). d(*(U, V), X, +(*(DU, V), *(U, DV))) :- ','(!, ','(d(U, X, DU), d(V, X, DV))). d(/(U, V), X, /(-(*(DU, V), *(U, DV)), ^(V, 2))) :- ','(!, ','(d(U, X, DU), d(V, X, DV))). d(^(U, N), X, *(DU, *(N, ^(U, N1)))) :- ','(!, ','(integer(N), ','(is(N1, -(N, 1)), d(U, X, DU)))). d(-(U), X, -(DU)) :- ','(!, d(U, X, DU)). d(exp(U), X, *(exp(U), DU)) :- ','(!, d(U, X, DU)). d(log(U), X, /(DU, U)) :- ','(!, d(U, X, DU)). d(X, X, 1) :- !. d(C, X, 0). main :- ','(expression(X), ','(d(X, x, Y), write(Y))). expression(+(Exp, -(Exp, *(Exp, /(Exp, *(Exp, /(Exp, Exp))))))) :- value(Exp). value(/(+(*(3, x), -(*(4, *(exp(^(x, 3)), log(^(x, 2)))), 2)), +(-(*(3, x)), /(5, +(exp(^(x, 4)), 2))))). Query: deriv(g,g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(d (+ U V) X (+ DU DV))", "(',' (!) (',' (d U X DU) (d V X DV)))" ], [ "(d (- U V) X (- DU DV))", "(',' (!) (',' (d U X DU) (d V X DV)))" ], [ "(d (* U V) X (+ (* DU V) (* U DV)))", "(',' (!) (',' (d U X DU) (d V X DV)))" ], [ "(d (/ U V) X (/ (- (* DU V) (* U DV)) (^ V (2))))", "(',' (!) (',' (d U X DU) (d V X DV)))" ], [ "(d (^ U N) X (* DU (* N (^ U N1))))", "(',' (!) (',' (integer N) (',' (is N1 (- N (1))) (d U X DU))))" ], [ "(d (- U) X (- DU))", "(',' (!) (d U X DU))" ], [ "(d (exp U) X (* (exp U) DU))", "(',' (!) (d U X DU))" ], [ "(d (log U) X (/ DU U))", "(',' (!) (d U X DU))" ], [ "(d X X (1))", "(!)" ], [ "(d C X (0))", null ], [ "(main)", "(',' (expression X) (',' (d X (x) Y) (write Y)))" ], [ "(expression (+ Exp (- Exp (* Exp (/ Exp (* Exp (/ Exp Exp)))))))", popout

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

job log

popout

actions

all output return to Logic Progr 19030