TSTP Solution File: GRA002+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:35:32 EDT 2023
% Result : Theorem 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 12 unt; 0 def)
% Number of atoms : 158 ( 29 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 173 ( 62 ~; 72 |; 23 &)
% ( 1 <=>; 14 =>; 1 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-4 aty)
% Number of variables : 121 ( 20 sgn; 68 !; 4 ?)
% 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/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',maximal_path_length) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',precedes_defn) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',shortest_path_defn) ).
fof(sequential_is_triangle,lemma,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',sequential_is_triangle) ).
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/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',sequential_pairs_and_triangles) ).
fof(length_defn,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.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/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',path_length_sequential_pairs) ).
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/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p',graph_has_them_all) ).
fof(c_0_8,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_9,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_10,plain,
! [X16,X17,X18,X19,X20,X21,X22] :
( ( path(X16,X17,X18)
| ~ shortest_path(X16,X17,X18) )
& ( X16 != X17
| ~ shortest_path(X16,X17,X18) )
& ( ~ path(X16,X17,X19)
| less_or_equal(length_of(X18),length_of(X19))
| ~ shortest_path(X16,X17,X18) )
& ( path(X20,X21,esk4_3(X20,X21,X22))
| ~ path(X20,X21,X22)
| X20 = X21
| shortest_path(X20,X21,X22) )
& ( ~ less_or_equal(length_of(X22),length_of(esk4_3(X20,X21,X22)))
| ~ path(X20,X21,X22)
| X20 = X21
| shortest_path(X20,X21,X22) ) ),
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_11,negated_conjecture,
( complete
& shortest_path(esk2_0,esk3_0,esk1_0)
& ~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,lemma,
! [X44,X45,X46,X47,X48] :
( ~ complete
| ~ shortest_path(X44,X45,X48)
| ~ precedes(X46,X47,X48)
| ~ sequential(X46,X47)
| triangle(X46,X47,esk7_4(X44,X45,X46,X47)) ),
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_is_triangle])])])])]) ).
fof(c_0_13,plain,
! [X73,X74,X75,X76,X77,X78] :
( ( ~ sequential(X76,X77)
| ~ on_path(X76,X73)
| ~ on_path(X77,X73)
| precedes(X76,X77,X73)
| ~ path(X74,X75,X73) )
& ( ~ sequential(X76,X78)
| ~ precedes(X78,X77,X73)
| ~ on_path(X76,X73)
| ~ on_path(X77,X73)
| precedes(X76,X77,X73)
| ~ path(X74,X75,X73) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
shortest_path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X32,X33,X34,X37] :
( ( on_path(esk5_1(X32),X32)
| ~ path(X33,X34,X32)
| number_of_in(sequential_pairs,X32) = number_of_in(triangles,X32) )
& ( on_path(esk6_1(X32),X32)
| ~ path(X33,X34,X32)
| number_of_in(sequential_pairs,X32) = number_of_in(triangles,X32) )
& ( sequential(esk5_1(X32),esk6_1(X32))
| ~ path(X33,X34,X32)
| number_of_in(sequential_pairs,X32) = number_of_in(triangles,X32) )
& ( ~ triangle(esk5_1(X32),esk6_1(X32),X37)
| ~ path(X33,X34,X32)
| number_of_in(sequential_pairs,X32) = number_of_in(triangles,X32) ) ),
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_17,lemma,
( triangle(X4,X5,esk7_4(X1,X2,X4,X5))
| ~ complete
| ~ shortest_path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ sequential(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( on_path(esk6_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_16]) ).
cnf(c_0_22,lemma,
( triangle(X1,X2,esk7_4(X3,X4,X1,X2))
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5)
| ~ sequential(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
( precedes(X1,X2,esk1_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| on_path(esk6_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,plain,
( sequential(esk5_1(X1),esk6_1(X1))
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( on_path(esk5_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_16]) ).
fof(c_0_27,plain,
! [X26,X27,X28] :
( ~ path(X26,X27,X28)
| length_of(X28) = number_of_in(edges,X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[length_defn])]) ).
cnf(c_0_28,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ triangle(esk5_1(X1),esk6_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( triangle(X1,X2,esk7_4(esk2_0,esk3_0,X1,X2))
| ~ precedes(X1,X2,esk1_0)
| ~ sequential(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| precedes(X1,esk6_1(esk1_0),esk1_0)
| ~ sequential(X1,esk6_1(esk1_0))
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| sequential(esk5_1(esk1_0),esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| on_path(esk5_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
fof(c_0_33,plain,
! [X29,X30,X31] :
( ~ path(X29,X30,X31)
| number_of_in(sequential_pairs,X31) = minus(length_of(X31),n1) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[path_length_sequential_pairs])]) ).
cnf(c_0_34,plain,
( length_of(X3) = number_of_in(edges,X3)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ precedes(esk5_1(X1),esk6_1(X1),esk1_0)
| ~ path(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| precedes(esk5_1(esk1_0),esk6_1(esk1_0),esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
( number_of_in(sequential_pairs,X3) = minus(length_of(X3),n1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
length_of(esk1_0) = number_of_in(edges,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
fof(c_0_39,plain,
! [X24,X25] : less_or_equal(number_of_in(X24,X25),number_of_in(X24,graph)),
inference(variable_rename,[status(thm)],[graph_has_them_all]) ).
cnf(c_0_40,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ path(X1,X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
minus(number_of_in(edges,esk1_0),n1) = number_of_in(sequential_pairs,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_20]),c_0_38]) ).
cnf(c_0_43,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_45,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk1_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 19:59:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.3JBZHDLIYR/E---3.1_19003.p
% 0.19/0.53 # Version: 3.1pre001
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # sh5l with pid 19084 completed with status 0
% 0.19/0.53 # Result found by sh5l
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.53 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.19/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.19/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19091 completed with status 0
% 0.19/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.53 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.19/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.19/0.53 # Preprocessing time : 0.002 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Theorem
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 19
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 63
% 0.19/0.53 # Removed in clause preprocessing : 1
% 0.19/0.53 # Initial clauses in saturation : 62
% 0.19/0.53 # Processed clauses : 310
% 0.19/0.53 # ...of these trivial : 0
% 0.19/0.53 # ...subsumed : 45
% 0.19/0.53 # ...remaining for further processing : 265
% 0.19/0.53 # Other redundant clauses eliminated : 9
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 0
% 0.19/0.53 # Backward-rewritten : 22
% 0.19/0.53 # Generated clauses : 769
% 0.19/0.53 # ...of the previous two non-redundant : 743
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 15
% 0.19/0.53 # Paramodulations : 758
% 0.19/0.53 # Factorizations : 4
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 10
% 0.19/0.53 # Total rewrite steps : 43
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 177
% 0.19/0.53 # Positive orientable unit clauses : 10
% 0.19/0.53 # Positive unorientable unit clauses: 0
% 0.19/0.53 # Negative unit clauses : 4
% 0.19/0.53 # Non-unit-clauses : 163
% 0.19/0.53 # Current number of unprocessed clauses: 557
% 0.19/0.53 # ...number of literals in the above : 2397
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 84
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 5144
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 2679
% 0.19/0.53 # Non-unit clause-clause subsumptions : 60
% 0.19/0.53 # Unit Clause-clause subsumption calls : 67
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 1
% 0.19/0.53 # BW rewrite match successes : 1
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 19865
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.031 s
% 0.19/0.53 # System time : 0.006 s
% 0.19/0.53 # Total time : 0.037 s
% 0.19/0.53 # Maximum resident set size: 1900 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.034 s
% 0.19/0.53 # System time : 0.007 s
% 0.19/0.53 # Total time : 0.040 s
% 0.19/0.53 # Maximum resident set size: 1732 pages
% 0.19/0.53 % E---3.1 exiting
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------