%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV268-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n007.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 05:21:20 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 51 ( 26 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oparts__mono_0,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Message_Oparts__idem_0,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__idem_0) ).
cnf(i_0_4,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Oparts__mono_0,
[final] ).
cnf(i_0_5,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
cls_conjecture_1,
[final] ).
cnf(i_0_6,negated_conjecture,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
cls_conjecture_0,
[final] ).
cnf(i_0_7,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
cls_Message_Oparts__idem_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_Message_Oparts(X1) = c_Message_Oparts(X2) ) ).
cnf(i_0_12,axiom,
( X1 != X2
| ~ c_lessequals(X1,X3,X4)
| c_lessequals(X2,X3,X4) ) ).
cnf(i_0_13,axiom,
( X1 != X2
| ~ c_lessequals(X3,X1,X4)
| c_lessequals(X3,X2,X4) ) ).
cnf(i_0_14,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_Message_Oparts(X1) = c_Message_Oparts(X2) ) ).
cnf(i_0_12_005,axiom,
( X1 != X2
| ~ c_lessequals(X1,X3,X4)
| c_lessequals(X2,X3,X4) ) ).
cnf(i_0_13_006,axiom,
( X1 != X2
| ~ c_lessequals(X3,X1,X4)
| c_lessequals(X3,X2,X4) ) ).
cnf(i_0_14_007,axiom,
( X1 != X2
| ~ c_lessequals(X3,X4,X1)
| c_lessequals(X3,X4,X2) ) ).
cnf(i_0_15,plain,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(c_Message_Oparts(v_H)),tc_set(tc_Message_Omsg)),
inference(scs_inference,[],[i_0_6,i_0_4]) ).
cnf(i_0_16,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_17,plain,
c_Message_Oparts(X1) = c_Message_Oparts(c_Message_Oparts(X1)),
inference(scs_inference,[],[i_0_6,i_0_7,i_0_4,i_0_9]) ).
cnf(i_0_18,plain,
~ c_lessequals(c_Message_Oparts(c_Message_Oparts(v_G)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(scs_inference,[],[i_0_5,i_0_6,i_0_7,i_0_4,i_0_9,i_0_12]) ).
cnf(i_0_19,plain,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
inference(rename_variables,[],[i_0_7]) ).
cnf(i_0_20,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_6,i_0_7,i_0_19,i_0_4,i_0_9,i_0_12,i_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV268-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n007.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 04:59:09 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.269s
%------------------------------------------------------------------------------