TSTP Solution File: SWB025+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Tue Jul 19 19:02:04 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 18 unt; 0 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 53 ( 4 avg)
% Number of connectives : 271 ( 108 ~; 108 |; 50 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 17 con; 0-5 aty)
% Number of variables : 92 ( 4 sgn 28 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_chain_002,axiom,
! [X1,X2,X3,X4,X5] :
( ( iext(uri_rdf_first,X2,X3)
& iext(uri_rdf_rest,X2,X4)
& iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X4,uri_rdf_nil) )
=> ( iext(uri_owl_propertyChainAxiom,X1,X2)
<=> ( ip(X1)
& ip(X3)
& ip(X5)
& ! [X6,X7,X8] :
( ( iext(X3,X6,X7)
& iext(X5,X7,X8) )
=> iext(X1,X6,X8) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_chain_002) ).
fof(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties,axiom,
? [X11,X12,X13,X14,X15] :
( iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,X11)
& iext(uri_rdf_first,X11,uri_ex_hasCousin)
& iext(uri_rdf_rest,X11,X12)
& iext(uri_rdf_first,X12,uri_ex_hasFather)
& iext(uri_rdf_rest,X12,uri_rdf_nil)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,X13)
& iext(uri_rdf_first,X13,uri_ex_hasUncle)
& iext(uri_rdf_rest,X13,X14)
& iext(uri_rdf_first,X14,X15)
& iext(uri_rdf_rest,X14,uri_rdf_nil)
& iext(uri_owl_inverseOf,X15,uri_ex_hasFather)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(owl_inv,axiom,
! [X3,X5] :
( iext(uri_owl_inverseOf,X3,X5)
<=> ( ip(X3)
& ip(X5)
& ! [X9,X10] :
( iext(X3,X9,X10)
<=> iext(X5,X10,X9) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_inv) ).
fof(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties,conjecture,
( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(c_0_4,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ip(X9)
| ~ iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( ip(X11)
| ~ iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( ip(X13)
| ~ iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( ~ iext(X11,X14,X15)
| ~ iext(X13,X15,X16)
| iext(X9,X14,X16)
| ~ iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( iext(X11,esk1_5(X9,X10,X11,X12,X13),esk2_5(X9,X10,X11,X12,X13))
| ~ ip(X9)
| ~ ip(X11)
| ~ ip(X13)
| iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( iext(X13,esk2_5(X9,X10,X11,X12,X13),esk3_5(X9,X10,X11,X12,X13))
| ~ ip(X9)
| ~ ip(X11)
| ~ ip(X13)
| iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) )
& ( ~ iext(X9,esk1_5(X9,X10,X11,X12,X13),esk3_5(X9,X10,X11,X12,X13))
| ~ ip(X9)
| ~ ip(X11)
| ~ ip(X13)
| iext(uri_owl_propertyChainAxiom,X9,X10)
| ~ iext(uri_rdf_first,X10,X11)
| ~ iext(uri_rdf_rest,X10,X12)
| ~ iext(uri_rdf_first,X12,X13)
| ~ iext(uri_rdf_rest,X12,uri_rdf_nil) ) ),
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)],[owl_chain_002])])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0)
& iext(uri_rdf_first,esk6_0,uri_ex_hasCousin)
& iext(uri_rdf_rest,esk6_0,esk7_0)
& iext(uri_rdf_first,esk7_0,uri_ex_hasFather)
& iext(uri_rdf_rest,esk7_0,uri_rdf_nil)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0)
& iext(uri_rdf_first,esk8_0,uri_ex_hasUncle)
& iext(uri_rdf_rest,esk8_0,esk9_0)
& iext(uri_rdf_first,esk9_0,esk10_0)
& iext(uri_rdf_rest,esk9_0,uri_rdf_nil)
& iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties])])]) ).
cnf(c_0_6,plain,
( iext(X5,X6,X7)
| ~ iext(uri_rdf_rest,X1,uri_rdf_nil)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_rdf_rest,X3,X1)
| ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_owl_propertyChainAxiom,X5,X3)
| ~ iext(X2,X8,X7)
| ~ iext(X4,X6,X8) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk9_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk9_0,X4)
| ~ iext(uri_rdf_rest,X5,esk9_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk9_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(esk10_0,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
iext(uri_rdf_first,esk8_0,uri_ex_hasUncle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
iext(uri_rdf_rest,esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X11,X12,X13,X14,X13,X14,X11,X12] :
( ( ip(X11)
| ~ iext(uri_owl_inverseOf,X11,X12) )
& ( ip(X12)
| ~ iext(uri_owl_inverseOf,X11,X12) )
& ( ~ iext(X11,X13,X14)
| iext(X12,X14,X13)
| ~ iext(uri_owl_inverseOf,X11,X12) )
& ( ~ iext(X12,X14,X13)
| iext(X11,X13,X14)
| ~ iext(uri_owl_inverseOf,X11,X12) )
& ( ~ iext(X11,esk4_2(X11,X12),esk5_2(X11,X12))
| ~ iext(X12,esk5_2(X11,X12),esk4_2(X11,X12))
| ~ ip(X11)
| ~ ip(X12)
| iext(uri_owl_inverseOf,X11,X12) )
& ( iext(X11,esk4_2(X11,X12),esk5_2(X11,X12))
| iext(X12,esk5_2(X11,X12),esk4_2(X11,X12))
| ~ ip(X11)
| ~ ip(X12)
| iext(uri_owl_inverseOf,X11,X12) ) ),
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)],[owl_inv])])])])])])]) ).
cnf(c_0_14,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| ~ iext(esk10_0,X4,X3)
| ~ iext(uri_ex_hasUncle,X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( iext(X1,X3,X4)
| ~ iext(uri_owl_inverseOf,X1,X2)
| ~ iext(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
iext(uri_rdf_rest,esk7_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( iext(uri_ex_hasCousin,X1,X2)
| ~ iext(esk10_0,X3,X2)
| ~ iext(uri_ex_hasUncle,X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( iext(esk10_0,X1,X2)
| ~ iext(uri_ex_hasFather,X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk7_0,X4)
| ~ iext(uri_rdf_rest,X5,esk7_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_22,plain,
iext(uri_rdf_first,esk7_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_23,negated_conjecture,
~ ( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties]) ).
cnf(c_0_24,plain,
( iext(uri_ex_hasCousin,X1,X2)
| ~ iext(uri_ex_hasUncle,X1,X3)
| ~ iext(uri_ex_hasFather,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk7_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(uri_ex_hasFather,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
iext(uri_rdf_first,esk6_0,uri_ex_hasCousin),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,plain,
iext(uri_rdf_rest,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_29,negated_conjecture,
( ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( iext(uri_ex_hasCousin,uri_ex_bob,X1)
| ~ iext(uri_ex_hasFather,X1,uri_ex_dave) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| ~ iext(uri_ex_hasFather,X4,X3)
| ~ iext(uri_ex_hasCousin,X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_34,negated_conjecture,
( ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
| ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( iext(uri_ex_hasUncle,X1,X2)
| ~ iext(uri_ex_hasFather,X3,X2)
| ~ iext(uri_ex_hasCousin,X1,X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_38,negated_conjecture,
~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,plain,
( iext(uri_ex_hasUncle,X1,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,X1,uri_ex_bob) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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 : Wed Jun 1 08:40:33 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.013 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 : 4
% 0.21/1.40 # Removed by relevancy pruning/SinE : 3
% 0.21/1.40 # Initial clauses : 1
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 1
% 0.21/1.40 # Processed clauses : 1
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 1
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 0
% 0.21/1.40 # ...of the previous two non-trivial : 0
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 0
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 1
% 0.21/1.40 # Positive orientable unit clauses : 0
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 0
% 0.21/1.40 # Non-unit-clauses : 1
% 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 : 0
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 0
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 0
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 200
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.010 s
% 0.21/1.40 # System time : 0.003 s
% 0.21/1.40 # Total time : 0.013 s
% 0.21/1.40 # Maximum resident set size: 2792 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.015 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 : 42
% 0.21/1.40 # Proof object clause steps : 33
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 6
% 0.21/1.40 # Proof object clause conjectures : 3
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 18
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 14
% 0.21/1.40 # Proof object simplifying inferences : 8
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 4
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 29
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 29
% 0.21/1.40 # Processed clauses : 104
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 3
% 0.21/1.40 # ...remaining for further processing : 101
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 5
% 0.21/1.40 # Backward-rewritten : 2
% 0.21/1.40 # Generated clauses : 158
% 0.21/1.40 # ...of the previous two non-trivial : 142
% 0.21/1.40 # Contextual simplify-reflections : 3
% 0.21/1.40 # Paramodulations : 158
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 94
% 0.21/1.40 # Positive orientable unit clauses : 20
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 1
% 0.21/1.40 # Non-unit-clauses : 73
% 0.21/1.40 # Current number of unprocessed clauses: 67
% 0.21/1.40 # ...number of literals in the above : 569
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 7
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 2066
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 484
% 0.21/1.40 # Non-unit clause-clause subsumptions : 11
% 0.21/1.40 # Unit Clause-clause subsumption calls : 44
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 3
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 6140
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.024 s
% 0.21/1.40 # System time : 0.001 s
% 0.21/1.40 # Total time : 0.025 s
% 0.21/1.40 # Maximum resident set size: 3160 pages
%------------------------------------------------------------------------------