TSTP Solution File: NUM582+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : NUM582+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 : n025.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:57:06 EDT 2023
% Result : Theorem 4.93s 1.38s
% Output : Proof 4.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM582+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.10/0.33 % Computer : n025.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Fri Aug 25 14:19:37 EDT 2023
% 0.10/0.34 % CPUTime :
% 4.93/1.38 Command-line arguments: --no-flatten-goal
% 4.93/1.38
% 4.93/1.38 % SZS status Theorem
% 4.93/1.38
% 4.93/1.39 % SZS output start Proof
% 4.93/1.39 Take the following subset of the input axioms:
% 4.93/1.39 fof(mZeroLess, axiom, ![W0]: (aElementOf0(W0, szNzAzT0) => sdtlseqdt0(sz00, W0))).
% 4.93/1.39 fof(mZeroNum, axiom, aElementOf0(sz00, szNzAzT0)).
% 4.93/1.39 fof(m__, conjecture, aSubsetOf0(sdtlpdtrp0(xN, xi), xS)).
% 4.93/1.39 fof(m__3623, hypothesis, aFunction0(xN) & (szDzozmdt0(xN)=szNzAzT0 & (sdtlpdtrp0(xN, sz00)=xS & ![W0_2]: (aElementOf0(W0_2, szNzAzT0) => ((aSubsetOf0(sdtlpdtrp0(xN, W0_2), szNzAzT0) & isCountable0(sdtlpdtrp0(xN, W0_2))) => (aSubsetOf0(sdtlpdtrp0(xN, szszuzczcdt0(W0_2)), sdtmndt0(sdtlpdtrp0(xN, W0_2), szmzizndt0(sdtlpdtrp0(xN, W0_2)))) & isCountable0(sdtlpdtrp0(xN, szszuzczcdt0(W0_2))))))))).
% 4.93/1.39 fof(m__3754, hypothesis, ![W1, W0_2]: ((aElementOf0(W0_2, szNzAzT0) & aElementOf0(W1, szNzAzT0)) => (sdtlseqdt0(W1, W0_2) => aSubsetOf0(sdtlpdtrp0(xN, W0_2), sdtlpdtrp0(xN, W1))))).
% 4.93/1.39 fof(m__3989, hypothesis, aElementOf0(xi, szNzAzT0)).
% 4.93/1.39
% 4.93/1.39 Now clausify the problem and encode Horn clauses using encoding 3 of
% 4.93/1.39 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 4.93/1.39 We repeatedly replace C & s=t => u=v by the two clauses:
% 4.93/1.39 fresh(y, y, x1...xn) = u
% 4.93/1.39 C => fresh(s, t, x1...xn) = v
% 4.93/1.39 where fresh is a fresh function symbol and x1..xn are the free
% 4.93/1.39 variables of u and v.
% 4.93/1.39 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 4.93/1.39 input problem has no model of domain size 1).
% 4.93/1.39
% 4.93/1.39 The encoding turns the above axioms into the following unit equations and goals:
% 4.93/1.39
% 4.93/1.39 Axiom 1 (m__3623_1): sdtlpdtrp0(xN, sz00) = xS.
% 4.93/1.39 Axiom 2 (m__3989): aElementOf0(xi, szNzAzT0) = true2.
% 4.93/1.39 Axiom 3 (mZeroNum): aElementOf0(sz00, szNzAzT0) = true2.
% 4.93/1.39 Axiom 4 (mZeroLess): fresh13(X, X, Y) = true2.
% 4.93/1.39 Axiom 5 (m__3754): fresh104(X, X, Y, Z) = true2.
% 4.93/1.39 Axiom 6 (mZeroLess): fresh13(aElementOf0(X, szNzAzT0), true2, X) = sdtlseqdt0(sz00, X).
% 4.93/1.39 Axiom 7 (m__3754): fresh103(X, X, Y, Z) = fresh104(aElementOf0(Y, szNzAzT0), true2, Y, Z).
% 4.93/1.39 Axiom 8 (m__3754): fresh103(sdtlseqdt0(X, Y), true2, Y, X) = fresh9(aElementOf0(X, szNzAzT0), true2, Y, X).
% 4.93/1.39 Axiom 9 (m__3754): fresh9(X, X, Y, Z) = aSubsetOf0(sdtlpdtrp0(xN, Y), sdtlpdtrp0(xN, Z)).
% 4.93/1.39
% 4.93/1.39 Goal 1 (m__): aSubsetOf0(sdtlpdtrp0(xN, xi), xS) = true2.
% 4.93/1.39 Proof:
% 4.93/1.39 aSubsetOf0(sdtlpdtrp0(xN, xi), xS)
% 4.93/1.39 = { by axiom 1 (m__3623_1) R->L }
% 4.93/1.39 aSubsetOf0(sdtlpdtrp0(xN, xi), sdtlpdtrp0(xN, sz00))
% 4.93/1.39 = { by axiom 9 (m__3754) R->L }
% 4.93/1.39 fresh9(true2, true2, xi, sz00)
% 4.93/1.39 = { by axiom 3 (mZeroNum) R->L }
% 4.93/1.39 fresh9(aElementOf0(sz00, szNzAzT0), true2, xi, sz00)
% 4.93/1.39 = { by axiom 8 (m__3754) R->L }
% 4.93/1.39 fresh103(sdtlseqdt0(sz00, xi), true2, xi, sz00)
% 4.93/1.39 = { by axiom 6 (mZeroLess) R->L }
% 4.93/1.39 fresh103(fresh13(aElementOf0(xi, szNzAzT0), true2, xi), true2, xi, sz00)
% 4.93/1.39 = { by axiom 2 (m__3989) }
% 4.93/1.39 fresh103(fresh13(true2, true2, xi), true2, xi, sz00)
% 4.93/1.39 = { by axiom 4 (mZeroLess) }
% 4.93/1.39 fresh103(true2, true2, xi, sz00)
% 4.93/1.39 = { by axiom 7 (m__3754) }
% 4.93/1.39 fresh104(aElementOf0(xi, szNzAzT0), true2, xi, sz00)
% 4.93/1.39 = { by axiom 2 (m__3989) }
% 4.93/1.39 fresh104(true2, true2, xi, sz00)
% 4.93/1.39 = { by axiom 5 (m__3754) }
% 4.93/1.39 true2
% 4.93/1.39 % SZS output end Proof
% 4.93/1.39
% 4.93/1.39 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------