TSTP Solution File: ALG179+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : ALG179+1 : TPTP v8.1.2. Released v2.7.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 : n011.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 : Wed Aug 30 16:42:25 EDT 2023
% Result : Theorem 0.21s 0.43s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG179+1 : TPTP v8.1.2. Released v2.7.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 : n011.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 : Mon Aug 28 02:47:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.43 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.21/0.43
% 0.21/0.43 % SZS status Theorem
% 0.21/0.43
% 0.21/0.44 % SZS output start Proof
% 0.21/0.44 Take the following subset of the input axioms:
% 0.21/0.45 fof(ax2, axiom, ![U]: (sorti2(U) => ![V]: (sorti2(V) => sorti2(op2(U, V))))).
% 0.21/0.45 fof(ax3, axiom, ![U2]: (sorti1(U2) => ![V2]: (sorti1(V2) => op1(op1(U2, V2), V2)=U2))).
% 0.21/0.45 fof(ax4, axiom, ~![U2]: (sorti2(U2) => ![V2]: (sorti2(V2) => op2(op2(U2, V2), V2)=U2))).
% 0.21/0.45 fof(co1, conjecture, (![U2]: (sorti1(U2) => sorti2(h(U2))) & ![V2]: (sorti2(V2) => sorti1(j(V2)))) => ~(![W]: (sorti1(W) => ![X]: (sorti1(X) => h(op1(W, X))=op2(h(W), h(X)))) & (![Y]: (sorti2(Y) => ![Z]: (sorti2(Z) => j(op2(Y, Z))=op1(j(Y), j(Z)))) & (![X1]: (sorti2(X1) => h(j(X1))=X1) & ![X2]: (sorti1(X2) => j(h(X2))=X2))))).
% 0.21/0.45
% 0.21/0.45 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.45 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.45 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.45 fresh(y, y, x1...xn) = u
% 0.21/0.45 C => fresh(s, t, x1...xn) = v
% 0.21/0.45 where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.45 variables of u and v.
% 0.21/0.45 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.45 input problem has no model of domain size 1).
% 0.21/0.45
% 0.21/0.45 The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.45
% 0.21/0.45 Axiom 1 (ax4_1): sorti2(v) = true.
% 0.21/0.45 Axiom 2 (ax4): sorti2(u) = true.
% 0.21/0.45 Axiom 3 (co1_5): fresh(X, X, Y) = Y.
% 0.21/0.45 Axiom 4 (co1_3): fresh6(X, X, Y) = true.
% 0.21/0.45 Axiom 5 (co1_5): fresh(sorti2(X), true, X) = h(j(X)).
% 0.21/0.45 Axiom 6 (ax2): fresh12(X, X, Y, Z) = sorti2(op2(Y, Z)).
% 0.21/0.45 Axiom 7 (ax2): fresh11(X, X, Y, Z) = true.
% 0.21/0.45 Axiom 8 (ax3): fresh10(X, X, Y, Z) = op1(op1(Y, Z), Z).
% 0.21/0.45 Axiom 9 (co1_1): fresh8(X, X, Y, Z) = op2(h(Y), h(Z)).
% 0.21/0.45 Axiom 10 (co1_1): fresh7(X, X, Y, Z) = h(op1(Y, Z)).
% 0.21/0.45 Axiom 11 (co1_3): fresh6(sorti2(X), true, X) = sorti1(j(X)).
% 0.21/0.45 Axiom 12 (co1_4): fresh5(X, X, Y, Z) = op1(j(Y), j(Z)).
% 0.21/0.45 Axiom 13 (co1_4): fresh4(X, X, Y, Z) = j(op2(Y, Z)).
% 0.21/0.45 Axiom 14 (ax3): fresh3(X, X, Y, Z) = Y.
% 0.21/0.45 Axiom 15 (ax2): fresh12(sorti2(X), true, Y, X) = fresh11(sorti2(Y), true, Y, X).
% 0.21/0.45 Axiom 16 (co1_1): fresh8(sorti1(X), true, Y, X) = fresh7(sorti1(Y), true, Y, X).
% 0.21/0.45 Axiom 17 (co1_4): fresh5(sorti2(X), true, Y, X) = fresh4(sorti2(Y), true, Y, X).
% 0.21/0.45 Axiom 18 (ax3): fresh10(sorti1(X), true, Y, X) = fresh3(sorti1(Y), true, Y, X).
% 0.21/0.45
% 0.21/0.45 Lemma 19: sorti1(j(v)) = true.
% 0.21/0.45 Proof:
% 0.21/0.45 sorti1(j(v))
% 0.21/0.45 = { by axiom 11 (co1_3) R->L }
% 0.21/0.45 fresh6(sorti2(v), true, v)
% 0.21/0.45 = { by axiom 1 (ax4_1) }
% 0.21/0.45 fresh6(true, true, v)
% 0.21/0.45 = { by axiom 4 (co1_3) }
% 0.21/0.45 true
% 0.21/0.45
% 0.21/0.45 Lemma 20: sorti2(op2(u, v)) = true.
% 0.21/0.45 Proof:
% 0.21/0.45 sorti2(op2(u, v))
% 0.21/0.45 = { by axiom 6 (ax2) R->L }
% 0.21/0.45 fresh12(true, true, u, v)
% 0.21/0.45 = { by axiom 1 (ax4_1) R->L }
% 0.21/0.45 fresh12(sorti2(v), true, u, v)
% 0.21/0.45 = { by axiom 15 (ax2) }
% 0.21/0.45 fresh11(sorti2(u), true, u, v)
% 0.21/0.45 = { by axiom 2 (ax4) }
% 0.21/0.45 fresh11(true, true, u, v)
% 0.21/0.45 = { by axiom 7 (ax2) }
% 0.21/0.45 true
% 0.21/0.45
% 0.21/0.45 Goal 1 (ax4_2): op2(op2(u, v), v) = u.
% 0.21/0.45 Proof:
% 0.21/0.45 op2(op2(u, v), v)
% 0.21/0.45 = { by axiom 3 (co1_5) R->L }
% 0.21/0.45 op2(fresh(true, true, op2(u, v)), v)
% 0.21/0.45 = { by lemma 20 R->L }
% 0.21/0.45 op2(fresh(sorti2(op2(u, v)), true, op2(u, v)), v)
% 0.21/0.45 = { by axiom 5 (co1_5) }
% 0.21/0.45 op2(h(j(op2(u, v))), v)
% 0.21/0.45 = { by axiom 3 (co1_5) R->L }
% 0.21/0.45 op2(h(j(op2(u, v))), fresh(true, true, v))
% 0.21/0.45 = { by axiom 1 (ax4_1) R->L }
% 0.21/0.45 op2(h(j(op2(u, v))), fresh(sorti2(v), true, v))
% 0.21/0.45 = { by axiom 5 (co1_5) }
% 0.21/0.45 op2(h(j(op2(u, v))), h(j(v)))
% 0.21/0.45 = { by axiom 9 (co1_1) R->L }
% 0.21/0.45 fresh8(true, true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by lemma 19 R->L }
% 0.21/0.45 fresh8(sorti1(j(v)), true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by axiom 16 (co1_1) }
% 0.21/0.45 fresh7(sorti1(j(op2(u, v))), true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by axiom 11 (co1_3) R->L }
% 0.21/0.45 fresh7(fresh6(sorti2(op2(u, v)), true, op2(u, v)), true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by lemma 20 }
% 0.21/0.45 fresh7(fresh6(true, true, op2(u, v)), true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by axiom 4 (co1_3) }
% 0.21/0.45 fresh7(true, true, j(op2(u, v)), j(v))
% 0.21/0.45 = { by axiom 10 (co1_1) }
% 0.21/0.45 h(op1(j(op2(u, v)), j(v)))
% 0.21/0.45 = { by axiom 13 (co1_4) R->L }
% 0.21/0.45 h(op1(fresh4(true, true, u, v), j(v)))
% 0.21/0.45 = { by axiom 2 (ax4) R->L }
% 0.21/0.45 h(op1(fresh4(sorti2(u), true, u, v), j(v)))
% 0.21/0.45 = { by axiom 17 (co1_4) R->L }
% 0.21/0.45 h(op1(fresh5(sorti2(v), true, u, v), j(v)))
% 0.21/0.45 = { by axiom 1 (ax4_1) }
% 0.21/0.45 h(op1(fresh5(true, true, u, v), j(v)))
% 0.21/0.45 = { by axiom 12 (co1_4) }
% 0.21/0.45 h(op1(op1(j(u), j(v)), j(v)))
% 0.21/0.45 = { by axiom 8 (ax3) R->L }
% 0.21/0.45 h(fresh10(true, true, j(u), j(v)))
% 0.21/0.45 = { by lemma 19 R->L }
% 0.21/0.45 h(fresh10(sorti1(j(v)), true, j(u), j(v)))
% 0.21/0.45 = { by axiom 18 (ax3) }
% 0.21/0.45 h(fresh3(sorti1(j(u)), true, j(u), j(v)))
% 0.21/0.45 = { by axiom 11 (co1_3) R->L }
% 0.21/0.45 h(fresh3(fresh6(sorti2(u), true, u), true, j(u), j(v)))
% 0.21/0.45 = { by axiom 2 (ax4) }
% 0.21/0.45 h(fresh3(fresh6(true, true, u), true, j(u), j(v)))
% 0.21/0.45 = { by axiom 4 (co1_3) }
% 0.21/0.45 h(fresh3(true, true, j(u), j(v)))
% 0.21/0.45 = { by axiom 14 (ax3) }
% 0.21/0.45 h(j(u))
% 0.21/0.45 = { by axiom 5 (co1_5) R->L }
% 0.21/0.46 fresh(sorti2(u), true, u)
% 0.21/0.46 = { by axiom 2 (ax4) }
% 0.21/0.46 fresh(true, true, u)
% 0.21/0.46 = { by axiom 3 (co1_5) }
% 0.21/0.46 u
% 0.21/0.46 % SZS output end Proof
% 0.21/0.46
% 0.21/0.46 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------