TSTP Solution File: SWC067+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC067+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 20:26:29 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 17 unt; 0 def)
% Number of atoms : 291 ( 99 equ)
% Maximal formula atoms : 40 ( 4 avg)
% Number of connectives : 371 ( 142 ~; 139 |; 60 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 51 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X15] :
( ssList(X15)
& neq(X15,nil)
& segmentP(X2,X15)
& segmentP(X1,X15) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X15] :
( ssList(X15)
& neq(X15,nil)
& segmentP(X2,X15)
& segmentP(X1,X15) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X22)
| ~ ssList(X23)
| app(X23,cons(X22,nil)) != esk5_0
| ~ ssItem(X24)
| ~ ssList(X25)
| app(cons(X24,nil),X25) != esk3_0
| ~ lt(X22,X24) )
& ( ~ ssItem(X26)
| ~ ssList(X27)
| app(cons(X26,nil),X27) != esk6_0
| ~ ssItem(X28)
| ~ ssList(X29)
| app(X29,cons(X28,nil)) != esk3_0
| ~ lt(X28,X26) )
& ( nil = esk4_0
| nil != esk3_0 )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X30)
| ~ neq(X30,nil)
| ~ segmentP(esk2_0,X30)
| ~ segmentP(esk1_0,X30)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X30)
| ~ neq(X30,nil)
| ~ segmentP(esk2_0,X30)
| ~ segmentP(esk1_0,X30)
| nil != esk1_0 ) ),
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)],[c_0_10])])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
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)],[ax82])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax83])])])])])]) ).
cnf(c_0_16,negated_conjecture,
app(app(esk5_0,esk1_0),esk6_0) = esk4_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
app(esk5_0,app(esk1_0,esk6_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
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)],[ax26])])])])]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk2_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax15])])])])])]) ).
cnf(c_0_27,negated_conjecture,
( app(esk1_0,esk6_0) = nil
| nil != esk4_0
| ~ ssList(app(esk1_0,esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]) ).
cnf(c_0_28,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk4_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_30,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_32,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_34,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
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)],[ax7])])])])])])]) ).
fof(c_0_35,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_36,negated_conjecture,
( app(esk1_0,esk6_0) = nil
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),c_0_19])]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk4_0
| X1 = nil
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_38,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( nil = esk4_0
| nil != esk1_0 ),
inference(rw,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_40,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( app(esk5_0,nil) = esk4_0
| nil != esk4_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk4_0
| ~ segmentP(esk4_0,esk1_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19])]),c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( segmentP(X1,esk1_0)
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_16]),c_0_18]),c_0_20]),c_0_19])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_41,c_0_25]) ).
fof(c_0_49,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_50,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_51,negated_conjecture,
( neq(esk4_0,nil)
| nil != esk1_0 ),
inference(rw,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_52,negated_conjecture,
( esk4_0 = esk5_0
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20])]) ).
cnf(c_0_53,negated_conjecture,
nil = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_54,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_48])]) ).
cnf(c_0_56,negated_conjecture,
esk4_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_57,negated_conjecture,
( nil = esk1_0
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_47]),c_0_19]),c_0_31])]) ).
cnf(c_0_58,negated_conjecture,
( esk1_0 != esk5_0
| ~ segmentP(esk1_0,esk5_0)
| ~ segmentP(esk5_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_53]),c_0_56]),c_0_56]),c_0_56]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
esk1_0 = esk5_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_53]),c_0_53])]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
~ segmentP(esk5_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_59])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_38]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC067+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 10:00:37 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.024 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 62
% 0.25/1.44 # Proof object clause steps : 42
% 0.25/1.44 # Proof object formula steps : 20
% 0.25/1.44 # Proof object conjectures : 36
% 0.25/1.44 # Proof object clause conjectures : 33
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 20
% 0.25/1.44 # Proof object initial formulas used : 10
% 0.25/1.44 # Proof object generating inferences : 12
% 0.25/1.44 # Proof object simplifying inferences : 50
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 96
% 0.25/1.44 # Removed by relevancy pruning/SinE : 47
% 0.25/1.44 # Initial clauses : 93
% 0.25/1.44 # Removed in clause preprocessing : 1
% 0.25/1.44 # Initial clauses in saturation : 92
% 0.25/1.44 # Processed clauses : 165
% 0.25/1.44 # ...of these trivial : 4
% 0.25/1.44 # ...subsumed : 24
% 0.25/1.44 # ...remaining for further processing : 137
% 0.25/1.44 # Other redundant clauses eliminated : 6
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 9
% 0.25/1.44 # Backward-rewritten : 76
% 0.25/1.44 # Generated clauses : 426
% 0.25/1.44 # ...of the previous two non-trivial : 431
% 0.25/1.44 # Contextual simplify-reflections : 27
% 0.25/1.44 # Paramodulations : 413
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 13
% 0.25/1.44 # Current number of processed clauses : 49
% 0.25/1.44 # Positive orientable unit clauses : 6
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 2
% 0.25/1.44 # Non-unit-clauses : 41
% 0.25/1.44 # Current number of unprocessed clauses: 108
% 0.25/1.44 # ...number of literals in the above : 553
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 85
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 1910
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 580
% 0.25/1.44 # Non-unit clause-clause subsumptions : 60
% 0.25/1.44 # Unit Clause-clause subsumption calls : 80
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 4
% 0.25/1.44 # BW rewrite match successes : 4
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 15017
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.053 s
% 0.25/1.44 # System time : 0.003 s
% 0.25/1.44 # Total time : 0.056 s
% 0.25/1.44 # Maximum resident set size: 3796 pages
%------------------------------------------------------------------------------