Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529387
details
property
value
status
complete
benchmark
permutation2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n022.star.cs.uiowa.edu
space
terminweb_old
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.93335103989 seconds
cpu usage
4.743036273
max memory
4.26954752E8
stage attributes
key
value
output-size
15015
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern perm(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) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) MRRProof [EQUIVALENT, 2 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Clauses: perm([], []). perm(.(X, Y), .(U, V)) :- ','(delete(U, .(X, Y), W), perm(W, V)). delete(X, .(X, Y), Y). delete(U, .(X, Y), .(X, Z)) :- delete(U, Y, Z). Query: perm(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: perm_in_2: (b,f) delete_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: perm_in_ga([], []) -> perm_out_ga([], []) perm_in_ga(.(X, Y), .(U, V)) -> U1_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), W)) delete_in_aga(X, .(X, Y), Y) -> delete_out_aga(X, .(X, Y), Y) delete_in_aga(U, .(X, Y), .(X, Z)) -> U3_aga(U, X, Y, Z, delete_in_aga(U, Y, Z)) U3_aga(U, X, Y, Z, delete_out_aga(U, Y, Z)) -> delete_out_aga(U, .(X, Y), .(X, Z)) U1_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), W)) -> U2_ga(X, Y, U, V, perm_in_ga(W, V)) U2_ga(X, Y, U, V, perm_out_ga(W, V)) -> perm_out_ga(.(X, Y), .(U, V)) The argument filtering Pi contains the following mapping: perm_in_ga(x1, x2) = perm_in_ga(x1) [] = [] perm_out_ga(x1, x2) = perm_out_ga(x2) .(x1, x2) = .(x1, x2) U1_ga(x1, x2, x3, x4, x5) = U1_ga(x5) delete_in_aga(x1, x2, x3) = delete_in_aga(x2) delete_out_aga(x1, x2, x3) = delete_out_aga(x1, x3) U3_aga(x1, x2, x3, x4, x5) = U3_aga(x2, x5) U2_ga(x1, x2, x3, x4, x5) = U2_ga(x3, x5)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming