TSTP Solution File: GEO585+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO585+1 : TPTP v8.1.2. Released v7.5.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 17:35:18 EDT 2023
% Result : Theorem 0.34s 0.74s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 18
% Syntax : Number of formulae : 77 ( 17 unt; 0 def)
% Number of atoms : 172 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 148 ( 53 ~; 50 |; 26 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-8 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-4 aty)
% Number of variables : 299 ( 20 sgn; 168 !; 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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD9) ).
fof(ruleX11,axiom,
! [X1,X2,X3,X8] :
? [X9] :
( circle(X8,X1,X2,X3)
=> perp(X9,X1,X1,X8) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleX11) ).
fof(ruleD8,axiom,
! [X1,X2,X3,X4] :
( perp(X1,X2,X3,X4)
=> perp(X3,X4,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD8) ).
fof(exemplo6GDDFULL416047,conjecture,
! [X1,X2,X3,X8,X4,X11,X12,X19] :
( ( circle(X8,X1,X2,X3)
& circle(X8,X1,X4,X19)
& perp(X1,X2,X4,X11)
& perp(X1,X4,X2,X11)
& perp(X2,X4,X1,X11)
& perp(X1,X3,X4,X12)
& perp(X1,X4,X3,X12)
& perp(X3,X4,X1,X12) )
=> cyclic(X1,X11,X4,X12) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',exemplo6GDDFULL416047) ).
fof(ruleD4,axiom,
! [X1,X2,X3,X4] :
( para(X1,X2,X3,X4)
=> para(X1,X2,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD40) ).
fof(ruleD5,axiom,
! [X1,X2,X3,X4] :
( para(X1,X2,X3,X4)
=> para(X3,X4,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD39) ).
fof(ruleD66,axiom,
! [X1,X2,X3] :
( para(X1,X2,X1,X3)
=> coll(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD66) ).
fof(ruleD2,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD2) ).
fof(ruleD1,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD42b) ).
fof(ruleD3,axiom,
! [X1,X2,X3,X4] :
( ( coll(X1,X2,X3)
& coll(X1,X2,X4) )
=> coll(X3,X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD3) ).
fof(ruleD15,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X1,X3,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD15) ).
fof(ruleD14,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X1,X2,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD14) ).
fof(ruleD16,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X2,X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.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/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p',ruleD17) ).
fof(c_0_18,plain,
! [X52,X53,X54,X55,X56,X57] :
( ~ perp(X52,X53,X54,X55)
| ~ perp(X54,X55,X56,X57)
| para(X52,X53,X56,X57) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD9])]) ).
fof(c_0_19,plain,
! [X494,X495,X496,X497] :
( ~ circle(X497,X494,X495,X496)
| perp(esk12_4(X494,X495,X496,X497),X494,X494,X497) ),
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,
! [X48,X49,X50,X51] :
( ~ perp(X48,X49,X50,X51)
| perp(X50,X51,X48,X49) ),
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(esk12_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,X4,X11,X12,X19] :
( ( circle(X8,X1,X2,X3)
& circle(X8,X1,X4,X19)
& perp(X1,X2,X4,X11)
& perp(X1,X4,X2,X11)
& perp(X2,X4,X1,X11)
& perp(X1,X3,X4,X12)
& perp(X1,X4,X3,X12)
& perp(X3,X4,X1,X12) )
=> cyclic(X1,X11,X4,X12) ),
inference(assume_negation,[status(cth)],[exemplo6GDDFULL416047]) ).
cnf(c_0_25,plain,
( para(X1,X2,X3,X4)
| ~ circle(X4,X3,X5,X6)
| ~ perp(X1,X2,esk12_4(X3,X5,X6,X4),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( perp(X1,X2,esk12_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(esk24_0,esk21_0,esk22_0,esk23_0)
& circle(esk24_0,esk21_0,esk25_0,esk28_0)
& perp(esk21_0,esk22_0,esk25_0,esk26_0)
& perp(esk21_0,esk25_0,esk22_0,esk26_0)
& perp(esk22_0,esk25_0,esk21_0,esk26_0)
& perp(esk21_0,esk23_0,esk25_0,esk27_0)
& perp(esk21_0,esk25_0,esk23_0,esk27_0)
& perp(esk23_0,esk25_0,esk21_0,esk27_0)
& ~ cyclic(esk21_0,esk26_0,esk25_0,esk27_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_28,plain,
! [X30,X31,X32,X33] :
( ~ para(X30,X31,X32,X33)
| para(X30,X31,X33,X32) ),
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(esk24_0,esk21_0,esk22_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_31,plain,
! [X101,X102,X103,X104,X105,X106,X107,X108] :
( ~ eqangle(X101,X102,X103,X104,X105,X106,X107,X108)
| eqangle(X103,X104,X101,X102,X107,X108,X105,X106) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD19])]) ).
fof(c_0_32,plain,
! [X255,X256,X257,X258,X259,X260] :
( ~ para(X255,X256,X257,X258)
| eqangle(X255,X256,X259,X260,X257,X258,X259,X260) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD40])]) ).
fof(c_0_33,plain,
! [X34,X35,X36,X37] :
( ~ para(X34,X35,X36,X37)
| para(X36,X37,X34,X35) ),
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(esk21_0,esk24_0,esk21_0,esk24_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_36,plain,
! [X249,X250,X251,X252,X253,X254] :
( ~ eqangle(X249,X250,X253,X254,X251,X252,X253,X254)
| para(X249,X250,X251,X252) ),
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(esk21_0,esk24_0,esk24_0,esk21_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(esk24_0,esk21_0,esk21_0,esk24_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_44,plain,
! [X384,X385,X386] :
( ~ para(X384,X385,X384,X386)
| coll(X384,X385,X386) ),
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(esk24_0,esk21_0,esk24_0,esk21_0),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
fof(c_0_47,plain,
! [X23,X24,X25] :
( ~ coll(X23,X24,X25)
| coll(X24,X23,X25) ),
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,
! [X20,X21,X22] :
( ~ coll(X20,X21,X22)
| coll(X20,X22,X21) ),
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,
! [X269,X270,X271,X272] :
( ~ eqangle(X271,X269,X271,X270,X272,X269,X272,X270)
| ~ coll(X271,X272,X270)
| cyclic(X269,X270,X271,X272) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD42b])]) ).
fof(c_0_54,plain,
! [X26,X27,X28,X29] :
( ~ coll(X26,X27,X28)
| ~ coll(X26,X27,X29)
| coll(X28,X29,X26) ),
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,
! [X80,X81,X82,X83] :
( ~ cyclic(X80,X81,X82,X83)
| cyclic(X80,X82,X81,X83) ),
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,
! [X76,X77,X78,X79] :
( ~ cyclic(X76,X77,X78,X79)
| cyclic(X76,X77,X79,X78) ),
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,
! [X84,X85,X86,X87] :
( ~ cyclic(X84,X85,X86,X87)
| cyclic(X85,X84,X86,X87) ),
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,
! [X88,X89,X90,X91,X92] :
( ~ cyclic(X88,X89,X90,X91)
| ~ cyclic(X88,X89,X90,X92)
| cyclic(X89,X90,X91,X92) ),
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(esk21_0,esk26_0,esk25_0,esk27_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.07/0.12 % Problem : GEO585+1 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 06:11:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.KWGJTaPM5d/E---3.1_4747.p
% 0.34/0.74 # Version: 3.1pre001
% 0.34/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.74 # Starting sh5l with 300s (1) cores
% 0.34/0.74 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4860 completed with status 0
% 0.34/0.74 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.34/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.74 # No SInE strategy applied
% 0.34/0.74 # Search class: FGUSF-FFLM33-SFFFFFNN
% 0.34/0.74 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 0.34/0.74 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.74 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.34/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.34/0.74 # Starting new_bool_3 with 136s (1) cores
% 0.34/0.74 # Starting new_bool_1 with 136s (1) cores
% 0.34/0.74 # Starting sh5l with 136s (1) cores
% 0.34/0.74 # SAT001_MinMin_p005000_rr_RG with pid 4873 completed with status 0
% 0.34/0.74 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.34/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.74 # No SInE strategy applied
% 0.34/0.74 # Search class: FGUSF-FFLM33-SFFFFFNN
% 0.34/0.74 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 0.34/0.74 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.74 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.34/0.74 # Preprocessing time : 0.003 s
% 0.34/0.74 # Presaturation interreduction done
% 0.34/0.74
% 0.34/0.74 # Proof found!
% 0.34/0.74 # SZS status Theorem
% 0.34/0.74 # SZS output start CNFRefutation
% See solution above
% 0.34/0.74 # Parsed axioms : 95
% 0.34/0.74 # Removed by relevancy pruning/SinE : 0
% 0.34/0.74 # Initial clauses : 122
% 0.34/0.74 # Removed in clause preprocessing : 0
% 0.34/0.74 # Initial clauses in saturation : 122
% 0.34/0.74 # Processed clauses : 2079
% 0.34/0.74 # ...of these trivial : 296
% 0.34/0.74 # ...subsumed : 202
% 0.34/0.74 # ...remaining for further processing : 1581
% 0.34/0.74 # Other redundant clauses eliminated : 0
% 0.34/0.74 # Clauses deleted for lack of memory : 0
% 0.34/0.74 # Backward-subsumed : 82
% 0.34/0.74 # Backward-rewritten : 898
% 0.34/0.74 # Generated clauses : 12406
% 0.34/0.74 # ...of the previous two non-redundant : 6983
% 0.34/0.74 # ...aggressively subsumed : 0
% 0.34/0.74 # Contextual simplify-reflections : 2
% 0.34/0.74 # Paramodulations : 12406
% 0.34/0.74 # Factorizations : 0
% 0.34/0.74 # NegExts : 0
% 0.34/0.74 # Equation resolutions : 0
% 0.34/0.74 # Total rewrite steps : 7765
% 0.34/0.74 # Propositional unsat checks : 0
% 0.34/0.74 # Propositional check models : 0
% 0.34/0.74 # Propositional check unsatisfiable : 0
% 0.34/0.74 # Propositional clauses : 0
% 0.34/0.74 # Propositional clauses after purity: 0
% 0.34/0.74 # Propositional unsat core size : 0
% 0.34/0.74 # Propositional preprocessing time : 0.000
% 0.34/0.74 # Propositional encoding time : 0.000
% 0.34/0.74 # Propositional solver time : 0.000
% 0.34/0.74 # Success case prop preproc time : 0.000
% 0.34/0.74 # Success case prop encoding time : 0.000
% 0.34/0.74 # Success case prop solver time : 0.000
% 0.34/0.74 # Current number of processed clauses : 480
% 0.34/0.74 # Positive orientable unit clauses : 257
% 0.34/0.74 # Positive unorientable unit clauses: 0
% 0.34/0.74 # Negative unit clauses : 0
% 0.34/0.74 # Non-unit-clauses : 223
% 0.34/0.74 # Current number of unprocessed clauses: 4529
% 0.34/0.74 # ...number of literals in the above : 13458
% 0.34/0.74 # Current number of archived formulas : 0
% 0.34/0.74 # Current number of archived clauses : 1101
% 0.34/0.74 # Clause-clause subsumption calls (NU) : 57050
% 0.34/0.74 # Rec. Clause-clause subsumption calls : 51260
% 0.34/0.74 # Non-unit clause-clause subsumptions : 213
% 0.34/0.74 # Unit Clause-clause subsumption calls : 34087
% 0.34/0.74 # Rewrite failures with RHS unbound : 0
% 0.34/0.74 # BW rewrite match attempts : 3426
% 0.34/0.74 # BW rewrite match successes : 604
% 0.34/0.74 # Condensation attempts : 0
% 0.34/0.74 # Condensation successes : 0
% 0.34/0.74 # Termbank termtop insertions : 144187
% 0.34/0.74
% 0.34/0.74 # -------------------------------------------------
% 0.34/0.74 # User time : 0.221 s
% 0.34/0.74 # System time : 0.016 s
% 0.34/0.74 # Total time : 0.237 s
% 0.34/0.74 # Maximum resident set size: 2528 pages
% 0.34/0.74
% 0.34/0.74 # -------------------------------------------------
% 0.34/0.74 # User time : 1.121 s
% 0.34/0.74 # System time : 0.038 s
% 0.34/0.74 # Total time : 1.159 s
% 0.34/0.74 # Maximum resident set size: 1836 pages
% 0.34/0.74 % E---3.1 exiting
%------------------------------------------------------------------------------