%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV246-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:04 PM UTC 2026
% Result : Unsatisfiable 3.33s 1.11s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 63 ( 17 unt; 10 nHn; 46 RR)
% Number of literals : 124 ( 8 equ; 56 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 145 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oanalz__analzD__dest_0,axiom,
( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz__analzD__dest_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
cnf(cls_Message_Oanalz__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Message_Oanalz_OInj_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz_OInj_0) ).
cnf(cls_Message_OMPair__analz_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_OMPair__analz_0) ).
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
cnf(cls_Message_OMPair__synth_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_OMPair__synth_0) ).
cnf(cls_Set_OUn__least_0,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__least_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(c_0_15,plain,
( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__analzD__dest_0]) ).
cnf(c_0_16,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_17,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__mono_0]) ).
cnf(c_0_18,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_19,plain,
( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_15 ).
cnf(c_0_20,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_21,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).
cnf(c_0_22,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_25,plain,
( c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(X1)),X2,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg)
| c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X1)),X2,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_21 ).
cnf(c_0_27,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__analz_0]) ).
cnf(c_0_28,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_OUnE_0]) ).
cnf(c_0_29,plain,
( ~ c_lessequals(X2,X1,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_Message_Oanalz(X1) = c_Message_Oanalz(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X1)),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oanalz(X2),tc_Message_Omsg),X2,tc_Message_Omsg)
| c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_33,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_34,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
c_0_27 ).
cnf(c_0_35,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_28 ).
cnf(c_0_36,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_37,plain,
( ~ c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| c_Message_Oanalz(c_Message_Oanalz(X1)) = c_Message_Oanalz(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_39,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
c_0_32 ).
cnf(c_0_40,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_33 ).
cnf(c_0_41,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_42,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__synth_0]) ).
cnf(c_0_43,plain,
( ~ c_in(c_Message_Omsg_OMPair(X3,X1),X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_44,negated_conjecture,
( c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
c_Message_Oanalz(c_Message_Oanalz(X1)) = c_Message_Oanalz(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_41 ).
cnf(c_0_48,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__least_0]) ).
cnf(c_0_49,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
c_0_42 ).
cnf(c_0_50,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_51,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_39,c_0_47]) ).
cnf(c_0_52,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
c_0_48 ).
cnf(c_0_53,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_54,plain,
( ~ c_in(c_Message_Omsg_OMPair(X4,X1),X3,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_56,plain,
( ~ c_lessequals(X3,X1,tc_set(X4))
| ~ c_lessequals(X2,X1,tc_set(X4))
| ~ c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| X1 = c_union(X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_52]) ).
cnf(c_0_57,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_53,c_0_20]) ).
cnf(c_0_58,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_59,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_union(X1,v_G,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| c_union(X1,X2,X3) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
( ~ c_lessequals(v_G,X1,tc_set(tc_Message_Omsg))
| c_in(v_Y,c_Message_Oanalz(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_61]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV246-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 % Computer : n003.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 08:37:16 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 3.33/1.11 % Version: 3.5.1
% 3.33/1.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.33/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.33/1.11 % Starting new_bool_3 with 300s (1) cores
% 3.33/1.11 % Starting new_bool_1 with 300s (1) cores
% 3.33/1.11 % Starting sh5l with 300s (1) cores
% 3.33/1.11 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3875421 completed with status 0
% 3.33/1.11 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.33/1.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.33/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.33/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.33/1.11 % No SInE strategy applied
% 3.33/1.11 % Search class: FGHSM-SSLM32-MFFFFFNN
% 3.33/1.11 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.33/1.11 % Starting SubtermCWHack with 136s (1) cores
% 3.33/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.33/1.11 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.33/1.11 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 3.33/1.11 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 3.33/1.11 % SubtermCWHack with pid 3875434 completed with status 0
% 3.33/1.11 % Result found by SubtermCWHack
% 3.33/1.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.33/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.33/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.33/1.11 % No SInE strategy applied
% 3.33/1.11 % Search class: FGHSM-SSLM32-MFFFFFNN
% 3.33/1.11 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.33/1.11 % Starting SubtermCWHack with 136s (1) cores
% 3.33/1.11 % Preprocessing time : 0.007 s
% 3.33/1.11
% 3.33/1.11 % Proof found!
% 3.33/1.11 % SZS status Unsatisfiable
% 3.33/1.11 % SZS output start CNFRefutation
% See solution above
% 3.33/1.11 % Parsed axioms : 1403
% 3.33/1.11 % Removed by relevancy pruning/SinE : 0
% 3.33/1.11 % Initial clauses : 1403
% 3.33/1.11 % Removed in clause preprocessing : 1
% 3.33/1.11 % Initial clauses in saturation : 1402
% 3.33/1.11 % Processed clauses : 7505
% 3.33/1.11 % ...of these trivial : 1472
% 3.33/1.11 % ...subsumed : 3483
% 3.33/1.11 % ...remaining for further processing : 2550
% 3.33/1.11 % Other redundant clauses eliminated : 45
% 3.33/1.11 % Clauses deleted for lack of memory : 0
% 3.33/1.11 % Backward-subsumed : 17
% 3.33/1.11 % Backward-rewritten : 289
% 3.33/1.11 % Generated clauses : 39043
% 3.33/1.11 % ...of the previous two non-redundant : 31274
% 3.33/1.11 % ...aggressively subsumed : 0
% 3.33/1.11 % Contextual simplify-reflections : 2
% 3.33/1.11 % Paramodulations : 38950
% 3.33/1.11 % Factorizations : 6
% 3.33/1.11 % NegExts : 0
% 3.33/1.11 % Equation resolutions : 87
% 3.33/1.11 % Disequality decompositions : 0
% 3.33/1.11 % Total rewrite steps : 29233
% 3.33/1.11 % ...of those cached : 27725
% 3.33/1.11 % Propositional unsat checks : 0
% 3.33/1.11 % Propositional check models : 0
% 3.33/1.11 % Propositional check unsatisfiable : 0
% 3.33/1.11 % Propositional clauses : 0
% 3.33/1.11 % Propositional clauses after purity: 0
% 3.33/1.11 % Propositional unsat core size : 0
% 3.33/1.11 % Propositional preprocessing time : 0.000
% 3.33/1.11 % Propositional encoding time : 0.000
% 3.33/1.11 % Propositional solver time : 0.000
% 3.33/1.11 % Success case prop preproc time : 0.000
% 3.33/1.11 % Success case prop encoding time : 0.000
% 3.33/1.11 % Success case prop solver time : 0.000
% 3.33/1.11 % Current number of processed clauses : 2244
% 3.33/1.11 % Positive orientable unit clauses : 591
% 3.33/1.11 % Positive unorientable unit clauses: 0
% 3.33/1.11 % Negative unit clauses : 46
% 3.33/1.11 % Non-unit-clauses : 1607
% 3.33/1.11 % Current number of unprocessed clauses: 24327
% 3.33/1.11 % ...number of literals in the above : 50298
% 3.33/1.11 % Current number of archived formulas : 0
% 3.33/1.11 % Current number of archived clauses : 306
% 3.33/1.11 % Clause-clause subsumption calls (NU) : 1919501
% 3.33/1.11 % Rec. Clause-clause subsumption calls : 1835856
% 3.33/1.11 % Non-unit clause-clause subsumptions : 3272
% 3.33/1.11 % Unit Clause-clause subsumption calls : 17318
% 3.33/1.11 % Rewrite failures with RHS unbound : 0
% 3.33/1.11 % BW rewrite match attempts : 2926
% 3.33/1.11 % BW rewrite match successes : 194
% 3.33/1.11 % Condensation attempts : 0
% 3.33/1.11 % Condensation successes : 0
% 3.33/1.11 % Termbank termtop insertions : 631756
% 3.33/1.11 % Search garbage collected termcells : 1693
% 3.33/1.11
% 3.33/1.11 % -------------------------------------------------
% 3.33/1.11 % User time : 0.427 s
% 3.33/1.11 % System time : 0.027 s
% 3.33/1.11 % Total time : 0.454 s
% 3.33/1.11 % Maximum resident set size: 5920 pages
% 3.33/1.11
% 3.33/1.11 % -------------------------------------------------
% 3.33/1.11 % User time : 2.077 s
% 3.33/1.11 % System time : 0.087 s
% 3.33/1.11 % Total time : 2.163 s
% 3.33/1.11 % Maximum resident set size: 5376 pages
% 3.33/1.11 % E exiting
%------------------------------------------------------------------------------