%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET831-2 : TPTP v9.3.1. Released v3.2.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 : n006.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:33 AM UTC 2026
% Result : Unsatisfiable 224.95s 225.28s
% Output : Proof 227.25s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
( c_lessequals(v_X,v_Y,tc_set(t_a))
| v_X = c_inter(v_Y,v_Z,t_a) ),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(v_X,v_Z,tc_set(t_a))
| v_X = c_inter(v_Y,v_Z,t_a) ),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
( v_X != c_inter(v_Y,v_Z,t_a)
| ~ c_lessequals(v_X,v_Y,tc_set(t_a))
| ~ c_lessequals(v_X,v_Z,tc_set(t_a))
| c_lessequals(v_x,v_Y,tc_set(t_a)) ),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
( v_X != c_inter(v_Y,v_Z,t_a)
| ~ c_lessequals(v_X,v_Y,tc_set(t_a))
| ~ c_lessequals(v_X,v_Z,tc_set(t_a))
| c_lessequals(v_x,v_Z,tc_set(t_a)) ),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
( v_X != c_inter(v_Y,v_Z,t_a)
| ~ c_lessequals(v_X,v_Y,tc_set(t_a))
| ~ c_lessequals(v_X,v_Z,tc_set(t_a))
| ~ c_lessequals(v_x,v_X,tc_set(t_a)) ),
file('theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_lessequals(V_U,v_Y,tc_set(t_a))
| ~ c_lessequals(V_U,v_Z,tc_set(t_a))
| c_lessequals(V_U,v_X,tc_set(t_a))
| v_X = c_inter(v_Y,v_Z,t_a) ),
file('theBenchmark.p',cls_conjecture_5) ).
cnf(cls_Set_OIntE_0,axiom,
( c_in(V_c,V_B,T_a)
| ~ c_in(V_c,c_inter(V_A,V_B,T_a),T_a) ),
file('theBenchmark.p',cls_Set_OIntE_0) ).
cnf(cls_Set_OIntE_1,axiom,
( c_in(V_c,V_A,T_a)
| ~ c_in(V_c,c_inter(V_A,V_B,T_a),T_a) ),
file('theBenchmark.p',cls_Set_OIntE_1) ).
cnf(cls_Set_OIntI_0,axiom,
( c_in(V_c,c_inter(V_A,V_B,T_a),T_a)
| ~ c_in(V_c,V_A,T_a)
| ~ c_in(V_c,V_B,T_a) ),
file('theBenchmark.p',cls_Set_OIntI_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(V_c,V_B,T_a)
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_in(V_c,V_A,T_a) ),
file('theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(V_A,V_B,tc_set(T_a))
| c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a) ),
file('theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a) ),
file('theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( V_A = V_B
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
file('theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( c_inter(Eq_x_0,Eq_x_1,Eq_x_2) = c_inter(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( tc_set(Eq_x_0) = tc_set(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( c_Main_OsubsetI__1(Eq_x_0,Eq_x_1,Eq_x_2) = c_Main_OsubsetI__1(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( c_lessequals(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ c_lessequals(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( c_in(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ c_in(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET831-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n006.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 23:01:58 UTC 2026
% 0.07/0.35 % CPUTime :
% 224.95/225.28 % SZS status Unsatisfiable for theBenchmark
% 224.95/225.28 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------