%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET627+3 : TPTP v9.3.1. Released v2.2.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 : n017.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:57:09 AM UTC 2026
% Result : Theorem 0.09s 5.47s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 33 ~; 22 |; 12 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [B] : ~ member(B,empty_set),
file('theBenchmark.p',empty_set_defn) ).
fof(intersect_defn,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,C)
& member(D,B) ) ),
file('theBenchmark.p',intersect_defn) ).
fof(disjoint_defn,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('theBenchmark.p',disjoint_defn) ).
fof(prove_th104,conjecture,
! [B] : disjoint(B,empty_set),
file('theBenchmark.p',prove_th104) ).
fof(f_1_1,plain,
! [B] : ~ member(B,empty_set),
inference(fof_nnf,[status(thm)],[empty_set_defn]) ).
fof(f_1_2,plain,
! [U_0] : ~ member(U_0,empty_set),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
~ member(U_0,empty_set),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [B,C] :
( ( intersect(B,C)
| ! [D] :
( ~ member(D,C)
| ~ member(D,B) ) )
& ( ? [D] :
( member(D,C)
& member(D,B) )
| ~ intersect(B,C) ) ),
inference(fof_nnf,[status(thm)],[intersect_defn]) ).
fof(f_2_2,plain,
! [U_4,U_3] :
( ( intersect(U_4,U_3)
| ! [U_2] :
( ~ member(U_2,U_3)
| ~ member(U_2,U_4) ) )
& ( ? [U_1] :
( member(U_1,U_3)
& member(U_1,U_4) )
| ~ intersect(U_4,U_3) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_8,U_6] :
( intersect(U_8,U_6)
| ! [U_2] :
( ~ member(U_2,U_6)
| ~ member(U_2,U_8) ) )
& ! [U_7,U_5] :
( ? [U_1] :
( member(U_1,U_5)
& member(U_1,U_7) )
| ~ intersect(U_7,U_5) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_8,U_6] :
( intersect(U_8,U_6)
| ! [U_2] :
( ~ member(U_2,U_6)
| ~ member(U_2,U_8) ) )
& ! [U_7,U_5] :
( ( member(sK1(U_7,U_5),U_5)
& member(sK1(U_7,U_5),U_7) )
| ~ intersect(U_7,U_5) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_7,U_5))],[f_2_3]) ).
cnf(f_2_6,plain,
( member(sK1(U_7,U_5),U_5)
| ~ intersect(U_7,U_5) ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
! [B,C] :
( ( disjoint(B,C)
| intersect(B,C) )
& ( ~ intersect(B,C)
| ~ disjoint(B,C) ) ),
inference(fof_nnf,[status(thm)],[disjoint_defn]) ).
fof(f_3_2,plain,
! [U_10,U_9] :
( ( disjoint(U_10,U_9)
| intersect(U_10,U_9) )
& ( ~ intersect(U_10,U_9)
| ~ disjoint(U_10,U_9) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_14,U_12] :
( disjoint(U_14,U_12)
| intersect(U_14,U_12) )
& ! [U_13,U_11] :
( ~ intersect(U_13,U_11)
| ~ disjoint(U_13,U_11) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_5,plain,
( disjoint(U_14,U_12)
| intersect(U_14,U_12) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_6_1,negated_conjecture,
~ ! [B] : disjoint(B,empty_set),
inference(negate,[status(cth)],[prove_th104]) ).
fof(f_6_2,negated_conjecture,
? [B] : ~ disjoint(B,empty_set),
inference(fof_nnf,[status(thm)],[f_6_1]) ).
fof(f_6_3,negated_conjecture,
? [U_22] : ~ disjoint(U_22,empty_set),
inference(variable_rename,[status(thm)],[f_6_2]) ).
fof(f_6_4,negated_conjecture,
~ disjoint(sK3,empty_set),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_22,sK3)],[f_6_3]) ).
fof(f_6_5,negated_conjecture,
~ disjoint(sK3,empty_set),
inference(definitional_conversion,[status(esa)],[f_6_4]) ).
cnf(f_6_6,negated_conjecture,
~ disjoint(sK3,empty_set),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(t1,plain,
~ member(sK1(sK3,empty_set),empty_set),
inference(start,[status(thm),parent(0:0)],[f_1_3]) ).
cnf(t2,plain,
( ~ intersect(sK3,empty_set)
| member(sK1(sK3,empty_set),empty_set) ),
inference(extension,[status(thm),parent(t1:1)],[f_2_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( disjoint(sK3,empty_set)
| intersect(sK3,empty_set) ),
inference(extension,[status(thm),parent(t2:2)],[f_3_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ disjoint(sK3,empty_set),
inference(extension,[status(thm),parent(t4:2)],[f_6_6]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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/5.44 % Computer : n017.cluster.edu
% 0.09/5.44 % Model : x86_64 x86_64
% 0.09/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.44 % Memory : 8046.5625MB
% 0.09/5.44 % OS : Linux 6.8.0-71-generic
% 0.09/5.45 % CPULimit : 300
% 0.09/5.45 % WCLimit : 300
% 0.09/5.45 % DateTime : Sat Sep 19 22:39:16 UTC 2026
% 0.09/5.45 % CPUTime :
% 0.09/5.47 % SZS status Theorem for theBenchmark
% 0.09/5.47 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------