%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM531+2 : 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 : n012.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:31 AM UTC 2026
% Result : Theorem 0.03s 0.32s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(mSetSort,axiom,
! [W0] :
( aSet0(W0)
=> $true ),
file('theBenchmark.p',mSetSort) ).
fof(mElmSort,axiom,
! [W0] :
( aElement0(W0)
=> $true ),
file('theBenchmark.p',mElmSort) ).
fof(mEOfElem,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('theBenchmark.p',mEOfElem) ).
fof(mFinRel,axiom,
! [W0] :
( aSet0(W0)
=> ( isFinite0(W0)
=> $true ) ),
file('theBenchmark.p',mFinRel) ).
fof(mDefEmp,definition,
! [W0] :
( W0 = slcrc0
<=> ( ~ ? [W1] : aElementOf0(W1,W0)
& aSet0(W0) ) ),
file('theBenchmark.p',mDefEmp) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('theBenchmark.p',mEmpFin) ).
fof(mCntRel,axiom,
! [W0] :
( aSet0(W0)
=> ( isCountable0(W0)
=> $true ) ),
file('theBenchmark.p',mCntRel) ).
fof(mCountNFin,axiom,
! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> ~ isFinite0(W0) ),
file('theBenchmark.p',mCountNFin) ).
fof(m__,conjecture,
! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> ~ ( W0 = slcrc0
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
file('theBenchmark.p',m__) ).
fof(f_1_1,plain,
! [W0] :
( $true
| ~ aSet0(W0) ),
inference(fof_nnf,[status(thm)],[mSetSort]) ).
fof(f_1_2,plain,
! [U_0] :
( $true
| ~ aSet0(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_0] : ~ aSet0(U_0)
| $true ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ aSet0(U_0)
| $true ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [W0] :
( $true
| ~ aElement0(W0) ),
inference(fof_nnf,[status(thm)],[mElmSort]) ).
fof(f_2_2,plain,
! [U_1] :
( $true
| ~ aElement0(U_1) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_1] : ~ aElement0(U_1)
| $true ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( ~ aElement0(U_1)
| $true ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [W0] :
( ! [W1] :
( aElement0(W1)
| ~ aElementOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(fof_nnf,[status(thm)],[mEOfElem]) ).
fof(f_3_2,plain,
! [U_3] :
( ! [U_2] :
( aElement0(U_2)
| ~ aElementOf0(U_2,U_3) )
| ~ aSet0(U_3) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( aElement0(U_2)
| ~ aElementOf0(U_2,U_3)
| ~ aSet0(U_3) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [W0] :
( $true
| ~ isFinite0(W0)
| ~ aSet0(W0) ),
inference(fof_nnf,[status(thm)],[mFinRel]) ).
fof(f_4_2,plain,
! [U_4] :
( $true
| ~ isFinite0(U_4)
| ~ aSet0(U_4) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
( $true
| ~ isFinite0(U_4)
| ~ aSet0(U_4) ),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
! [W0] :
( ( W0 = slcrc0
| ? [W1] : aElementOf0(W1,W0)
| ~ aSet0(W0) )
& ( ( ! [W1] : ~ aElementOf0(W1,W0)
& aSet0(W0) )
| W0 != slcrc0 ) ),
inference(fof_nnf,[status(thm)],[mDefEmp]) ).
fof(f_5_2,plain,
! [U_7] :
( ( U_7 = slcrc0
| ? [U_6] : aElementOf0(U_6,U_7)
| ~ aSet0(U_7) )
& ( ( ! [U_5] : ~ aElementOf0(U_5,U_7)
& aSet0(U_7) )
| U_7 != slcrc0 ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_9] :
( U_9 = slcrc0
| ? [U_6] : aElementOf0(U_6,U_9)
| ~ aSet0(U_9) )
& ! [U_8] :
( ( ! [U_5] : ~ aElementOf0(U_5,U_8)
& aSet0(U_8) )
| U_8 != slcrc0 ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
fof(f_5_4,plain,
( ! [U_9] :
( U_9 = slcrc0
| aElementOf0(sK1(U_9),U_9)
| ~ aSet0(U_9) )
& ! [U_8] :
( ( ! [U_5] : ~ aElementOf0(U_5,U_8)
& aSet0(U_8) )
| U_8 != slcrc0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1(U_9))],[f_5_3]) ).
cnf(f_5_5,plain,
( aSet0(U_8)
| U_8 != slcrc0 ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_6,plain,
( ~ aElementOf0(U_5,U_8)
| U_8 != slcrc0 ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_7,plain,
( U_9 = slcrc0
| aElementOf0(sK1(U_9),U_9)
| ~ aSet0(U_9) ),
inference(clausify,[status(thm)],[f_5_4]) ).
fof(f_6_1,plain,
isFinite0(slcrc0),
inference(fof_nnf,[status(thm)],[mEmpFin]) ).
cnf(f_6_2,plain,
isFinite0(slcrc0),
inference(clausify,[status(thm)],[f_6_1]) ).
fof(f_7_1,plain,
! [W0] :
( $true
| ~ isCountable0(W0)
| ~ aSet0(W0) ),
inference(fof_nnf,[status(thm)],[mCntRel]) ).
fof(f_7_2,plain,
! [U_10] :
( $true
| ~ isCountable0(U_10)
| ~ aSet0(U_10) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
cnf(f_7_3,plain,
( $true
| ~ isCountable0(U_10)
| ~ aSet0(U_10) ),
inference(clausify,[status(thm)],[f_7_2]) ).
fof(f_8_1,plain,
! [W0] :
( ~ isFinite0(W0)
| ~ isCountable0(W0)
| ~ aSet0(W0) ),
inference(fof_nnf,[status(thm)],[mCountNFin]) ).
fof(f_8_2,plain,
! [U_11] :
( ~ isFinite0(U_11)
| ~ isCountable0(U_11)
| ~ aSet0(U_11) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
( ~ isFinite0(U_11)
| ~ isCountable0(U_11)
| ~ aSet0(U_11) ),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,negated_conjecture,
~ ! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> ~ ( W0 = slcrc0
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
inference(negate,[status(cth)],[m__]) ).
fof(f_9_2,negated_conjecture,
? [W0] :
( W0 = slcrc0
& ! [W1] : ~ aElementOf0(W1,W0)
& isCountable0(W0)
& aSet0(W0) ),
inference(fof_nnf,[status(thm)],[f_9_1]) ).
fof(f_9_3,negated_conjecture,
? [U_13] :
( U_13 = slcrc0
& ! [U_12] : ~ aElementOf0(U_12,U_13)
& isCountable0(U_13)
& aSet0(U_13) ),
inference(variable_rename,[status(thm)],[f_9_2]) ).
fof(f_9_4,negated_conjecture,
( sK2 = slcrc0
& ! [U_12] : ~ aElementOf0(U_12,sK2)
& isCountable0(sK2)
& aSet0(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_13,sK2)],[f_9_3]) ).
fof(f_9_5,negated_conjecture,
( sK2 = slcrc0
& ! [U_12] : ~ aElementOf0(U_12,sK2)
& isCountable0(sK2)
& aSet0(sK2) ),
inference(definitional_conversion,[status(esa)],[f_9_4]) ).
cnf(f_9_6,negated_conjecture,
aSet0(sK2),
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(f_9_7,negated_conjecture,
isCountable0(sK2),
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(f_9_8,negated_conjecture,
~ aElementOf0(U_12,sK2),
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(f_9_9,negated_conjecture,
sK2 = slcrc0,
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(f_1_4_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_1_4]) ).
cnf(f_2_4_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_2_4]) ).
cnf(f_4_3_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_4_3]) ).
cnf(f_7_3_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_7_3]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sK1(Eq_x_0) = sK1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( aSet0(Eq_y_0)
| ~ aSet0(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,axiom,
( aElement0(Eq_y_0)
| ~ aElement0(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( aElementOf0(Eq_y_0,Eq_y_1)
| ~ aElementOf0(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( isFinite0(Eq_y_0)
| ~ isFinite0(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( isCountable0(Eq_y_0)
| ~ isCountable0(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sat Sep 19 18:43:37 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.32 % SZS status Theorem for theBenchmark
% 0.03/0.32 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------