details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.76634311676 seconds
cpu usage	4.052003445
max memory	2.90566144E8

stage attributes

key	value
output-size	10742
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 shuffle(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 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, 17 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: shuffle(A, [], A) :- !. shuffle([], B, B) :- !. shuffle(.(A, RestA), B, .(A, Shuffled)) :- shuffle(RestA, B, Shuffled). shuffle(A, .(B, RestB), .(B, Shuffled)) :- shuffle(A, RestB, Shuffled). Query: shuffle(g,g,a) ---------------------------------------- (1) CutEliminatorProof (SOUND) Eliminated all cuts by simply ignoring them[PROLOG]. ---------------------------------------- (2) Obligation: Clauses: shuffle(A, [], A). shuffle([], B, B). shuffle(.(A, RestA), B, .(A, Shuffled)) :- shuffle(RestA, B, Shuffled). shuffle(A, .(B, RestB), .(B, Shuffled)) :- shuffle(A, RestB, Shuffled). Query: shuffle(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: shuffle_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: shuffle_in_gga(A, [], A) -> shuffle_out_gga(A, [], A) shuffle_in_gga([], B, B) -> shuffle_out_gga([], B, B) shuffle_in_gga(.(A, RestA), B, .(A, Shuffled)) -> U1_gga(A, RestA, B, Shuffled, shuffle_in_gga(RestA, B, Shuffled)) shuffle_in_gga(A, .(B, RestB), .(B, Shuffled)) -> U2_gga(A, B, RestB, Shuffled, shuffle_in_gga(A, RestB, Shuffled)) U2_gga(A, B, RestB, Shuffled, shuffle_out_gga(A, RestB, Shuffled)) -> shuffle_out_gga(A, .(B, RestB), .(B, Shuffled)) U1_gga(A, RestA, B, Shuffled, shuffle_out_gga(RestA, B, Shuffled)) -> shuffle_out_gga(.(A, RestA), B, .(A, Shuffled)) The argument filtering Pi contains the following mapping: shuffle_in_gga(x1, x2, x3) = shuffle_in_gga(x1, x2) [] = [] shuffle_out_gga(x1, x2, x3) = shuffle_out_gga(x1, x2, x3) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4, x5) = U1_gga(x1, x2, x3, x5) U2_gga(x1, x2, x3, x4, x5) = U2_gga(x1, x2, x3, x5) popout

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

job log

popout

actions

all output return to Logic Progr 19030