TSTP Solution File: LCL004-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 18:11:13 EDT 2023
% Result : Unsatisfiable 2.26s 0.81s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 54
% Number of leaves : 3
% Syntax : Number of clauses : 94 ( 65 unt; 0 nHn; 7 RR)
% Number of literals : 125 ( 0 equ; 33 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 375 ( 213 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(or(not(X1),X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.HafTW1dmkA/E---3.1_30325.p',condensed_detachment) ).
cnf(an_CAMerideth,axiom,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X5)))),or(not(or(not(X4),X1)),or(X3,or(X5,X1))))),
file('/export/starexec/sandbox2/tmp/tmp.HafTW1dmkA/E---3.1_30325.p',an_CAMerideth) ).
cnf(an_3,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
file('/export/starexec/sandbox2/tmp/tmp.HafTW1dmkA/E---3.1_30325.p',an_3) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(or(not(X1),X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X5)))),or(not(or(not(X4),X1)),or(X3,or(X5,X1))))),
an_CAMerideth ).
cnf(c_0_5,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(X4,X2))))
| ~ is_a_theorem(or(not(or(not(X2),X5)),or(X3,or(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(or(not(or(not(X1),or(not(X2),X3))),or(not(or(not(X4),X2)),or(or(X5,X2),or(not(X2),X3))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(or(not(or(not(or(X1,X2)),X3)),or(not(or(not(X4),X2)),or(or(not(X2),X5),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,X1))),or(not(or(not(X4),X1)),or(X5,or(X3,X1))))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(X4,X2))))
| ~ is_a_theorem(or(not(or(not(X2),X5)),or(X4,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(or(not(or(not(X1),or(not(X2),or(X3,X2)))),or(X4,or(not(or(not(X5),X2)),or(not(X2),or(X3,X2)))))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X4)))
| ~ is_a_theorem(or(not(or(X5,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(or(not(or(not(not(or(not(X1),X2))),X3)),or(X4,or(or(not(X2),or(X5,X2)),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),or(X4,or(or(not(X5),or(X6,X5)),X2))))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X3),X4),or(or(or(not(X5),or(X6,X5)),X3),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(or(not(or(not(or(or(not(X1),or(X2,X1)),X3)),X4)),or(or(not(X3),X5),or(X6,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(or(not(or(not(X1),or(or(not(X2),X3),X2))),or(X4,or(not(or(not(X5),X2)),or(or(not(X2),X3),X2))))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_17,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),or(or(not(X4),X5),or(X6,X2))))),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(or(X3,X2),or(not(X2),X4))))
| ~ is_a_theorem(or(not(X5),or(not(X2),X4))) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_19,plain,
is_a_theorem(or(not(or(not(not(or(not(X1),X2))),X3)),or(X4,or(or(or(not(X2),X5),X2),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_20,plain,
( is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3)))))
| ~ is_a_theorem(or(not(X5),or(not(X3),or(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_21,plain,
is_a_theorem(or(not(or(not(or(not(X1),X2)),X3)),or(or(not(X4),X5),or(or(X6,X4),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_17]) ).
cnf(c_0_22,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(or(X3,X2),or(not(X2),or(or(or(not(X4),X5),X4),X6))))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(or(not(X4),or(X5,X4)),X3))))),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,plain,
( is_a_theorem(or(or(not(X1),X2),or(or(X3,X1),X4)))
| ~ is_a_theorem(or(not(or(not(X5),X6)),X4)) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(or(not(or(not(not(X1)),X2)),or(or(X3,X1),or(or(or(or(not(X4),X5),X4),X6),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_22]) ).
cnf(c_0_26,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_27,plain,
is_a_theorem(or(or(not(X1),X2),or(or(X3,X1),or(or(X4,X5),or(or(or(or(not(X6),X7),X6),X8),X9))))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2)))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(or(not(or(not(or(not(X1),or(X2,X1))),X3)),or(not(X4),or(X4,X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_28]) ).
cnf(c_0_30,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X3,X3))))),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_31,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_30]) ).
cnf(c_0_32,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_33,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X1),or(X1,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_32]) ).
cnf(c_0_34,plain,
is_a_theorem(or(not(or(not(X1),X1)),or(not(X1),or(X2,X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_33]) ).
cnf(c_0_35,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_36,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_35]) ).
cnf(c_0_37,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_38,plain,
is_a_theorem(or(not(or(not(X1),or(X2,X2))),or(X3,or(not(X2),or(X2,X2))))),
inference(spm,[status(thm)],[c_0_9,c_0_32]) ).
cnf(c_0_39,plain,
is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(X4,or(not(X3),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(or(not(or(not(not(X1)),X2)),or(X3,or(or(X1,X1),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_38]) ).
cnf(c_0_41,plain,
( is_a_theorem(or(X1,or(not(X2),or(X3,X2))))
| ~ is_a_theorem(or(not(X4),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_39]) ).
cnf(c_0_42,plain,
is_a_theorem(or(not(or(not(or(X1,X1)),not(X1))),or(X2,or(X3,not(X1))))),
inference(spm,[status(thm)],[c_0_5,c_0_40]) ).
cnf(c_0_43,plain,
is_a_theorem(or(X1,or(not(or(X2,not(X3))),or(X4,or(X2,not(X3)))))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
( is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2)))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_43]) ).
cnf(c_0_45,plain,
is_a_theorem(or(or(not(X1),X2),or(or(X3,X1),or(or(not(X4),X5),or(X6,X7))))),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_46,plain,
is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X3),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_37]) ).
cnf(c_0_48,plain,
is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(not(X3),X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_46]) ).
cnf(c_0_49,plain,
is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(X4,or(not(X2),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_47]) ).
cnf(c_0_50,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(X4,or(not(X2),X3))))),
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(or(not(or(not(not(X1)),X2)),or(X3,or(or(X1,X4),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_49]) ).
cnf(c_0_52,plain,
( is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(or(not(or(not(or(X1,X2)),not(X1))),or(X3,or(X4,not(X1))))),
inference(spm,[status(thm)],[c_0_5,c_0_51]) ).
cnf(c_0_54,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))),
inference(spm,[status(thm)],[c_0_52,c_0_45]) ).
cnf(c_0_55,plain,
is_a_theorem(or(not(or(not(or(X1,X2)),or(not(X3),X4))),or(or(not(X2),X5),or(X6,or(not(X3),X4))))),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_56,plain,
is_a_theorem(or(not(or(not(X1),or(X2,not(X2)))),or(X3,or(X4,or(X2,not(X2)))))),
inference(spm,[status(thm)],[c_0_9,c_0_53]) ).
cnf(c_0_57,plain,
is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(X3,X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_54]) ).
cnf(c_0_58,plain,
is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(or(not(X3),X4),or(or(not(X5),X6),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_5,c_0_55]) ).
cnf(c_0_59,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(or(X4,not(X4)),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_56]) ).
cnf(c_0_60,plain,
is_a_theorem(or(X1,or(not(or(X2,X3)),or(X4,or(X2,X3))))),
inference(spm,[status(thm)],[c_0_41,c_0_57]) ).
cnf(c_0_61,plain,
( is_a_theorem(or(or(not(X1),X2),or(or(not(X3),X4),or(X5,X1))))
| ~ is_a_theorem(or(not(X6),or(X5,X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_58]) ).
cnf(c_0_62,plain,
is_a_theorem(or(not(or(not(or(X1,not(X1))),X2)),or(X3,or(X4,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_59]) ).
cnf(c_0_63,plain,
( is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_60]) ).
cnf(c_0_64,plain,
is_a_theorem(or(or(not(or(X1,or(X2,X3))),X4),or(or(not(X5),X6),or(not(or(not(X7),X3)),or(X1,or(X2,X3)))))),
inference(spm,[status(thm)],[c_0_61,c_0_4]) ).
cnf(c_0_65,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(not(or(X4,not(X4))),X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_62]) ).
cnf(c_0_66,plain,
is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
is_a_theorem(or(X1,or(X2,or(X3,or(X4,not(X4)))))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,plain,
( is_a_theorem(or(or(not(X1),X2),or(X3,or(not(X4),X5))))
| ~ is_a_theorem(or(not(or(X6,X1)),or(not(X4),X5))) ),
inference(spm,[status(thm)],[c_0_3,c_0_55]) ).
cnf(c_0_69,plain,
( is_a_theorem(or(X1,or(X2,or(X3,not(X3)))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_67]) ).
cnf(c_0_70,plain,
is_a_theorem(or(or(not(or(X1,or(X2,X3))),X4),or(X5,or(not(or(not(X2),X6)),or(X1,or(X3,X6)))))),
inference(spm,[status(thm)],[c_0_68,c_0_4]) ).
cnf(c_0_71,plain,
( is_a_theorem(or(X1,or(not(X2),or(X2,X3))))
| ~ is_a_theorem(or(not(X4),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_49]) ).
cnf(c_0_72,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_47]) ).
cnf(c_0_73,plain,
is_a_theorem(or(X1,or(X2,or(X3,not(X3))))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
is_a_theorem(or(X1,or(not(not(X2)),or(not(X2),or(X3,X4))))),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
( is_a_theorem(or(X1,or(X2,not(X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_73]) ).
cnf(c_0_76,plain,
( is_a_theorem(or(not(not(X1)),or(not(X1),or(X2,X3))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_74]) ).
cnf(c_0_77,plain,
is_a_theorem(or(or(not(X1),X2),or(or(X3,X1),or(X4,or(not(or(not(X5),X6)),or(not(X6),or(X7,X6))))))),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_78,plain,
is_a_theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_75,c_0_70]) ).
cnf(c_0_79,plain,
is_a_theorem(or(not(not(X1)),or(not(X1),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
( is_a_theorem(or(X1,not(X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_78]) ).
cnf(c_0_81,plain,
( is_a_theorem(or(not(X1),or(X2,X3)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_79]) ).
cnf(c_0_82,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_80,c_0_70]) ).
cnf(c_0_83,plain,
( is_a_theorem(or(X1,or(not(X2),or(X2,X3))))
| ~ is_a_theorem(not(X4)) ),
inference(spm,[status(thm)],[c_0_71,c_0_81]) ).
cnf(c_0_84,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_82]) ).
cnf(c_0_85,plain,
( is_a_theorem(or(X1,or(not(X2),or(X2,X3))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_86,plain,
is_a_theorem(or(X1,or(not(X2),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_85,c_0_70]) ).
cnf(c_0_87,plain,
( is_a_theorem(or(not(X1),or(X1,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_86]) ).
cnf(c_0_88,plain,
is_a_theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_87,c_0_70]) ).
cnf(c_0_89,plain,
is_a_theorem(or(X1,or(not(X2),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_41,c_0_88]) ).
cnf(c_0_90,plain,
( is_a_theorem(or(not(X1),or(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_89]) ).
cnf(c_0_91,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
an_3 ).
cnf(c_0_92,plain,
is_a_theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_90,c_0_70]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : LCL004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n015.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 12:39:16 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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/tmp/tmp.HafTW1dmkA/E---3.1_30325.p
% 2.26/0.81 # Version: 3.1pre001
% 2.26/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.26/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.26/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.26/0.81 # Starting sh5l with 300s (1) cores
% 2.26/0.81 # new_bool_3 with pid 30406 completed with status 0
% 2.26/0.81 # Result found by new_bool_3
% 2.26/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.26/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.26/0.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.26/0.81 # Search class: FHUNF-FFSF21-DFFFFFNN
% 2.26/0.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.26/0.81 # Starting G----_0019_C18_F1_PI_SE_CS_SP_S0Y with 181s (1) cores
% 2.26/0.81 # G----_0019_C18_F1_PI_SE_CS_SP_S0Y with pid 30409 completed with status 0
% 2.26/0.81 # Result found by G----_0019_C18_F1_PI_SE_CS_SP_S0Y
% 2.26/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.26/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.26/0.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.26/0.81 # Search class: FHUNF-FFSF21-DFFFFFNN
% 2.26/0.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.26/0.81 # Starting G----_0019_C18_F1_PI_SE_CS_SP_S0Y with 181s (1) cores
% 2.26/0.81 # Preprocessing time : 0.001 s
% 2.26/0.81
% 2.26/0.81 # Proof found!
% 2.26/0.81 # SZS status Unsatisfiable
% 2.26/0.81 # SZS output start CNFRefutation
% See solution above
% 2.26/0.81 # Parsed axioms : 3
% 2.26/0.81 # Removed by relevancy pruning/SinE : 0
% 2.26/0.81 # Initial clauses : 3
% 2.26/0.81 # Removed in clause preprocessing : 0
% 2.26/0.81 # Initial clauses in saturation : 3
% 2.26/0.81 # Processed clauses : 1410
% 2.26/0.81 # ...of these trivial : 382
% 2.26/0.81 # ...subsumed : 290
% 2.26/0.81 # ...remaining for further processing : 738
% 2.26/0.81 # Other redundant clauses eliminated : 0
% 2.26/0.81 # Clauses deleted for lack of memory : 0
% 2.26/0.81 # Backward-subsumed : 201
% 2.26/0.81 # Backward-rewritten : 330
% 2.26/0.81 # Generated clauses : 31146
% 2.26/0.81 # ...of the previous two non-redundant : 24294
% 2.26/0.81 # ...aggressively subsumed : 0
% 2.26/0.81 # Contextual simplify-reflections : 0
% 2.26/0.81 # Paramodulations : 31146
% 2.26/0.81 # Factorizations : 0
% 2.26/0.81 # NegExts : 0
% 2.26/0.81 # Equation resolutions : 0
% 2.26/0.81 # Total rewrite steps : 7566
% 2.26/0.81 # Propositional unsat checks : 0
% 2.26/0.81 # Propositional check models : 0
% 2.26/0.81 # Propositional check unsatisfiable : 0
% 2.26/0.81 # Propositional clauses : 0
% 2.26/0.81 # Propositional clauses after purity: 0
% 2.26/0.81 # Propositional unsat core size : 0
% 2.26/0.81 # Propositional preprocessing time : 0.000
% 2.26/0.81 # Propositional encoding time : 0.000
% 2.26/0.81 # Propositional solver time : 0.000
% 2.26/0.81 # Success case prop preproc time : 0.000
% 2.26/0.81 # Success case prop encoding time : 0.000
% 2.26/0.81 # Success case prop solver time : 0.000
% 2.26/0.81 # Current number of processed clauses : 207
% 2.26/0.81 # Positive orientable unit clauses : 97
% 2.26/0.81 # Positive unorientable unit clauses: 0
% 2.26/0.81 # Negative unit clauses : 4
% 2.26/0.81 # Non-unit-clauses : 106
% 2.26/0.81 # Current number of unprocessed clauses: 15929
% 2.26/0.81 # ...number of literals in the above : 25439
% 2.26/0.81 # Current number of archived formulas : 0
% 2.26/0.81 # Current number of archived clauses : 531
% 2.26/0.81 # Clause-clause subsumption calls (NU) : 14672
% 2.26/0.81 # Rec. Clause-clause subsumption calls : 14672
% 2.26/0.81 # Non-unit clause-clause subsumptions : 484
% 2.26/0.81 # Unit Clause-clause subsumption calls : 3568
% 2.26/0.81 # Rewrite failures with RHS unbound : 0
% 2.26/0.81 # BW rewrite match attempts : 36132
% 2.26/0.81 # BW rewrite match successes : 322
% 2.26/0.81 # Condensation attempts : 0
% 2.26/0.81 # Condensation successes : 0
% 2.26/0.81 # Termbank termtop insertions : 515323
% 2.26/0.81
% 2.26/0.81 # -------------------------------------------------
% 2.26/0.81 # User time : 0.276 s
% 2.26/0.81 # System time : 0.013 s
% 2.26/0.81 # Total time : 0.289 s
% 2.26/0.81 # Maximum resident set size: 1644 pages
% 2.26/0.81
% 2.26/0.81 # -------------------------------------------------
% 2.26/0.81 # User time : 0.277 s
% 2.26/0.81 # System time : 0.015 s
% 2.26/0.81 # Total time : 0.292 s
% 2.26/0.81 # Maximum resident set size: 1680 pages
% 2.26/0.81 % E---3.1 exiting
% 2.26/0.81 % E---3.1 exiting
%------------------------------------------------------------------------------