%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA006+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : 600s
% DateTime : Sat Jul 16 07:15:23 EDT 2022
% Result : Theorem 8.94s 2.55s
% Output : CNFRefutation 8.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 16 unt; 0 def)
% Number of atoms : 386 ( 132 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 501 ( 196 ~; 218 |; 66 &)
% ( 2 <=>; 14 =>; 1 <=; 4 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 181 ( 24 sgn 82 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(edge_some_way,conjecture,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ? [X9] :
( edge(X9)
& tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
<~> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',edge_some_way) ).
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/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
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/benchmark/Axioms/GRA001+0.ax',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/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
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/benchmark/Axioms/GRA001+0.ax',precedes_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/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
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/benchmark/Axioms/GRA001+0.ax',shortest_path_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/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
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/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',no_loops) ).
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) = tail_of(X7)
& head_of(X9) = head_of(X8) )
<~> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ) ),
inference(assume_negation,[status(cth)],[edge_some_way]) ).
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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[shortest_path_defn])])])])])]) ).
fof(c_0_12,negated_conjecture,
! [X89,X91] :
( complete
& shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( edge(esk14_0)
| ~ edge(X89)
| tail_of(X89) != tail_of(esk11_0)
| head_of(X89) != head_of(esk12_0) )
& ( tail_of(esk14_0) = head_of(esk12_0)
| ~ edge(X89)
| tail_of(X89) != tail_of(esk11_0)
| head_of(X89) != head_of(esk12_0) )
& ( head_of(esk14_0) = tail_of(esk11_0)
| ~ edge(X89)
| tail_of(X89) != tail_of(esk11_0)
| head_of(X89) != head_of(esk12_0) )
& ( edge(esk15_0)
| ~ edge(X91)
| tail_of(X91) != head_of(esk12_0)
| head_of(X91) != tail_of(esk11_0) )
& ( tail_of(esk15_0) = tail_of(esk11_0)
| ~ edge(X91)
| tail_of(X91) != head_of(esk12_0)
| head_of(X91) != tail_of(esk11_0) )
& ( head_of(esk15_0) = head_of(esk12_0)
| ~ edge(X91)
| tail_of(X91) != head_of(esk12_0)
| head_of(X91) != tail_of(esk11_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])])])]) ).
fof(c_0_13,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_path_properties])])])]) ).
cnf(c_0_14,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
fof(c_0_17,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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[precedes_properties])])])])])])]) ).
cnf(c_0_18,plain,
( vertex(X1)
| ~ path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in_path(head_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[complete_properties])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( in_path(head_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( in_path(tail_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_29,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(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[shortest_path_properties])])])])]) ).
cnf(c_0_30,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_23]) ).
cnf(c_0_31,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
( vertex(head_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( in_path(tail_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_36,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_29]) ).
cnf(c_0_37,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_30,c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
vertex(head_of(esk12_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( vertex(tail_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_41,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_36,c_0_15]) ).
cnf(c_0_42,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_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
vertex(tail_of(esk11_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
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(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[precedes_defn])])])])]) ).
cnf(c_0_45,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_23]) ).
cnf(c_0_46,plain,
( edge(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_47,negated_conjecture,
( head_of(X1) != head_of(esk12_0)
| tail_of(X1) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_48,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)
| head_of(esk12_0) = tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,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_23]) ).
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_29]) ).
cnf(c_0_52,negated_conjecture,
( head_of(esk15_0) = head_of(esk12_0)
| ~ 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_53,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_45,c_0_31])]) ).
cnf(c_0_54,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_31])]) ).
cnf(c_0_55,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,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_49,c_0_31])]) ).
cnf(c_0_57,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_19]) ).
cnf(c_0_58,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_15]) ).
cnf(c_0_59,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_60,negated_conjecture,
( head_of(esk15_0) = head_of(esk12_0)
| head_of(esk1_2(X1,X2)) = X1
| X1 = X2
| head_of(esk1_2(X1,X2)) != tail_of(esk11_0)
| X1 != head_of(esk12_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_38]),c_0_43])]) ).
cnf(c_0_62,negated_conjecture,
( precedes(X1,esk11_0,esk13_0)
| ~ sequential(X1,esk11_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_40]) ).
cnf(c_0_63,negated_conjecture,
~ precedes(esk12_0,esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_58,c_0_22]) ).
fof(c_0_64,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_defn])])]) ).
cnf(c_0_65,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_19]) ).
cnf(c_0_66,negated_conjecture,
( tail_of(esk15_0) = tail_of(esk11_0)
| ~ 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_67,negated_conjecture,
( head_of(esk12_0) = tail_of(esk11_0)
| head_of(esk15_0) = head_of(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_43]),c_0_38])]) ).
cnf(c_0_68,negated_conjecture,
~ sequential(esk12_0,esk11_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_33]),c_0_63]) ).
cnf(c_0_69,plain,
( X1 = X2
| sequential(X1,X2)
| ~ edge(X1)
| ~ edge(X2)
| head_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_65,c_0_40]) ).
cnf(c_0_71,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_65,c_0_33]) ).
cnf(c_0_72,negated_conjecture,
( tail_of(esk15_0) = tail_of(esk11_0)
| head_of(esk1_2(X1,X2)) = X1
| X1 = X2
| head_of(esk1_2(X1,X2)) != tail_of(esk11_0)
| X1 != head_of(esk12_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_53]),c_0_54]) ).
cnf(c_0_73,negated_conjecture,
( head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk15_0) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_67]) ).
fof(c_0_74,plain,
! [X13] :
( ~ edge(X13)
| head_of(X13) != tail_of(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[no_loops])]) ).
cnf(c_0_75,negated_conjecture,
( esk12_0 = esk11_0
| head_of(esk12_0) != tail_of(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71])]) ).
cnf(c_0_76,negated_conjecture,
head_of(esk12_0) = tail_of(esk11_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_61]),c_0_43]),c_0_38])]),c_0_73]) ).
cnf(c_0_77,plain,
( ~ edge(X1)
| head_of(X1) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_78,negated_conjecture,
esk12_0 = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_79,negated_conjecture,
tail_of(esk11_0) != head_of(esk11_0),
inference(spm,[status(thm)],[c_0_77,c_0_70]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_78]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRA006+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue May 31 02:16:31 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.94/2.55 # ENIGMATIC: Solved by autoschedule:
% 8.94/2.55 # No SInE strategy applied
% 8.94/2.55 # Trying AutoSched0 for 150 seconds
% 8.94/2.55 # AutoSched0-Mode selected heuristic G_E___207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 8.94/2.55 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.94/2.55 #
% 8.94/2.55 # Preprocessing time : 0.028 s
% 8.94/2.55 # Presaturation interreduction done
% 8.94/2.55
% 8.94/2.55 # Proof found!
% 8.94/2.55 # SZS status Theorem
% 8.94/2.55 # SZS output start CNFRefutation
% See solution above
% 8.94/2.55 # Training examples: 0 positive, 0 negative
% 8.94/2.55
% 8.94/2.55 # -------------------------------------------------
% 8.94/2.55 # User time : 0.158 s
% 8.94/2.55 # System time : 0.011 s
% 8.94/2.55 # Total time : 0.169 s
% 8.94/2.55 # Maximum resident set size: 7120 pages
% 8.94/2.55
%------------------------------------------------------------------------------