%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT275-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:37:51 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 28
% Syntax : Number of clauses : 35 ( 11 unt; 0 nHn; 27 RR)
% Number of literals : 73 ( 39 equ; 41 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0,axiom,
( c_in(c_Tarski_Olub(X1,v_cl,t_a),v_A,t_a)
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(i_0_4,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
cls_conjecture_2,
[final] ).
cnf(i_0_5,axiom,
( c_in(c_Tarski_Olub(X1,v_cl,t_a),v_A,t_a)
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0,
[final] ).
cnf(i_0_6,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0,
[final] ).
cnf(i_0_7,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_OA_A_61_61_Apset_Acl_0,
[final] ).
cnf(i_0_8,axiom,
X1 = X1 ).
cnf(i_0_9,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_10,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_11,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X1,X3,X4) = c_Tarski_Opotype_Opset(X2,X3,X4) ) ).
cnf(i_0_12,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X3,X1,X4) = c_Tarski_Opotype_Opset(X3,X2,X4) ) ).
cnf(i_0_13,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X3,X4,X1) = c_Tarski_Opotype_Opset(X3,X4,X2) ) ).
cnf(i_0_14,axiom,
( X1 != X2
| ~ c_in(X1,X3,X4)
| c_in(X2,X3,X4) ) ).
cnf(i_0_15,axiom,
( X1 != X2
| ~ c_in(X3,X1,X4)
| c_in(X3,X2,X4) ) ).
cnf(i_0_16,axiom,
( X1 != X2
| ~ c_in(X3,X4,X1)
| c_in(X3,X4,X2) ) ).
cnf(i_0_17,axiom,
( X1 != X2
| ~ c_lessequals(X1,X3,X4)
| c_lessequals(X2,X3,X4) ) ).
cnf(i_0_18,axiom,
( X1 != X2
| ~ c_lessequals(X3,X1,X4)
| c_lessequals(X3,X2,X4) ) ).
cnf(i_0_19,axiom,
( X1 != X2
| ~ c_lessequals(X3,X4,X1)
| c_lessequals(X3,X4,X2) ) ).
cnf(i_0_8_001,axiom,
X1 = X1 ).
cnf(i_0_9_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_10_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_11_004,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X1,X3,X4) = c_Tarski_Opotype_Opset(X2,X3,X4) ) ).
cnf(i_0_12_005,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X3,X1,X4) = c_Tarski_Opotype_Opset(X3,X2,X4) ) ).
cnf(i_0_13_006,axiom,
( X1 != X2
| c_Tarski_Opotype_Opset(X3,X4,X1) = c_Tarski_Opotype_Opset(X3,X4,X2) ) ).
cnf(i_0_14_007,axiom,
( X1 != X2
| ~ c_in(X1,X3,X4)
| c_in(X2,X3,X4) ) ).
cnf(i_0_15_008,axiom,
( X1 != X2
| ~ c_in(X3,X1,X4)
| c_in(X3,X2,X4) ) ).
cnf(i_0_16_009,axiom,
( X1 != X2
| ~ c_in(X3,X4,X1)
| c_in(X3,X4,X2) ) ).
cnf(i_0_17_010,axiom,
( X1 != X2
| ~ c_lessequals(X1,X3,X4)
| c_lessequals(X2,X3,X4) ) ).
cnf(i_0_18_011,axiom,
( X1 != X2
| ~ c_lessequals(X3,X1,X4)
| c_lessequals(X3,X2,X4) ) ).
cnf(i_0_19_012,axiom,
( X1 != X2
| ~ c_lessequals(X3,X4,X1)
| c_lessequals(X3,X4,X2) ) ).
cnf(i_0_20,plain,
c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
inference(scs_inference,[],[i_0_7,i_0_9]) ).
cnf(i_0_21,plain,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),v_A,t_a),
inference(scs_inference,[],[i_0_4,i_0_7,i_0_9,i_0_15]) ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_4,i_0_6,i_0_7,i_0_9,i_0_15,i_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT275-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n016.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 20:57:21 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.64 % Total time : 1.273s
%------------------------------------------------------------------------------