%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA002+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:31:50 PM UTC 2026
% Result : Theorem 84.52s 12.78s
% Output : CNFRefutation 84.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of formulae : 122 ( 25 unt; 0 def)
% Number of atoms : 495 ( 168 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 603 ( 230 ~; 263 |; 78 &)
% ( 6 <=>; 24 =>; 1 <=; 1 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-4 aty)
% Number of variables : 247 ( 33 sgn 117 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(maximal_path_length,conjecture,
( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length) ).
fof(length_defn,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',length_defn) ).
fof(path_length_sequential_pairs,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> number_of_in(sequential_pairs,X4) = minus(length_of(X4),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( ! [X7,X8] :
( ( sequential(X7,X8)
& on_path(X8,X4)
& on_path(X7,X4) )
=> ? [X9] : triangle(X7,X8,X9) )
& path(X2,X3,X4) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( on_path(X1,X4)
& path(X2,X3,X4) )
=> ( in_path(tail_of(X1),X4)
& in_path(head_of(X1),X4)
& edge(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(graph_has_them_all,axiom,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( ~ precedes(X8,X7,X4)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(complete_properties,axiom,
( complete
=> ! [X2,X3] :
( ( X2 != X3
& vertex(X3)
& vertex(X2) )
=> ? [X1] :
( ( ( X3 = tail_of(X1)
& X2 = head_of(X1) )
<~> ( X2 = tail_of(X1)
& X3 = head_of(X1) ) )
& edge(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
fof(in_path_properties,axiom,
! [X2,X3,X4,X6] :
( ( in_path(X6,X4)
& path(X2,X3,X4) )
=> ( ? [X1] :
( ( X6 = tail_of(X1)
| X6 = head_of(X1) )
& on_path(X1,X4) )
& vertex(X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',in_path_properties) ).
fof(edge_ends_are_vertices,axiom,
! [X1] :
( edge(X1)
=> ( vertex(tail_of(X1))
& vertex(head_of(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',edge_ends_are_vertices) ).
fof(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(triangle_defn,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( sequential(X9,X7)
& sequential(X8,X9)
& sequential(X7,X8)
& edge(X9)
& edge(X8)
& edge(X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',triangle_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_15,plain,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_defn]) ).
fof(c_0_16,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
inference(assume_negation,[status(cth)],[maximal_path_length]) ).
fof(c_0_17,plain,
! [X53,X54,X55,X56,X57,X58,X59] :
( ( shortest_path(X57,X58,X59)
| X57 = X58
| ~ path(X57,X58,X59)
| ~ less_or_equal(length_of(X59),length_of(esk6_3(X57,X58,X59))) )
& ( shortest_path(X57,X58,X59)
| X57 = X58
| ~ path(X57,X58,X59)
| path(X57,X58,esk6_3(X57,X58,X59)) )
& ( ~ shortest_path(X53,X54,X55)
| less_or_equal(length_of(X55),length_of(X56))
| ~ path(X53,X54,X56) )
& ( ~ shortest_path(X53,X54,X55)
| X53 != X54 )
& ( ~ shortest_path(X53,X54,X55)
| path(X53,X54,X55) ) ),
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_15])])])])])])]) ).
fof(c_0_18,negated_conjecture,
( ~ less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph))
& shortest_path(esk10_0,esk11_0,esk9_0)
& complete ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_19,plain,
! [X70,X71,X72] :
( length_of(X72) = number_of_in(edges,X72)
| ~ path(X70,X71,X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[length_defn])])]) ).
cnf(c_0_20,plain,
( ~ shortest_path(X1,X2,X3)
| path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
shortest_path(esk10_0,esk11_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X73,X74,X75] :
( number_of_in(sequential_pairs,X75) = minus(length_of(X75),n1)
| ~ path(X73,X74,X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[path_length_sequential_pairs])])]) ).
cnf(c_0_23,plain,
( ~ path(X1,X2,X3)
| length_of(X3) = number_of_in(edges,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
path(esk10_0,esk11_0,esk9_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X76,X77,X78,X81] :
( ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| ~ triangle(esk7_1(X76),esk8_1(X76),X81) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| sequential(esk7_1(X76),esk8_1(X76)) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| on_path(esk8_1(X76),X76) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| on_path(esk7_1(X76),X76) ) ),
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)],[sequential_pairs_and_triangles])])])])])])]) ).
cnf(c_0_26,plain,
( ~ path(X1,X2,X3)
| number_of_in(sequential_pairs,X3) = minus(length_of(X3),n1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
length_of(esk9_0) = number_of_in(edges,esk9_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) )
=> precedes(X7,X8,X4) ) ),
inference(fof_simplification,[status(thm)],[precedes_defn]) ).
fof(c_0_29,plain,
! [X29,X30,X31,X32] :
( ( ~ on_path(X32,X31)
| ~ path(X29,X30,X31)
| in_path(tail_of(X32),X31) )
& ( ~ on_path(X32,X31)
| ~ path(X29,X30,X31)
| in_path(head_of(X32),X31) )
& ( ~ on_path(X32,X31)
| ~ path(X29,X30,X31)
| edge(X32) ) ),
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_30,plain,
! [X82,X83] : less_or_equal(number_of_in(X82,X83),number_of_in(X82,graph)),
inference(variable_rename,[status(thm)],[graph_has_them_all]) ).
cnf(c_0_31,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk8_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
~ less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,negated_conjecture,
minus(number_of_in(edges,esk9_0),n1) = number_of_in(sequential_pairs,esk9_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27]) ).
fof(c_0_34,plain,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( ~ precedes(X8,X7,X4)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_properties]) ).
fof(c_0_35,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( ~ path(X41,X42,X40)
| precedes(X43,X44,X40)
| ~ on_path(X44,X40)
| ~ on_path(X43,X40)
| ~ precedes(X45,X44,X40)
| ~ sequential(X43,X45) )
& ( ~ path(X41,X42,X40)
| precedes(X43,X44,X40)
| ~ on_path(X44,X40)
| ~ on_path(X43,X40)
| ~ sequential(X43,X44) ) ),
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_28])])])])]) ).
fof(c_0_36,plain,
( complete
=> ! [X2,X3] :
( ( X2 != X3
& vertex(X3)
& vertex(X2) )
=> ? [X1] :
( ~ ( ( X3 = tail_of(X1)
& X2 = head_of(X1) )
<=> ( X2 = tail_of(X1)
& X3 = head_of(X1) ) )
& edge(X1) ) ) ),
inference(fof_simplification,[status(thm)],[complete_properties]) ).
cnf(c_0_37,plain,
( ~ on_path(X1,X4)
| ~ path(X2,X3,X4)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( on_path(esk8_1(esk9_0),esk9_0)
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk9_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_33]) ).
fof(c_0_41,plain,
! [X33,X34,X35,X36] :
( ( ~ in_path(X36,X35)
| ~ path(X33,X34,X35)
| X36 = tail_of(esk4_4(X33,X34,X35,X36))
| X36 = head_of(esk4_4(X33,X34,X35,X36)) )
& ( ~ in_path(X36,X35)
| ~ path(X33,X34,X35)
| on_path(esk4_4(X33,X34,X35,X36),X35) )
& ( ~ in_path(X36,X35)
| ~ path(X33,X34,X35)
| vertex(X36) ) ),
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])])])])]) ).
fof(c_0_42,plain,
! [X61,X62,X63,X64,X65,X66] :
( ( ~ precedes(X63,X64,X65)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X64,X63,X65) )
& ( ~ precedes(X63,X64,X65)
| ~ shortest_path(X61,X62,X65)
| head_of(X66) != head_of(X64)
| tail_of(X66) != tail_of(X63) ) ),
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_34])])])])]) ).
cnf(c_0_43,plain,
( ~ path(X4,X5,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_44,plain,
! [X15,X16] :
( ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| X16 = tail_of(esk1_2(X15,X16))
| X15 = tail_of(esk1_2(X15,X16)) )
& ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| X16 = tail_of(esk1_2(X15,X16))
| X16 = head_of(esk1_2(X15,X16)) )
& ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| X15 = head_of(esk1_2(X15,X16))
| X15 = tail_of(esk1_2(X15,X16)) )
& ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| X15 = head_of(esk1_2(X15,X16))
| X16 = head_of(esk1_2(X15,X16)) )
& ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| X15 != tail_of(esk1_2(X15,X16))
| X16 != head_of(esk1_2(X15,X16))
| X16 != tail_of(esk1_2(X15,X16))
| X15 != head_of(esk1_2(X15,X16)) )
& ( ~ complete
| X15 = X16
| ~ vertex(X16)
| ~ vertex(X15)
| edge(esk1_2(X15,X16)) ) ),
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_36])])])])])]) ).
fof(c_0_45,plain,
! [X14] :
( ( ~ edge(X14)
| vertex(tail_of(X14)) )
& ( ~ edge(X14)
| vertex(head_of(X14)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[edge_ends_are_vertices])])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ on_path(X1,esk9_0)
| edge(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
on_path(esk8_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( ~ in_path(X1,X4)
| ~ path(X2,X3,X4)
| vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
( ~ on_path(X1,X2)
| ~ path(X3,X4,X2)
| in_path(tail_of(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_50,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_51,plain,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
inference(fof_simplification,[status(thm)],[sequential_defn]) ).
cnf(c_0_52,plain,
( ~ precedes(X2,X3,X6)
| ~ shortest_path(X4,X5,X6)
| head_of(X1) != head_of(X3)
| tail_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( ~ on_path(X1,esk9_0)
| ~ on_path(X2,esk9_0)
| ~ sequential(X1,X2)
| precedes(X1,X2,esk9_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_54,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk7_1(X1),esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_55,plain,
( ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| X1 = X2
| X2 = tail_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_56,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_57,plain,
( ~ edge(X1)
| vertex(head_of(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_58,negated_conjecture,
edge(esk8_1(esk9_0)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_59,negated_conjecture,
( ~ in_path(X1,esk9_0)
| vertex(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_24]) ).
cnf(c_0_60,negated_conjecture,
( ~ on_path(X1,esk9_0)
| in_path(tail_of(X1),esk9_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_61,negated_conjecture,
( on_path(esk7_1(esk9_0),esk9_0)
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_24]) ).
fof(c_0_62,plain,
! [X67,X68,X69] :
( ( triangle(X67,X68,X69)
| ~ sequential(X69,X67)
| ~ sequential(X68,X69)
| ~ sequential(X67,X68)
| ~ edge(X69)
| ~ edge(X68)
| ~ edge(X67) )
& ( ~ triangle(X67,X68,X69)
| sequential(X69,X67) )
& ( ~ triangle(X67,X68,X69)
| sequential(X68,X69) )
& ( ~ triangle(X67,X68,X69)
| sequential(X67,X68) )
& ( ~ triangle(X67,X68,X69)
| edge(X69) )
& ( ~ triangle(X67,X68,X69)
| edge(X68) )
& ( ~ triangle(X67,X68,X69)
| edge(X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[triangle_defn])])])]) ).
fof(c_0_63,plain,
! [X38,X39] :
( ( sequential(X38,X39)
| head_of(X38) != tail_of(X39)
| X38 = X39
| ~ edge(X39)
| ~ edge(X38) )
& ( ~ sequential(X38,X39)
| head_of(X38) = tail_of(X39) )
& ( ~ sequential(X38,X39)
| X38 != X39 )
& ( ~ sequential(X38,X39)
| edge(X39) )
& ( ~ sequential(X38,X39)
| edge(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])])]) ).
cnf(c_0_64,negated_conjecture,
( ~ precedes(X3,X2,esk9_0)
| tail_of(X1) != tail_of(X3)
| head_of(X1) != head_of(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_21]) ).
cnf(c_0_65,negated_conjecture,
( ~ on_path(X1,esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| precedes(X1,esk8_1(esk9_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_47]) ).
cnf(c_0_66,negated_conjecture,
( sequential(esk7_1(esk9_0),esk8_1(esk9_0))
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_24]) ).
cnf(c_0_67,plain,
( ~ vertex(X1)
| ~ vertex(X2)
| X1 = X2
| tail_of(esk1_2(X1,X2)) = X2
| tail_of(esk1_2(X1,X2)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_68,negated_conjecture,
vertex(head_of(esk8_1(esk9_0))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_69,negated_conjecture,
( ~ on_path(X1,esk9_0)
| vertex(tail_of(X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_70,negated_conjecture,
on_path(esk7_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_61]),c_0_40]) ).
cnf(c_0_71,plain,
( ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1)
| triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_72,plain,
( ~ sequential(X1,X2)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
fof(c_0_73,plain,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
inference(fof_simplification,[status(thm)],[no_loops]) ).
cnf(c_0_74,negated_conjecture,
( ~ on_path(X2,esk9_0)
| ~ sequential(X2,esk8_1(esk9_0))
| tail_of(X1) != tail_of(X2)
| head_of(X1) != head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_75,negated_conjecture,
sequential(esk7_1(esk9_0),esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_66]),c_0_40]) ).
cnf(c_0_76,negated_conjecture,
( ~ vertex(X1)
| X1 = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = X1
| tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,negated_conjecture,
vertex(tail_of(esk7_1(esk9_0))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_78,plain,
( ~ path(X3,X4,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X2)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_79,plain,
( ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_71,c_0_72]),c_0_72]),c_0_72]) ).
cnf(c_0_80,plain,
( head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1)
| sequential(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_81,plain,
( ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| X1 = X2
| edge(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_82,plain,
! [X13] :
( head_of(X13) != tail_of(X13)
| ~ edge(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])]) ).
cnf(c_0_83,negated_conjecture,
( tail_of(X1) != tail_of(esk7_1(esk9_0))
| head_of(X1) != head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_70])]) ).
cnf(c_0_84,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,plain,
( ~ path(X3,X4,X1)
| ~ sequential(esk8_1(X1),X2)
| ~ sequential(X2,esk7_1(X1))
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_54]) ).
cnf(c_0_86,negated_conjecture,
( ~ edge(X1)
| tail_of(X1) != head_of(esk8_1(esk9_0))
| sequential(esk8_1(esk9_0),X1)
| esk8_1(esk9_0) = X1 ),
inference(spm,[status(thm)],[c_0_80,c_0_58]) ).
cnf(c_0_87,plain,
( ~ vertex(X1)
| ~ vertex(X2)
| edge(esk1_2(X1,X2))
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_56])]) ).
cnf(c_0_88,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_89,negated_conjecture,
( head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( ~ path(X2,X3,esk9_0)
| ~ sequential(X1,esk7_1(esk9_0))
| tail_of(X1) != head_of(esk8_1(esk9_0))
| esk8_1(esk9_0) = X1
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_72]) ).
cnf(c_0_91,plain,
( ~ edge(X3)
| ~ vertex(X1)
| ~ vertex(X2)
| tail_of(X3) != head_of(esk1_2(X1,X2))
| sequential(esk1_2(X1,X2),X3)
| X1 = X2
| esk1_2(X1,X2) = X3 ),
inference(spm,[status(thm)],[c_0_80,c_0_87]) ).
cnf(c_0_92,negated_conjecture,
edge(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_46,c_0_70]) ).
cnf(c_0_93,plain,
( ~ complete
| ~ vertex(X1)
| ~ vertex(X2)
| X2 = X1
| X1 = tail_of(esk1_2(X2,X1))
| X1 = head_of(esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_94,negated_conjecture,
( ~ edge(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,negated_conjecture,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ path(X3,X4,esk9_0)
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| X1 = X2
| esk8_1(esk9_0) = esk1_2(X1,X2)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_96,plain,
( ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| X1 = X2
| X1 = head_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_97,plain,
( ~ vertex(X2)
| ~ vertex(X1)
| X2 = X1
| head_of(esk1_2(X1,X2)) = X2
| tail_of(esk1_2(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_56])]) ).
cnf(c_0_98,negated_conjecture,
( head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_87]),c_0_68]),c_0_77])]) ).
cnf(c_0_99,negated_conjecture,
( ~ vertex(X1)
| ~ vertex(X2)
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| X1 = X2
| esk1_2(X1,X2) = esk7_1(esk9_0)
| esk8_1(esk9_0) = esk1_2(X1,X2)
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(spm,[status(thm)],[c_0_95,c_0_24]) ).
cnf(c_0_100,plain,
( ~ vertex(X1)
| ~ vertex(X2)
| X1 = X2
| head_of(esk1_2(X1,X2)) = X1
| tail_of(esk1_2(X1,X2)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_56])]) ).
cnf(c_0_101,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_84]),c_0_77]),c_0_68])]),c_0_98]) ).
cnf(c_0_102,plain,
( ~ sequential(X1,X2)
| head_of(X1) = tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_103,plain,
( ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_104,negated_conjecture,
( ~ vertex(X1)
| ~ vertex(X2)
| X2 != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| X1 = X2
| head_of(esk1_2(X1,X2)) = X2
| esk8_1(esk9_0) = esk1_2(X1,X2)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(spm,[status(thm)],[c_0_99,c_0_97]) ).
cnf(c_0_105,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_68]),c_0_77])]) ).
cnf(c_0_106,negated_conjecture,
tail_of(esk8_1(esk9_0)) = head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_102,c_0_75]) ).
cnf(c_0_107,negated_conjecture,
( ~ precedes(X2,X1,esk9_0)
| ~ precedes(X1,X2,esk9_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_21]) ).
cnf(c_0_108,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0)
| esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk8_1(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_68]),c_0_77])]) ).
cnf(c_0_109,negated_conjecture,
tail_of(esk7_1(esk9_0)) != head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_83,c_0_106]) ).
cnf(c_0_110,negated_conjecture,
( ~ on_path(X1,esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| ~ precedes(esk8_1(esk9_0),X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_65]) ).
cnf(c_0_111,negated_conjecture,
( ~ on_path(X1,esk9_0)
| ~ sequential(X1,esk7_1(esk9_0))
| precedes(X1,esk7_1(esk9_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_70]) ).
cnf(c_0_112,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_108]),c_0_106]),c_0_68]),c_0_77])]),c_0_109]) ).
cnf(c_0_113,negated_conjecture,
head_of(esk8_1(esk9_0)) != head_of(esk7_1(esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_106]),c_0_58])]) ).
cnf(c_0_114,negated_conjecture,
~ sequential(esk8_1(esk9_0),esk7_1(esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_75]),c_0_70]),c_0_47])]) ).
cnf(c_0_115,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_112]),c_0_77]),c_0_68])]),c_0_113]) ).
cnf(c_0_116,negated_conjecture,
( tail_of(esk7_1(esk9_0)) != head_of(esk8_1(esk9_0))
| esk8_1(esk9_0) = esk7_1(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_86]),c_0_92])]) ).
cnf(c_0_117,negated_conjecture,
tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_115]),c_0_40]) ).
cnf(c_0_118,plain,
( ~ sequential(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_119,negated_conjecture,
esk8_1(esk9_0) = esk7_1(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117])]) ).
cnf(c_0_120,plain,
~ sequential(X1,X1),
inference(er,[status(thm)],[c_0_118]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_119]),c_0_120]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA002+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 18:16:20 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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/benchmark/theBenchmark.p
% 84.52/12.78 % Version: 3.5.1
% 84.52/12.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 84.52/12.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.52/12.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 84.52/12.78 % Starting new_bool_3 with 300s (1) cores
% 84.52/12.78 % Starting new_bool_1 with 300s (1) cores
% 84.52/12.78 % Starting sh5l with 300s (1) cores
% 84.52/12.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 653227 completed with status 0
% 84.52/12.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 84.52/12.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 84.52/12.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.52/12.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 84.52/12.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 84.52/12.78 % No SInE strategy applied
% 84.52/12.78 % Search class: FGHSF-FFMF32-SFFFFFNN
% 84.52/12.78 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 84.52/12.78 % Starting SubtermCWHack with 151s (1) cores
% 84.52/12.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 84.52/12.78 % Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 84.52/12.78 % Starting new_bool_3 with 151s (1) cores
% 84.52/12.78 % Starting new_bool_1 with 146s (1) cores
% 84.52/12.78 % G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 653236 completed with status 0
% 84.52/12.78 % Result found by G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 84.52/12.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 84.52/12.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.52/12.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 84.52/12.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 84.52/12.78 % No SInE strategy applied
% 84.52/12.78 % Search class: FGHSF-FFMF32-SFFFFFNN
% 84.52/12.78 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 84.52/12.78 % Starting SubtermCWHack with 151s (1) cores
% 84.52/12.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 84.52/12.78 % Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 84.52/12.78 % Preprocessing time : 0.002 s
% 84.52/12.78 % Presaturation interreduction done
% 84.52/12.78
% 84.52/12.78 % Proof found!
% 84.52/12.78 % SZS status Theorem
% 84.52/12.78 % SZS output start CNFRefutation
% See solution above
% 84.52/12.79 % Parsed axioms : 18
% 84.52/12.79 % Removed by relevancy pruning/SinE : 0
% 84.52/12.79 % Initial clauses : 62
% 84.52/12.79 % Removed in clause preprocessing : 1
% 84.52/12.79 % Initial clauses in saturation : 61
% 84.52/12.79 % Processed clauses : 19401
% 84.52/12.79 % ...of these trivial : 597
% 84.52/12.79 % ...subsumed : 12584
% 84.52/12.79 % ...remaining for further processing : 6220
% 84.52/12.79 % Other redundant clauses eliminated : 1320
% 84.52/12.79 % Clauses deleted for lack of memory : 0
% 84.52/12.79 % Backward-subsumed : 1347
% 84.52/12.79 % Backward-rewritten : 1707
% 84.52/12.79 % Generated clauses : 240203
% 84.52/12.79 % ...of the previous two non-redundant : 227008
% 84.52/12.79 % ...aggressively subsumed : 0
% 84.52/12.79 % Contextual simplify-reflections : 1301
% 84.52/12.79 % Paramodulations : 237805
% 84.52/12.79 % Factorizations : 252
% 84.52/12.79 % NegExts : 0
% 84.52/12.79 % Equation resolutions : 2123
% 84.52/12.79 % Disequality decompositions : 0
% 84.52/12.79 % Total rewrite steps : 36503
% 84.52/12.79 % ...of those cached : 36482
% 84.52/12.79 % Propositional unsat checks : 0
% 84.52/12.79 % Propositional check models : 0
% 84.52/12.79 % Propositional check unsatisfiable : 0
% 84.52/12.79 % Propositional clauses : 0
% 84.52/12.79 % Propositional clauses after purity: 0
% 84.52/12.79 % Propositional unsat core size : 0
% 84.52/12.79 % Propositional preprocessing time : 0.000
% 84.52/12.79 % Propositional encoding time : 0.000
% 84.52/12.79 % Propositional solver time : 0.000
% 84.52/12.79 % Success case prop preproc time : 0.000
% 84.52/12.79 % Success case prop encoding time : 0.000
% 84.52/12.79 % Success case prop solver time : 0.000
% 84.52/12.79 % Current number of processed clauses : 3092
% 84.52/12.79 % Positive orientable unit clauses : 16
% 84.52/12.79 % Positive unorientable unit clauses: 0
% 84.52/12.79 % Negative unit clauses : 15
% 84.52/12.79 % Non-unit-clauses : 3061
% 84.52/12.79 % Current number of unprocessed clauses: 202019
% 84.52/12.79 % ...number of literals in the above : 2173469
% 84.52/12.79 % Current number of archived formulas : 0
% 84.52/12.79 % Current number of archived clauses : 3115
% 84.52/12.79 % Clause-clause subsumption calls (NU) : 3830078
% 84.52/12.79 % Rec. Clause-clause subsumption calls : 73487
% 84.52/12.79 % Non-unit clause-clause subsumptions : 14657
% 84.52/12.79 % Unit Clause-clause subsumption calls : 16806
% 84.52/12.79 % Rewrite failures with RHS unbound : 0
% 84.52/12.79 % BW rewrite match attempts : 6
% 84.52/12.79 % BW rewrite match successes : 6
% 84.52/12.79 % Condensation attempts : 0
% 84.52/12.79 % Condensation successes : 0
% 84.52/12.79 % Termbank termtop insertions : 10239220
% 84.52/12.79 % Search garbage collected termcells : 1183
% 84.52/12.79
% 84.52/12.79 % -------------------------------------------------
% 84.52/12.79 % User time : 11.412 s
% 84.52/12.79 % System time : 0.206 s
% 84.52/12.79 % Total time : 11.618 s
% 84.52/12.79 % Maximum resident set size: 3668 pages
% 84.52/12.79
% 84.52/12.79 % -------------------------------------------------
% 84.52/12.79 % User time : 58.513 s
% 84.52/12.79 % System time : 1.510 s
% 84.52/12.79 % Total time : 60.023 s
% 84.52/12.79 % Maximum resident set size: 4608 pages
% 84.52/12.79 % E exiting
%------------------------------------------------------------------------------