%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM514+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /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 : Thu Sep 24 08:52:28 AM UTC 2026
% Result : Theorem 148.47s 148.75s
% Output : Proof 148.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 50 ( 24 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 16 ~; 9 |; 22 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 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 : 8 ( 0 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2613,hypothesis,
( sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm)
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& xk = sdtasdt0(xr,sdtsldt0(xk,xr))
& aNaturalNumber0(sdtsldt0(xk,xr)) ),
file('theBenchmark.p',m__2613) ).
fof(m__,conjecture,
( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
| ? [W0] :
( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,W0)
& aNaturalNumber0(W0) ) ) ),
file('theBenchmark.p',m__) ).
fof(f_55_1,plain,
( sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm)
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& xk = sdtasdt0(xr,sdtsldt0(xk,xr))
& aNaturalNumber0(sdtsldt0(xk,xr)) ),
inference(fof_nnf,[status(thm)],[m__2613]) ).
cnf(f_55_2,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(clausify,[status(thm)],[f_55_1]) ).
cnf(f_55_6,plain,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(clausify,[status(thm)],[f_55_1]) ).
fof(f_56_1,negated_conjecture,
( ~ ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
| ? [W0] :
( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,W0)
& aNaturalNumber0(W0) ) )
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(negate,[status(cth)],[m__]) ).
fof(f_56_2,negated_conjecture,
( ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& ! [W0] :
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,W0)
| ~ aNaturalNumber0(W0) )
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(fof_nnf,[status(thm)],[f_56_1]) ).
fof(f_56_3,negated_conjecture,
( ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& ! [U_114] :
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,U_114)
| ~ aNaturalNumber0(U_114) )
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(variable_rename,[status(thm)],[f_56_2]) ).
fof(f_56_4,negated_conjecture,
( ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& ! [U_114] :
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,U_114)
| ~ aNaturalNumber0(U_114) )
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(definitional_conversion,[status(esa)],[f_56_3]) ).
cnf(f_56_7,negated_conjecture,
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,U_114)
| ~ aNaturalNumber0(U_114) ),
inference(clausify,[status(thm)],[f_56_4]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(t1,plain,
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,sdtsldt0(xk,xr))
| ~ aNaturalNumber0(sdtsldt0(xk,xr)) ),
inference(start,[status(thm),parent(0:0)],[f_56_7]) ).
cnf(t2,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(extension,[status(thm),parent(t1:1)],[f_55_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(sdtsldt0(xn,xr),xm)
| sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)) ),
inference(extension,[status(thm),parent(t1:2)],[equality_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(extension,[status(thm),parent(t4:2)],[f_55_6]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM514+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 18:40:50 UTC 2026
% 0.09/0.36 % CPUTime :
% 148.47/148.75 % SZS status Theorem for theBenchmark
% 148.47/148.75 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------