TSTP Solution File: GRA002+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRA002+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:35:31 EDT 2023
% Result : Theorem 72.76s 9.82s
% Output : CNFRefutation 72.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of formulae : 119 ( 25 unt; 0 def)
% Number of atoms : 483 ( 164 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 591 ( 227 ~; 263 |; 73 &)
% ( 4 <=>; 22 =>; 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 : 240 ( 33 sgn; 110 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',maximal_path_length) ).
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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',shortest_path_defn) ).
fof(length_defn,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
file('/export/starexec/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',path_length_sequential_pairs) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',sequential_pairs_and_triangles) ).
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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',precedes_defn) ).
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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',graph_has_them_all) ).
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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',shortest_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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',complete_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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',in_path_properties) ).
fof(edge_ends_are_vertices,axiom,
! [X1] :
( edge(X1)
=> ( vertex(head_of(X1))
& vertex(tail_of(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',edge_ends_are_vertices) ).
fof(triangle_defn,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( edge(X7)
& edge(X8)
& edge(X9)
& sequential(X7,X8)
& sequential(X8,X9)
& sequential(X9,X7) ) ),
file('/export/starexec/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',triangle_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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',sequential_defn) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p',no_loops) ).
fof(c_0_15,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_16,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_17,negated_conjecture,
( complete
& shortest_path(esk10_0,esk11_0,esk9_0)
& ~ less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_18,plain,
! [X70,X71,X72] :
( ~ path(X70,X71,X72)
| length_of(X72) = number_of_in(edges,X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[length_defn])]) ).
cnf(c_0_19,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
shortest_path(esk10_0,esk11_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X73,X74,X75] :
( ~ path(X73,X74,X75)
| number_of_in(sequential_pairs,X75) = minus(length_of(X75),n1) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[path_length_sequential_pairs])]) ).
cnf(c_0_22,plain,
( length_of(X3) = number_of_in(edges,X3)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
path(esk10_0,esk11_0,esk9_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X76,X77,X78,X81] :
( ( on_path(esk7_1(X76),X76)
| ~ path(X77,X78,X76)
| number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76) )
& ( on_path(esk8_1(X76),X76)
| ~ path(X77,X78,X76)
| number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76) )
& ( sequential(esk7_1(X76),esk8_1(X76))
| ~ path(X77,X78,X76)
| number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76) )
& ( ~ triangle(esk7_1(X76),esk8_1(X76),X81)
| ~ path(X77,X78,X76)
| number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76) ) ),
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)],[sequential_pairs_and_triangles])])])])])]) ).
cnf(c_0_25,plain,
( number_of_in(sequential_pairs,X3) = minus(length_of(X3),n1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
length_of(esk9_0) = number_of_in(edges,esk9_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,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_28,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_29,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_30,plain,
( on_path(esk8_1(X1),X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
~ less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,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_25,c_0_23]),c_0_26]) ).
fof(c_0_33,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]) ).
fof(c_0_34,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)],[c_0_27])])])]) ).
fof(c_0_35,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_36,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| on_path(esk8_1(esk9_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_39,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_31,c_0_26]),c_0_32]) ).
fof(c_0_40,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])])])]) ).
fof(c_0_41,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)],[c_0_33])])])]) ).
cnf(c_0_42,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_34]) ).
fof(c_0_43,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)],[c_0_35])])])])]) ).
fof(c_0_44,plain,
! [X14] :
( ( vertex(head_of(X14))
| ~ edge(X14) )
& ( vertex(tail_of(X14))
| ~ edge(X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[edge_ends_are_vertices])])]) ).
cnf(c_0_45,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_46,negated_conjecture,
on_path(esk8_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_47,plain,
( vertex(X1)
| ~ path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( in_path(tail_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_49,plain,
( on_path(esk7_1(X1),X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_50,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_41]) ).
cnf(c_0_51,negated_conjecture,
( precedes(X1,X2,esk9_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk9_0)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_52,plain,
( sequential(esk7_1(X1),esk8_1(X1))
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_53,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_43]) ).
cnf(c_0_54,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_55,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_56,negated_conjecture,
edge(esk8_1(esk9_0)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_23]) ).
cnf(c_0_58,negated_conjecture,
( in_path(tail_of(X1),esk9_0)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_59,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| on_path(esk7_1(esk9_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_23]) ).
fof(c_0_60,plain,
! [X67,X68,X69] :
( ( edge(X67)
| ~ triangle(X67,X68,X69) )
& ( edge(X68)
| ~ triangle(X67,X68,X69) )
& ( edge(X69)
| ~ triangle(X67,X68,X69) )
& ( sequential(X67,X68)
| ~ triangle(X67,X68,X69) )
& ( sequential(X68,X69)
| ~ triangle(X67,X68,X69) )
& ( sequential(X69,X67)
| ~ triangle(X67,X68,X69) )
& ( ~ edge(X67)
| ~ edge(X68)
| ~ edge(X69)
| ~ sequential(X67,X68)
| ~ sequential(X68,X69)
| ~ sequential(X69,X67)
| triangle(X67,X68,X69) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[triangle_defn])])]) ).
fof(c_0_61,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_62,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ precedes(X3,X2,esk9_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_63,negated_conjecture,
( precedes(X1,esk8_1(esk9_0),esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_64,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| sequential(esk7_1(esk9_0),esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_23]) ).
cnf(c_0_65,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_53,c_0_54])]) ).
cnf(c_0_66,negated_conjecture,
vertex(head_of(esk8_1(esk9_0))),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_67,negated_conjecture,
( vertex(tail_of(X1))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_68,negated_conjecture,
on_path(esk7_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_59]),c_0_39]) ).
cnf(c_0_69,plain,
( triangle(X1,X2,X3)
| ~ edge(X1)
| ~ edge(X2)
| ~ edge(X3)
| ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_70,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_71,negated_conjecture,
( head_of(X1) != head_of(esk8_1(esk9_0))
| tail_of(X1) != tail_of(X2)
| ~ sequential(X2,esk8_1(esk9_0))
| ~ on_path(X2,esk9_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,negated_conjecture,
sequential(esk7_1(esk9_0),esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_64]),c_0_39]) ).
cnf(c_0_73,negated_conjecture,
( tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = X1
| X1 = head_of(esk8_1(esk9_0))
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
vertex(tail_of(esk7_1(esk9_0))),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_76,plain,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_69,c_0_70]),c_0_70]),c_0_70]) ).
cnf(c_0_77,plain,
( X1 = X2
| sequential(X1,X2)
| ~ edge(X1)
| ~ edge(X2)
| head_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_78,plain,
( edge(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_79,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_80,negated_conjecture,
( head_of(X1) != head_of(esk8_1(esk9_0))
| tail_of(X1) != tail_of(esk7_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_68])]) ).
cnf(c_0_81,negated_conjecture,
( tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_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(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_82,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ sequential(X2,esk7_1(X1))
| ~ sequential(esk8_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_52]) ).
cnf(c_0_83,negated_conjecture,
( esk8_1(esk9_0) = X1
| sequential(esk8_1(esk9_0),X1)
| tail_of(X1) != head_of(esk8_1(esk9_0))
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_56]) ).
cnf(c_0_84,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_54])]) ).
cnf(c_0_85,plain,
( ~ edge(X1)
| head_of(X1) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_86,negated_conjecture,
( tail_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))
| head_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_80,c_0_81]) ).
cnf(c_0_87,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| esk8_1(esk9_0) = X1
| tail_of(X1) != head_of(esk8_1(esk9_0))
| ~ sequential(X1,esk7_1(esk9_0))
| ~ path(X2,X3,esk9_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_70]) ).
cnf(c_0_88,plain,
( esk1_2(X1,X2) = X3
| X1 = X2
| sequential(esk1_2(X1,X2),X3)
| tail_of(X3) != head_of(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1)
| ~ edge(X3) ),
inference(spm,[status(thm)],[c_0_77,c_0_84]) ).
cnf(c_0_89,negated_conjecture,
edge(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_45,c_0_68]) ).
cnf(c_0_90,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_43]) ).
cnf(c_0_91,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)))) != head_of(esk8_1(esk9_0))
| ~ edge(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_92,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| esk8_1(esk9_0) = esk1_2(X1,X2)
| X1 = X2
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| ~ path(X3,X4,esk9_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_93,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_43]) ).
cnf(c_0_94,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_90,c_0_54])]) ).
cnf(c_0_95,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)))) != head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_84]),c_0_66]),c_0_74])]) ).
cnf(c_0_96,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| esk8_1(esk9_0) = esk1_2(X1,X2)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| X1 = X2
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_23]) ).
cnf(c_0_97,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_93,c_0_54])]) ).
cnf(c_0_98,negated_conjecture,
( tail_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(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_81]),c_0_74]),c_0_66])]),c_0_95]) ).
cnf(c_0_99,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_100,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_101,negated_conjecture,
( number_of_in(triangles,esk9_0) = number_of_in(sequential_pairs,esk9_0)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| esk8_1(esk9_0) = esk1_2(X1,X2)
| head_of(esk1_2(X1,X2)) = X2
| X1 = X2
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| X2 != head_of(esk8_1(esk9_0))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_96,c_0_94]) ).
cnf(c_0_102,negated_conjecture,
( head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_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_97,c_0_98]),c_0_66]),c_0_74])]) ).
cnf(c_0_103,negated_conjecture,
tail_of(esk8_1(esk9_0)) = head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_99,c_0_72]) ).
cnf(c_0_104,negated_conjecture,
( ~ precedes(X1,X2,esk9_0)
| ~ precedes(X2,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_100,c_0_20]) ).
cnf(c_0_105,negated_conjecture,
( esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk8_1(esk9_0)
| esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0)
| 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_66]),c_0_74])]) ).
cnf(c_0_106,negated_conjecture,
tail_of(esk7_1(esk9_0)) != head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_80,c_0_103]) ).
cnf(c_0_107,negated_conjecture,
( ~ precedes(esk8_1(esk9_0),X1,esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_104,c_0_63]) ).
cnf(c_0_108,negated_conjecture,
( precedes(X1,esk7_1(esk9_0),esk9_0)
| ~ sequential(X1,esk7_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_68]) ).
cnf(c_0_109,negated_conjecture,
( esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0)
| 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)) ),
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_97,c_0_105]),c_0_103]),c_0_66]),c_0_74])]),c_0_106]) ).
cnf(c_0_110,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_85,c_0_103]),c_0_56])]) ).
cnf(c_0_111,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_107,c_0_108]),c_0_72]),c_0_68]),c_0_46])]) ).
cnf(c_0_112,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)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_109]),c_0_74]),c_0_66])]),c_0_110]) ).
cnf(c_0_113,negated_conjecture,
( esk8_1(esk9_0) = esk7_1(esk9_0)
| tail_of(esk7_1(esk9_0)) != head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_83]),c_0_89])]) ).
cnf(c_0_114,negated_conjecture,
tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_112]),c_0_39]) ).
cnf(c_0_115,plain,
( X1 != X2
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_116,negated_conjecture,
esk8_1(esk9_0) = esk7_1(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114])]) ).
cnf(c_0_117,plain,
~ sequential(X1,X1),
inference(er,[status(thm)],[c_0_115]) ).
cnf(c_0_118,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_116]),c_0_117]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRA002+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.23/0.36 % CPULimit : 2400
% 0.23/0.36 % WCLimit : 300
% 0.23/0.37 % DateTime : Mon Oct 2 20:10:14 EDT 2023
% 0.23/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.w1ejqdPbi4/E---3.1_30696.p
% 72.76/9.82 # Version: 3.1pre001
% 72.76/9.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 72.76/9.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.76/9.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.76/9.82 # Starting new_bool_3 with 300s (1) cores
% 72.76/9.82 # Starting new_bool_1 with 300s (1) cores
% 72.76/9.82 # Starting sh5l with 300s (1) cores
% 72.76/9.82 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30774 completed with status 0
% 72.76/9.82 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 72.76/9.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 72.76/9.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.76/9.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.76/9.82 # No SInE strategy applied
% 72.76/9.82 # Search class: FGHSF-FFMF32-SFFFFFNN
% 72.76/9.82 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 72.76/9.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 72.76/9.82 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 72.76/9.82 # Starting new_bool_3 with 151s (1) cores
% 72.76/9.82 # Starting new_bool_1 with 151s (1) cores
% 72.76/9.82 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 72.76/9.82 # G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 30782 completed with status 0
% 72.76/9.82 # Result found by G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 72.76/9.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 72.76/9.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.76/9.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.76/9.82 # No SInE strategy applied
% 72.76/9.82 # Search class: FGHSF-FFMF32-SFFFFFNN
% 72.76/9.82 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 72.76/9.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 72.76/9.82 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 72.76/9.82 # Preprocessing time : 0.002 s
% 72.76/9.82 # Presaturation interreduction done
% 72.76/9.82
% 72.76/9.82 # Proof found!
% 72.76/9.82 # SZS status Theorem
% 72.76/9.82 # SZS output start CNFRefutation
% See solution above
% 72.76/9.82 # Parsed axioms : 18
% 72.76/9.82 # Removed by relevancy pruning/SinE : 0
% 72.76/9.82 # Initial clauses : 62
% 72.76/9.82 # Removed in clause preprocessing : 1
% 72.76/9.82 # Initial clauses in saturation : 61
% 72.76/9.82 # Processed clauses : 18445
% 72.76/9.82 # ...of these trivial : 439
% 72.76/9.82 # ...subsumed : 12008
% 72.76/9.82 # ...remaining for further processing : 5998
% 72.76/9.82 # Other redundant clauses eliminated : 1291
% 72.76/9.82 # Clauses deleted for lack of memory : 0
% 72.76/9.82 # Backward-subsumed : 1325
% 72.76/9.82 # Backward-rewritten : 1571
% 72.76/9.82 # Generated clauses : 226145
% 72.76/9.82 # ...of the previous two non-redundant : 214297
% 72.76/9.82 # ...aggressively subsumed : 0
% 72.76/9.82 # Contextual simplify-reflections : 1298
% 72.76/9.82 # Paramodulations : 223841
% 72.76/9.82 # Factorizations : 246
% 72.76/9.82 # NegExts : 0
% 72.76/9.82 # Equation resolutions : 2035
% 72.76/9.82 # Total rewrite steps : 32392
% 72.76/9.82 # Propositional unsat checks : 0
% 72.76/9.82 # Propositional check models : 0
% 72.76/9.82 # Propositional check unsatisfiable : 0
% 72.76/9.82 # Propositional clauses : 0
% 72.76/9.82 # Propositional clauses after purity: 0
% 72.76/9.82 # Propositional unsat core size : 0
% 72.76/9.82 # Propositional preprocessing time : 0.000
% 72.76/9.82 # Propositional encoding time : 0.000
% 72.76/9.82 # Propositional solver time : 0.000
% 72.76/9.82 # Success case prop preproc time : 0.000
% 72.76/9.82 # Success case prop encoding time : 0.000
% 72.76/9.82 # Success case prop solver time : 0.000
% 72.76/9.82 # Current number of processed clauses : 3028
% 72.76/9.82 # Positive orientable unit clauses : 16
% 72.76/9.82 # Positive unorientable unit clauses: 0
% 72.76/9.82 # Negative unit clauses : 15
% 72.76/9.82 # Non-unit-clauses : 2997
% 72.76/9.82 # Current number of unprocessed clauses: 190356
% 72.76/9.82 # ...number of literals in the above : 2039676
% 72.76/9.82 # Current number of archived formulas : 0
% 72.76/9.82 # Current number of archived clauses : 2957
% 72.76/9.82 # Clause-clause subsumption calls (NU) : 3513425
% 72.76/9.82 # Rec. Clause-clause subsumption calls : 66954
% 72.76/9.82 # Non-unit clause-clause subsumptions : 14125
% 72.76/9.82 # Unit Clause-clause subsumption calls : 16574
% 72.76/9.82 # Rewrite failures with RHS unbound : 0
% 72.76/9.82 # BW rewrite match attempts : 6
% 72.76/9.82 # BW rewrite match successes : 6
% 72.76/9.82 # Condensation attempts : 0
% 72.76/9.82 # Condensation successes : 0
% 72.76/9.82 # Termbank termtop insertions : 9640526
% 72.76/9.82
% 72.76/9.82 # -------------------------------------------------
% 72.76/9.82 # User time : 8.983 s
% 72.76/9.82 # System time : 0.168 s
% 72.76/9.82 # Total time : 9.151 s
% 72.76/9.82 # Maximum resident set size: 1900 pages
% 72.76/9.82
% 72.76/9.82 # -------------------------------------------------
% 72.76/9.82 # User time : 43.994 s
% 72.76/9.82 # System time : 0.787 s
% 72.76/9.82 # Total time : 44.781 s
% 72.76/9.82 # Maximum resident set size: 1732 pages
% 72.76/9.82 % E---3.1 exiting
% 72.76/9.82 % E---3.1 exiting
%------------------------------------------------------------------------------