%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET625+3 : 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 : n001.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:09 AM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,C)
& member(D,B) ) ),
file('theBenchmark.p',intersect_defn) ).
fof(subset_defn,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('theBenchmark.p',subset_defn) ).
fof(symmetry_of_intersect,axiom,
! [B,C] :
( intersect(B,C)
=> intersect(C,B) ),
file('theBenchmark.p',symmetry_of_intersect) ).
fof(reflexivity_of_subset,axiom,
! [B] : subset(B,B),
file('theBenchmark.p',reflexivity_of_subset) ).
fof(prove_th101,conjecture,
! [B,C,D] :
( ( subset(C,D)
& intersect(B,C) )
=> intersect(B,D) ),
file('theBenchmark.p',prove_th101) ).
fof(f_1_1,plain,
! [B,C] :
( ( intersect(B,C)
| ! [D] :
( ~ member(D,C)
| ~ member(D,B) ) )
& ( ? [D] :
( member(D,C)
& member(D,B) )
| ~ intersect(B,C) ) ),
inference(fof_nnf,[status(thm)],[intersect_defn]) ).
fof(f_1_2,plain,
! [U_3,U_2] :
( ( intersect(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) )
| ~ intersect(U_3,U_2) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_7,U_5] :
( intersect(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) )
| ~ intersect(U_6,U_4) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
( ! [U_7,U_5] :
( intersect(U_7,U_5)
| ! [U_1] :
( ~ member(U_1,U_5)
| ~ member(U_1,U_7) ) )
& ! [U_6,U_4] :
( ( member(sK1(U_6,U_4),U_4)
& member(sK1(U_6,U_4),U_6) )
| ~ intersect(U_6,U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_6,U_4))],[f_1_3]) ).
cnf(f_1_5,plain,
( member(sK1(U_6,U_4),U_6)
| ~ intersect(U_6,U_4) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_6,plain,
( member(sK1(U_6,U_4),U_4)
| ~ intersect(U_6,U_4) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_7,plain,
( intersect(U_7,U_5)
| ~ member(U_1,U_5)
| ~ member(U_1,U_7) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
! [B,C] :
( ( subset(B,C)
| ? [D] :
( ~ member(D,C)
& member(D,B) ) )
& ( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(fof_nnf,[status(thm)],[subset_defn]) ).
fof(f_2_2,plain,
! [U_11,U_10] :
( ( subset(U_11,U_10)
| ? [U_9] :
( ~ member(U_9,U_10)
& member(U_9,U_11) ) )
& ( ! [U_8] :
( member(U_8,U_10)
| ~ member(U_8,U_11) )
| ~ subset(U_11,U_10) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_15,U_13] :
( subset(U_15,U_13)
| ? [U_9] :
( ~ member(U_9,U_13)
& member(U_9,U_15) ) )
& ! [U_14,U_12] :
( ! [U_8] :
( member(U_8,U_12)
| ~ member(U_8,U_14) )
| ~ subset(U_14,U_12) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_15,U_13] :
( subset(U_15,U_13)
| ( ~ member(sK2(U_15,U_13),U_13)
& member(sK2(U_15,U_13),U_15) ) )
& ! [U_14,U_12] :
( ! [U_8] :
( member(U_8,U_12)
| ~ member(U_8,U_14) )
| ~ subset(U_14,U_12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2(U_15,U_13))],[f_2_3]) ).
cnf(f_2_5,plain,
( member(U_8,U_12)
| ~ member(U_8,U_14)
| ~ subset(U_14,U_12) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_6,plain,
( member(sK2(U_15,U_13),U_15)
| subset(U_15,U_13) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_7,plain,
( ~ member(sK2(U_15,U_13),U_13)
| subset(U_15,U_13) ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
! [B,C] :
( intersect(C,B)
| ~ intersect(B,C) ),
inference(fof_nnf,[status(thm)],[symmetry_of_intersect]) ).
fof(f_3_2,plain,
! [U_17,U_16] :
( intersect(U_16,U_17)
| ~ intersect(U_17,U_16) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( intersect(U_16,U_17)
| ~ intersect(U_17,U_16) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [B] : subset(B,B),
inference(fof_nnf,[status(thm)],[reflexivity_of_subset]) ).
fof(f_4_2,plain,
! [U_18] : subset(U_18,U_18),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
subset(U_18,U_18),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,negated_conjecture,
~ ! [B,C,D] :
( ( subset(C,D)
& intersect(B,C) )
=> intersect(B,D) ),
inference(negate,[status(cth)],[prove_th101]) ).
fof(f_5_2,negated_conjecture,
? [B,C,D] :
( ~ intersect(B,D)
& subset(C,D)
& intersect(B,C) ),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_21,U_20,U_19] :
( ~ intersect(U_21,U_19)
& subset(U_20,U_19)
& intersect(U_21,U_20) ),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
? [U_20,U_19] :
( ~ intersect(sK3,U_19)
& subset(U_20,U_19)
& intersect(sK3,U_20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_21,sK3)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
? [U_19] :
( ~ intersect(sK3,U_19)
& subset(sK4,U_19)
& intersect(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_20,sK4)],[f_5_4]) ).
fof(f_5_6,negated_conjecture,
( ~ intersect(sK3,sK5)
& subset(sK4,sK5)
& intersect(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_19,sK5)],[f_5_5]) ).
fof(f_5_7,negated_conjecture,
( ~ intersect(sK3,sK5)
& subset(sK4,sK5)
& intersect(sK3,sK4) ),
inference(definitional_conversion,[status(esa)],[f_5_6]) ).
cnf(f_5_8,negated_conjecture,
intersect(sK3,sK4),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_9,negated_conjecture,
subset(sK4,sK5),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_10,negated_conjecture,
~ intersect(sK3,sK5),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET625+3 : TPTP v9.3.1. Released v2.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.09/0.43 % Computer : n001.cluster.edu
% 0.09/0.43 % Model : x86_64 x86_64
% 0.09/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.43 % Memory : 8046.5625MB
% 0.09/0.43 % OS : Linux 6.8.0-71-generic
% 0.09/0.43 % CPULimit : 300
% 0.09/0.43 % WCLimit : 300
% 0.09/0.43 % DateTime : Sat Sep 19 22:49:26 UTC 2026
% 0.09/0.44 % CPUTime :
% 0.14/0.46 % SZS status Theorem for theBenchmark
% 0.14/0.46 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------