%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET062+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 : n014.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.38s 0.64s
% Output : Proof 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 15 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 48 ( 24 ~; 14 |; 8 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 1 sgn 24 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subclass_defn,axiom,
! [X,Y] :
( subclass(X,Y)
<=> ! [U] :
( member(U,X)
=> member(U,Y) ) ),
file('SET005+0.ax',subclass_defn) ).
fof(null_class_defn,axiom,
! [X] : ~ member(X,null_class),
file('SET005+0.ax',null_class_defn) ).
fof(null_class_is_subclass,conjecture,
! [X] : subclass(null_class,X),
file('theBenchmark.p',null_class_is_subclass) ).
fof(f_1_1,plain,
! [X,Y] :
( ( subclass(X,Y)
| ? [U] :
( ~ member(U,Y)
& member(U,X) ) )
& ( ! [U] :
( member(U,Y)
| ~ member(U,X) )
| ~ subclass(X,Y) ) ),
inference(fof_nnf,[status(thm)],[subclass_defn]) ).
fof(f_1_2,plain,
! [U_3,U_2] :
( ( subclass(U_3,U_2)
| ? [U_1] :
( ~ member(U_1,U_2)
& member(U_1,U_3) ) )
& ( ! [U_0] :
( member(U_0,U_2)
| ~ member(U_0,U_3) )
| ~ subclass(U_3,U_2) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_7,U_5] :
( subclass(U_7,U_5)
| ? [U_1] :
( ~ member(U_1,U_5)
& member(U_1,U_7) ) )
& ! [U_6,U_4] :
( ! [U_0] :
( member(U_0,U_4)
| ~ member(U_0,U_6) )
| ~ subclass(U_6,U_4) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
( ! [U_7,U_5] :
( subclass(U_7,U_5)
| ( ~ member(sK1(U_7,U_5),U_5)
& member(sK1(U_7,U_5),U_7) ) )
& ! [U_6,U_4] :
( ! [U_0] :
( member(U_0,U_4)
| ~ member(U_0,U_6) )
| ~ subclass(U_6,U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_7,U_5))],[f_1_3]) ).
cnf(f_1_6,plain,
( member(sK1(U_7,U_5),U_7)
| subclass(U_7,U_5) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_16_1,plain,
! [X] : ~ member(X,null_class),
inference(fof_nnf,[status(thm)],[null_class_defn]) ).
fof(f_16_2,plain,
! [U_70] : ~ member(U_70,null_class),
inference(variable_rename,[status(thm)],[f_16_1]) ).
cnf(f_16_3,plain,
~ member(U_70,null_class),
inference(clausify,[status(thm)],[f_16_2]) ).
fof(f_44_1,negated_conjecture,
~ ! [X] : subclass(null_class,X),
inference(negate,[status(cth)],[null_class_is_subclass]) ).
fof(f_44_2,negated_conjecture,
? [X] : ~ subclass(null_class,X),
inference(fof_nnf,[status(thm)],[f_44_1]) ).
fof(f_44_3,negated_conjecture,
? [U_182] : ~ subclass(null_class,U_182),
inference(variable_rename,[status(thm)],[f_44_2]) ).
fof(f_44_4,negated_conjecture,
~ subclass(null_class,sK8),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_182,sK8)],[f_44_3]) ).
fof(f_44_5,negated_conjecture,
~ subclass(null_class,sK8),
inference(definitional_conversion,[status(esa)],[f_44_4]) ).
cnf(f_44_6,negated_conjecture,
~ subclass(null_class,sK8),
inference(clausify,[status(thm)],[f_44_5]) ).
cnf(t1,plain,
~ member(sK1(null_class,sK8),null_class),
inference(start,[status(thm),parent(0:0)],[f_16_3]) ).
cnf(t2,plain,
( subclass(null_class,sK8)
| member(sK1(null_class,sK8),null_class) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
~ subclass(null_class,sK8),
inference(extension,[status(thm),parent(t2:2)],[f_44_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET062+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n014.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 19 21:35:51 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.38/0.64 % SZS status Theorem for theBenchmark
% 0.38/0.64 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------