%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET915+1 : TPTP v9.3.1. Released v3.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 : n019.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:47 AM UTC 2026
% Result : Theorem 0.11s 0.40s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(symmetry_r1_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('theBenchmark.p',symmetry_r1_xboole_0) ).
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('theBenchmark.p',antisymmetry_r2_hidden) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A),
file('theBenchmark.p',rc1_xboole_0) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A),
file('theBenchmark.p',rc2_xboole_0) ).
fof(t56_zfmisc_1,conjecture,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('theBenchmark.p',t56_zfmisc_1) ).
fof(l28_zfmisc_1,axiom,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('theBenchmark.p',l28_zfmisc_1) ).
fof(f_1_1,plain,
! [A,B] :
( disjoint(B,A)
| ~ disjoint(A,B) ),
inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( disjoint(U_0,U_1)
| ~ disjoint(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( disjoint(U_0,U_1)
| ~ disjoint(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(f_2_2,plain,
! [U_3,U_2] :
( ~ in(U_2,U_3)
| ~ in(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( ~ in(U_2,U_3)
| ~ in(U_3,U_2) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_3_2,plain,
? [U_4] : empty(U_4),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
empty(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_3_2]) ).
cnf(f_3_4,plain,
empty(sK1),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_4_2,plain,
? [U_5] : ~ empty(U_5),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
~ empty(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_4_2]) ).
cnf(f_4_4,plain,
~ empty(sK2),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,negated_conjecture,
~ ! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
inference(negate,[status(cth)],[t56_zfmisc_1]) ).
fof(f_5_2,negated_conjecture,
? [A,B] :
( ~ disjoint(singleton(A),B)
& ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_7,U_6] :
( ~ disjoint(singleton(U_7),U_6)
& ~ in(U_7,U_6) ),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
? [U_6] :
( ~ disjoint(singleton(sK3),U_6)
& ~ in(sK3,U_6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_7,sK3)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
( ~ disjoint(singleton(sK3),sK4)
& ~ in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_6,sK4)],[f_5_4]) ).
fof(f_5_6,negated_conjecture,
( ~ disjoint(singleton(sK3),sK4)
& ~ in(sK3,sK4) ),
inference(definitional_conversion,[status(esa)],[f_5_5]) ).
cnf(f_5_7,negated_conjecture,
~ in(sK3,sK4),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_8,negated_conjecture,
~ disjoint(singleton(sK3),sK4),
inference(clausify,[status(thm)],[f_5_6]) ).
fof(f_6_1,plain,
! [A,B] :
( disjoint(singleton(A),B)
| in(A,B) ),
inference(fof_nnf,[status(thm)],[l28_zfmisc_1]) ).
fof(f_6_2,plain,
! [U_9,U_8] :
( disjoint(singleton(U_9),U_8)
| in(U_9,U_8) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( disjoint(singleton(U_9),U_8)
| in(U_9,U_8) ),
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET915+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 19 23:07:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.40 % SZS status Theorem for theBenchmark
% 0.11/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------