TSTP Solution File: RNG059+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : RNG059+1 : TPTP v8.1.2. Released v4.0.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 : n026.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 13:59:05 EDT 2023
% Result : Theorem 10.39s 1.74s
% Output : Proof 10.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG059+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 03:07:04 EDT 2023
% 0.13/0.35 % CPUTime :
% 10.39/1.74 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 10.39/1.74
% 10.39/1.74 % SZS status Theorem
% 10.39/1.74
% 10.39/1.74 % SZS output start Proof
% 10.39/1.74 Take the following subset of the input axioms:
% 10.39/1.75 fof(mArith, axiom, ![W0, W1, W2]: ((aScalar0(W0) & (aScalar0(W1) & aScalar0(W2))) => (sdtpldt0(sdtpldt0(W0, W1), W2)=sdtpldt0(W0, sdtpldt0(W1, W2)) & (sdtpldt0(W0, W1)=sdtpldt0(W1, W0) & (sdtasdt0(sdtasdt0(W0, W1), W2)=sdtasdt0(W0, sdtasdt0(W1, W2)) & sdtasdt0(W0, W1)=sdtasdt0(W1, W0)))))).
% 10.39/1.75 fof(mMNeg, axiom, ![W0_2, W1_2]: ((aScalar0(W0_2) & aScalar0(W1_2)) => (sdtasdt0(W0_2, smndt0(W1_2))=smndt0(sdtasdt0(W0_2, W1_2)) & sdtasdt0(smndt0(W0_2), W1_2)=smndt0(sdtasdt0(W0_2, W1_2))))).
% 10.39/1.75 fof(mSZeroSc, axiom, aScalar0(sz0z00)).
% 10.39/1.75 fof(m__, conjecture, sdtasdt0(smndt0(xS), xR)=smndt0(xN)).
% 10.39/1.75 fof(m__1892, hypothesis, aScalar0(xR) & xR=sdtasdt0(xC, xG)).
% 10.39/1.75 fof(m__1930, hypothesis, aScalar0(xS) & xS=sdtasdt0(xF, xD)).
% 10.39/1.75 fof(m__1949, hypothesis, aScalar0(xN) & xN=sdtasdt0(xR, xS)).
% 10.39/1.75
% 10.39/1.75 Now clausify the problem and encode Horn clauses using encoding 3 of
% 10.39/1.75 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 10.39/1.75 We repeatedly replace C & s=t => u=v by the two clauses:
% 10.39/1.75 fresh(y, y, x1...xn) = u
% 10.39/1.75 C => fresh(s, t, x1...xn) = v
% 10.39/1.75 where fresh is a fresh function symbol and x1..xn are the free
% 10.39/1.75 variables of u and v.
% 10.39/1.75 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 10.39/1.75 input problem has no model of domain size 1).
% 10.39/1.75
% 10.39/1.75 The encoding turns the above axioms into the following unit equations and goals:
% 10.39/1.75
% 10.39/1.75 Axiom 1 (mSZeroSc): aScalar0(sz0z00) = true2.
% 10.39/1.75 Axiom 2 (m__1930_1): aScalar0(xS) = true2.
% 10.39/1.75 Axiom 3 (m__1892_1): aScalar0(xR) = true2.
% 10.39/1.75 Axiom 4 (m__1949): xN = sdtasdt0(xR, xS).
% 10.39/1.75 Axiom 5 (mArith_2): fresh94(X, X, Y, Z) = sdtasdt0(Z, Y).
% 10.39/1.75 Axiom 6 (mArith_2): fresh35(X, X, Y, Z) = sdtasdt0(Y, Z).
% 10.39/1.75 Axiom 7 (mMNeg_1): fresh21(X, X, Y, Z) = sdtasdt0(smndt0(Y), Z).
% 10.39/1.75 Axiom 8 (mMNeg_1): fresh20(X, X, Y, Z) = smndt0(sdtasdt0(Y, Z)).
% 10.39/1.75 Axiom 9 (mArith_2): fresh93(X, X, Y, Z) = fresh94(aScalar0(Y), true2, Y, Z).
% 10.39/1.75 Axiom 10 (mArith_2): fresh93(aScalar0(X), true2, Y, Z) = fresh35(aScalar0(Z), true2, Y, Z).
% 10.39/1.75 Axiom 11 (mMNeg_1): fresh21(aScalar0(X), true2, Y, X) = fresh20(aScalar0(Y), true2, Y, X).
% 10.39/1.75
% 10.39/1.75 Goal 1 (m__): sdtasdt0(smndt0(xS), xR) = smndt0(xN).
% 10.39/1.75 Proof:
% 10.39/1.75 sdtasdt0(smndt0(xS), xR)
% 10.39/1.75 = { by axiom 7 (mMNeg_1) R->L }
% 10.39/1.75 fresh21(true2, true2, xS, xR)
% 10.39/1.75 = { by axiom 3 (m__1892_1) R->L }
% 10.39/1.75 fresh21(aScalar0(xR), true2, xS, xR)
% 10.39/1.75 = { by axiom 11 (mMNeg_1) }
% 10.39/1.75 fresh20(aScalar0(xS), true2, xS, xR)
% 10.39/1.75 = { by axiom 2 (m__1930_1) }
% 10.39/1.75 fresh20(true2, true2, xS, xR)
% 10.39/1.75 = { by axiom 8 (mMNeg_1) }
% 10.39/1.75 smndt0(sdtasdt0(xS, xR))
% 10.39/1.75 = { by axiom 5 (mArith_2) R->L }
% 10.39/1.75 smndt0(fresh94(true2, true2, xR, xS))
% 10.39/1.75 = { by axiom 3 (m__1892_1) R->L }
% 10.39/1.75 smndt0(fresh94(aScalar0(xR), true2, xR, xS))
% 10.39/1.75 = { by axiom 9 (mArith_2) R->L }
% 10.39/1.75 smndt0(fresh93(true2, true2, xR, xS))
% 10.39/1.75 = { by axiom 1 (mSZeroSc) R->L }
% 10.39/1.75 smndt0(fresh93(aScalar0(sz0z00), true2, xR, xS))
% 10.39/1.75 = { by axiom 10 (mArith_2) }
% 10.39/1.75 smndt0(fresh35(aScalar0(xS), true2, xR, xS))
% 10.39/1.75 = { by axiom 2 (m__1930_1) }
% 10.39/1.75 smndt0(fresh35(true2, true2, xR, xS))
% 10.39/1.75 = { by axiom 6 (mArith_2) }
% 10.39/1.75 smndt0(sdtasdt0(xR, xS))
% 10.39/1.75 = { by axiom 4 (m__1949) R->L }
% 10.39/1.75 smndt0(xN)
% 10.39/1.75 % SZS output end Proof
% 10.39/1.75
% 10.39/1.75 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------