%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM434+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 : n006.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:14 AM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 40 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 5 |; 18 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 3 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1003,hypothesis,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [W0] :
( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(W0) )
& sdtasdt0(xp,xq) != sz00 ),
file('theBenchmark.p',m__1003) ).
fof(m__,conjecture,
? [W0] :
( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(W0) ),
file('theBenchmark.p',m__) ).
fof(f_24_1,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [W0] :
( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(W0) )
& sdtasdt0(xp,xq) != sz00 ),
inference(fof_nnf,[status(thm)],[m__1003]) ).
fof(f_24_2,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [U_44] :
( sdtasdt0(sdtasdt0(xp,xq),U_44) = sdtpldt0(xa,smndt0(xb))
& aInteger0(U_44) )
& sdtasdt0(xp,xq) != sz00 ),
inference(variable_rename,[status(thm)],[f_24_1]) ).
fof(f_24_3,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdtasdt0(sdtasdt0(xp,xq),sK2) = sdtpldt0(xa,smndt0(xb))
& aInteger0(sK2)
& sdtasdt0(xp,xq) != sz00 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_44,sK2)],[f_24_2]) ).
cnf(f_24_5,plain,
aInteger0(sK2),
inference(clausify,[status(thm)],[f_24_3]) ).
cnf(f_24_6,plain,
sdtasdt0(sdtasdt0(xp,xq),sK2) = sdtpldt0(xa,smndt0(xb)),
inference(clausify,[status(thm)],[f_24_3]) ).
fof(f_25_1,negated_conjecture,
~ ? [W0] :
( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(W0) ),
inference(negate,[status(cth)],[m__]) ).
fof(f_25_2,negated_conjecture,
! [W0] :
( sdtasdt0(sdtasdt0(xp,xq),W0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(W0) ),
inference(fof_nnf,[status(thm)],[f_25_1]) ).
fof(f_25_3,negated_conjecture,
! [U_45] :
( sdtasdt0(sdtasdt0(xp,xq),U_45) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(U_45) ),
inference(variable_rename,[status(thm)],[f_25_2]) ).
fof(f_25_4,negated_conjecture,
! [U_45] :
( sdtasdt0(sdtasdt0(xp,xq),U_45) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(U_45) ),
inference(definitional_conversion,[status(esa)],[f_25_3]) ).
cnf(f_25_5,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),U_45) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(U_45) ),
inference(clausify,[status(thm)],[f_25_4]) ).
cnf(t1,plain,
( sdtasdt0(sdtasdt0(xp,xq),sK2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sK2) ),
inference(start,[status(thm),parent(0:0)],[f_25_5]) ).
cnf(t2,plain,
aInteger0(sK2),
inference(extension,[status(thm),parent(t1:1)],[f_24_5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
sdtasdt0(sdtasdt0(xp,xq),sK2) = sdtpldt0(xa,smndt0(xb)),
inference(extension,[status(thm),parent(t1:2)],[f_24_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM434+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.08/0.34 % Computer : n006.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 19 18:25:12 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.44 % SZS status Theorem for theBenchmark
% 0.13/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------