Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529115
details
property
value
status
complete
benchmark
select.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
talp_apt
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.99972105026 seconds
cpu usage
4.15869411
max memory
3.59800832E8
stage attributes
key
value
output-size
6934
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern select(a,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 1 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: select(X, .(X, Xs), Xs). select(X, .(Y, Xs), .(Y, Zs)) :- select(X, Xs, Zs). Query: select(a,g,a) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: select_in_3: (f,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Xs), .(Y, Zs)) -> U1_aga(X, Y, Xs, Zs, select_in_aga(X, Xs, Zs)) U1_aga(X, Y, Xs, Zs, select_out_aga(X, Xs, Zs)) -> select_out_aga(X, .(Y, Xs), .(Y, Zs)) The argument filtering Pi contains the following mapping: select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U1_aga(x1, x2, x3, x4, x5) = U1_aga(x2, x5) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Xs), .(Y, Zs)) -> U1_aga(X, Y, Xs, Zs, select_in_aga(X, Xs, Zs)) U1_aga(X, Y, Xs, Zs, select_out_aga(X, Xs, Zs)) -> select_out_aga(X, .(Y, Xs), .(Y, Zs)) The argument filtering Pi contains the following mapping: select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U1_aga(x1, x2, x3, x4, x5) = U1_aga(x2, x5) ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming