%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV261-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 : n008.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:07 PM UTC 2026
% Result : Unsatisfiable 106.78s 16.10s
% Output : CNFRefutation 106.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 67 ( 20 unt; 13 nHn; 44 RR)
% Number of literals : 128 ( 17 equ; 58 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 : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 177 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OemptyE_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OemptyE_0) ).
cnf(cls_Set_OUnionE_0,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OUnionE_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_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_Set_Oempty__subsetI_0,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Oempty__subsetI_0) ).
cnf(cls_Set_Osubset__trans_0,axiom,
( ~ c_lessequals(X4,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
cnf(cls_Message_Oparts__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).
cnf(cls_Set_ODiffE_0,axiom,
( ~ c_in(X1,c_minus(X4,X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffE_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('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__Un__subset2_0,axiom,
c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertE_0) ).
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_Set_ODiffE_1,axiom,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffE_1) ).
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_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_Set_ODiffI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_17,plain,
~ c_in(X1,c_emptyset,X2),
inference(fof_simplification,[status(thm)],[cls_Set_OemptyE_0]) ).
cnf(c_0_18,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_0]) ).
cnf(c_0_19,plain,
~ c_in(X1,c_emptyset,X2),
c_0_17 ).
cnf(c_0_20,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_21,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_22,plain,
~ c_in(X1,c_Union(c_emptyset,X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,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_24,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_21 ).
cnf(c_0_25,plain,
c_lessequals(c_Union(c_emptyset,X1),X2,tc_set(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ c_lessequals(X1,c_Union(c_emptyset,X2),tc_set(X2))
| X1 = c_Union(c_emptyset,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
cls_Set_Oempty__subsetI_0 ).
cnf(c_0_28,plain,
( ~ c_lessequals(X4,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(X4,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__trans_0]) ).
cnf(c_0_29,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(fof_simplification,[status(thm)],[cls_Message_Oparts__mono_0]) ).
cnf(c_0_30,plain,
c_Union(c_emptyset,X1) = c_emptyset,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ c_lessequals(X4,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(X4,X2,tc_set(X3)) ),
c_0_28 ).
cnf(c_0_32,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)) ),
c_0_29 ).
cnf(c_0_33,plain,
( ~ c_in(X1,c_minus(X4,X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffE_0]) ).
cnf(c_0_34,plain,
( ~ c_lessequals(X1,c_emptyset,tc_set(X2))
| X1 = c_emptyset ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_30]),c_0_30]) ).
cnf(c_0_35,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)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_36,plain,
( ~ c_lessequals(X1,X3,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X3),X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),X2,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,axiom,
c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
cls_Message_Oparts__Un__subset2_0 ).
cnf(c_0_38,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_39,plain,
( ~ c_in(X1,c_minus(X4,X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_33 ).
cnf(c_0_40,plain,
( c_in(c_Main_OsubsetI__1(X1,c_emptyset,X2),X1,X2)
| X1 = c_emptyset ),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_41,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_42,plain,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffE_1]) ).
cnf(c_0_43,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_44,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_45,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)),
c_0_35 ).
cnf(c_0_46,plain,
( ~ c_lessequals(X1,c_union(X2,X3,tc_Message_Omsg),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_38 ).
cnf(c_0_48,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffI_0]) ).
cnf(c_0_49,plain,
( ~ c_in(c_Main_OsubsetI__1(c_minus(X1,X2,tc_set(X3)),c_emptyset,X3),X2,X3)
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_41 ).
cnf(c_0_51,plain,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
c_0_42 ).
cnf(c_0_52,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_43 ).
cnf(c_0_53,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_44 ).
cnf(c_0_54,negated_conjecture,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,plain,
( c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3)
| c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1 ),
inference(spm,[status(thm)],[c_0_47,c_0_23]) ).
cnf(c_0_56,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
c_0_48 ).
cnf(c_0_57,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_58,plain,
( ~ c_in(c_Main_OsubsetI__1(c_minus(X1,c_union(X2,X3,X4),tc_set(X4)),c_emptyset,X4),X2,X4)
| c_minus(X1,c_union(X2,X3,X4),tc_set(X4)) = c_emptyset ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,plain,
( c_in(c_Main_OsubsetI__1(c_minus(X1,X2,tc_set(X3)),c_emptyset,X3),X1,X3)
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
cnf(c_0_60,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( c_in(v_X,X1,tc_Message_Omsg)
| c_in(v_X,c_minus(v_G,X1,tc_set(tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
c_minus(X1,c_union(X1,X2,X3),tc_set(X3)) = c_emptyset,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_54]) ).
cnf(c_0_65,negated_conjecture,
c_in(v_X,c_union(v_G,X1,tc_Message_Omsg),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_19]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_64]),c_0_65])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV261-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.09/0.35 % Computer : n008.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:37:38 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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
% 106.78/16.10 % Version: 3.5.1
% 106.78/16.10 % Preprocessing class: FMLMSMSMSSSNFFN.
% 106.78/16.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.78/16.10 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 106.78/16.10 % Starting new_bool_3 with 300s (1) cores
% 106.78/16.10 % Starting new_bool_1 with 300s (1) cores
% 106.78/16.10 % Starting sh5l with 300s (1) cores
% 106.78/16.10 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 604726 completed with status 0
% 106.78/16.10 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 106.78/16.10 % Preprocessing class: FMLMSMSMSSSNFFN.
% 106.78/16.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.78/16.10 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 106.78/16.10 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 106.78/16.10 % No SInE strategy applied
% 106.78/16.10 % Search class: FGHSM-SSLM32-MFFFFFNN
% 106.78/16.10 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 106.78/16.10 % Starting SubtermCWHack with 136s (1) cores
% 106.78/16.10 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 106.78/16.10 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 106.78/16.10 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 106.78/16.10 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 106.78/16.10 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 604734 completed with status 0
% 106.78/16.10 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 106.78/16.10 % Preprocessing class: FMLMSMSMSSSNFFN.
% 106.78/16.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.78/16.10 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 106.78/16.10 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 106.78/16.10 % No SInE strategy applied
% 106.78/16.10 % Search class: FGHSM-SSLM32-MFFFFFNN
% 106.78/16.10 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 106.78/16.10 % Starting SubtermCWHack with 136s (1) cores
% 106.78/16.10 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 106.78/16.10 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 106.78/16.10 % Preprocessing time : 0.012 s
% 106.78/16.10 % Presaturation interreduction done
% 106.78/16.10
% 106.78/16.10 % Proof found!
% 106.78/16.10 % SZS status Unsatisfiable
% 106.78/16.10 % SZS output start CNFRefutation
% See solution above
% 106.78/16.10 % Parsed axioms : 1403
% 106.78/16.10 % Removed by relevancy pruning/SinE : 0
% 106.78/16.10 % Initial clauses : 1403
% 106.78/16.10 % Removed in clause preprocessing : 1
% 106.78/16.10 % Initial clauses in saturation : 1402
% 106.78/16.10 % Processed clauses : 43244
% 106.78/16.10 % ...of these trivial : 928
% 106.78/16.10 % ...subsumed : 34544
% 106.78/16.10 % ...remaining for further processing : 7772
% 106.78/16.10 % Other redundant clauses eliminated : 212
% 106.78/16.10 % Clauses deleted for lack of memory : 0
% 106.78/16.10 % Backward-subsumed : 139
% 106.78/16.10 % Backward-rewritten : 549
% 106.78/16.10 % Generated clauses : 452882
% 106.78/16.10 % ...of the previous two non-redundant : 403040
% 106.78/16.10 % ...aggressively subsumed : 0
% 106.78/16.10 % Contextual simplify-reflections : 6
% 106.78/16.10 % Paramodulations : 452591
% 106.78/16.10 % Factorizations : 36
% 106.78/16.10 % NegExts : 0
% 106.78/16.10 % Equation resolutions : 255
% 106.78/16.10 % Disequality decompositions : 0
% 106.78/16.10 % Total rewrite steps : 360927
% 106.78/16.10 % ...of those cached : 352504
% 106.78/16.10 % Propositional unsat checks : 1
% 106.78/16.10 % Propositional check models : 0
% 106.78/16.10 % Propositional check unsatisfiable : 0
% 106.78/16.10 % Propositional clauses : 0
% 106.78/16.10 % Propositional clauses after purity: 0
% 106.78/16.10 % Propositional unsat core size : 0
% 106.78/16.10 % Propositional preprocessing time : 0.000
% 106.78/16.10 % Propositional encoding time : 0.257
% 106.78/16.10 % Propositional solver time : 0.216
% 106.78/16.10 % Success case prop preproc time : 0.000
% 106.78/16.10 % Success case prop encoding time : 0.000
% 106.78/16.10 % Success case prop solver time : 0.000
% 106.78/16.10 % Current number of processed clauses : 5721
% 106.78/16.10 % Positive orientable unit clauses : 594
% 106.78/16.10 % Positive unorientable unit clauses: 0
% 106.78/16.10 % Negative unit clauses : 97
% 106.78/16.10 % Non-unit-clauses : 5030
% 106.78/16.10 % Current number of unprocessed clauses: 354662
% 106.78/16.10 % ...number of literals in the above : 1060654
% 106.78/16.10 % Current number of archived formulas : 0
% 106.78/16.10 % Current number of archived clauses : 2051
% 106.78/16.10 % Clause-clause subsumption calls (NU) : 9937242
% 106.78/16.10 % Rec. Clause-clause subsumption calls : 8877477
% 106.78/16.10 % Non-unit clause-clause subsumptions : 24687
% 106.78/16.10 % Unit Clause-clause subsumption calls : 38065
% 106.78/16.10 % Rewrite failures with RHS unbound : 0
% 106.78/16.10 % BW rewrite match attempts : 2156
% 106.78/16.10 % BW rewrite match successes : 250
% 106.78/16.10 % Condensation attempts : 0
% 106.78/16.10 % Condensation successes : 0
% 106.78/16.10 % Termbank termtop insertions : 16815559
% 106.78/16.10 % Search garbage collected termcells : 1693
% 106.78/16.10
% 106.78/16.10 % -------------------------------------------------
% 106.78/16.10 % User time : 14.740 s
% 106.78/16.10 % System time : 0.437 s
% 106.78/16.10 % Total time : 15.177 s
% 106.78/16.10 % Maximum resident set size: 5920 pages
% 106.78/16.10
% 106.78/16.10 % -------------------------------------------------
% 106.78/16.10 % User time : 73.200 s
% 106.78/16.10 % System time : 2.394 s
% 106.78/16.10 % Total time : 75.593 s
% 106.78/16.10 % Maximum resident set size: 5632 pages
% 106.78/16.10 % E exiting
%------------------------------------------------------------------------------