TSTP Solution File: CSR075+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR075+5 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : Fri Jul 15 03:02:15 EDT 2022
% Result : Theorem 3.61s 128.78s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 17 unt; 0 def)
% Number of atoms : 121 ( 30 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 133 ( 52 ~; 56 |; 18 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 94 ( 54 sgn 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_4682,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4682) ).
fof(kb_SUMO_10668,axiom,
~ s__overlapsTemporally(s__CommonEra,s__BeforeCommonEra),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_10668) ).
fof(kb_SUMO_1099,axiom,
! [X48] :
( s__instance(X48,s__TimeInterval)
=> s__overlapsTemporally(X48,X48) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1099) ).
fof(kb_SUMO_4719,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4719) ).
fof(kb_SUMO_10665,axiom,
s__instance(s__BeforeCommonEra,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_10665) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] : s__member(X1223,s__Org1_1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_SUMO_MILO) ).
fof(kb_SUMO_734,axiom,
! [X85] :
( s__instance(X85,s__Collection)
=> ? [X51] :
( s__instance(X51,s__SelfConnectedObject)
& s__member(X51,X85) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_734) ).
fof(c_0_7,plain,
! [X177,X178,X179,X180,X181,X182,X177,X178,X179] :
( ( s__instance(X180,X178)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X181,X178)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X182,X179)
| s__instance(X182,X177)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X179,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(X178,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(X177,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk188_3(X177,X178,X179),X179)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk189_3(X177,X178,X179),X177)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk190_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk190_3(X177,X178,X179),X179)
| ~ s__instance(esk188_3(X177,X178,X179),X178)
| ~ s__instance(esk189_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk190_3(X177,X178,X179),X177)
| ~ s__instance(esk188_3(X177,X178,X179),X178)
| ~ s__instance(esk189_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) ) ),
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)],[kb_SUMO_4682])])])])])])]) ).
fof(c_0_8,plain,
~ s__overlapsTemporally(s__CommonEra,s__BeforeCommonEra),
inference(fof_simplification,[status(thm)],[kb_SUMO_10668]) ).
cnf(c_0_9,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
~ s__overlapsTemporally(s__CommonEra,s__BeforeCommonEra),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
fof(c_0_12,plain,
! [X49] :
( ~ s__instance(X49,s__TimeInterval)
| s__overlapsTemporally(X49,X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1099])]) ).
fof(c_0_13,plain,
! [X169,X170] :
( ~ s__instance(X169,s__SetOrClass)
| ~ s__instance(X169,s__NullSet)
| ~ s__instance(X170,X169) ),
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)],[kb_SUMO_4719])])])])]) ).
cnf(c_0_14,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__overlapsTemporally(X2,s__BeforeCommonEra) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( s__overlapsTemporally(X1,X1)
| ~ s__instance(X1,s__TimeInterval) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
s__instance(s__BeforeCommonEra,s__TimeInterval),
inference(split_conjunct,[status(thm)],[kb_SUMO_10665]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X2,s__NullSet)
| ~ s__instance(X2,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
s__instance(X1,s__SetOrClass),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_20,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk189_3(X3,X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,esk189_3(s__NullSet,X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk190_3(X3,X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( esk189_3(s__NullSet,X1,X2) = s__UnionFn(X3,X4)
| X1 = s__UnionFn(X2,s__NullSet) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
( s__UnionFn(X1,X2) = s__UnionFn(X3,X4)
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_25,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| s__UnionFn(X3,X4) != X1 ),
inference(ef,[status(thm)],[c_0_24]) ).
cnf(c_0_26,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,s__NullSet),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_29,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,X4),
inference(spm,[status(thm)],[c_0_27,c_0_27]) ).
fof(c_0_30,negated_conjecture,
~ ? [X1223] : s__member(X1223,s__Org1_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_0_31,plain,
X1 = s__UnionFn(X2,s__UnionFn(X3,X4)),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_28]),c_0_29]) ).
fof(c_0_32,negated_conjecture,
! [X1224] : ~ s__member(X1224,s__Org1_1),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
fof(c_0_33,plain,
! [X86] :
( ( s__instance(esk38_1(X86),s__SelfConnectedObject)
| ~ s__instance(X86,s__Collection) )
& ( s__member(esk38_1(X86),X86)
| ~ s__instance(X86,s__Collection) ) ),
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)],[kb_SUMO_734])])])])])]) ).
cnf(c_0_34,plain,
X1 = X2,
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
~ s__member(X1,s__Org1_1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
( s__member(esk38_1(X1),X1)
| ~ s__instance(X1,s__Collection) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ s__member(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR075+5 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 00:28:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.99/26.03 eprover: CPU time limit exceeded, terminating
% 2.99/26.05 eprover: CPU time limit exceeded, terminating
% 2.99/26.39 eprover: CPU time limit exceeded, terminating
% 2.99/26.89 eprover: CPU time limit exceeded, terminating
% 3.14/49.06 eprover: CPU time limit exceeded, terminating
% 3.14/49.42 eprover: CPU time limit exceeded, terminating
% 3.14/49.44 eprover: CPU time limit exceeded, terminating
% 3.14/50.19 eprover: CPU time limit exceeded, terminating
% 3.27/72.08 eprover: CPU time limit exceeded, terminating
% 3.27/72.47 eprover: CPU time limit exceeded, terminating
% 3.28/73.76 eprover: CPU time limit exceeded, terminating
% 3.29/75.89 eprover: CPU time limit exceeded, terminating
% 3.42/95.14 eprover: CPU time limit exceeded, terminating
% 3.43/95.79 eprover: CPU time limit exceeded, terminating
% 3.43/96.79 eprover: CPU time limit exceeded, terminating
% 3.44/99.23 eprover: CPU time limit exceeded, terminating
% 3.56/118.17 eprover: CPU time limit exceeded, terminating
% 3.57/119.83 eprover: CPU time limit exceeded, terminating
% 3.58/122.60 eprover: CPU time limit exceeded, terminating
% 3.59/123.52 eprover: CPU time limit exceeded, terminating
% 3.61/128.78 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 3.61/128.78
% 3.61/128.78 # Failure: Resource limit exceeded (time)
% 3.61/128.78 # OLD status Res
% 3.61/128.78 # Preprocessing time : 0.915 s
% 3.61/128.78 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 3.61/128.78
% 3.61/128.78 # Failure: Resource limit exceeded (time)
% 3.61/128.78 # OLD status Res
% 3.61/128.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 3.61/128.78 # Preprocessing time : 0.332 s
% 3.61/128.78 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 3.61/128.78
% 3.61/128.78 # Failure: Resource limit exceeded (time)
% 3.61/128.78 # OLD status Res
% 3.61/128.78 # Preprocessing time : 0.898 s
% 3.61/128.78 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 3.61/128.78
% 3.61/128.78 # Failure: Resource limit exceeded (time)
% 3.61/128.78 # OLD status Res
% 3.61/128.78 # Preprocessing time : 0.930 s
% 3.61/128.78 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 3.61/128.78
% 3.61/128.78 # Failure: Resource limit exceeded (time)
% 3.61/128.78 # OLD status Res
% 3.61/128.78 # Preprocessing time : 0.947 s
% 3.61/128.78 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 3.61/128.78 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 3.61/128.78 # Preprocessing time : 0.245 s
% 3.61/128.78
% 3.61/128.78 # Failure: Out of unprocessed clauses!
% 3.61/128.78 # OLD status GaveUp
% 3.61/128.78 # Parsed axioms : 16750
% 3.61/128.78 # Removed by relevancy pruning/SinE : 16722
% 3.61/128.78 # Initial clauses : 30
% 3.61/128.78 # Removed in clause preprocessing : 0
% 3.61/128.78 # Initial clauses in saturation : 30
% 3.61/128.78 # Processed clauses : 38
% 3.61/128.78 # ...of these trivial : 0
% 3.61/128.78 # ...subsumed : 0
% 3.61/128.78 # ...remaining for further processing : 38
% 3.61/128.78 # Other redundant clauses eliminated : 1
% 3.61/128.78 # Clauses deleted for lack of memory : 0
% 3.61/128.78 # Backward-subsumed : 0
% 3.61/128.78 # Backward-rewritten : 0
% 3.61/128.78 # Generated clauses : 8
% 3.61/128.78 # ...of the previous two non-trivial : 8
% 3.61/128.78 # Contextual simplify-reflections : 0
% 3.61/128.78 # Paramodulations : 7
% 3.61/128.78 # Factorizations : 0
% 3.61/128.78 # Equation resolutions : 1
% 3.61/128.78 # Current number of processed clauses : 37
% 3.61/128.78 # Positive orientable unit clauses : 9
% 3.61/128.78 # Positive unorientable unit clauses: 0
% 3.61/128.78 # Negative unit clauses : 2
% 3.61/128.78 # Non-unit-clauses : 26
% 3.61/128.78 # Current number of unprocessed clauses: 0
% 3.61/128.78 # ...number of literals in the above : 0
% 3.61/128.78 # Current number of archived formulas : 0
% 3.61/128.78 # Current number of archived clauses : 0
% 3.61/128.78 # Clause-clause subsumption calls (NU) : 29
% 3.61/128.78 # Rec. Clause-clause subsumption calls : 8
% 3.61/128.78 # Non-unit clause-clause subsumptions : 0
% 3.61/128.78 # Unit Clause-clause subsumption calls : 14
% 3.61/128.78 # Rewrite failures with RHS unbound : 0
% 3.61/128.78 # BW rewrite match attempts : 2
% 3.61/128.78 # BW rewrite match successes : 0
% 3.61/128.78 # Condensation attempts : 0
% 3.61/128.78 # Condensation successes : 0
% 3.61/128.78 # Termbank termtop insertions : 165492
% 3.61/128.78
% 3.61/128.78 # -------------------------------------------------
% 3.61/128.78 # User time : 0.221 s
% 3.61/128.78 # System time : 0.025 s
% 3.61/128.78 # Total time : 0.246 s
% 3.61/128.78 # Maximum resident set size: 43764 pages
% 3.61/128.78 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 3.61/128.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 3.61/128.78 # Preprocessing time : 0.242 s
% 3.61/128.78
% 3.61/128.78 # Failure: Out of unprocessed clauses!
% 3.61/128.78 # OLD status GaveUp
% 3.61/128.78 # Parsed axioms : 16750
% 3.61/128.78 # Removed by relevancy pruning/SinE : 16714
% 3.61/128.78 # Initial clauses : 41
% 3.61/128.78 # Removed in clause preprocessing : 0
% 3.61/128.78 # Initial clauses in saturation : 41
% 3.61/128.78 # Processed clauses : 69
% 3.61/128.78 # ...of these trivial : 0
% 3.61/128.78 # ...subsumed : 5
% 3.61/128.78 # ...remaining for further processing : 64
% 3.61/128.78 # Other redundant clauses eliminated : 1
% 3.61/128.78 # Clauses deleted for lack of memory : 0
% 3.61/128.78 # Backward-subsumed : 0
% 3.61/128.78 # Backward-rewritten : 0
% 3.61/128.78 # Generated clauses : 53
% 3.61/128.78 # ...of the previous two non-trivial : 28
% 3.61/128.78 # Contextual simplify-reflections : 18
% 3.61/128.78 # Paramodulations : 52
% 3.61/128.78 # Factorizations : 0
% 3.61/128.78 # Equation resolutions : 1
% 3.61/128.78 # Current number of processed clauses : 63
% 3.61/128.78 # Positive orientable unit clauses : 9
% 3.61/128.78 # Positive unorientable unit clauses: 0
% 3.61/128.78 # Negative unit clauses : 2
% 3.61/128.78 # Non-unit-clauses : 52
% 3.61/128.78 # Current number of unprocessed clauses: 0
% 3.61/128.78 # ...number of literals in the above : 0
% 3.61/128.78 # Current number of archived formulas : 0
% 3.61/128.78 # Current number of archived clauses : 0
% 3.61/128.78 # Clause-clause subsumption calls (NU) : 670
% 3.61/128.78 # Rec. Clause-clause subsumption calls : 143
% 3.61/128.78 # Non-unit clause-clause subsumptions : 23
% 3.61/128.78 # Unit Clause-clause subsumption calls : 45
% 3.61/128.78 # Rewrite failures with RHS unbound : 0
% 3.61/128.78 # BW rewrite match attempts : 2
% 3.61/128.78 # BW rewrite match successes : 0
% 3.61/128.78 # Condensation attempts : 0
% 3.61/128.78 # Condensation successes : 0
% 3.61/128.78 # Termbank termtop insertions : 167806
% 3.61/128.78
% 3.61/128.78 # -------------------------------------------------
% 3.61/128.78 # User time : 0.216 s
% 3.61/128.78 # System time : 0.029 s
% 3.61/128.78 # Total time : 0.245 s
% 3.61/128.78 # Maximum resident set size: 44152 pages
% 3.61/128.78 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 3.61/128.78 # Preprocessing time : 0.864 s
% 3.61/128.78
% 3.61/128.78 # Proof found!
% 3.61/128.78 # SZS status Theorem
% 3.61/128.78 # SZS output start CNFRefutation
% See solution above
% 3.61/128.78 # Proof object total steps : 40
% 3.61/128.78 # Proof object clause steps : 26
% 3.61/128.78 # Proof object formula steps : 14
% 3.61/128.78 # Proof object conjectures : 5
% 3.61/128.78 # Proof object clause conjectures : 2
% 3.61/128.78 # Proof object formula conjectures : 3
% 3.61/128.78 # Proof object initial clauses used : 9
% 3.61/128.78 # Proof object initial formulas used : 7
% 3.61/128.78 # Proof object generating inferences : 15
% 3.61/128.78 # Proof object simplifying inferences : 8
% 3.61/128.78 # Training examples: 0 positive, 0 negative
% 3.61/128.78 # Parsed axioms : 16750
% 3.61/128.78 # Removed by relevancy pruning/SinE : 0
% 3.61/128.78 # Initial clauses : 20272
% 3.61/128.78 # Removed in clause preprocessing : 63
% 3.61/128.78 # Initial clauses in saturation : 20209
% 3.61/128.78 # Processed clauses : 21475
% 3.61/128.78 # ...of these trivial : 56
% 3.61/128.78 # ...subsumed : 942
% 3.61/128.78 # ...remaining for further processing : 20477
% 3.61/128.78 # Other redundant clauses eliminated : 1105
% 3.61/128.78 # Clauses deleted for lack of memory : 242922
% 3.61/128.78 # Backward-subsumed : 700
% 3.61/128.78 # Backward-rewritten : 11440
% 3.61/128.78 # Generated clauses : 446451
% 3.61/128.78 # ...of the previous two non-trivial : 446390
% 3.61/128.78 # Contextual simplify-reflections : 1728
% 3.61/128.78 # Paramodulations : 444970
% 3.61/128.78 # Factorizations : 19
% 3.61/128.78 # Equation resolutions : 1222
% 3.61/128.78 # Current number of processed clauses : 8086
% 3.61/128.78 # Positive orientable unit clauses : 7968
% 3.61/128.78 # Positive unorientable unit clauses: 1
% 3.61/128.78 # Negative unit clauses : 13
% 3.61/128.78 # Non-unit-clauses : 104
% 3.61/128.78 # Current number of unprocessed clauses: 45935
% 3.61/128.78 # ...number of literals in the above : 52202
% 3.61/128.78 # Current number of archived formulas : 0
% 3.61/128.78 # Current number of archived clauses : 12380
% 3.61/128.78 # Clause-clause subsumption calls (NU) : 22359635
% 3.61/128.78 # Rec. Clause-clause subsumption calls : 4469349
% 3.61/128.78 # Non-unit clause-clause subsumptions : 2560
% 3.61/128.78 # Unit Clause-clause subsumption calls : 1357343
% 3.61/128.78 # Rewrite failures with RHS unbound : 31947
% 3.61/128.78 # BW rewrite match attempts : 46916
% 3.61/128.78 # BW rewrite match successes : 38242
% 3.61/128.78 # Condensation attempts : 0
% 3.61/128.78 # Condensation successes : 0
% 3.61/128.78 # Termbank termtop insertions : 5850548
% 3.61/128.78
% 3.61/128.78 # -------------------------------------------------
% 3.61/128.78 # User time : 9.322 s
% 3.61/128.78 # System time : 0.218 s
% 3.61/128.78 # Total time : 9.540 s
% 3.61/128.78 # Maximum resident set size: 313836 pages
%------------------------------------------------------------------------------