Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919779
details
property
value
status
complete
benchmark
sublist1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
talp_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.78709793091 seconds
cpu usage
4.038321353
max memory
2.09928192E8
stage attributes
key
value
output-size
9584
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 sublist(a,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 4 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 9 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: append([], Ys, Ys). append(.(X, Xs), Ys, .(X, Zs)) :- append(Xs, Ys, Zs). sublist(X, Y) :- ','(append(P, X1, Y), append(X2, X, P)). Query: sublist(a,g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: sublist_in_2: (f,b) append_in_3: (f,f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: sublist_in_ag(X, Y) -> U2_ag(X, Y, append_in_aag(P, X1, Y)) append_in_aag([], Ys, Ys) -> append_out_aag([], Ys, Ys) append_in_aag(.(X, Xs), Ys, .(X, Zs)) -> U1_aag(X, Xs, Ys, Zs, append_in_aag(Xs, Ys, Zs)) U1_aag(X, Xs, Ys, Zs, append_out_aag(Xs, Ys, Zs)) -> append_out_aag(.(X, Xs), Ys, .(X, Zs)) U2_ag(X, Y, append_out_aag(P, X1, Y)) -> U3_ag(X, Y, append_in_aag(X2, X, P)) U3_ag(X, Y, append_out_aag(X2, X, P)) -> sublist_out_ag(X, Y) The argument filtering Pi contains the following mapping: sublist_in_ag(x1, x2) = sublist_in_ag(x2) U2_ag(x1, x2, x3) = U2_ag(x3) append_in_aag(x1, x2, x3) = append_in_aag(x3) append_out_aag(x1, x2, x3) = append_out_aag(x1, x2) .(x1, x2) = .(x1, x2) U1_aag(x1, x2, x3, x4, x5) = U1_aag(x1, x5) U3_ag(x1, x2, x3) = U3_ag(x3) sublist_out_ag(x1, x2) = sublist_out_ag(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: sublist_in_ag(X, Y) -> U2_ag(X, Y, append_in_aag(P, X1, Y)) append_in_aag([], Ys, Ys) -> append_out_aag([], Ys, Ys) append_in_aag(.(X, Xs), Ys, .(X, Zs)) -> U1_aag(X, Xs, Ys, Zs, append_in_aag(Xs, Ys, Zs))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030