%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM435+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 : n003.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:16:59 AM UTC 2026
% Result : Theorem 2.19s 0.79s
% Output : CNFRefutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 42 ( 19 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 33 ( 13 ~; 9 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulAsso,axiom,
! [W0,W1,W2] :
( ( aInteger0(W2)
& aInteger0(W1)
& aInteger0(W0) )
=> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2) ),
file('theBenchmark.p',mMulAsso) ).
fof(mMulComm,axiom,
! [W0,W1] :
( ( aInteger0(W1)
& aInteger0(W0) )
=> sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ),
file('theBenchmark.p',mMulComm) ).
fof(m__979,axiom,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('theBenchmark.p',m__979) ).
fof(m__1032,axiom,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('theBenchmark.p',m__1032) ).
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_35,plain,
( sdtasdt0(sdtasdt0(A,B),C) = sdtasdt0(A,sdtasdt0(B,C))
| ~ aInteger0(C)
| ~ aInteger0(B)
| ~ aInteger0(A) ),
inference(clausify,[status(thm)],[mMulAsso]) ).
cnf(c_36,plain,
( sdtasdt0(B,A) = sdtasdt0(A,B)
| ~ aInteger0(B)
| ~ aInteger0(A) ),
inference(clausify,[status(thm)],[mMulComm]) ).
cnf(c_68,plain,
aInteger0(xp),
inference(clausify,[status(thm)],[m__979]) ).
cnf(c_70,plain,
aInteger0(xq),
inference(clausify,[status(thm)],[m__979]) ).
cnf(c_73,plain,
aInteger0(xm),
inference(clausify,[status(thm)],[m__1032]) ).
cnf(c_74,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(clausify,[status(thm)],[m__1032]) ).
cnf(c_75,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_1534,plain,
( sdtasdt0(A,xp) = sdtasdt0(xp,A)
| ~ aInteger0(A) ),
inference(resolve,[status(thm)],[c_36,c_68]) ).
cnf(c_1020,plain,
sdtasdt0(xq,xp) = sdtasdt0(xp,xq),
inference(resolve,[status(thm)],[c_1534,c_70]) ).
cnf(c_1535,plain,
( sdtasdt0(sdtasdt0(xq,A),B) = sdtasdt0(xq,sdtasdt0(A,B))
| ~ aInteger0(B)
| ~ aInteger0(A) ),
inference(resolve,[status(thm)],[c_35,c_70]) ).
cnf(c_1536,plain,
( sdtasdt0(sdtasdt0(xq,xp),A) = sdtasdt0(xq,sdtasdt0(xp,A))
| ~ aInteger0(A) ),
inference(resolve,[status(thm)],[c_1535,c_68]) ).
cnf(c_1537,plain,
sdtasdt0(sdtasdt0(xq,xp),xm) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(resolve,[status(thm)],[c_1536,c_73]) ).
cnf(c_1538,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(paramod,[status(thm)],[c_1020,c_1537]) ).
cnf(c_1539,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(paramod,[status(thm)],[c_74,c_1538]) ).
cnf(c_1540,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(copy,[status(thm)],[c_1539]) ).
cnf(c_1533,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_75,c_1540]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM435+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n003.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sat Sep 26 02:44:39 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 1853370 was started by sandbox on n003,
% 0.17/0.43 % Sat Sep 26 02:44:39 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 2.19/0.79
% 2.19/0.79 % Assigning unary symbol smndt0 kb_weight 0 and highest precedence (15).
% 2.19/0.79
% 2.19/0.79 % SZS status Theorem for theBenchmark
% 2.19/0.79
% 2.19/0.79 % Proof 1 at 0.25 (+ 0.08) seconds.
% 2.19/0.79 % Length of proof is 14.
% 2.19/0.79 % Level of proof is 3.
% 2.19/0.79 % Maximum clause weight is 42.000.
% 2.19/0.79 % Given clauses 40.
% 2.19/0.79
% 2.19/0.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------