%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV261-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 : n013.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 09:03:07 AM UTC 2026
% Result : Unsatisfiable 257.14s 257.40s
% Output : Proof 259.32s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__Un__subset2_0,axiom,
c_lessequals(c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg)),c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).
cnf(cls_Message_Oparts__mono_0,axiom,
( c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) ),
file('theBenchmark.p',cls_Message_Oparts__mono_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
| ~ c_in(V_c,V_B,T_a) ),
file('theBenchmark.p',cls_Set_OUnCI_0) ).
cnf(cls_Set_OUnCI_1,axiom,
( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
| ~ c_in(V_c,V_A,T_a) ),
file('theBenchmark.p',cls_Set_OUnCI_1) ).
cnf(cls_Set_OinsertE_0,axiom,
( V_a = V_b
| c_in(V_a,V_A,T_a)
| ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a) ),
file('theBenchmark.p',cls_Set_OinsertE_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__trans_0,axiom,
( c_lessequals(V_A,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_lessequals(V_B,V_C,tc_set(T_a)) ),
file('theBenchmark.p',cls_Set_Osubset__trans_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_insert(Eq_x_0,Eq_x_1,Eq_x_2) = c_insert(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,
( c_Message_Oparts(Eq_x_0) = c_Message_Oparts(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( c_union(Eq_x_0,Eq_x_1,Eq_x_2) = c_union(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,
( tc_set(Eq_x_0) = tc_set(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,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_9,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(equality_10,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(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV261-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.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 03:13:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 257.14/257.40 % SZS status Unsatisfiable for theBenchmark
% 257.14/257.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------