TSTP Solution File: GRA007+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRA007+2 : TPTP v8.1.2. Bugfixed v3.2.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:46:22 EDT 2024
% Result : Theorem 1.40s 0.72s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 85 ( 16 unt; 0 def)
% Number of atoms : 395 ( 121 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 491 ( 181 ~; 204 |; 76 &)
% ( 6 <=>; 21 =>; 1 <=; 2 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 204 ( 24 sgn 102 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',shortest_path_defn) ).
fof(back_edge,conjecture,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',back_edge) ).
fof(precedes_properties,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
<~> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',precedes_properties) ).
fof(in_path_properties,axiom,
! [X2,X3,X4,X6] :
( ( path(X2,X3,X4)
& in_path(X6,X4) )
=> ( vertex(X6)
& ? [X1] :
( on_path(X1,X4)
& ( X6 = head_of(X1)
| X6 = tail_of(X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',in_path_properties) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',on_path_properties) ).
fof(complete_properties,axiom,
( complete
=> ! [X2,X3] :
( ( vertex(X2)
& vertex(X3)
& X2 != X3 )
=> ? [X1] :
( edge(X1)
& ( ( X2 = head_of(X1)
& X3 = tail_of(X1) )
<~> ( X3 = head_of(X1)
& X2 = tail_of(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',complete_properties) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',precedes_defn) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',shortest_path_properties) ).
fof(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3LfqPIZsjV/E---3.1_13843.p',sequential_defn) ).
fof(c_0_9,plain,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_defn]) ).
fof(c_0_10,negated_conjecture,
~ ( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ),
inference(assume_negation,[status(cth)],[back_edge]) ).
fof(c_0_11,plain,
! [X53,X54,X55,X56,X57,X58,X59] :
( ( path(X53,X54,X55)
| ~ shortest_path(X53,X54,X55) )
& ( X53 != X54
| ~ shortest_path(X53,X54,X55) )
& ( ~ path(X53,X54,X56)
| less_or_equal(length_of(X55),length_of(X56))
| ~ shortest_path(X53,X54,X55) )
& ( path(X57,X58,esk6_3(X57,X58,X59))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) )
& ( ~ less_or_equal(length_of(X59),length_of(esk6_3(X57,X58,X59)))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_12,negated_conjecture,
! [X95] :
( complete
& shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( ~ edge(X95)
| tail_of(X95) != head_of(esk12_0)
| head_of(X95) != tail_of(esk11_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_13,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ~ ( sequential(X7,X8)
<=> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[precedes_properties]) ).
fof(c_0_14,plain,
! [X33,X34,X35,X36] :
( ( vertex(X36)
| ~ path(X33,X34,X35)
| ~ in_path(X36,X35) )
& ( on_path(esk4_4(X33,X34,X35,X36),X35)
| ~ path(X33,X34,X35)
| ~ in_path(X36,X35) )
& ( X36 = head_of(esk4_4(X33,X34,X35,X36))
| X36 = tail_of(esk4_4(X33,X34,X35,X36))
| ~ path(X33,X34,X35)
| ~ in_path(X36,X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_path_properties])])])])]) ).
cnf(c_0_15,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X29,X30,X31,X32] :
( ( edge(X32)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(head_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(tail_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])])]) ).
fof(c_0_18,plain,
! [X46,X47,X48,X49,X50,X51] :
( ( on_path(X49,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( on_path(X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( ~ sequential(X49,X50)
| ~ sequential(X49,X51)
| ~ precedes(X51,X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( sequential(X49,esk5_3(X46,X49,X50))
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( precedes(esk5_3(X46,X49,X50),X50,X46)
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])])]) ).
fof(c_0_19,plain,
( complete
=> ! [X2,X3] :
( ( vertex(X2)
& vertex(X3)
& X2 != X3 )
=> ? [X1] :
( edge(X1)
& ~ ( ( X2 = head_of(X1)
& X3 = tail_of(X1) )
<=> ( X3 = head_of(X1)
& X2 = tail_of(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[complete_properties]) ).
cnf(c_0_20,plain,
( vertex(X1)
| ~ path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( in_path(tail_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( in_path(head_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X15,X16] :
( ( edge(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete )
& ( X15 != head_of(esk1_2(X15,X16))
| X16 != tail_of(esk1_2(X15,X16))
| X16 != head_of(esk1_2(X15,X16))
| X15 != tail_of(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete )
& ( X16 = head_of(esk1_2(X15,X16))
| X15 = head_of(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete )
& ( X15 = tail_of(esk1_2(X15,X16))
| X15 = head_of(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete )
& ( X16 = head_of(esk1_2(X15,X16))
| X16 = tail_of(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete )
& ( X15 = tail_of(esk1_2(X15,X16))
| X16 = tail_of(esk1_2(X15,X16))
| ~ vertex(X15)
| ~ vertex(X16)
| X15 = X16
| ~ complete ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])]) ).
cnf(c_0_28,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( in_path(tail_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( in_path(head_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_33,plain,
( X1 = tail_of(esk1_2(X1,X2))
| X2 = tail_of(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
( vertex(tail_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
fof(c_0_37,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) )
=> precedes(X7,X8,X4) ) ),
inference(fof_simplification,[status(thm)],[precedes_defn]) ).
fof(c_0_38,plain,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_properties]) ).
cnf(c_0_39,plain,
( X1 = head_of(esk1_2(X2,X1))
| X2 = head_of(esk1_2(X2,X1))
| X2 = X1
| ~ vertex(X2)
| ~ vertex(X1)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( vertex(head_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_42,plain,
( tail_of(esk1_2(X1,X2)) = X1
| tail_of(esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
vertex(tail_of(esk11_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_44,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( ~ sequential(X43,X44)
| ~ on_path(X43,X40)
| ~ on_path(X44,X40)
| precedes(X43,X44,X40)
| ~ path(X41,X42,X40) )
& ( ~ sequential(X43,X45)
| ~ precedes(X45,X44,X40)
| ~ on_path(X43,X40)
| ~ on_path(X44,X40)
| precedes(X43,X44,X40)
| ~ path(X41,X42,X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])]) ).
fof(c_0_45,plain,
! [X61,X62,X63,X64,X65,X66] :
( ( tail_of(X66) != tail_of(X63)
| head_of(X66) != head_of(X64)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) )
& ( ~ precedes(X64,X63,X65)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])])]) ).
cnf(c_0_46,plain,
( head_of(esk1_2(X1,X2)) = X2
| head_of(esk1_2(X1,X2)) = X1
| X2 = X1
| ~ vertex(X1)
| ~ vertex(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
vertex(head_of(esk12_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( X1 = tail_of(esk1_2(X1,X2))
| X1 = head_of(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_49,negated_conjecture,
( tail_of(esk1_2(X1,tail_of(esk11_0))) = tail_of(esk11_0)
| tail_of(esk1_2(X1,tail_of(esk11_0))) = X1
| X1 = tail_of(esk11_0)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( precedes(X1,X2,X3)
| ~ sequential(X1,X2)
| ~ on_path(X1,X3)
| ~ on_path(X2,X3)
| ~ path(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
( tail_of(X1) != tail_of(X2)
| head_of(X1) != head_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X2,X3,X6) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),X1)) = head_of(esk12_0)
| head_of(esk1_2(head_of(esk12_0),X1)) = X1
| X1 = head_of(esk12_0)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( tail_of(esk1_2(X1,X2)) = X1
| head_of(esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_34])]) ).
cnf(c_0_55,negated_conjecture,
( tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( precedes(X1,X2,esk13_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_21]) ).
cnf(c_0_57,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_16]) ).
fof(c_0_58,plain,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
inference(fof_simplification,[status(thm)],[sequential_defn]) ).
cnf(c_0_59,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_60,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ precedes(X3,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_16]) ).
cnf(c_0_61,plain,
( X1 = head_of(esk1_2(X2,X1))
| X1 = tail_of(esk1_2(X2,X1))
| X2 = X1
| ~ vertex(X2)
| ~ vertex(X1)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_62,negated_conjecture,
( ~ edge(X1)
| tail_of(X1) != head_of(esk12_0)
| head_of(X1) != tail_of(esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_63,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_43]) ).
cnf(c_0_64,negated_conjecture,
( tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_43]),c_0_47])]) ).
cnf(c_0_65,plain,
( edge(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_66,negated_conjecture,
( precedes(X1,esk11_0,esk13_0)
| ~ sequential(X1,esk11_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_67,negated_conjecture,
~ precedes(esk12_0,esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_57,c_0_24]) ).
fof(c_0_68,plain,
! [X38,X39] :
( ( edge(X38)
| ~ sequential(X38,X39) )
& ( edge(X39)
| ~ sequential(X38,X39) )
& ( X38 != X39
| ~ sequential(X38,X39) )
& ( head_of(X38) = tail_of(X39)
| ~ sequential(X38,X39) )
& ( ~ edge(X38)
| ~ edge(X39)
| X38 = X39
| head_of(X38) != tail_of(X39)
| sequential(X38,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])]) ).
cnf(c_0_69,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_21]) ).
cnf(c_0_70,negated_conjecture,
( head_of(X1) != head_of(esk12_0)
| tail_of(X1) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_24]) ).
cnf(c_0_71,plain,
( tail_of(esk1_2(X1,X2)) = X2
| head_of(esk1_2(X1,X2)) = X2
| X2 = X1
| ~ vertex(X1)
| ~ vertex(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_34])]) ).
cnf(c_0_72,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0)
| ~ edge(esk1_2(head_of(esk12_0),tail_of(esk11_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_73,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_34])]) ).
cnf(c_0_74,negated_conjecture,
~ sequential(esk12_0,esk11_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_41]),c_0_67]) ).
cnf(c_0_75,plain,
( X1 = X2
| sequential(X1,X2)
| ~ edge(X1)
| ~ edge(X2)
| head_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_76,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_69,c_0_36]) ).
cnf(c_0_77,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_69,c_0_41]) ).
cnf(c_0_78,negated_conjecture,
( head_of(esk1_2(X1,X2)) = X2
| X2 = X1
| head_of(esk1_2(X1,X2)) != head_of(esk12_0)
| X2 != tail_of(esk11_0)
| ~ vertex(X1)
| ~ vertex(X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_43]),c_0_47])]) ).
cnf(c_0_80,negated_conjecture,
( esk12_0 = esk11_0
| tail_of(esk11_0) != head_of(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_81,negated_conjecture,
tail_of(esk11_0) = head_of(esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_47]),c_0_43])]) ).
cnf(c_0_82,negated_conjecture,
head_of(esk12_0) != head_of(esk11_0),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_83,negated_conjecture,
esk12_0 = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GRA007+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Fri May 3 11:37:49 EDT 2024
% 0.13/0.37 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.3LfqPIZsjV/E---3.1_13843.p
% 1.40/0.72 # Version: 3.1.0
% 1.40/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.72 # Starting sh5l with 300s (1) cores
% 1.40/0.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13922 completed with status 0
% 1.40/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.40/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.72 # No SInE strategy applied
% 1.40/0.72 # Search class: FGHSF-FFMS32-SFFFFFNN
% 1.40/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.72 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.40/0.72 # Starting new_bool_3 with 136s (1) cores
% 1.40/0.72 # Starting new_bool_1 with 136s (1) cores
% 1.40/0.72 # Starting sh5l with 136s (1) cores
% 1.40/0.72 # G-E--_301_C18_F1_URBAN_S0Y with pid 13928 completed with status 0
% 1.40/0.72 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 1.40/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.72 # No SInE strategy applied
% 1.40/0.72 # Search class: FGHSF-FFMS32-SFFFFFNN
% 1.40/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.72 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 1.40/0.72 # Preprocessing time : 0.002 s
% 1.40/0.72
% 1.40/0.72 # Proof found!
% 1.40/0.72 # SZS status Theorem
% 1.40/0.72 # SZS output start CNFRefutation
% See solution above
% 1.40/0.72 # Parsed axioms : 19
% 1.40/0.72 # Removed by relevancy pruning/SinE : 0
% 1.40/0.72 # Initial clauses : 64
% 1.40/0.72 # Removed in clause preprocessing : 1
% 1.40/0.72 # Initial clauses in saturation : 63
% 1.40/0.72 # Processed clauses : 975
% 1.40/0.72 # ...of these trivial : 79
% 1.40/0.72 # ...subsumed : 203
% 1.40/0.72 # ...remaining for further processing : 693
% 1.40/0.72 # Other redundant clauses eliminated : 71
% 1.40/0.72 # Clauses deleted for lack of memory : 0
% 1.40/0.72 # Backward-subsumed : 37
% 1.40/0.72 # Backward-rewritten : 314
% 1.40/0.72 # Generated clauses : 6219
% 1.40/0.72 # ...of the previous two non-redundant : 5827
% 1.40/0.72 # ...aggressively subsumed : 0
% 1.40/0.72 # Contextual simplify-reflections : 65
% 1.40/0.72 # Paramodulations : 6053
% 1.40/0.72 # Factorizations : 54
% 1.40/0.72 # NegExts : 0
% 1.40/0.72 # Equation resolutions : 112
% 1.40/0.72 # Disequality decompositions : 0
% 1.40/0.72 # Total rewrite steps : 1589
% 1.40/0.72 # ...of those cached : 1572
% 1.40/0.72 # Propositional unsat checks : 0
% 1.40/0.72 # Propositional check models : 0
% 1.40/0.72 # Propositional check unsatisfiable : 0
% 1.40/0.72 # Propositional clauses : 0
% 1.40/0.72 # Propositional clauses after purity: 0
% 1.40/0.72 # Propositional unsat core size : 0
% 1.40/0.72 # Propositional preprocessing time : 0.000
% 1.40/0.72 # Propositional encoding time : 0.000
% 1.40/0.72 # Propositional solver time : 0.000
% 1.40/0.72 # Success case prop preproc time : 0.000
% 1.40/0.72 # Success case prop encoding time : 0.000
% 1.40/0.72 # Success case prop solver time : 0.000
% 1.40/0.72 # Current number of processed clauses : 340
% 1.40/0.72 # Positive orientable unit clauses : 15
% 1.40/0.72 # Positive unorientable unit clauses: 0
% 1.40/0.72 # Negative unit clauses : 2
% 1.40/0.72 # Non-unit-clauses : 323
% 1.40/0.72 # Current number of unprocessed clauses: 4743
% 1.40/0.72 # ...number of literals in the above : 33780
% 1.40/0.72 # Current number of archived formulas : 0
% 1.40/0.72 # Current number of archived clauses : 351
% 1.40/0.72 # Clause-clause subsumption calls (NU) : 42658
% 1.40/0.72 # Rec. Clause-clause subsumption calls : 6585
% 1.40/0.72 # Non-unit clause-clause subsumptions : 287
% 1.40/0.72 # Unit Clause-clause subsumption calls : 382
% 1.40/0.72 # Rewrite failures with RHS unbound : 0
% 1.40/0.72 # BW rewrite match attempts : 4
% 1.40/0.72 # BW rewrite match successes : 4
% 1.40/0.72 # Condensation attempts : 0
% 1.40/0.72 # Condensation successes : 0
% 1.40/0.72 # Termbank termtop insertions : 166583
% 1.40/0.72 # Search garbage collected termcells : 1276
% 1.40/0.72
% 1.40/0.72 # -------------------------------------------------
% 1.40/0.72 # User time : 0.202 s
% 1.40/0.72 # System time : 0.009 s
% 1.40/0.72 # Total time : 0.211 s
% 1.40/0.72 # Maximum resident set size: 1900 pages
% 1.40/0.72
% 1.40/0.72 # -------------------------------------------------
% 1.40/0.72 # User time : 1.017 s
% 1.40/0.72 # System time : 0.018 s
% 1.40/0.72 # Total time : 1.035 s
% 1.40/0.72 # Maximum resident set size: 1724 pages
% 1.40/0.72 % E---3.1 exiting
% 1.40/0.72 % E exiting
%------------------------------------------------------------------------------