%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET074+1 : TPTP v9.3.1. Bugfixed v5.4.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:56:12 AM UTC 2026
% Result : Theorem 32.65s 32.90s
% Output : Proof 32.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 20 unt; 0 def)
% Number of atoms : 94 ( 36 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 97 ( 41 ~; 33 |; 20 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 2 sgn 41 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( ( U = Y
| U = X )
& member(U,universal_class) ) ),
file('SET005+0.ax',unordered_pair_defn) ).
fof(null_class_defn,axiom,
! [X] : ~ member(X,null_class),
file('SET005+0.ax',null_class_defn) ).
fof(corollary1_2,conjecture,
! [X,Y] :
( member(Y,universal_class)
=> unordered_pair(X,Y) != null_class ),
file('theBenchmark.p',corollary1_2) ).
fof(f_4_1,plain,
! [U,X,Y] :
( ( member(U,unordered_pair(X,Y))
| ( U != Y
& U != X )
| ~ member(U,universal_class) )
& ( ( ( U = Y
| U = X )
& member(U,universal_class) )
| ~ member(U,unordered_pair(X,Y)) ) ),
inference(fof_nnf,[status(thm)],[unordered_pair_defn]) ).
fof(f_4_2,plain,
! [U_17,U_16,U_15] :
( ( member(U_17,unordered_pair(U_16,U_15))
| ( U_17 != U_15
& U_17 != U_16 )
| ~ member(U_17,universal_class) )
& ( ( ( U_17 = U_15
| U_17 = U_16 )
& member(U_17,universal_class) )
| ~ member(U_17,unordered_pair(U_16,U_15)) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_23,U_21,U_19] :
( member(U_23,unordered_pair(U_21,U_19))
| ( U_23 != U_19
& U_23 != U_21 )
| ~ member(U_23,universal_class) )
& ! [U_22,U_20,U_18] :
( ( ( U_22 = U_18
| U_22 = U_20 )
& member(U_22,universal_class) )
| ~ member(U_22,unordered_pair(U_20,U_18)) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_21,U_23,U_19] :
( U_23 != U_19
| ~ sP3(U_21,U_23,U_19) )
& ! [U_21,U_23,U_19] :
( U_23 != U_21
| ~ sP3(U_21,U_23,U_19) )
& ! [U_20,U_18,U_22] :
( U_22 = U_18
| U_22 = U_20
| ~ sP2(U_20,U_18,U_22) )
& ! [U_20,U_18,U_22] :
( member(U_22,universal_class)
| ~ sP2(U_20,U_18,U_22) )
& ! [U_21,U_23,U_19] :
( member(U_23,unordered_pair(U_21,U_19))
| sP3(U_21,U_23,U_19)
| ~ member(U_23,universal_class) )
& ! [U_20,U_18,U_22] :
( sP2(U_20,U_18,U_22)
| ~ member(U_22,unordered_pair(U_20,U_18)) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP2,sP3])],[f_4_3]) ).
cnf(f_4_6,plain,
( member(U_23,unordered_pair(U_21,U_19))
| sP3(U_21,U_23,U_19)
| ~ member(U_23,universal_class) ),
inference(clausify,[status(thm)],[f_4_4]) ).
cnf(f_4_10,plain,
( U_23 != U_19
| ~ sP3(U_21,U_23,U_19) ),
inference(clausify,[status(thm)],[f_4_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]) ).
fof(f_16_3,plain,
! [U_70] : ~ member(U_70,null_class),
inference(definitional_conversion,[status(esa)],[f_16_2]) ).
cnf(f_16_4,plain,
~ member(U_70,null_class),
inference(clausify,[status(thm)],[f_16_3]) ).
fof(f_44_1,negated_conjecture,
~ ! [X,Y] :
( member(Y,universal_class)
=> unordered_pair(X,Y) != null_class ),
inference(negate,[status(cth)],[corollary1_2]) ).
fof(f_44_2,negated_conjecture,
? [X,Y] :
( unordered_pair(X,Y) = null_class
& member(Y,universal_class) ),
inference(fof_nnf,[status(thm)],[f_44_1]) ).
fof(f_44_3,negated_conjecture,
? [U_183,U_182] :
( unordered_pair(U_183,U_182) = null_class
& member(U_182,universal_class) ),
inference(variable_rename,[status(thm)],[f_44_2]) ).
fof(f_44_4,negated_conjecture,
? [U_182] :
( unordered_pair(sK8,U_182) = null_class
& member(U_182,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_183,sK8)],[f_44_3]) ).
fof(f_44_5,negated_conjecture,
( unordered_pair(sK8,sK9) = null_class
& member(sK9,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_182,sK9)],[f_44_4]) ).
fof(f_44_6,negated_conjecture,
( unordered_pair(sK8,sK9) = null_class
& member(sK9,universal_class) ),
inference(definitional_conversion,[status(esa)],[f_44_5]) ).
cnf(f_44_7,negated_conjecture,
member(sK9,universal_class),
inference(clausify,[status(thm)],[f_44_6]) ).
cnf(f_44_8,negated_conjecture,
unordered_pair(sK8,sK9) = null_class,
inference(clausify,[status(thm)],[f_44_6]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_31,axiom,
( member(Eq_y_0,Eq_y_1)
| ~ member(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
member(sK9,universal_class),
inference(start,[status(thm),parent(0:0)],[f_44_7]) ).
cnf(t2,plain,
( sP3(sK8,sK9,sK9)
| member(sK9,unordered_pair(sK8,sK9))
| ~ member(sK9,universal_class) ),
inference(extension,[status(thm),parent(t1:1)],[f_4_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( unordered_pair(sK8,sK9) != null_class
| member(sK9,null_class)
| sK9 != sK9
| ~ member(sK9,unordered_pair(sK8,sK9)) ),
inference(extension,[status(thm),parent(t2:2)],[equality_31]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
sK9 = sK9,
inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
~ member(sK9,null_class),
inference(extension,[status(thm),parent(t4:3)],[f_16_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
unordered_pair(sK8,sK9) = null_class,
inference(extension,[status(thm),parent(t4:4)],[f_44_8]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:4]) ).
cnf(t12,plain,
( sK9 != sK9
| ~ sP3(sK8,sK9,sK9) ),
inference(extension,[status(thm),parent(t2:3)],[f_4_10]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
sK9 = sK9,
inference(extension,[status(thm),parent(t12:2)],[equality_1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET074+1 : TPTP v9.3.1. Bugfixed v5.4.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.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sat Sep 19 21:36:52 UTC 2026
% 0.02/0.29 % CPUTime :
% 32.65/32.90 % SZS status Theorem for theBenchmark
% 32.65/32.90 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------