Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919620
details
property
value
status
complete
benchmark
map.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
talp_apt
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.66736698151 seconds
cpu usage
3.750428492
max memory
2.62004736E8
stage attributes
key
value
output-size
8961
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 map(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, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: p(val_i, val_j). map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys)). map([], []). Query: map(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: map_in_2: (b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: map_in_ga(.(X, Xs), .(Y, Ys)) -> U1_ga(X, Xs, Y, Ys, p_in_ga(X, Y)) p_in_ga(val_i, val_j) -> p_out_ga(val_i, val_j) U1_ga(X, Xs, Y, Ys, p_out_ga(X, Y)) -> U2_ga(X, Xs, Y, Ys, map_in_ga(Xs, Ys)) map_in_ga([], []) -> map_out_ga([], []) U2_ga(X, Xs, Y, Ys, map_out_ga(Xs, Ys)) -> map_out_ga(.(X, Xs), .(Y, Ys)) The argument filtering Pi contains the following mapping: map_in_ga(x1, x2) = map_in_ga(x1) .(x1, x2) = .(x1, x2) U1_ga(x1, x2, x3, x4, x5) = U1_ga(x1, x2, x5) p_in_ga(x1, x2) = p_in_ga(x1) val_i = val_i p_out_ga(x1, x2) = p_out_ga(x1, x2) U2_ga(x1, x2, x3, x4, x5) = U2_ga(x1, x2, x3, x5) [] = [] map_out_ga(x1, x2) = map_out_ga(x1, x2) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: map_in_ga(.(X, Xs), .(Y, Ys)) -> U1_ga(X, Xs, Y, Ys, p_in_ga(X, Y)) p_in_ga(val_i, val_j) -> p_out_ga(val_i, val_j) U1_ga(X, Xs, Y, Ys, p_out_ga(X, Y)) -> U2_ga(X, Xs, Y, Ys, map_in_ga(Xs, Ys)) map_in_ga([], []) -> map_out_ga([], [])
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030