TSTP Solution File: NUM550+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : NUM550+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 : n012.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 11:56:55 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM550+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 : n012.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 : Fri Aug 25 10:06:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.61 Command-line arguments: --ground-connectedness --complete-subsets
% 0.19/0.61
% 0.19/0.61 % SZS status Theorem
% 0.19/0.61
% 0.19/0.61 % SZS output start Proof
% 0.19/0.61 Take the following subset of the input axioms:
% 0.19/0.61 fof(mCardEmpty, axiom, ![W0]: (aSet0(W0) => (sbrdtbr0(W0)=sz00 <=> W0=slcrc0))).
% 0.19/0.61 fof(m__, conjecture, xQ!=slcrc0).
% 0.19/0.61 fof(m__2202_02, hypothesis, aSet0(xS) & (aSet0(xT) & xk!=sz00)).
% 0.19/0.61 fof(m__2291, hypothesis, aSet0(xQ) & (isFinite0(xQ) & sbrdtbr0(xQ)=xk)).
% 0.19/0.61
% 0.19/0.61 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.61 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.61 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.61 fresh(y, y, x1...xn) = u
% 0.19/0.61 C => fresh(s, t, x1...xn) = v
% 0.19/0.61 where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.61 variables of u and v.
% 0.19/0.61 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.61 input problem has no model of domain size 1).
% 0.19/0.61
% 0.19/0.61 The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.61
% 0.19/0.61 Axiom 1 (m__): xQ = slcrc0.
% 0.19/0.61 Axiom 2 (m__2291): sbrdtbr0(xQ) = xk.
% 0.19/0.61 Axiom 3 (m__2291_1): aSet0(xQ) = true2.
% 0.19/0.61 Axiom 4 (mCardEmpty): fresh66(X, X, Y) = sz00.
% 0.19/0.61 Axiom 5 (mCardEmpty): fresh65(X, X, Y) = sbrdtbr0(Y).
% 0.19/0.61 Axiom 6 (mCardEmpty): fresh65(aSet0(X), true2, X) = fresh66(X, slcrc0, X).
% 0.19/0.61
% 0.19/0.61 Goal 1 (m__2202_02_2): xk = sz00.
% 0.19/0.61 Proof:
% 0.19/0.61 xk
% 0.19/0.61 = { by axiom 2 (m__2291) R->L }
% 0.19/0.61 sbrdtbr0(xQ)
% 0.19/0.61 = { by axiom 5 (mCardEmpty) R->L }
% 0.19/0.61 fresh65(true2, true2, xQ)
% 0.19/0.61 = { by axiom 3 (m__2291_1) R->L }
% 0.19/0.61 fresh65(aSet0(xQ), true2, xQ)
% 0.19/0.61 = { by axiom 6 (mCardEmpty) }
% 0.19/0.61 fresh66(xQ, slcrc0, xQ)
% 0.19/0.61 = { by axiom 1 (m__) R->L }
% 0.19/0.61 fresh66(xQ, xQ, xQ)
% 0.19/0.61 = { by axiom 4 (mCardEmpty) }
% 0.19/0.61 sz00
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61
% 0.19/0.61 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------