Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487096694
details
property
value
status
complete
benchmark
ts08.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
lpexamples
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.86717 seconds
cpu usage
4.02178
user time
3.83219
system time
0.189593
max virtual memory
1.8943972E7
max residence set size
285064.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern q(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 1 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: q(X) :- p(X, 0). p(0, X1). p(s(X), Y) :- p(X, s(Y)). Query: q(g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: q_in_1: (b) p_in_2: (b,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: q_in_g(X) -> U1_g(X, p_in_gg(X, 0)) p_in_gg(0, X1) -> p_out_gg(0, X1) p_in_gg(s(X), Y) -> U2_gg(X, Y, p_in_gg(X, s(Y))) U2_gg(X, Y, p_out_gg(X, s(Y))) -> p_out_gg(s(X), Y) U1_g(X, p_out_gg(X, 0)) -> q_out_g(X) The argument filtering Pi contains the following mapping: q_in_g(x1) = q_in_g(x1) U1_g(x1, x2) = U1_g(x2) p_in_gg(x1, x2) = p_in_gg(x1, x2) 0 = 0 p_out_gg(x1, x2) = p_out_gg s(x1) = s(x1) U2_gg(x1, x2, x3) = U2_gg(x3) q_out_g(x1) = q_out_g Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: q_in_g(X) -> U1_g(X, p_in_gg(X, 0)) p_in_gg(0, X1) -> p_out_gg(0, X1) p_in_gg(s(X), Y) -> U2_gg(X, Y, p_in_gg(X, s(Y))) U2_gg(X, Y, p_out_gg(X, s(Y))) -> p_out_gg(s(X), Y) U1_g(X, p_out_gg(X, 0)) -> q_out_g(X) The argument filtering Pi contains the following mapping: q_in_g(x1) = q_in_g(x1) U1_g(x1, x2) = U1_g(x2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming