TSTP Solution File: SWV182+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV182+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 23:02:54 EDT 2023
% Result : Theorem 3.20s 0.77s
% Output : Proof 3.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV182+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 03:04:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.20/0.77 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 3.20/0.77
% 3.20/0.77 % SZS status Theorem
% 3.20/0.77
% 3.20/0.77 % SZS output start Proof
% 3.20/0.77 Take the following subset of the input axioms:
% 3.20/0.78 fof(cl5_nebula_init_0086, conjecture, (leq(tptp_float_0_001, pv76) & (leq(n1, loopcounter) & (![A2]: ((leq(n0, A2) & leq(A2, n135299)) => ![B]: ((leq(n0, B) & leq(B, n4)) => a_select3(q_init, A2, B)=init)) & (![C]: ((leq(n0, C) & leq(C, n4)) => a_select3(center_init, C, n0)=init) & ((gt(loopcounter, n0) => ![D]: ((leq(n0, D) & leq(D, n4)) => a_select2(mu_init, D)=init)) & ((gt(loopcounter, n0) => ![E]: ((leq(n0, E) & leq(E, n4)) => a_select2(rho_init, E)=init)) & (gt(loopcounter, n0) => ![F]: ((leq(n0, F) & leq(F, n4)) => a_select2(sigma_init, F)=init)))))))) => ![G]: ((leq(n0, G) & leq(G, n4)) => a_select2(rho_init, G)=init)).
% 3.20/0.78 fof(leq_succ_gt, axiom, ![X, Y]: (leq(succ(X), Y) => gt(Y, X))).
% 3.20/0.78 fof(successor_1, axiom, succ(n0)=n1).
% 3.20/0.78
% 3.20/0.78 Now clausify the problem and encode Horn clauses using encoding 3 of
% 3.20/0.78 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 3.20/0.78 We repeatedly replace C & s=t => u=v by the two clauses:
% 3.20/0.78 fresh(y, y, x1...xn) = u
% 3.20/0.78 C => fresh(s, t, x1...xn) = v
% 3.20/0.78 where fresh is a fresh function symbol and x1..xn are the free
% 3.20/0.78 variables of u and v.
% 3.20/0.78 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 3.20/0.78 input problem has no model of domain size 1).
% 3.20/0.78
% 3.20/0.78 The encoding turns the above axioms into the following unit equations and goals:
% 3.20/0.78
% 3.20/0.78 Axiom 1 (successor_1): succ(n0) = n1.
% 3.20/0.78 Axiom 2 (cl5_nebula_init_0086): leq(n0, g) = true3.
% 3.20/0.78 Axiom 3 (cl5_nebula_init_0086_1): leq(n1, loopcounter) = true3.
% 3.20/0.78 Axiom 4 (cl5_nebula_init_0086_3): leq(g, n4) = true3.
% 3.20/0.78 Axiom 5 (cl5_nebula_init_0086_6): fresh53(X, X, Y) = init.
% 3.20/0.78 Axiom 6 (cl5_nebula_init_0086_6): fresh44(X, X, Y) = a_select2(rho_init, Y).
% 3.20/0.78 Axiom 7 (leq_succ_gt): fresh31(X, X, Y, Z) = true3.
% 3.20/0.78 Axiom 8 (cl5_nebula_init_0086_6): fresh52(X, X, Y) = fresh53(gt(loopcounter, n0), true3, Y).
% 3.20/0.78 Axiom 9 (cl5_nebula_init_0086_6): fresh52(leq(n0, X), true3, X) = fresh44(leq(X, n4), true3, X).
% 3.20/0.78 Axiom 10 (leq_succ_gt): fresh31(leq(succ(X), Y), true3, X, Y) = gt(Y, X).
% 3.20/0.78
% 3.20/0.78 Goal 1 (cl5_nebula_init_0086_4): a_select2(rho_init, g) = init.
% 3.20/0.78 Proof:
% 3.20/0.78 a_select2(rho_init, g)
% 3.20/0.78 = { by axiom 6 (cl5_nebula_init_0086_6) R->L }
% 3.20/0.78 fresh44(true3, true3, g)
% 3.20/0.78 = { by axiom 4 (cl5_nebula_init_0086_3) R->L }
% 3.20/0.78 fresh44(leq(g, n4), true3, g)
% 3.20/0.78 = { by axiom 9 (cl5_nebula_init_0086_6) R->L }
% 3.20/0.78 fresh52(leq(n0, g), true3, g)
% 3.20/0.78 = { by axiom 2 (cl5_nebula_init_0086) }
% 3.20/0.78 fresh52(true3, true3, g)
% 3.20/0.78 = { by axiom 8 (cl5_nebula_init_0086_6) }
% 3.20/0.78 fresh53(gt(loopcounter, n0), true3, g)
% 3.20/0.78 = { by axiom 10 (leq_succ_gt) R->L }
% 3.20/0.78 fresh53(fresh31(leq(succ(n0), loopcounter), true3, n0, loopcounter), true3, g)
% 3.20/0.78 = { by axiom 1 (successor_1) }
% 3.20/0.78 fresh53(fresh31(leq(n1, loopcounter), true3, n0, loopcounter), true3, g)
% 3.20/0.78 = { by axiom 3 (cl5_nebula_init_0086_1) }
% 3.20/0.78 fresh53(fresh31(true3, true3, n0, loopcounter), true3, g)
% 3.20/0.78 = { by axiom 7 (leq_succ_gt) }
% 3.20/0.78 fresh53(true3, true3, g)
% 3.20/0.78 = { by axiom 5 (cl5_nebula_init_0086_6) }
% 3.20/0.78 init
% 3.20/0.78 % SZS output end Proof
% 3.20/0.78
% 3.20/0.78 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------