%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET061+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/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:56:08 AM UTC 2026
% Result : Theorem 0.32s 0.56s
% Output : Proof 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 19 ~; 13 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 1 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(complement,axiom,
! [X,Z] :
( member(Z,complement(X))
<=> ( ~ member(Z,X)
& member(Z,universal_class) ) ),
file('SET005+0.ax',complement) ).
fof(existence_of_null_class,conjecture,
? [X] :
! [Z] : ~ member(Z,X),
file('theBenchmark.p',existence_of_null_class) ).
fof(f_14_1,plain,
! [X,Z] :
( ( member(Z,complement(X))
| member(Z,X)
| ~ member(Z,universal_class) )
& ( ( ~ member(Z,X)
& member(Z,universal_class) )
| ~ member(Z,complement(X)) ) ),
inference(fof_nnf,[status(thm)],[complement]) ).
fof(f_14_2,plain,
! [U_62,U_61] :
( ( member(U_61,complement(U_62))
| member(U_61,U_62)
| ~ member(U_61,universal_class) )
& ( ( ~ member(U_61,U_62)
& member(U_61,universal_class) )
| ~ member(U_61,complement(U_62)) ) ),
inference(variable_rename,[status(thm)],[f_14_1]) ).
fof(f_14_3,plain,
( ! [U_66,U_64] :
( member(U_64,complement(U_66))
| member(U_64,U_66)
| ~ member(U_64,universal_class) )
& ! [U_65,U_63] :
( ( ~ member(U_63,U_65)
& member(U_63,universal_class) )
| ~ member(U_63,complement(U_65)) ) ),
inference(miniscope,[status(thm)],[f_14_2]) ).
cnf(f_14_4,plain,
( member(U_63,universal_class)
| ~ member(U_63,complement(U_65)) ),
inference(clausify,[status(thm)],[f_14_3]) ).
cnf(f_14_5,plain,
( ~ member(U_63,U_65)
| ~ member(U_63,complement(U_65)) ),
inference(clausify,[status(thm)],[f_14_3]) ).
fof(f_44_1,negated_conjecture,
~ ? [X] :
! [Z] : ~ member(Z,X),
inference(negate,[status(cth)],[existence_of_null_class]) ).
fof(f_44_2,negated_conjecture,
! [X] :
? [Z] : member(Z,X),
inference(fof_nnf,[status(thm)],[f_44_1]) ).
fof(f_44_3,negated_conjecture,
! [U_183] :
? [U_182] : member(U_182,U_183),
inference(variable_rename,[status(thm)],[f_44_2]) ).
fof(f_44_4,negated_conjecture,
! [U_183] : member(sK8(U_183),U_183),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_182,sK8(U_183))],[f_44_3]) ).
fof(f_44_5,negated_conjecture,
! [U_183] : member(sK8(U_183),U_183),
inference(definitional_conversion,[status(esa)],[f_44_4]) ).
cnf(f_44_6,negated_conjecture,
member(sK8(U_183),U_183),
inference(clausify,[status(thm)],[f_44_5]) ).
cnf(t1,plain,
( ~ member(sK8(complement(universal_class)),universal_class)
| ~ member(sK8(complement(universal_class)),complement(universal_class)) ),
inference(start,[status(thm),parent(0:0)],[f_14_5]) ).
cnf(t2,plain,
member(sK8(complement(universal_class)),complement(universal_class)),
inference(extension,[status(thm),parent(t1:1)],[f_44_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ member(sK8(complement(universal_class)),complement(universal_class))
| member(sK8(complement(universal_class)),universal_class) ),
inference(extension,[status(thm),parent(t1:2)],[f_14_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
member(sK8(complement(universal_class)),complement(universal_class)),
inference(extension,[status(thm),parent(t4:2)],[f_44_6]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET061+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n006.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 21:35:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.32/0.56 % SZS status Theorem for theBenchmark
% 0.32/0.56 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------