%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV276-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 02:54:11 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 72 ( 27 unt; 17 nHn; 46 RR)
% Number of literals : 135 ( 15 equ; 54 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 132 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Message_OkeysFor__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_OkeysFor__mono_0) ).
cnf(cls_Message_Oparts__insert__subset__Un_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_lessequals(c_Message_Oparts(c_insert(X1,X3,tc_Message_Omsg)),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__insert__subset__Un_0) ).
cnf(cls_Set_OUn__iff_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__iff_1) ).
cnf(cls_Set_OUn__iff_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__iff_0) ).
cnf(cls_Message_Oparts__Un_0,axiom,
c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__Un_0) ).
cnf(cls_Message_OkeysFor__Un_0,axiom,
c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_OkeysFor__Un_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OUn__iff_2,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__iff_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Message_Oparts__synth_0,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__synth_0) ).
cnf(cls_Event_OkeysFor__synth_H_1,axiom,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| X1 = c_Message_OinvKey(v_sko__uhi(X2,X1))
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Event_OkeysFor__synth_H_1) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__analz_0,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__analz_0) ).
cnf(cls_Event_OkeysFor__synth_H_0,axiom,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| c_in(c_Message_Omsg_OKey(v_sko__uhi(X2,X1)),X2,tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Event_OkeysFor__synth_H_0) ).
cnf(cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0,axiom,
c_Message_OinvKey(c_Message_OinvKey(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0) ).
cnf(cls_Message_Oanalz__conj__parts_0,axiom,
( ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__conj__parts_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Message_Oanalz__subset__parts_0,axiom,
c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__parts_0) ).
cnf(c_0_19,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_20,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
inference(fof_simplification,[status(thm)],[cls_Message_OkeysFor__mono_0]) ).
cnf(c_0_21,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_lessequals(c_Message_Oparts(c_insert(X1,X3,tc_Message_Omsg)),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__insert__subset__Un_0]) ).
cnf(c_0_22,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__iff_1]) ).
cnf(c_0_23,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__iff_0]) ).
cnf(c_0_24,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_19 ).
cnf(c_0_25,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
c_0_20 ).
cnf(c_0_26,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_lessequals(c_Message_Oparts(c_insert(X1,X3,tc_Message_Omsg)),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
c_0_21 ).
cnf(c_0_27,axiom,
c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
cls_Message_Oparts__Un_0 ).
cnf(c_0_28,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_22 ).
cnf(c_0_29,axiom,
c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat),
cls_Message_OkeysFor__Un_0 ).
cnf(c_0_30,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_23 ).
cnf(c_0_31,plain,
( ~ c_in(X1,c_Message_OkeysFor(X3),tc_nat)
| ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg))
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ c_in(X1,X3,tc_Message_Omsg)
| c_lessequals(c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_34,plain,
( ~ c_in(X1,c_Message_OkeysFor(X2),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__iff_2]) ).
cnf(c_0_36,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat)
| c_in(X1,c_Message_OkeysFor(X3),tc_nat)
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_37,plain,
( ~ c_in(X4,X2,tc_Message_Omsg)
| ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_insert(X4,X3,tc_Message_Omsg))),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat),
cls_conjecture_0 ).
cnf(c_0_39,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),
c_0_33 ).
cnf(c_0_40,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat) ),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_41,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_35 ).
cnf(c_0_42,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oparts__synth_0 ).
cnf(c_0_43,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg))),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X3)),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat) ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_44,negated_conjecture,
( ~ c_in(v_X,X1,tc_Message_Omsg)
| c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(X1,v_G,tc_Message_Omsg))),tc_nat) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_G)),tc_nat),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( ~ c_in(X1,c_Message_OkeysFor(X3),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat) ),
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_47,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Message_Osynth(X2))),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat) ),
inference(spm,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ c_in(v_X,X1,tc_Message_Omsg)
| c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(X1)),tc_nat) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X3)),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat) ),
inference(spm,[status(thm)],[c_0_46,c_0_27]) ).
cnf(c_0_50,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| X1 = c_Message_OinvKey(v_sko__uhi(X2,X1))
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Event_OkeysFor__synth_H_1]) ).
cnf(c_0_51,negated_conjecture,
( ~ c_in(v_X,c_Message_Osynth(X1),tc_Message_Omsg)
| c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat)
| c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(X1)),tc_nat) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_53,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
cls_Message_Oparts__analz_0 ).
cnf(c_0_54,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
inference(spm,[status(thm)],[c_0_39,c_0_49]) ).
cnf(c_0_55,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| c_in(c_Message_Omsg_OKey(v_sko__uhi(X2,X1)),X2,tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Event_OkeysFor__synth_H_0]) ).
cnf(c_0_56,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| X1 = c_Message_OinvKey(v_sko__uhi(X2,X1))
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]) ).
cnf(c_0_58,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
| c_in(c_Message_Omsg_OKey(v_sko__uhi(X2,X1)),X2,tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
c_0_55 ).
cnf(c_0_59,axiom,
c_Message_OinvKey(c_Message_OinvKey(X1)) = X1,
cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0 ).
cnf(c_0_60,negated_conjecture,
( c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat)
| c_Message_OinvKey(v_sko__uhi(c_Message_Oanalz(v_H),v_K)) = v_K ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__conj__parts_0]) ).
cnf(c_0_62,negated_conjecture,
( c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat)
| c_in(c_Message_Omsg_OKey(v_sko__uhi(c_Message_Oanalz(v_H),v_K)),c_Message_Oanalz(v_H),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat)
| v_sko__uhi(c_Message_Oanalz(v_H),v_K) = c_Message_OinvKey(v_K) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_65,axiom,
c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
cls_Message_Oanalz__subset__parts_0 ).
cnf(c_0_66,plain,
( ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_61 ).
cnf(c_0_67,negated_conjecture,
( c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat)
| c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(v_H),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg),
c_0_64 ).
cnf(c_0_69,plain,
( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oanalz(X2)),tc_nat)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat) ),
inference(spm,[status(thm)],[c_0_31,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV276-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:37:50 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2166074 completed with status 0
% 0.16/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGUSM-FFMF31-MFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 254s (1) cores
% 0.16/0.46 % Starting new_bool_3 with 254s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 254s (1) cores
% 0.16/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2166080 completed with status 0
% 0.16/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGUSM-FFMF31-MFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 % Preprocessing time : 0.001 s
% 0.16/0.46 % Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Unsatisfiable
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 19
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 19
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 19
% 0.16/0.46 % Processed clauses : 183
% 0.16/0.46 % ...of these trivial : 0
% 0.16/0.46 % ...subsumed : 33
% 0.16/0.46 % ...remaining for further processing : 150
% 0.16/0.46 % Other redundant clauses eliminated : 0
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 0
% 0.16/0.46 % Backward-rewritten : 4
% 0.16/0.46 % Generated clauses : 538
% 0.16/0.46 % ...of the previous two non-redundant : 477
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 0
% 0.16/0.46 % Paramodulations : 538
% 0.16/0.46 % Factorizations : 0
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 0
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 137
% 0.16/0.46 % ...of those cached : 104
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 127
% 0.16/0.46 % Positive orientable unit clauses : 33
% 0.16/0.46 % Positive unorientable unit clauses: 0
% 0.16/0.46 % Negative unit clauses : 7
% 0.16/0.46 % Non-unit-clauses : 87
% 0.16/0.46 % Current number of unprocessed clauses: 332
% 0.16/0.46 % ...number of literals in the above : 540
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 23
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 1557
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 1274
% 0.16/0.46 % Non-unit clause-clause subsumptions : 30
% 0.16/0.46 % Unit Clause-clause subsumption calls : 132
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 40
% 0.16/0.46 % BW rewrite match successes : 1
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 12685
% 0.16/0.46 % Search garbage collected termcells : 28
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.011 s
% 0.16/0.46 % System time : 0.012 s
% 0.16/0.46 % Total time : 0.023 s
% 0.16/0.46 % Maximum resident set size: 3600 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.077 s
% 0.16/0.46 % System time : 0.035 s
% 0.16/0.46 % Total time : 0.112 s
% 0.16/0.46 % Maximum resident set size: 4864 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------