Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919824
details
property
value
status
complete
benchmark
pl8.4.2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
talp_plumer
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.18661403656 seconds
cpu usage
5.65924641
max memory
4.80452608E8
stage attributes
key
value
output-size
17861
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 e(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 28 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 13 ms] (8) QDP (9) UsableRulesReductionPairsProof [EQUIVALENT, 56 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Clauses: e(L, T) :- t(L, T). e(L, T) :- ','(t(L, .(plus, C)), e(C, T)). t(L, T) :- n(L, T). t(L, T) :- ','(n(L, .(star, C)), t(C, T)). n(.(L, T), T) :- z(L). n(.(lbrace, A), B) :- e(A, .(rbrace, B)). z(a). z(b). z(c). Query: e(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: e_in_2: (b,f) t_in_2: (b,f) n_in_2: (b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: e_in_ga(L, T) -> U1_ga(L, T, t_in_ga(L, T)) t_in_ga(L, T) -> U4_ga(L, T, n_in_ga(L, T)) n_in_ga(.(L, T), T) -> U7_ga(L, T, z_in_g(L)) z_in_g(a) -> z_out_g(a) z_in_g(b) -> z_out_g(b) z_in_g(c) -> z_out_g(c) U7_ga(L, T, z_out_g(L)) -> n_out_ga(.(L, T), T) n_in_ga(.(lbrace, A), B) -> U8_ga(A, B, e_in_ga(A, .(rbrace, B))) e_in_ga(L, T) -> U2_ga(L, T, t_in_ga(L, .(plus, C))) t_in_ga(L, T) -> U5_ga(L, T, n_in_ga(L, .(star, C))) U5_ga(L, T, n_out_ga(L, .(star, C))) -> U6_ga(L, T, t_in_ga(C, T)) U6_ga(L, T, t_out_ga(C, T)) -> t_out_ga(L, T) U2_ga(L, T, t_out_ga(L, .(plus, C))) -> U3_ga(L, T, e_in_ga(C, T)) U3_ga(L, T, e_out_ga(C, T)) -> e_out_ga(L, T) U8_ga(A, B, e_out_ga(A, .(rbrace, B))) -> n_out_ga(.(lbrace, A), B) U4_ga(L, T, n_out_ga(L, T)) -> t_out_ga(L, T) U1_ga(L, T, t_out_ga(L, T)) -> e_out_ga(L, T) The argument filtering Pi contains the following mapping: e_in_ga(x1, x2) = e_in_ga(x1) U1_ga(x1, x2, x3) = U1_ga(x3) t_in_ga(x1, x2) = t_in_ga(x1) U4_ga(x1, x2, x3) = U4_ga(x3) n_in_ga(x1, x2) = n_in_ga(x1) .(x1, x2) = .(x1, x2) U7_ga(x1, x2, x3) = U7_ga(x2, x3) z_in_g(x1) = z_in_g(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030