TSTP Solution File: GEO628+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO628+1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 17:33:12 EDT 2023
% Result : Theorem 2.85s 0.92s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 18
% Syntax : Number of formulae : 77 ( 17 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 163 ( 53 ~; 50 |; 41 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-8 aty)
% Number of functors : 14 ( 14 usr; 13 con; 0-4 aty)
% Number of variables : 309 ( 20 sgn; 178 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ruleD9,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( perp(X1,X2,X3,X4)
& perp(X3,X4,X5,X6) )
=> para(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD9) ).
fof(ruleX11,axiom,
! [X1,X2,X3,X8] :
? [X9] :
( circle(X8,X1,X2,X3)
=> perp(X9,X1,X1,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleX11) ).
fof(ruleD8,axiom,
! [X1,X2,X3,X4] :
( perp(X1,X2,X3,X4)
=> perp(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD8) ).
fof(exemplo6GDDFULL8110991,conjecture,
! [X1,X2,X3,X8,X19,X6,X13,X9,X20,X21,X22,X23,X24] :
( ( circle(X8,X1,X2,X3)
& circle(X8,X1,X19,X23)
& perp(X6,X19,X1,X3)
& coll(X6,X1,X3)
& perp(X13,X19,X1,X2)
& coll(X13,X1,X2)
& circle(X8,X1,X9,X24)
& perp(X20,X9,X1,X2)
& coll(X20,X1,X2)
& perp(X21,X9,X1,X3)
& coll(X21,X1,X3)
& perp(X6,X13,X9,X22)
& perp(X20,X21,X19,X22) )
=> cyclic(X1,X19,X9,X22) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',exemplo6GDDFULL8110991) ).
fof(ruleD4,axiom,
! [X1,X2,X3,X4] :
( para(X1,X2,X3,X4)
=> para(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD4) ).
fof(ruleD19,axiom,
! [X1,X2,X3,X4,X9,X10,X11,X12] :
( eqangle(X1,X2,X3,X4,X9,X10,X11,X12)
=> eqangle(X3,X4,X1,X2,X11,X12,X9,X10) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD19) ).
fof(ruleD40,axiom,
! [X1,X2,X3,X4,X9,X10] :
( para(X1,X2,X3,X4)
=> eqangle(X1,X2,X9,X10,X3,X4,X9,X10) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD40) ).
fof(ruleD5,axiom,
! [X1,X2,X3,X4] :
( para(X1,X2,X3,X4)
=> para(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD5) ).
fof(ruleD39,axiom,
! [X1,X2,X3,X4,X9,X10] :
( eqangle(X1,X2,X9,X10,X3,X4,X9,X10)
=> para(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD39) ).
fof(ruleD66,axiom,
! [X1,X2,X3] :
( para(X1,X2,X1,X3)
=> coll(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD66) ).
fof(ruleD2,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD2) ).
fof(ruleD1,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD1) ).
fof(ruleD42b,axiom,
! [X1,X2,X9,X10] :
( ( eqangle(X9,X1,X9,X2,X10,X1,X10,X2)
& coll(X9,X10,X2) )
=> cyclic(X1,X2,X9,X10) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD42b) ).
fof(ruleD3,axiom,
! [X1,X2,X3,X4] :
( ( coll(X1,X2,X3)
& coll(X1,X2,X4) )
=> coll(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD3) ).
fof(ruleD15,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD15) ).
fof(ruleD14,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD14) ).
fof(ruleD16,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X2,X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD16) ).
fof(ruleD17,axiom,
! [X1,X2,X3,X4,X5] :
( ( cyclic(X1,X2,X3,X4)
& cyclic(X1,X2,X3,X5) )
=> cyclic(X2,X3,X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.FQmUZWbxjq/E---3.1_23319.p',ruleD17) ).
fof(c_0_18,plain,
! [X111,X112,X113,X114,X115,X116] :
( ~ perp(X111,X112,X113,X114)
| ~ perp(X113,X114,X115,X116)
| para(X111,X112,X115,X116) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD9])]) ).
fof(c_0_19,plain,
! [X276,X277,X278,X279] :
( ~ circle(X279,X276,X277,X278)
| perp(esk30_4(X276,X277,X278,X279),X276,X276,X279) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleX11])])])]) ).
fof(c_0_20,plain,
! [X107,X108,X109,X110] :
( ~ perp(X107,X108,X109,X110)
| perp(X109,X110,X107,X108) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD8])]) ).
cnf(c_0_21,plain,
( para(X1,X2,X5,X6)
| ~ perp(X1,X2,X3,X4)
| ~ perp(X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( perp(esk30_4(X2,X3,X4,X1),X2,X2,X1)
| ~ circle(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( perp(X3,X4,X1,X2)
| ~ perp(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1,X2,X3,X8,X19,X6,X13,X9,X20,X21,X22,X23,X24] :
( ( circle(X8,X1,X2,X3)
& circle(X8,X1,X19,X23)
& perp(X6,X19,X1,X3)
& coll(X6,X1,X3)
& perp(X13,X19,X1,X2)
& coll(X13,X1,X2)
& circle(X8,X1,X9,X24)
& perp(X20,X9,X1,X2)
& coll(X20,X1,X2)
& perp(X21,X9,X1,X3)
& coll(X21,X1,X3)
& perp(X6,X13,X9,X22)
& perp(X20,X21,X19,X22) )
=> cyclic(X1,X19,X9,X22) ),
inference(assume_negation,[status(cth)],[exemplo6GDDFULL8110991]) ).
cnf(c_0_25,plain,
( para(X1,X2,X3,X4)
| ~ circle(X4,X3,X5,X6)
| ~ perp(X1,X2,esk30_4(X3,X5,X6,X4),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( perp(X1,X2,esk30_4(X1,X3,X4,X2),X1)
| ~ circle(X2,X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
fof(c_0_27,negated_conjecture,
( circle(esk4_0,esk1_0,esk2_0,esk3_0)
& circle(esk4_0,esk1_0,esk5_0,esk12_0)
& perp(esk6_0,esk5_0,esk1_0,esk3_0)
& coll(esk6_0,esk1_0,esk3_0)
& perp(esk7_0,esk5_0,esk1_0,esk2_0)
& coll(esk7_0,esk1_0,esk2_0)
& circle(esk4_0,esk1_0,esk8_0,esk13_0)
& perp(esk9_0,esk8_0,esk1_0,esk2_0)
& coll(esk9_0,esk1_0,esk2_0)
& perp(esk10_0,esk8_0,esk1_0,esk3_0)
& coll(esk10_0,esk1_0,esk3_0)
& perp(esk6_0,esk7_0,esk8_0,esk11_0)
& perp(esk9_0,esk10_0,esk5_0,esk11_0)
& ~ cyclic(esk1_0,esk5_0,esk8_0,esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_28,plain,
! [X373,X374,X375,X376] :
( ~ para(X373,X374,X375,X376)
| para(X373,X374,X376,X375) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD4])]) ).
cnf(c_0_29,plain,
( para(X1,X2,X1,X2)
| ~ circle(X2,X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
circle(esk4_0,esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_31,plain,
! [X317,X318,X319,X320,X321,X322,X323,X324] :
( ~ eqangle(X317,X318,X319,X320,X321,X322,X323,X324)
| eqangle(X319,X320,X317,X318,X323,X324,X321,X322) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD19])]) ).
fof(c_0_32,plain,
! [X359,X360,X361,X362,X363,X364] :
( ~ para(X359,X360,X361,X362)
| eqangle(X359,X360,X363,X364,X361,X362,X363,X364) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD40])]) ).
fof(c_0_33,plain,
! [X377,X378,X379,X380] :
( ~ para(X377,X378,X379,X380)
| para(X379,X380,X377,X378) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD5])]) ).
cnf(c_0_34,plain,
( para(X1,X2,X4,X3)
| ~ para(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
para(esk1_0,esk4_0,esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_36,plain,
! [X353,X354,X355,X356,X357,X358] :
( ~ eqangle(X353,X354,X357,X358,X355,X356,X357,X358)
| para(X353,X354,X355,X356) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD39])]) ).
cnf(c_0_37,plain,
( eqangle(X3,X4,X1,X2,X7,X8,X5,X6)
| ~ eqangle(X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( eqangle(X1,X2,X5,X6,X3,X4,X5,X6)
| ~ para(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( para(X3,X4,X1,X2)
| ~ para(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
para(esk1_0,esk4_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( para(X1,X2,X5,X6)
| ~ eqangle(X1,X2,X3,X4,X5,X6,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( eqangle(X1,X2,X3,X4,X1,X2,X5,X6)
| ~ para(X3,X4,X5,X6) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
para(esk4_0,esk1_0,esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_44,plain,
! [X212,X213,X214] :
( ~ para(X212,X213,X212,X214)
| coll(X212,X213,X214) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD66])]) ).
cnf(c_0_45,plain,
( para(X1,X2,X1,X2)
| ~ para(X3,X4,X3,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
para(esk4_0,esk1_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
fof(c_0_47,plain,
! [X197,X198,X199] :
( ~ coll(X197,X198,X199)
| coll(X198,X197,X199) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD2])]) ).
cnf(c_0_48,plain,
( coll(X1,X2,X3)
| ~ para(X1,X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
para(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_50,plain,
! [X194,X195,X196] :
( ~ coll(X194,X195,X196)
| coll(X194,X196,X195) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD1])]) ).
cnf(c_0_51,plain,
( coll(X2,X1,X3)
| ~ coll(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
coll(X1,X2,X2),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
fof(c_0_53,plain,
! [X68,X69,X70,X71] :
( ~ eqangle(X70,X68,X70,X69,X71,X68,X71,X69)
| ~ coll(X70,X71,X69)
| cyclic(X68,X69,X70,X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD42b])]) ).
fof(c_0_54,plain,
! [X200,X201,X202,X203] :
( ~ coll(X200,X201,X202)
| ~ coll(X200,X201,X203)
| coll(X202,X203,X200) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD3])]) ).
cnf(c_0_55,plain,
( coll(X1,X3,X2)
| ~ coll(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
coll(X1,X2,X1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( cyclic(X2,X3,X1,X4)
| ~ eqangle(X1,X2,X1,X3,X4,X2,X4,X3)
| ~ coll(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
( coll(X3,X4,X1)
| ~ coll(X1,X2,X3)
| ~ coll(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,negated_conjecture,
coll(X1,X1,X2),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_60,plain,
! [X47,X48,X49,X50] :
( ~ cyclic(X47,X48,X49,X50)
| cyclic(X47,X49,X48,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD15])]) ).
cnf(c_0_61,plain,
( cyclic(X1,X2,X3,X3)
| ~ para(X3,X1,X3,X1)
| ~ coll(X3,X3,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_62,negated_conjecture,
coll(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_59])]) ).
fof(c_0_63,plain,
! [X43,X44,X45,X46] :
( ~ cyclic(X43,X44,X45,X46)
| cyclic(X43,X44,X46,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD14])]) ).
cnf(c_0_64,plain,
( cyclic(X1,X3,X2,X4)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,plain,
cyclic(X1,X2,X3,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_49])]),c_0_62])]) ).
fof(c_0_66,plain,
! [X51,X52,X53,X54] :
( ~ cyclic(X51,X52,X53,X54)
| cyclic(X52,X51,X53,X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD16])]) ).
cnf(c_0_67,plain,
( cyclic(X1,X2,X4,X3)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
cyclic(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_69,plain,
! [X55,X56,X57,X58,X59] :
( ~ cyclic(X55,X56,X57,X58)
| ~ cyclic(X55,X56,X57,X59)
| cyclic(X56,X57,X58,X59) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD17])]) ).
cnf(c_0_70,plain,
( cyclic(X2,X1,X3,X4)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_71,plain,
cyclic(X1,X2,X2,X3),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
( cyclic(X2,X3,X4,X5)
| ~ cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X2,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_73,plain,
cyclic(X1,X2,X1,X3),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
~ cyclic(esk1_0,esk5_0,esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_75,plain,
cyclic(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_73])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : GEO628+1 : TPTP v8.1.2. Released v7.5.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n011.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Tue Oct 3 06:28:53 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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.FQmUZWbxjq/E---3.1_23319.p
% 2.85/0.92 # Version: 3.1pre001
% 2.85/0.92 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.85/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.85/0.92 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.85/0.92 # Starting new_bool_3 with 300s (1) cores
% 2.85/0.92 # Starting new_bool_1 with 300s (1) cores
% 2.85/0.92 # Starting sh5l with 300s (1) cores
% 2.85/0.92 # new_bool_3 with pid 23398 completed with status 0
% 2.85/0.92 # Result found by new_bool_3
% 2.85/0.92 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.85/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.85/0.92 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.85/0.92 # Starting new_bool_3 with 300s (1) cores
% 2.85/0.92 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.85/0.92 # Search class: FGUSF-FFLM33-SFFFFFNN
% 2.85/0.92 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 2.85/0.92 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.85/0.92 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.85/0.92 # SAT001_MinMin_p005000_rr_RG with pid 23401 completed with status 0
% 2.85/0.92 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.85/0.92 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.85/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.85/0.92 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.85/0.92 # Starting new_bool_3 with 300s (1) cores
% 2.85/0.92 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.85/0.92 # Search class: FGUSF-FFLM33-SFFFFFNN
% 2.85/0.92 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 2.85/0.92 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.85/0.92 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.85/0.92 # Preprocessing time : 0.005 s
% 2.85/0.92 # Presaturation interreduction done
% 2.85/0.92
% 2.85/0.92 # Proof found!
% 2.85/0.92 # SZS status Theorem
% 2.85/0.92 # SZS output start CNFRefutation
% See solution above
% 2.85/0.92 # Parsed axioms : 95
% 2.85/0.92 # Removed by relevancy pruning/SinE : 21
% 2.85/0.92 # Initial clauses : 106
% 2.85/0.92 # Removed in clause preprocessing : 0
% 2.85/0.92 # Initial clauses in saturation : 106
% 2.85/0.92 # Processed clauses : 4026
% 2.85/0.92 # ...of these trivial : 522
% 2.85/0.92 # ...subsumed : 165
% 2.85/0.92 # ...remaining for further processing : 3339
% 2.85/0.92 # Other redundant clauses eliminated : 0
% 2.85/0.92 # Clauses deleted for lack of memory : 0
% 2.85/0.92 # Backward-subsumed : 208
% 2.85/0.92 # Backward-rewritten : 2712
% 2.85/0.92 # Generated clauses : 32657
% 2.85/0.92 # ...of the previous two non-redundant : 13858
% 2.85/0.92 # ...aggressively subsumed : 0
% 2.85/0.92 # Contextual simplify-reflections : 2
% 2.85/0.92 # Paramodulations : 32657
% 2.85/0.92 # Factorizations : 0
% 2.85/0.92 # NegExts : 0
% 2.85/0.92 # Equation resolutions : 0
% 2.85/0.92 # Total rewrite steps : 23907
% 2.85/0.92 # Propositional unsat checks : 0
% 2.85/0.92 # Propositional check models : 0
% 2.85/0.92 # Propositional check unsatisfiable : 0
% 2.85/0.92 # Propositional clauses : 0
% 2.85/0.92 # Propositional clauses after purity: 0
% 2.85/0.92 # Propositional unsat core size : 0
% 2.85/0.92 # Propositional preprocessing time : 0.000
% 2.85/0.92 # Propositional encoding time : 0.000
% 2.85/0.92 # Propositional solver time : 0.000
% 2.85/0.92 # Success case prop preproc time : 0.000
% 2.85/0.92 # Success case prop encoding time : 0.000
% 2.85/0.92 # Success case prop solver time : 0.000
% 2.85/0.92 # Current number of processed clauses : 314
% 2.85/0.92 # Positive orientable unit clauses : 82
% 2.85/0.92 # Positive unorientable unit clauses: 0
% 2.85/0.92 # Negative unit clauses : 0
% 2.85/0.92 # Non-unit-clauses : 232
% 2.85/0.92 # Current number of unprocessed clauses: 8079
% 2.85/0.92 # ...number of literals in the above : 28188
% 2.85/0.92 # Current number of archived formulas : 0
% 2.85/0.92 # Current number of archived clauses : 3025
% 2.85/0.92 # Clause-clause subsumption calls (NU) : 197896
% 2.85/0.92 # Rec. Clause-clause subsumption calls : 177198
% 2.85/0.92 # Non-unit clause-clause subsumptions : 174
% 2.85/0.92 # Unit Clause-clause subsumption calls : 153302
% 2.85/0.92 # Rewrite failures with RHS unbound : 0
% 2.85/0.92 # BW rewrite match attempts : 13488
% 2.85/0.92 # BW rewrite match successes : 1860
% 2.85/0.92 # Condensation attempts : 0
% 2.85/0.92 # Condensation successes : 0
% 2.85/0.92 # Termbank termtop insertions : 322348
% 2.85/0.92
% 2.85/0.92 # -------------------------------------------------
% 2.85/0.92 # User time : 0.330 s
% 2.85/0.92 # System time : 0.018 s
% 2.85/0.92 # Total time : 0.348 s
% 2.85/0.92 # Maximum resident set size: 2376 pages
% 2.85/0.92
% 2.85/0.92 # -------------------------------------------------
% 2.85/0.92 # User time : 0.333 s
% 2.85/0.92 # System time : 0.020 s
% 2.85/0.92 # Total time : 0.354 s
% 2.85/0.92 # Maximum resident set size: 1848 pages
% 2.85/0.92 % E---3.1 exiting
% 2.85/0.92 % E---3.1 exiting
%------------------------------------------------------------------------------