details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.08424091339 seconds
cpu usage	5.126912398
max memory	2.86953472E8

stage attributes

key	value
output-size	12178
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 insert(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 21 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: insert(X, [], .(X, [])). insert(X, .(Y, Ys), .(X, .(Y, Ys))) :- =<(X, Y). insert(X, .(Y, Ys), .(Y, Tail)) :- ','(>(X, Y), insert(X, Ys, Tail)). Query: insert(g,g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: insert(X, [], .(X, [])). insert(X, .(Y, Ys), .(X, .(Y, Ys))) :- =<(X, Y). insert(X, .(Y, Ys), .(Y, Tail)) :- ','(>(X, Y), insert(X, Ys, Tail)). =<(X0, X1). >(X0, X1). Query: insert(g,g,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: insert_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: insert_in_gga(X, [], .(X, [])) -> insert_out_gga(X, [], .(X, [])) insert_in_gga(X, .(Y, Ys), .(X, .(Y, Ys))) -> U1_gga(X, Y, Ys, =<_in_gg(X, Y)) =<_in_gg(X0, X1) -> =<_out_gg(X0, X1) U1_gga(X, Y, Ys, =<_out_gg(X, Y)) -> insert_out_gga(X, .(Y, Ys), .(X, .(Y, Ys))) insert_in_gga(X, .(Y, Ys), .(Y, Tail)) -> U2_gga(X, Y, Ys, Tail, >_in_gg(X, Y)) >_in_gg(X0, X1) -> >_out_gg(X0, X1) U2_gga(X, Y, Ys, Tail, >_out_gg(X, Y)) -> U3_gga(X, Y, Ys, Tail, insert_in_gga(X, Ys, Tail)) U3_gga(X, Y, Ys, Tail, insert_out_gga(X, Ys, Tail)) -> insert_out_gga(X, .(Y, Ys), .(Y, Tail)) The argument filtering Pi contains the following mapping: insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2) [] = [] insert_out_gga(x1, x2, x3) = insert_out_gga(x3) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4) = U1_gga(x1, x2, x3, x4) =<_in_gg(x1, x2) = =<_in_gg(x1, x2) =<_out_gg(x1, x2) = =<_out_gg popout

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

job log

popout

actions

all output return to Logic Progr 19030