TSTP Solution File: GEO637+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO637+1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:14 EDT 2023
% Result : Theorem 1.24s 0.69s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 22
% Syntax : Number of formulae : 102 ( 27 unt; 0 def)
% Number of atoms : 226 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 201 ( 77 ~; 74 |; 27 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-8 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-6 aty)
% Number of variables : 354 ( 24 sgn; 196 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(exemplo6GDDFULL81109101,conjecture,
! [X1,X2,X3,X8,X14,X4,X5] :
( ( circle(X8,X1,X2,X3)
& midp(X14,X3,X2)
& coll(X4,X8,X14)
& coll(X4,X1,X2)
& perp(X3,X8,X3,X5)
& perp(X1,X8,X1,X5) )
=> cyclic(X1,X8,X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',exemplo6GDDFULL81109101) ).
fof(ruleD69,axiom,
! [X1,X2,X3] :
( midp(X1,X2,X3)
=> coll(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD69) ).
fof(ruleD11,axiom,
! [X1,X2,X7] :
( midp(X7,X2,X1)
=> midp(X7,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD11) ).
fof(ruleD2,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD2) ).
fof(ruleD68,axiom,
! [X1,X2,X3] :
( midp(X1,X2,X3)
=> cong(X1,X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD68) ).
fof(ruleD1,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD1) ).
fof(ruleD23,axiom,
! [X1,X2,X3,X4] :
( cong(X1,X2,X3,X4)
=> cong(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD23) ).
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.mlh2Lf6czf/E---3.1_31288.p',ruleD3) ).
fof(ruleD25,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( cong(X1,X2,X3,X4)
& cong(X3,X4,X5,X6) )
=> cong(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD25) ).
fof(ruleD24,axiom,
! [X1,X2,X3,X4] :
( cong(X1,X2,X3,X4)
=> cong(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD24) ).
fof(ruleD63,axiom,
! [X1,X2,X3,X4,X7] :
( ( midp(X7,X1,X2)
& midp(X7,X3,X4) )
=> para(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD63) ).
fof(ruleX6,axiom,
! [X1,X2,X3,X4,X7,X17] :
? [X9] :
( ( midp(X7,X1,X2)
& midp(X17,X3,X4) )
=> ( midp(X9,X1,X4)
& para(X9,X7,X2,X4)
& para(X9,X17,X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleX6) ).
fof(ruleD67,axiom,
! [X1,X2,X3] :
( ( cong(X1,X2,X1,X3)
& coll(X1,X2,X3) )
=> midp(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD67) ).
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.mlh2Lf6czf/E---3.1_31288.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.mlh2Lf6czf/E---3.1_31288.p',ruleD40) ).
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.mlh2Lf6czf/E---3.1_31288.p',ruleD39) ).
fof(ruleD66,axiom,
! [X1,X2,X3] :
( para(X1,X2,X1,X3)
=> coll(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.p',ruleD66) ).
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.mlh2Lf6czf/E---3.1_31288.p',ruleD42b) ).
fof(ruleD15,axiom,
! [X1,X2,X3,X4] :
( cyclic(X1,X2,X3,X4)
=> cyclic(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.mlh2Lf6czf/E---3.1_31288.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.mlh2Lf6czf/E---3.1_31288.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.mlh2Lf6czf/E---3.1_31288.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.mlh2Lf6czf/E---3.1_31288.p',ruleD17) ).
fof(c_0_22,negated_conjecture,
~ ! [X1,X2,X3,X8,X14,X4,X5] :
( ( circle(X8,X1,X2,X3)
& midp(X14,X3,X2)
& coll(X4,X8,X14)
& coll(X4,X1,X2)
& perp(X3,X8,X3,X5)
& perp(X1,X8,X1,X5) )
=> cyclic(X1,X8,X5,X4) ),
inference(assume_negation,[status(cth)],[exemplo6GDDFULL81109101]) ).
fof(c_0_23,plain,
! [X206,X207,X208] :
( ~ midp(X206,X207,X208)
| coll(X206,X207,X208) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD69])]) ).
fof(c_0_24,negated_conjecture,
( circle(esk4_0,esk1_0,esk2_0,esk3_0)
& midp(esk5_0,esk3_0,esk2_0)
& coll(esk6_0,esk4_0,esk5_0)
& coll(esk6_0,esk1_0,esk2_0)
& perp(esk3_0,esk4_0,esk3_0,esk7_0)
& perp(esk1_0,esk4_0,esk1_0,esk7_0)
& ~ cyclic(esk1_0,esk4_0,esk7_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_25,plain,
! [X236,X237,X238] :
( ~ midp(X238,X237,X236)
| midp(X238,X236,X237) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD11])]) ).
fof(c_0_26,plain,
! [X185,X186,X187] :
( ~ coll(X185,X186,X187)
| coll(X186,X185,X187) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD2])]) ).
cnf(c_0_27,plain,
( coll(X1,X2,X3)
| ~ midp(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
midp(esk5_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X254,X255,X256] :
( ~ midp(X254,X255,X256)
| cong(X254,X255,X254,X256) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD68])]) ).
cnf(c_0_30,plain,
( midp(X1,X3,X2)
| ~ midp(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X182,X183,X184] :
( ~ coll(X182,X183,X184)
| coll(X182,X184,X183) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD1])]) ).
cnf(c_0_32,plain,
( coll(X2,X1,X3)
| ~ coll(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
coll(esk5_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_34,plain,
! [X305,X306,X307,X308] :
( ~ cong(X305,X306,X307,X308)
| cong(X305,X306,X308,X307) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD23])]) ).
cnf(c_0_35,plain,
( cong(X1,X2,X1,X3)
| ~ midp(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
midp(esk5_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
fof(c_0_37,plain,
! [X188,X189,X190,X191] :
( ~ coll(X188,X189,X190)
| ~ coll(X188,X189,X191)
| coll(X190,X191,X188) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD3])]) ).
cnf(c_0_38,plain,
( coll(X1,X3,X2)
| ~ coll(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
coll(esk3_0,esk5_0,esk2_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_40,plain,
! [X313,X314,X315,X316,X317,X318] :
( ~ cong(X313,X314,X315,X316)
| ~ cong(X315,X316,X317,X318)
| cong(X313,X314,X317,X318) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD25])]) ).
fof(c_0_41,plain,
! [X309,X310,X311,X312] :
( ~ cong(X309,X310,X311,X312)
| cong(X311,X312,X309,X310) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD24])]) ).
cnf(c_0_42,plain,
( cong(X1,X2,X4,X3)
| ~ cong(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
cong(esk5_0,esk2_0,esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
( coll(X3,X4,X1)
| ~ coll(X1,X2,X3)
| ~ coll(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
coll(esk3_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
( cong(X1,X2,X5,X6)
| ~ cong(X1,X2,X3,X4)
| ~ cong(X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( cong(X3,X4,X1,X2)
| ~ cong(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
cong(esk5_0,esk2_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( coll(X1,esk5_0,esk3_0)
| ~ coll(esk3_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_50,plain,
! [X244,X245,X246,X247,X248] :
( ~ midp(X248,X244,X245)
| ~ midp(X248,X246,X247)
| para(X244,X246,X245,X247) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD63])]) ).
fof(c_0_51,plain,
! [X257,X258,X259,X260,X261,X262] :
( ( midp(esk24_6(X257,X258,X259,X260,X261,X262),X257,X260)
| ~ midp(X261,X257,X258)
| ~ midp(X262,X259,X260) )
& ( para(esk24_6(X257,X258,X259,X260,X261,X262),X261,X258,X260)
| ~ midp(X261,X257,X258)
| ~ midp(X262,X259,X260) )
& ( para(esk24_6(X257,X258,X259,X260,X261,X262),X262,X257,X259)
| ~ midp(X261,X257,X258)
| ~ midp(X262,X259,X260) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleX6])])])])]) ).
cnf(c_0_52,negated_conjecture,
( cong(X1,X2,esk5_0,esk3_0)
| ~ cong(X1,X2,esk5_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
cong(esk3_0,esk5_0,esk5_0,esk2_0),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
coll(esk5_0,esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_55,plain,
( para(X2,X4,X3,X5)
| ~ midp(X1,X2,X3)
| ~ midp(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( midp(esk24_6(X1,X2,X3,X4,X5,X6),X1,X4)
| ~ midp(X5,X1,X2)
| ~ midp(X6,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_57,plain,
! [X203,X204,X205] :
( ~ cong(X203,X204,X203,X205)
| ~ coll(X203,X204,X205)
| midp(X203,X204,X205) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD67])]) ).
cnf(c_0_58,negated_conjecture,
cong(esk3_0,esk5_0,esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
coll(esk5_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_38,c_0_54]) ).
fof(c_0_60,plain,
! [X330,X331,X332,X333,X334,X335,X336,X337] :
( ~ eqangle(X330,X331,X332,X333,X334,X335,X336,X337)
| eqangle(X332,X333,X330,X331,X336,X337,X334,X335) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD19])]) ).
fof(c_0_61,plain,
! [X372,X373,X374,X375,X376,X377] :
( ~ para(X372,X373,X374,X375)
| eqangle(X372,X373,X376,X377,X374,X375,X376,X377) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD40])]) ).
cnf(c_0_62,plain,
( para(X1,X2,X3,X4)
| ~ midp(esk24_6(X2,X5,X6,X4,X7,X8),X1,X3)
| ~ midp(X8,X6,X4)
| ~ midp(X7,X2,X5) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( midp(esk24_6(X1,X2,X3,X4,X5,X6),X4,X1)
| ~ midp(X6,X3,X4)
| ~ midp(X5,X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_56]) ).
cnf(c_0_64,plain,
( midp(X1,X2,X3)
| ~ cong(X1,X2,X1,X3)
| ~ coll(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_65,negated_conjecture,
cong(esk3_0,esk5_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_66,negated_conjecture,
coll(esk3_0,esk5_0,esk5_0),
inference(spm,[status(thm)],[c_0_32,c_0_59]) ).
fof(c_0_67,plain,
! [X366,X367,X368,X369,X370,X371] :
( ~ eqangle(X366,X367,X370,X371,X368,X369,X370,X371)
| para(X366,X367,X368,X369) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD39])]) ).
cnf(c_0_68,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_60]) ).
cnf(c_0_69,plain,
( eqangle(X1,X2,X5,X6,X3,X4,X5,X6)
| ~ para(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_70,plain,
( para(X1,X2,X2,X1)
| ~ midp(X3,X4,X1)
| ~ midp(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
midp(esk3_0,esk5_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_72,plain,
( para(X1,X2,X5,X6)
| ~ eqangle(X1,X2,X3,X4,X5,X6,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
( eqangle(X1,X2,X3,X4,X1,X2,X5,X6)
| ~ para(X3,X4,X5,X6) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( para(esk5_0,X1,X1,esk5_0)
| ~ midp(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
fof(c_0_75,plain,
! [X200,X201,X202] :
( ~ para(X200,X201,X200,X202)
| coll(X200,X201,X202) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD66])]) ).
cnf(c_0_76,plain,
( para(X1,X2,X1,X2)
| ~ para(X3,X4,X3,X4) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
para(esk5_0,esk5_0,esk5_0,esk5_0),
inference(spm,[status(thm)],[c_0_74,c_0_71]) ).
cnf(c_0_78,plain,
( coll(X1,X2,X3)
| ~ para(X1,X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_79,negated_conjecture,
para(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
coll(X1,X2,X2),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
fof(c_0_81,plain,
! [X56,X57,X58,X59] :
( ~ eqangle(X58,X56,X58,X57,X59,X56,X59,X57)
| ~ coll(X58,X59,X57)
| cyclic(X56,X57,X58,X59) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD42b])]) ).
cnf(c_0_82,negated_conjecture,
coll(X1,X2,X1),
inference(spm,[status(thm)],[c_0_32,c_0_80]) ).
cnf(c_0_83,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_81]) ).
cnf(c_0_84,negated_conjecture,
coll(X1,X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_82]) ).
fof(c_0_85,plain,
! [X35,X36,X37,X38] :
( ~ cyclic(X35,X36,X37,X38)
| cyclic(X35,X37,X36,X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD15])]) ).
cnf(c_0_86,plain,
( cyclic(X1,X2,X3,X3)
| ~ para(X3,X1,X3,X1)
| ~ coll(X3,X3,X2) ),
inference(spm,[status(thm)],[c_0_83,c_0_69]) ).
cnf(c_0_87,negated_conjecture,
coll(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_84]),c_0_84])]) ).
fof(c_0_88,plain,
! [X31,X32,X33,X34] :
( ~ cyclic(X31,X32,X33,X34)
| cyclic(X31,X32,X34,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD14])]) ).
cnf(c_0_89,plain,
( cyclic(X1,X3,X2,X4)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_90,plain,
cyclic(X1,X2,X3,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_79])]),c_0_87])]) ).
fof(c_0_91,plain,
! [X39,X40,X41,X42] :
( ~ cyclic(X39,X40,X41,X42)
| cyclic(X40,X39,X41,X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD16])]) ).
cnf(c_0_92,plain,
( cyclic(X1,X2,X4,X3)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_93,plain,
cyclic(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
fof(c_0_94,plain,
! [X43,X44,X45,X46,X47] :
( ~ cyclic(X43,X44,X45,X46)
| ~ cyclic(X43,X44,X45,X47)
| cyclic(X44,X45,X46,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD17])]) ).
cnf(c_0_95,plain,
( cyclic(X2,X1,X3,X4)
| ~ cyclic(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_96,plain,
cyclic(X1,X2,X2,X3),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_97,plain,
( cyclic(X2,X3,X4,X5)
| ~ cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X2,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_98,plain,
cyclic(X1,X2,X1,X3),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,negated_conjecture,
~ cyclic(esk1_0,esk4_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_100,plain,
cyclic(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_98])]) ).
cnf(c_0_101,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GEO637+1 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 07:01:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.mlh2Lf6czf/E---3.1_31288.p
% 1.24/0.69 # Version: 3.1pre001
% 1.24/0.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.24/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.24/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.24/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.24/0.69 # Starting sh5l with 300s (1) cores
% 1.24/0.69 # new_bool_1 with pid 31368 completed with status 0
% 1.24/0.69 # Result found by new_bool_1
% 1.24/0.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.24/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.24/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.24/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.24/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.69 # Search class: FGUSF-FFLM33-SFFFFFNN
% 1.24/0.69 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 1.24/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.69 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.24/0.69 # SAT001_MinMin_p005000_rr_RG with pid 31371 completed with status 0
% 1.24/0.69 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.24/0.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.24/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.24/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.24/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.24/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.69 # Search class: FGUSF-FFLM33-SFFFFFNN
% 1.24/0.69 # partial match(1): FGUSF-FFMM33-SFFFFFNN
% 1.24/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.69 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.24/0.69 # Preprocessing time : 0.003 s
% 1.24/0.69 # Presaturation interreduction done
% 1.24/0.69
% 1.24/0.69 # Proof found!
% 1.24/0.69 # SZS status Theorem
% 1.24/0.69 # SZS output start CNFRefutation
% See solution above
% 1.24/0.69 # Parsed axioms : 95
% 1.24/0.69 # Removed by relevancy pruning/SinE : 21
% 1.24/0.69 # Initial clauses : 99
% 1.24/0.69 # Removed in clause preprocessing : 0
% 1.24/0.69 # Initial clauses in saturation : 99
% 1.24/0.69 # Processed clauses : 2145
% 1.24/0.69 # ...of these trivial : 166
% 1.24/0.69 # ...subsumed : 162
% 1.24/0.69 # ...remaining for further processing : 1817
% 1.24/0.69 # Other redundant clauses eliminated : 0
% 1.24/0.69 # Clauses deleted for lack of memory : 0
% 1.24/0.69 # Backward-subsumed : 8
% 1.24/0.69 # Backward-rewritten : 1395
% 1.24/0.69 # Generated clauses : 11093
% 1.24/0.69 # ...of the previous two non-redundant : 6841
% 1.24/0.69 # ...aggressively subsumed : 0
% 1.24/0.69 # Contextual simplify-reflections : 3
% 1.24/0.69 # Paramodulations : 11093
% 1.24/0.69 # Factorizations : 0
% 1.24/0.69 # NegExts : 0
% 1.24/0.69 # Equation resolutions : 0
% 1.24/0.69 # Total rewrite steps : 6331
% 1.24/0.69 # Propositional unsat checks : 0
% 1.24/0.69 # Propositional check models : 0
% 1.24/0.69 # Propositional check unsatisfiable : 0
% 1.24/0.69 # Propositional clauses : 0
% 1.24/0.69 # Propositional clauses after purity: 0
% 1.24/0.69 # Propositional unsat core size : 0
% 1.24/0.69 # Propositional preprocessing time : 0.000
% 1.24/0.69 # Propositional encoding time : 0.000
% 1.24/0.69 # Propositional solver time : 0.000
% 1.24/0.69 # Success case prop preproc time : 0.000
% 1.24/0.69 # Success case prop encoding time : 0.000
% 1.24/0.69 # Success case prop solver time : 0.000
% 1.24/0.69 # Current number of processed clauses : 316
% 1.24/0.69 # Positive orientable unit clauses : 100
% 1.24/0.69 # Positive unorientable unit clauses: 0
% 1.24/0.69 # Negative unit clauses : 0
% 1.24/0.69 # Non-unit-clauses : 216
% 1.24/0.69 # Current number of unprocessed clauses: 4823
% 1.24/0.69 # ...number of literals in the above : 14665
% 1.24/0.69 # Current number of archived formulas : 0
% 1.24/0.69 # Current number of archived clauses : 1501
% 1.24/0.69 # Clause-clause subsumption calls (NU) : 61610
% 1.24/0.69 # Rec. Clause-clause subsumption calls : 58467
% 1.24/0.69 # Non-unit clause-clause subsumptions : 173
% 1.24/0.69 # Unit Clause-clause subsumption calls : 15762
% 1.24/0.69 # Rewrite failures with RHS unbound : 0
% 1.24/0.69 # BW rewrite match attempts : 6961
% 1.24/0.69 # BW rewrite match successes : 1113
% 1.24/0.69 # Condensation attempts : 0
% 1.24/0.69 # Condensation successes : 0
% 1.24/0.69 # Termbank termtop insertions : 132507
% 1.24/0.69
% 1.24/0.69 # -------------------------------------------------
% 1.24/0.69 # User time : 0.156 s
% 1.24/0.69 # System time : 0.009 s
% 1.24/0.69 # Total time : 0.165 s
% 1.24/0.69 # Maximum resident set size: 2356 pages
% 1.24/0.69
% 1.24/0.69 # -------------------------------------------------
% 1.24/0.69 # User time : 0.159 s
% 1.24/0.69 # System time : 0.012 s
% 1.24/0.69 # Total time : 0.171 s
% 1.24/0.69 # Maximum resident set size: 1844 pages
% 1.24/0.69 % E---3.1 exiting
% 1.24/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------