%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM479+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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:08 AM UTC 2026
% Result : Theorem 2.13s 0.76s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 55 ( 31 unt; 0 def)
% Number of atoms : 119 ( 66 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 106 ( 42 ~; 35 |; 20 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulComm,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ),
file('theBenchmark.p',mMulComm) ).
fof(mMulAsso,axiom,
! [W0,W1,W2] :
( ( aNaturalNumber0(W2)
& aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) ),
file('theBenchmark.p',mMulAsso) ).
fof(mDefQuot,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W1)
& aNaturalNumber0(W0) )
=> ( ( doDivides0(W0,W1)
& W0 != sz00 )
=> ! [W2] :
( W2 = sdtsldt0(W1,W0)
<=> ( W1 = sdtasdt0(W0,W2)
& aNaturalNumber0(W2) ) ) ) ),
file('theBenchmark.p',mDefQuot) ).
fof(m__1524,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('theBenchmark.p',m__1524) ).
fof(m__1524_04,axiom,
( doDivides0(xl,xm)
& ? [W0] :
( xm = sdtasdt0(xl,W0)
& aNaturalNumber0(W0) )
& xl != sz00 ),
file('theBenchmark.p',m__1524_04) ).
fof(m__,conjecture,
( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl)) )
=> sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) ) ),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
~ ( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl)) )
=> sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_38,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_39,negated_conjecture,
sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_40,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) = sdtasdt0(xn,xm),
inference(copy,[status(thm)],[c_39]) ).
fof(m__1553,axiom,
aNaturalNumber0(xn),
file('theBenchmark.p',m__1553) ).
cnf(c_44,plain,
aNaturalNumber0(xn),
inference(clausify,[status(thm)],[m__1553]) ).
fof(nnf_36,plain,
( doDivides0(xl,xm)
& ? [W0] :
( sdtasdt0(xl,W0) = xm
& aNaturalNumber0(W0) )
& xl != sz00 ),
inference(fof_nnf,[status(thm)],[m__1524_04]) ).
fof(sk_m__1524_04,plain,
( doDivides0(xl,xm)
& sdtasdt0(xl,sK0) = xm
& aNaturalNumber0(sK0)
& xl != sz00 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(W0,sK0)],[nnf_36]) ).
cnf(c_45,plain,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[sk_m__1524_04]) ).
cnf(c_46,plain,
sdtasdt0(xl,sK0) = xm,
inference(split_conjunct,[status(thm)],[sk_m__1524_04]) ).
cnf(c_47,plain,
xm = sdtasdt0(xl,sK0),
inference(copy,[status(thm)],[c_46]) ).
cnf(c_48,plain,
aNaturalNumber0(sK0),
inference(split_conjunct,[status(thm)],[sk_m__1524_04]) ).
cnf(c_49,plain,
xl != sz00,
inference(split_conjunct,[status(thm)],[sk_m__1524_04]) ).
cnf(c_50,plain,
aNaturalNumber0(xm),
inference(clausify,[status(thm)],[m__1524]) ).
cnf(c_51,plain,
aNaturalNumber0(sdtasdt0(xl,sK0)),
inference(paramod,[status(thm)],[c_47,c_50]) ).
cnf(c_52,plain,
aNaturalNumber0(xl),
inference(clausify,[status(thm)],[m__1524]) ).
cnf(c_58,plain,
( sdtasdt0(A,C) != B
| ~ aNaturalNumber0(C)
| sdtsldt0(B,A) = C
| ~ doDivides0(A,B)
| sz00 = A
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mDefQuot]) ).
cnf(c_102,plain,
( sdtasdt0(sdtasdt0(A,B),C) = sdtasdt0(A,sdtasdt0(B,C))
| ~ aNaturalNumber0(C)
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mMulAsso]) ).
cnf(c_103,plain,
( sdtasdt0(B,A) = sdtasdt0(A,B)
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(clausify,[status(thm)],[mMulComm]) ).
cnf(c_1628,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(sdtasdt0(xl,sK0),xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(paramod,[status(thm)],[c_47,c_38]) ).
cnf(c_113,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(sdtasdt0(xl,sK0),xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,sdtasdt0(xl,sK0)),xl)),
inference(paramod,[status(thm)],[c_47,c_1628]) ).
cnf(c_114,plain,
doDivides0(xl,sdtasdt0(xl,sK0)),
inference(paramod,[status(thm)],[c_47,c_45]) ).
cnf(c_1629,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,sdtasdt0(xl,sK0)),xl)) = sdtasdt0(xn,xm),
inference(paramod,[status(thm)],[c_47,c_40]) ).
cnf(c_118,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,sdtasdt0(xl,sK0)),xl)) = sdtasdt0(xn,sdtasdt0(xl,sK0)),
inference(paramod,[status(thm)],[c_47,c_1629]) ).
cnf(c_191,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(sdtasdt0(xl,sK0),xl)) != sdtasdt0(xn,sdtasdt0(xl,sK0)),
inference(paramod,[status(thm)],[c_118,c_113]) ).
cnf(c_1630,plain,
( sdtasdt0(sdtasdt0(xl,A),B) = sdtasdt0(xl,sdtasdt0(A,B))
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_102,c_52]) ).
cnf(c_1631,plain,
( sdtasdt0(sdtasdt0(xl,sK0),A) = sdtasdt0(xl,sdtasdt0(sK0,A))
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_1630,c_48]) ).
cnf(c_616,plain,
sdtasdt0(sdtasdt0(xl,sK0),xn) = sdtasdt0(xl,sdtasdt0(sK0,xn)),
inference(resolve,[status(thm)],[c_1631,c_44]) ).
cnf(c_1632,plain,
( sdtasdt0(sdtasdt0(xl,A),B) = sdtasdt0(xl,sdtasdt0(A,B))
| ~ aNaturalNumber0(B)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_102,c_52]) ).
cnf(c_1633,plain,
( sdtasdt0(sdtasdt0(xl,xn),A) = sdtasdt0(xl,sdtasdt0(xn,A))
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_1632,c_44]) ).
cnf(c_619,plain,
sdtasdt0(sdtasdt0(xl,xn),sK0) = sdtasdt0(xl,sdtasdt0(xn,sK0)),
inference(resolve,[status(thm)],[c_1633,c_48]) ).
cnf(c_1634,plain,
( sdtasdt0(A,sdtasdt0(xl,sK0)) = sdtasdt0(sdtasdt0(xl,sK0),A)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_103,c_51]) ).
cnf(c_1635,plain,
sdtasdt0(xn,sdtasdt0(xl,sK0)) = sdtasdt0(sdtasdt0(xl,sK0),xn),
inference(resolve,[status(thm)],[c_1634,c_44]) ).
cnf(c_738,plain,
sdtasdt0(xn,sdtasdt0(xl,sK0)) = sdtasdt0(xl,sdtasdt0(sK0,xn)),
inference(paramod,[status(thm)],[c_616,c_1635]) ).
cnf(c_1636,plain,
( sdtasdt0(A,sK0) = sdtasdt0(sK0,A)
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_103,c_48]) ).
cnf(c_1637,plain,
sdtasdt0(xn,sK0) = sdtasdt0(sK0,xn),
inference(resolve,[status(thm)],[c_1636,c_44]) ).
cnf(c_739,plain,
sdtasdt0(sK0,xn) = sdtasdt0(xn,sK0),
inference(copy,[status(thm)],[c_1637]) ).
cnf(c_1638,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(sdtasdt0(xl,sK0),xl)) != sdtasdt0(xl,sdtasdt0(sK0,xn)),
inference(paramod,[status(thm)],[c_738,c_191]) ).
cnf(c_843,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(sdtasdt0(xl,sK0),xl)) != sdtasdt0(xl,sdtasdt0(xn,sK0)),
inference(paramod,[status(thm)],[c_739,c_1638]) ).
cnf(c_1639,plain,
( sdtasdt0(xl,B) != A
| ~ aNaturalNumber0(B)
| sdtsldt0(A,xl) = B
| ~ doDivides0(xl,A)
| sz00 = xl
| ~ aNaturalNumber0(A) ),
inference(resolve,[status(thm)],[c_58,c_52]) ).
cnf(c_1640,plain,
( sdtasdt0(xl,A) != sdtasdt0(xl,sK0)
| ~ aNaturalNumber0(A)
| sdtsldt0(sdtasdt0(xl,sK0),xl) = A
| ~ doDivides0(xl,sdtasdt0(xl,sK0))
| sz00 = xl ),
inference(resolve,[status(thm)],[c_1639,c_51]) ).
cnf(c_1641,plain,
( sdtasdt0(xl,A) != sdtasdt0(xl,sK0)
| ~ aNaturalNumber0(A)
| sdtsldt0(sdtasdt0(xl,sK0),xl) = A
| sz00 = xl ),
inference(resolve,[status(thm)],[c_1640,c_114]) ).
cnf(c_1642,plain,
( sdtasdt0(xl,sK0) != sdtasdt0(xl,sK0)
| sdtsldt0(sdtasdt0(xl,sK0),xl) = sK0
| sz00 = xl ),
inference(resolve,[status(thm)],[c_1641,c_48]) ).
cnf(c_1643,plain,
( sdtsldt0(sdtasdt0(xl,sK0),xl) = sK0
| sz00 = xl ),
inference(xxres,[status(thm)],[c_1642]) ).
cnf(c_1644,plain,
( sdtsldt0(sdtasdt0(xl,sK0),xl) = sK0
| xl = sz00 ),
inference(copy,[status(thm)],[c_1643]) ).
cnf(c_1622,plain,
sdtsldt0(sdtasdt0(xl,sK0),xl) = sK0,
inference(resolve,[status(thm)],[c_49,c_1644]) ).
cnf(c_1645,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sK0) != sdtasdt0(xl,sdtasdt0(xn,sK0)),
inference(paramod,[status(thm)],[c_1622,c_843]) ).
cnf(c_1646,negated_conjecture,
sdtasdt0(xl,sdtasdt0(xn,sK0)) != sdtasdt0(xl,sdtasdt0(xn,sK0)),
inference(paramod,[status(thm)],[c_619,c_1645]) ).
cnf(c_1627,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_1646]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM479+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 02:55:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 246175 was started by sandbox2 on n019,
% 0.10/0.37 % Sat Sep 26 02:55:18 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 2.13/0.76
% 2.13/0.76 % SZS status Theorem for theBenchmark
% 2.13/0.76
% 2.13/0.76 % Proof 1 at 0.23 (+ 0.06) seconds.
% 2.13/0.76 % Length of proof is 32.
% 2.13/0.76 % Level of proof is 6.
% 2.13/0.76 % Maximum clause weight is 54.000.
% 2.13/0.76 % Given clauses 58.
% 2.13/0.76
% 2.13/0.76 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------