%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET062+4 : TPTP v9.3.1. Released v2.2.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 : n009.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.08s 0.42s
% Output : Proof 0.08s
% 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(subset,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('SET006+0.ax',subset) ).
fof(empty_set,axiom,
! [X] : ~ member(X,empty_set),
file('SET006+0.ax',empty_set) ).
fof(thI15,conjecture,
! [A] : subset(empty_set,A),
file('theBenchmark.p',thI15) ).
fof(f_1_1,plain,
! [A,B] :
( ( subset(A,B)
| ? [X] :
( ~ member(X,B)
& member(X,A) ) )
& ( ! [X] :
( member(X,B)
| ~ member(X,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[subset]) ).
fof(f_1_2,plain,
! [U_3,U_2] :
( ( subset(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) )
| ~ subset(U_3,U_2) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_7,U_5] :
( subset(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) )
| ~ subset(U_6,U_4) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
( ! [U_7,U_5] :
( subset(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) )
| ~ subset(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)
| subset(U_7,U_5) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_6_1,plain,
! [X] : ~ member(X,empty_set),
inference(fof_nnf,[status(thm)],[empty_set]) ).
fof(f_6_2,plain,
! [U_38] : ~ member(U_38,empty_set),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
~ member(U_38,empty_set),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_12_1,negated_conjecture,
~ ! [A] : subset(empty_set,A),
inference(negate,[status(cth)],[thI15]) ).
fof(f_12_2,negated_conjecture,
? [A] : ~ subset(empty_set,A),
inference(fof_nnf,[status(thm)],[f_12_1]) ).
fof(f_12_3,negated_conjecture,
? [U_79] : ~ subset(empty_set,U_79),
inference(variable_rename,[status(thm)],[f_12_2]) ).
fof(f_12_4,negated_conjecture,
~ subset(empty_set,sK4),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_79,sK4)],[f_12_3]) ).
fof(f_12_5,negated_conjecture,
~ subset(empty_set,sK4),
inference(definitional_conversion,[status(esa)],[f_12_4]) ).
cnf(f_12_6,negated_conjecture,
~ subset(empty_set,sK4),
inference(clausify,[status(thm)],[f_12_5]) ).
cnf(t1,plain,
~ member(sK1(empty_set,sK4),empty_set),
inference(start,[status(thm),parent(0:0)],[f_6_3]) ).
cnf(t2,plain,
( subset(empty_set,sK4)
| member(sK1(empty_set,sK4),empty_set) ),
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,
~ subset(empty_set,sK4),
inference(extension,[status(thm),parent(t2:2)],[f_12_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+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 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.08/0.36 % Computer : n009.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 19 21:36:12 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.42 % SZS status Theorem for theBenchmark
% 0.08/0.42 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------