TSTP Solution File: SWV275-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV275-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:43:59 EDT 2023
% Result : Unsatisfiable 624.93s 79.52s
% Output : CNFRefutation 624.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of clauses : 66 ( 19 unt; 13 nHn; 46 RR)
% Number of literals : 127 ( 9 equ; 62 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 172 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OpsubsetE_0,axiom,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OpsubsetE_0) ).
cnf(cls_SetInterval_OlessThan__iff__iff1_0,axiom,
( c_less(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_SetInterval_OlessThan__iff__iff1_0) ).
cnf(clsarity_set_1,axiom,
class_Orderings_Oord(tc_set(X1)),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',clsarity_set_1) ).
cnf(cls_Set_OPow__iff__iff2_0,axiom,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OPow__iff__iff2_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OsubsetD_0) ).
cnf(cls_Message_Osynth__mono_0,axiom,
( c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Message_Osynth__mono_0) ).
cnf(cls_Set_OinsertCI_0,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OinsertCI_0) ).
cnf(cls_Set_ODiffE_0,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_minus(X4,X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_ODiffE_0) ).
cnf(cls_Set_OPow__iff__iff1_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OPow__iff__iff1_0) ).
cnf(cls_Message_Osynth_OInj_0,axiom,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Message_Osynth_OInj_0) ).
cnf(cls_Set_ODiffE_1,axiom,
( c_in(X1,X2,X4)
| ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_ODiffE_1) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OpsubsetI_0) ).
cnf(cls_Set_Oempty__subsetI_0,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_Oempty__subsetI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_conjecture_0) ).
cnf(cls_SetInterval_OlessThan__iff__iff2_0,axiom,
( c_in(X2,c_SetInterval_OlessThan(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_less(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_SetInterval_OlessThan__iff__iff2_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OinsertE_0) ).
cnf(cls_Set_ODiffI_0,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_ODiffI_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OinsertCI_1) ).
cnf(cls_Set_OemptyE_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox/tmp/tmp.l836b1Ce0M/E---3.1_16987.p',cls_Set_OemptyE_0) ).
cnf(c_0_21,axiom,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_OpsubsetE_0 ).
cnf(c_0_22,axiom,
( c_less(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1) ),
cls_SetInterval_OlessThan__iff__iff1_0 ).
cnf(c_0_23,axiom,
class_Orderings_Oord(tc_set(X1)),
clsarity_set_1 ).
cnf(c_0_24,axiom,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OPow__iff__iff2_0 ).
cnf(c_0_25,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
cls_Set_OsubsetI_1 ).
cnf(c_0_26,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X2,c_SetInterval_OlessThan(X1,tc_set(X3)),tc_set(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_28,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
cls_Set_OsubsetD_0 ).
cnf(c_0_29,axiom,
( c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Osynth__mono_0 ).
cnf(c_0_30,plain,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OinsertCI_0 ).
cnf(c_0_32,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_minus(X4,X2,tc_set(X3)),X3) ),
cls_Set_ODiffE_0 ).
cnf(c_0_33,plain,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| ~ c_in(X2,c_SetInterval_OlessThan(X1,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
cls_Set_OPow__iff__iff1_0 ).
cnf(c_0_36,plain,
( c_in(X1,c_Pow(c_insert(X2,X3,X4),X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_insert(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_38,plain,
( ~ c_in(X1,c_SetInterval_OlessThan(c_minus(X2,X3,tc_set(X4)),tc_set(X4)),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(c_minus(X2,X3,tc_set(X4)),X1,X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,axiom,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
cls_Message_Osynth_OInj_0 ).
cnf(c_0_40,axiom,
( c_in(X1,X2,X4)
| ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4) ),
cls_Set_ODiffE_1 ).
cnf(c_0_41,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OpsubsetI_0 ).
cnf(c_0_42,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
cls_Set_Oempty__subsetI_0 ).
cnf(c_0_43,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
cls_conjecture_0 ).
cnf(c_0_44,plain,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_in(X3,c_Pow(X2,tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
c_in(X1,c_Pow(c_insert(X2,X1,X3),X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,plain,
( ~ c_in(X1,c_SetInterval_OlessThan(c_minus(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg)),tc_set(tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(c_minus(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg)),X1,tc_Message_Omsg),X3,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( c_in(c_Main_OsubsetI__1(c_minus(X1,X2,tc_set(X3)),X4,X3),X1,X3)
| ~ c_in(X4,c_SetInterval_OlessThan(c_minus(X1,X2,tc_set(X3)),tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_48,axiom,
( c_in(X2,c_SetInterval_OlessThan(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_less(X2,X3,X1) ),
cls_SetInterval_OlessThan__iff__iff2_0 ).
cnf(c_0_49,plain,
( c_emptyset = X1
| c_less(c_emptyset,X1,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_51,negated_conjecture,
c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_52,negated_conjecture,
~ c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_53,plain,
( c_in(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_ODiffI_0 ).
cnf(c_0_55,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_56,plain,
~ c_in(X1,c_SetInterval_OlessThan(c_minus(X2,c_Message_Osynth(X2),tc_set(tc_Message_Omsg)),tc_set(tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( c_emptyset = X1
| c_in(c_emptyset,c_SetInterval_OlessThan(X1,tc_set(X2)),tc_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23])]) ).
cnf(c_0_58,negated_conjecture,
( c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X
| c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( c_in(X1,c_minus(c_insert(X1,X2,X3),X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
c_minus(X1,c_Message_Osynth(X1),tc_set(tc_Message_Omsg)) = c_emptyset,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,axiom,
~ c_in(X1,c_emptyset,X2),
cls_Set_OemptyE_0 ).
cnf(c_0_63,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
c_in(X1,c_Message_Osynth(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.18 % Problem : SWV275-1 : TPTP v8.1.2. Released v3.2.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.18/0.39 % Computer : n010.cluster.edu
% 0.18/0.39 % Model : x86_64 x86_64
% 0.18/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39 % Memory : 8042.1875MB
% 0.18/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39 % CPULimit : 2400
% 0.18/0.39 % WCLimit : 300
% 0.18/0.39 % DateTime : Tue Oct 3 03:27:05 EDT 2023
% 0.18/0.40 % CPUTime :
% 0.24/0.60 Running first-order theorem proving
% 0.24/0.60 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/tmp/tmp.l836b1Ce0M/E---3.1_16987.p
% 624.93/79.52 # Version: 3.1pre001
% 624.93/79.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 624.93/79.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 624.93/79.52 # Starting new_bool_3 with 300s (1) cores
% 624.93/79.52 # Starting new_bool_1 with 300s (1) cores
% 624.93/79.52 # Starting sh5l with 300s (1) cores
% 624.93/79.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17065 completed with status 0
% 624.93/79.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 624.93/79.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 624.93/79.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 624.93/79.52 # No SInE strategy applied
% 624.93/79.52 # Search class: FGHSM-SSLM32-MFFFFFNN
% 624.93/79.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 624.93/79.52 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 624.93/79.52 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 624.93/79.52 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 624.93/79.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 17071 completed with status 0
% 624.93/79.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 624.93/79.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 624.93/79.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 624.93/79.52 # No SInE strategy applied
% 624.93/79.52 # Search class: FGHSM-SSLM32-MFFFFFNN
% 624.93/79.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 624.93/79.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 624.93/79.52 # Preprocessing time : 0.010 s
% 624.93/79.52 # Presaturation interreduction done
% 624.93/79.52
% 624.93/79.52 # Proof found!
% 624.93/79.52 # SZS status Unsatisfiable
% 624.93/79.52 # SZS output start CNFRefutation
% See solution above
% 624.93/79.52 # Parsed axioms : 1400
% 624.93/79.52 # Removed by relevancy pruning/SinE : 0
% 624.93/79.52 # Initial clauses : 1400
% 624.93/79.52 # Removed in clause preprocessing : 1
% 624.93/79.52 # Initial clauses in saturation : 1399
% 624.93/79.52 # Processed clauses : 461365
% 624.93/79.52 # ...of these trivial : 25063
% 624.93/79.52 # ...subsumed : 419266
% 624.93/79.52 # ...remaining for further processing : 17036
% 624.93/79.52 # Other redundant clauses eliminated : 16
% 624.93/79.52 # Clauses deleted for lack of memory : 76593
% 624.93/79.52 # Backward-subsumed : 400
% 624.93/79.52 # Backward-rewritten : 654
% 624.93/79.52 # Generated clauses : 3243673
% 624.93/79.52 # ...of the previous two non-redundant : 2927154
% 624.93/79.52 # ...aggressively subsumed : 0
% 624.93/79.52 # Contextual simplify-reflections : 2
% 624.93/79.52 # Paramodulations : 3243571
% 624.93/79.52 # Factorizations : 28
% 624.93/79.52 # NegExts : 0
% 624.93/79.52 # Equation resolutions : 73
% 624.93/79.52 # Total rewrite steps : 9701017
% 624.93/79.52 # Propositional unsat checks : 3
% 624.93/79.52 # Propositional check models : 0
% 624.93/79.52 # Propositional check unsatisfiable : 0
% 624.93/79.52 # Propositional clauses : 0
% 624.93/79.52 # Propositional clauses after purity: 0
% 624.93/79.52 # Propositional unsat core size : 0
% 624.93/79.52 # Propositional preprocessing time : 0.000
% 624.93/79.52 # Propositional encoding time : 8.241
% 624.93/79.52 # Propositional solver time : 2.191
% 624.93/79.52 # Success case prop preproc time : 0.000
% 624.93/79.52 # Success case prop encoding time : 0.000
% 624.93/79.52 # Success case prop solver time : 0.000
% 624.93/79.52 # Current number of processed clauses : 14621
% 624.93/79.52 # Positive orientable unit clauses : 802
% 624.93/79.52 # Positive unorientable unit clauses: 0
% 624.93/79.52 # Negative unit clauses : 2701
% 624.93/79.52 # Non-unit-clauses : 11118
% 624.93/79.52 # Current number of unprocessed clauses: 1462404
% 624.93/79.52 # ...number of literals in the above : 3603654
% 624.93/79.52 # Current number of archived formulas : 0
% 624.93/79.52 # Current number of archived clauses : 2415
% 624.93/79.52 # Clause-clause subsumption calls (NU) : 18074332
% 624.93/79.52 # Rec. Clause-clause subsumption calls : 16096159
% 624.93/79.52 # Non-unit clause-clause subsumptions : 34465
% 624.93/79.52 # Unit Clause-clause subsumption calls : 1191214
% 624.93/79.52 # Rewrite failures with RHS unbound : 0
% 624.93/79.52 # BW rewrite match attempts : 4925
% 624.93/79.52 # BW rewrite match successes : 456
% 624.93/79.52 # Condensation attempts : 0
% 624.93/79.52 # Condensation successes : 0
% 624.93/79.52 # Termbank termtop insertions : 154011788
% 624.93/79.52
% 624.93/79.52 # -------------------------------------------------
% 624.93/79.52 # User time : 76.136 s
% 624.93/79.52 # System time : 1.777 s
% 624.93/79.52 # Total time : 77.914 s
% 624.93/79.52 # Maximum resident set size: 3792 pages
% 624.93/79.52
% 624.93/79.52 # -------------------------------------------------
% 624.93/79.52 # User time : 379.751 s
% 624.93/79.52 # System time : 8.465 s
% 624.93/79.52 # Total time : 388.216 s
% 624.93/79.52 # Maximum resident set size: 2432 pages
% 624.93/79.52 % E---3.1 exiting
% 624.93/79.52 % E---3.1 exiting
%------------------------------------------------------------------------------