Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919760
details
property
value
status
complete
benchmark
pl4.4.6a.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
talp_plumer
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.87563300133 seconds
cpu usage
4.523642527
max memory
3.02747648E8
stage attributes
key
value
output-size
13250
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Clauses: perm([], []). perm(.(X, L), Z) :- ','(perm(L, Y), insert(X, Y, Z)). insert(X, [], .(X, [])). insert(X, L, .(X, L)). insert(X, .(H, L1), .(H, L2)) :- insert(X, L1, L2). 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) 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: perm_in_ga([], []) -> perm_out_ga([], []) perm_in_ga(.(X, L), Z) -> U1_ga(X, L, Z, perm_in_ga(L, Y)) U1_ga(X, L, Z, perm_out_ga(L, Y)) -> U2_ga(X, L, Z, insert_in_gga(X, Y, Z)) insert_in_gga(X, [], .(X, [])) -> insert_out_gga(X, [], .(X, [])) insert_in_gga(X, L, .(X, L)) -> insert_out_gga(X, L, .(X, L)) insert_in_gga(X, .(H, L1), .(H, L2)) -> U3_gga(X, H, L1, L2, insert_in_gga(X, L1, L2)) U3_gga(X, H, L1, L2, insert_out_gga(X, L1, L2)) -> insert_out_gga(X, .(H, L1), .(H, L2)) U2_ga(X, L, Z, insert_out_gga(X, Y, Z)) -> perm_out_ga(.(X, L), Z) 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) = U1_ga(x1, x4) U2_ga(x1, x2, x3, x4) = U2_ga(x4) insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2) insert_out_gga(x1, x2, x3) = insert_out_gga(x3) U3_gga(x1, x2, x3, x4, x5) = U3_gga(x2, x5)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030