%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.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 : n005.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:53:52 AM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 69 ( 16 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 72 ( 26 ~; 18 |; 28 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 34 ( 1 sgn 17 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7a,axiom,
! [X7,Y10] :
( ~ r2(X7,Y10)
| ! [Y20] :
( Y20 != Y10
| ~ r1(Y20) ) ),
file('NUM008+0.ax',axiom_7a) ).
fof(zerouneqtwo,conjecture,
! [Y1] :
( ! [Y4] :
( ~ r1(Y4)
| Y4 != Y1 )
| ! [Y2] :
( ~ r2(Y2,Y1)
| ! [Y3] :
( ~ r2(Y3,Y2)
| ~ r1(Y3) ) ) ),
file('theBenchmark.p',zerouneqtwo) ).
fof(f_11_1,plain,
! [X7,Y10] :
( ~ r2(X7,Y10)
| ! [Y20] :
( Y20 != Y10
| ~ r1(Y20) ) ),
inference(fof_nnf,[status(thm)],[axiom_7a]) ).
fof(f_11_2,plain,
! [U_42,U_41] :
( ~ r2(U_42,U_41)
| ! [U_40] :
( U_40 != U_41
| ~ r1(U_40) ) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
cnf(f_11_3,plain,
( ~ r2(U_42,U_41)
| U_40 != U_41
| ~ r1(U_40) ),
inference(clausify,[status(thm)],[f_11_2]) ).
fof(f_12_1,negated_conjecture,
~ ! [Y1] :
( ! [Y4] :
( ~ r1(Y4)
| Y4 != Y1 )
| ! [Y2] :
( ~ r2(Y2,Y1)
| ! [Y3] :
( ~ r2(Y3,Y2)
| ~ r1(Y3) ) ) ),
inference(negate,[status(cth)],[zerouneqtwo]) ).
fof(f_12_2,negated_conjecture,
? [Y1] :
( ? [Y4] :
( r1(Y4)
& Y4 = Y1 )
& ? [Y2] :
( r2(Y2,Y1)
& ? [Y3] :
( r2(Y3,Y2)
& r1(Y3) ) ) ),
inference(fof_nnf,[status(thm)],[f_12_1]) ).
fof(f_12_3,negated_conjecture,
? [U_46] :
( ? [U_45] :
( r1(U_45)
& U_45 = U_46 )
& ? [U_44] :
( r2(U_44,U_46)
& ? [U_43] :
( r2(U_43,U_44)
& r1(U_43) ) ) ),
inference(variable_rename,[status(thm)],[f_12_2]) ).
fof(f_12_4,negated_conjecture,
( ? [U_45] :
( r1(U_45)
& U_45 = sK21 )
& ? [U_44] :
( r2(U_44,sK21)
& ? [U_43] :
( r2(U_43,U_44)
& r1(U_43) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(U_46,sK21)],[f_12_3]) ).
fof(f_12_5,negated_conjecture,
( ? [U_45] :
( r1(U_45)
& U_45 = sK21 )
& r2(sK22,sK21)
& ? [U_43] :
( r2(U_43,sK22)
& r1(U_43) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22]),skolemize(U_44,sK22)],[f_12_4]) ).
fof(f_12_6,negated_conjecture,
( ? [U_45] :
( r1(U_45)
& U_45 = sK21 )
& r2(sK22,sK21)
& r2(sK23,sK22)
& r1(sK23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(U_43,sK23)],[f_12_5]) ).
fof(f_12_7,negated_conjecture,
( r1(sK24)
& sK24 = sK21
& r2(sK22,sK21)
& r2(sK23,sK22)
& r1(sK23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK24]),skolemize(U_45,sK24)],[f_12_6]) ).
fof(f_12_8,negated_conjecture,
( r1(sK24)
& sK24 = sK21
& r2(sK22,sK21)
& r2(sK23,sK22)
& r1(sK23) ),
inference(definitional_conversion,[status(esa)],[f_12_7]) ).
cnf(f_12_11,negated_conjecture,
r2(sK22,sK21),
inference(clausify,[status(thm)],[f_12_8]) ).
cnf(f_12_12,negated_conjecture,
sK24 = sK21,
inference(clausify,[status(thm)],[f_12_8]) ).
cnf(f_12_13,negated_conjecture,
r1(sK24),
inference(clausify,[status(thm)],[f_12_8]) ).
cnf(t1,plain,
( sK24 != sK21
| ~ r2(sK22,sK21)
| ~ r1(sK24) ),
inference(start,[status(thm),parent(0:0)],[f_11_3]) ).
cnf(t2,plain,
r1(sK24),
inference(extension,[status(thm),parent(t1:1)],[f_12_13]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
r2(sK22,sK21),
inference(extension,[status(thm),parent(t1:2)],[f_12_11]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
sK24 = sK21,
inference(extension,[status(thm),parent(t1:3)],[f_12_12]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.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.10/0.36 % Computer : n005.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 19 19:34:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.43 % SZS status Theorem for theBenchmark
% 0.10/0.43 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------