Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919982
details
property
value
status
complete
benchmark
exercise_length.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Art-of-prolog
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.91432499886 seconds
cpu usage
4.526596216
max memory
2.22191616E8
stage attributes
key
value
output-size
15041
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 length(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 18 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: length(Xs, L) :- length(Xs, 0, L). length([], L, L). length(.(X, Xs), L0, L) :- ','(is(L1, +(L0, 1)), length(Xs, L1, L)). Query: length(g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: length(Xs, L) :- length(Xs, 0, L). length([], L, L). length(.(X, Xs), L0, L) :- ','(is(L1, +(L0, 1)), length(Xs, L1, L)). is(X0, X1). Query: length(g,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: length_in_2: (b,f) length_in_3: (b,b,f) (b,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: length_in_ga(Xs, L) -> U1_ga(Xs, L, length_in_gga(Xs, 0, L)) length_in_gga([], L, L) -> length_out_gga([], L, L) length_in_gga(.(X, Xs), L0, L) -> U2_gga(X, Xs, L0, L, is_in_ag(L1, +(L0, 1))) is_in_ag(X0, X1) -> is_out_ag(X0, X1) U2_gga(X, Xs, L0, L, is_out_ag(L1, +(L0, 1))) -> U3_gga(X, Xs, L0, L, length_in_gaa(Xs, L1, L)) length_in_gaa([], L, L) -> length_out_gaa([], L, L) length_in_gaa(.(X, Xs), L0, L) -> U2_gaa(X, Xs, L0, L, is_in_ag(L1, +(L0, 1))) U2_gaa(X, Xs, L0, L, is_out_ag(L1, +(L0, 1))) -> U3_gaa(X, Xs, L0, L, length_in_gaa(Xs, L1, L)) U3_gaa(X, Xs, L0, L, length_out_gaa(Xs, L1, L)) -> length_out_gaa(.(X, Xs), L0, L) U3_gga(X, Xs, L0, L, length_out_gaa(Xs, L1, L)) -> length_out_gga(.(X, Xs), L0, L) U1_ga(Xs, L, length_out_gga(Xs, 0, L)) -> length_out_ga(Xs, L) The argument filtering Pi contains the following mapping: length_in_ga(x1, x2) = length_in_ga(x1) U1_ga(x1, x2, x3) = U1_ga(x3) length_in_gga(x1, x2, x3) = length_in_gga(x1, x2) [] = [] length_out_gga(x1, x2, x3) = length_out_gga
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030