TSTP Solution File: GRA004+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:16:07 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 13 unt; 0 def)
% Number of atoms : 217 ( 55 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 277 ( 114 ~; 106 |; 44 &)
% ( 2 <=>; 9 =>; 1 <=; 1 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 134 ( 25 sgn 70 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(shortest_path_properties_lemma,conjecture,
! [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) )
& head_of(X8) != tail_of(X7)
& head_of(X8) != head_of(X7) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',shortest_path_properties_lemma) ).
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/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/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
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/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
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/benchmark/Axioms/GRA001+0.ax',shortest_path_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/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(c_0_8,negated_conjecture,
~ ! [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) )
& head_of(X8) != tail_of(X7)
& head_of(X8) != head_of(X7) ) ),
inference(assume_negation,[status(cth)],[shortest_path_properties_lemma]) ).
fof(c_0_9,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( tail_of(X15) != tail_of(X12)
| head_of(X15) != head_of(X13)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) )
& ( ~ precedes(X13,X12,X14)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[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])])])])])])]) ).
fof(c_0_10,negated_conjecture,
( shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( tail_of(esk14_0) = tail_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0)
| head_of(esk12_0) = head_of(esk11_0) )
& ( head_of(esk14_0) = head_of(esk12_0)
| head_of(esk12_0) = tail_of(esk11_0)
| head_of(esk12_0) = head_of(esk11_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
cnf(c_0_11,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( ~ sequential(X13,X14)
| ~ on_path(X13,X10)
| ~ on_path(X14,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ on_path(X13,X10)
| ~ on_path(X14,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[precedes_defn])])])])])])]) ).
fof(c_0_14,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( on_path(X13,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( on_path(X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X14)
| ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( sequential(X13,esk5_3(X10,X13,X14))
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( precedes(esk5_3(X10,X13,X14),X14,X10)
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[precedes_properties])])])])])])])]) ).
fof(c_0_15,plain,
! [X11,X12,X13,X14,X11,X12,X13] :
( ( path(X11,X12,X13)
| ~ shortest_path(X11,X12,X13) )
& ( X11 != X12
| ~ shortest_path(X11,X12,X13) )
& ( ~ path(X11,X12,X14)
| less_or_equal(length_of(X13),length_of(X14))
| ~ shortest_path(X11,X12,X13) )
& ( path(X11,X12,esk6_3(X11,X12,X13))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) )
& ( ~ less_or_equal(length_of(X13),length_of(esk6_3(X11,X12,X13)))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[shortest_path_defn])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X5,X6,X7,X8] :
( ( edge(X8)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(head_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(tail_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
cnf(c_0_22,plain,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( head_of(esk12_0) != head_of(X1)
| tail_of(esk11_0) != tail_of(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( precedes(X1,X2,X3)
| ~ precedes(X4,X2,X3)
| ~ sequential(X1,X4)
| ~ on_path(X1,X3)
| ~ path(X5,X6,X3) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_26,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_28,negated_conjecture,
( head_of(esk12_0) = head_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk14_0) = tail_of(esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
head_of(esk11_0) != head_of(esk12_0),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( head_of(esk12_0) = head_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0)
| head_of(esk14_0) = head_of(esk12_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( precedes(X1,X2,esk13_0)
| ~ precedes(X3,X2,esk13_0)
| ~ sequential(X1,X3)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
fof(c_0_33,plain,
! [X9,X10,X9,X10] :
( ( edge(X9)
| ~ sequential(X9,X10) )
& ( edge(X10)
| ~ sequential(X9,X10) )
& ( X9 != X10
| ~ sequential(X9,X10) )
& ( head_of(X9) = tail_of(X10)
| ~ sequential(X9,X10) )
& ( ~ edge(X9)
| ~ edge(X10)
| X9 = X10
| head_of(X9) != tail_of(X10)
| sequential(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_defn])])])])]) ).
cnf(c_0_34,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( tail_of(esk11_0) = head_of(esk12_0)
| tail_of(esk14_0) = tail_of(esk11_0) ),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( head_of(esk14_0) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
inference(sr,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_38,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
( precedes(X1,esk12_0,esk13_0)
| ~ sequential(X1,esk11_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_41,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
tail_of(esk11_0) = head_of(esk12_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_36]),c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( precedes(esk12_0,esk12_0,esk13_0)
| ~ sequential(esk12_0,esk11_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_46,plain,
! [X2] :
( ~ edge(X2)
| head_of(X2) != tail_of(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[no_loops])]) ).
cnf(c_0_47,negated_conjecture,
( X1 = esk11_0
| sequential(X1,esk11_0)
| head_of(esk12_0) != head_of(X1)
| ~ edge(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
~ sequential(esk12_0,esk11_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_50,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
esk11_0 = esk12_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
tail_of(esk12_0) != head_of(esk12_0),
inference(spm,[status(thm)],[c_0_50,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_51]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.08/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 03:58:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.016 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 18
% 0.21/1.40 # Removed by relevancy pruning/SinE : 12
% 0.21/1.40 # Initial clauses : 19
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 19
% 0.21/1.40 # Processed clauses : 49
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 10
% 0.21/1.40 # ...remaining for further processing : 39
% 0.21/1.40 # Other redundant clauses eliminated : 1
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 7
% 0.21/1.40 # Backward-rewritten : 3
% 0.21/1.40 # Generated clauses : 43
% 0.21/1.40 # ...of the previous two non-trivial : 34
% 0.21/1.40 # Contextual simplify-reflections : 9
% 0.21/1.40 # Paramodulations : 36
% 0.21/1.40 # Factorizations : 2
% 0.21/1.40 # Equation resolutions : 3
% 0.21/1.40 # Current number of processed clauses : 26
% 0.21/1.40 # Positive orientable unit clauses : 3
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 3
% 0.21/1.40 # Non-unit-clauses : 20
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 12
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 49
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 27
% 0.21/1.40 # Non-unit clause-clause subsumptions : 17
% 0.21/1.40 # Unit Clause-clause subsumption calls : 15
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 2308
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.014 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.018 s
% 0.21/1.40 # Maximum resident set size: 2724 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.018 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 54
% 0.21/1.40 # Proof object clause steps : 37
% 0.21/1.40 # Proof object formula steps : 17
% 0.21/1.40 # Proof object conjectures : 30
% 0.21/1.40 # Proof object clause conjectures : 27
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 13
% 0.21/1.40 # Proof object initial formulas used : 8
% 0.21/1.40 # Proof object generating inferences : 20
% 0.21/1.40 # Proof object simplifying inferences : 9
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 18
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 63
% 0.21/1.40 # Removed in clause preprocessing : 1
% 0.21/1.40 # Initial clauses in saturation : 62
% 0.21/1.40 # Processed clauses : 156
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 16
% 0.21/1.40 # ...remaining for further processing : 140
% 0.21/1.40 # Other redundant clauses eliminated : 2
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 4
% 0.21/1.40 # Backward-rewritten : 29
% 0.21/1.40 # Generated clauses : 258
% 0.21/1.40 # ...of the previous two non-trivial : 229
% 0.21/1.40 # Contextual simplify-reflections : 14
% 0.21/1.40 # Paramodulations : 251
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 4
% 0.21/1.40 # Current number of processed clauses : 102
% 0.21/1.40 # Positive orientable unit clauses : 13
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 3
% 0.21/1.40 # Non-unit-clauses : 86
% 0.21/1.40 # Current number of unprocessed clauses: 98
% 0.21/1.40 # ...number of literals in the above : 438
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 36
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 2214
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1454
% 0.21/1.40 # Non-unit clause-clause subsumptions : 20
% 0.21/1.40 # Unit Clause-clause subsumption calls : 358
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 7
% 0.21/1.40 # BW rewrite match successes : 7
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 7576
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.028 s
% 0.21/1.40 # System time : 0.001 s
% 0.21/1.40 # Total time : 0.029 s
% 0.21/1.40 # Maximum resident set size: 3280 pages
%------------------------------------------------------------------------------