%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM465+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:17:05 AM UTC 2026
% Result : Theorem 0.12s 5.88s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 17 unt; 0 def)
% Number of atoms : 118 ( 50 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 107 ( 39 ~; 44 |; 14 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('theBenchmark.p',mSortsC_01) ).
fof(mMulComm,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ),
file('theBenchmark.p',mMulComm) ).
fof(m_MulUnit,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( W0 = sdtasdt0(sz10,W0)
& sdtasdt0(W0,sz10) = W0 ) ),
file('theBenchmark.p',m_MulUnit) ).
fof(m_MulZero,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( sz00 = sdtasdt0(sz00,W0)
& sdtasdt0(W0,sz00) = sz00 ) ),
file('theBenchmark.p',m_MulZero) ).
fof(mLERefl,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> sdtlseqdt0(W0,W0) ),
file('theBenchmark.p',mLERefl) ).
fof(mLETotal,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> ( ( sdtlseqdt0(W1,W0)
& W1 != W0 )
| sdtlseqdt0(W0,W1) ) ),
file('theBenchmark.p',mLETotal) ).
fof(mMonMul,axiom,
! [W0,W1,W2] :
( ( aNaturalNumber0(W2)
& aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> ( ( sdtlseqdt0(W1,W2)
& W1 != W2
& W0 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0))
& sdtasdt0(W1,W0) != sdtasdt0(W2,W0)
& sdtlseqdt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2))
& sdtasdt0(W0,W1) != sdtasdt0(W0,W2) ) ) ),
file('theBenchmark.p',mMonMul) ).
fof(m__987,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('theBenchmark.p',m__987) ).
fof(m__1007,axiom,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('theBenchmark.p',m__1007) ).
fof(m__,conjecture,
( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('theBenchmark.p',mSortsC) ).
cnf(c_29,plain,
aNaturalNumber0(sz00),
inference(clausify,[status(thm)],[mSortsC]) ).
cnf(c_30,plain,
aNaturalNumber0(sz10),
inference(clausify,[status(thm)],[mSortsC_01]) ).
cnf(c_38,plain,
( sdtasdt0(B,A) = sdtasdt0(A,B)
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mMulComm]) ).
cnf(c_41,plain,
( sdtasdt0(sz10,A) = A
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[m_MulUnit]) ).
cnf(c_42,plain,
( sdtasdt0(A,sz00) = sz00
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[m_MulZero]) ).
cnf(c_63,plain,
( sdtlseqdt0(A,A)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mLERefl]) ).
cnf(c_66,plain,
( B != A
| sdtlseqdt0(A,B)
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mLETotal]) ).
cnf(c_71,plain,
( sdtlseqdt0(sdtasdt0(B,A),sdtasdt0(C,A))
| ~ sdtlseqdt0(B,C)
| C = B
| sz00 = A
| ~ aNaturalNumber0(C)
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mMonMul]) ).
cnf(c_73,plain,
aNaturalNumber0(xm),
inference(clausify,[status(thm)],[m__987]) ).
cnf(c_74,plain,
aNaturalNumber0(xn),
inference(clausify,[status(thm)],[m__987]) ).
cnf(c_75,plain,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(clausify,[status(thm)],[m__1007]) ).
cnf(c_76,negated_conjecture,
xm != sz00,
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_77,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_123,negated_conjecture,
sdtlseqdt0(sz10,xm),
inference(resolve,[status(thm)],[c_76,c_75]) ).
cnf(c_311,plain,
sdtasdt0(xm,sz00) = sz00,
inference(resolve,[status(thm)],[c_73,c_42]) ).
cnf(c_404,plain,
sdtlseqdt0(xn,xn),
inference(resolve,[status(thm)],[c_74,c_63]) ).
cnf(c_430,plain,
sdtasdt0(sz10,xn) = xn,
inference(resolve,[status(thm)],[c_74,c_41]) ).
cnf(c_928,plain,
( sdtasdt0(A,xm) = sdtasdt0(xm,A)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_38,c_73]) ).
cnf(c_522,plain,
sdtasdt0(xn,xm) = sdtasdt0(xm,xn),
inference(resolve,[status(thm)],[c_928,c_74]) ).
cnf(c_593,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
inference(paramod,[status(thm)],[c_522,c_77]) ).
cnf(c_929,plain,
( sdtlseqdt0(sdtasdt0(A,xn),sdtasdt0(B,xn))
| ~ sdtlseqdt0(A,B)
| B = A
| sz00 = xn
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_71,c_74]) ).
cnf(c_930,plain,
( sdtlseqdt0(sdtasdt0(sz10,xn),sdtasdt0(A,xn))
| ~ sdtlseqdt0(sz10,A)
| A = sz10
| sz00 = xn
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_929,c_30]) ).
cnf(c_931,plain,
( sdtlseqdt0(sdtasdt0(sz10,xn),sdtasdt0(xm,xn))
| ~ sdtlseqdt0(sz10,xm)
| xm = sz10
| sz00 = xn ),
inference(resolve,[status(thm)],[c_930,c_73]) ).
cnf(c_932,plain,
( sdtlseqdt0(sdtasdt0(sz10,xn),sdtasdt0(xm,xn))
| xm = sz10
| sz00 = xn ),
inference(resolve,[status(thm)],[c_931,c_123]) ).
cnf(c_933,plain,
( sdtlseqdt0(xn,sdtasdt0(xm,xn))
| xm = sz10
| sz00 = xn ),
inference(paramod,[status(thm)],[c_430,c_932]) ).
cnf(c_934,plain,
( sdtlseqdt0(xn,sdtasdt0(xm,xn))
| xm = sz10
| xn = sz00 ),
inference(copy,[status(thm)],[c_933]) ).
cnf(c_704,negated_conjecture,
( xm = sz10
| xn = sz00 ),
inference(resolve,[status(thm)],[c_593,c_934]) ).
cnf(c_935,plain,
( A != xn
| sdtlseqdt0(xn,A)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_66,c_74]) ).
cnf(c_936,plain,
( sz00 != xn
| sdtlseqdt0(xn,sz00) ),
inference(resolve,[status(thm)],[c_935,c_29]) ).
cnf(c_937,plain,
( xm = sz10
| sz00 = xn ),
inference(copy,[status(thm)],[c_704]) ).
cnf(c_835,plain,
( xm = sz10
| sdtlseqdt0(xn,sz00) ),
inference(resolve,[status(thm)],[c_936,c_937]) ).
cnf(c_938,plain,
( ~ sdtlseqdt0(xn,sdtasdt0(xm,sz00))
| xm = sz10 ),
inference(paramod,[status(thm)],[c_704,c_593]) ).
cnf(c_838,plain,
( ~ sdtlseqdt0(xn,sz00)
| xm = sz10 ),
inference(paramod,[status(thm)],[c_311,c_938]) ).
cnf(c_939,plain,
( xm = sz10
| xm = sz10 ),
inference(resolve,[status(thm)],[c_838,c_835]) ).
cnf(c_926,plain,
xm = sz10,
inference(copy,[status(thm)],[c_939]) ).
cnf(c_940,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(sz10,xn)),
inference(paramod,[status(thm)],[c_926,c_593]) ).
cnf(c_941,negated_conjecture,
~ sdtlseqdt0(xn,xn),
inference(paramod,[status(thm)],[c_430,c_940]) ).
cnf(c_927,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_404,c_941]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM465+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.58 % Computer : n014.cluster.edu
% 0.09/5.58 % Model : x86_64 x86_64
% 0.09/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.58 % Memory : 8046.5625MB
% 0.09/5.58 % OS : Linux 6.8.0-71-generic
% 0.09/5.58 % CPULimit : 300
% 0.09/5.58 % WCLimit : 300
% 0.09/5.58 % DateTime : Sat Sep 26 02:51:24 UTC 2026
% 0.09/5.58 % CPUTime :
% 0.09/5.59 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.59 % Process 1969550 was started by sandbox on n014,
% 0.09/5.59 % Sat Sep 26 02:51:24 2026
% 0.09/5.59 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/5.60
% 0.12/5.60 % From the command line: assign(max_seconds, 300).
% 0.12/5.88
% 0.12/5.88 % SZS status Theorem for theBenchmark
% 0.12/5.88
% 0.12/5.88 % Proof 1 at 0.23 (+ 0.04) seconds.
% 0.12/5.88 % Length of proof is 34.
% 0.12/5.88 % Level of proof is 7.
% 0.12/5.88 % Maximum clause weight is 32.000.
% 0.12/5.88 % Given clauses 133.
% 0.12/5.88
% 0.12/5.88 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------