TSTP Solution File: SWC005+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC005+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:06 EDT 2022
% Result : Theorem 0.23s 17.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 10 unt; 0 def)
% Number of atoms : 272 ( 90 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 351 ( 147 ~; 143 |; 30 &)
% ( 1 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 50 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ? [X8] :
( ssList(X8)
& X3 != X8
& tl(X4) = X8
& neq(nil,X4) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ? [X8] :
( ssList(X8)
& X3 != X8
& tl(X4) = X8
& neq(nil,X4) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| ~ ssList(X14)
| ~ ssList(X15)
| app(app(X13,X14),X15) != esk2_0
| app(X13,X15) != esk1_0
| ~ neq(X14,nil) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| ~ ssList(X14)
| ~ ssList(X15)
| app(app(X13,X14),X15) != esk2_0
| app(X13,X15) != esk1_0
| ~ neq(X14,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X16)
| esk3_0 = X16
| tl(esk4_0) != X16
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X16)
| esk3_0 = X16
| tl(esk4_0) != X16
| ~ neq(nil,esk4_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_13])])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(X1,nil)
| app(X2,X3) != esk1_0
| app(app(X2,X1),X3) != esk2_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
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)],[ax16])])])])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
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)],[ax81])])])])]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),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)],[ax27])])])])]) ).
fof(c_0_23,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_24,negated_conjecture,
( app(app(X1,X2),X3) != esk2_0
| app(X1,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( app(nil,X1) != esk1_0
| app(X2,X1) != esk2_0
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
fof(c_0_32,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])])])])])]) ).
fof(c_0_33,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])])])])]) ).
cnf(c_0_34,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
( esk3_0 = X1
| ~ neq(nil,esk4_0)
| tl(esk4_0) != X1
| ~ ssList(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,negated_conjecture,
( app(X1,X2) != esk2_0
| X2 != esk1_0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_39,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_26])]) ).
fof(c_0_42,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
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)],[ax21])])])])]) ).
fof(c_0_43,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_44,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_45,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_46,negated_conjecture,
( esk1_0 = X1
| tl(esk2_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_17]),c_0_17]),c_0_17]),c_0_18])]) ).
cnf(c_0_47,negated_conjecture,
( X1 = nil
| app(X1,X2) != esk2_0
| X2 != esk1_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_26])]) ).
cnf(c_0_48,plain,
( app(cons(X1,X2),X3) = app(cons(X1,nil),app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_41]) ).
cnf(c_0_49,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( tl(esk2_0) = esk1_0
| ~ ssList(tl(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(X1,nil),app(X2,X3)) != esk2_0
| X3 != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27]),c_0_49]) ).
cnf(c_0_56,plain,
( app(cons(hd(X1),nil),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_50]),c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( tl(esk2_0) = esk1_0
| nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_54])]) ).
cnf(c_0_58,negated_conjecture,
( app(cons(X1,X2),X3) != esk2_0
| X3 != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( app(cons(hd(esk2_0),nil),esk1_0) = esk2_0
| nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_54])]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_61,negated_conjecture,
( nil = esk2_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_26])]) ).
cnf(c_0_62,negated_conjecture,
( nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_51]),c_0_54])]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_64,negated_conjecture,
nil = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_39]),c_0_54]),c_0_26])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_66,negated_conjecture,
neq(esk2_0,esk2_0),
inference(rw,[status(thm)],[c_0_18,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC005+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.08 % Command : run_ET %s %d
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sun Jun 12 00:19:55 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.23/17.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/17.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/17.41 # Preprocessing time : 0.012 s
% 0.23/17.41
% 0.23/17.41 # Proof found!
% 0.23/17.41 # SZS status Theorem
% 0.23/17.41 # SZS output start CNFRefutation
% See solution above
% 0.23/17.41 # Proof object total steps : 68
% 0.23/17.41 # Proof object clause steps : 42
% 0.23/17.41 # Proof object formula steps : 26
% 0.23/17.41 # Proof object conjectures : 26
% 0.23/17.41 # Proof object clause conjectures : 23
% 0.23/17.41 # Proof object formula conjectures : 3
% 0.23/17.41 # Proof object initial clauses used : 20
% 0.23/17.41 # Proof object initial formulas used : 13
% 0.23/17.41 # Proof object generating inferences : 17
% 0.23/17.41 # Proof object simplifying inferences : 39
% 0.23/17.41 # Training examples: 0 positive, 0 negative
% 0.23/17.41 # Parsed axioms : 96
% 0.23/17.41 # Removed by relevancy pruning/SinE : 67
% 0.23/17.41 # Initial clauses : 51
% 0.23/17.41 # Removed in clause preprocessing : 0
% 0.23/17.41 # Initial clauses in saturation : 51
% 0.23/17.41 # Processed clauses : 12052
% 0.23/17.41 # ...of these trivial : 699
% 0.23/17.41 # ...subsumed : 9416
% 0.23/17.41 # ...remaining for further processing : 1937
% 0.23/17.41 # Other redundant clauses eliminated : 185
% 0.23/17.41 # Clauses deleted for lack of memory : 287981
% 0.23/17.41 # Backward-subsumed : 146
% 0.23/17.41 # Backward-rewritten : 1689
% 0.23/17.41 # Generated clauses : 425323
% 0.23/17.41 # ...of the previous two non-trivial : 388017
% 0.23/17.41 # Contextual simplify-reflections : 8342
% 0.23/17.41 # Paramodulations : 424989
% 0.23/17.41 # Factorizations : 0
% 0.23/17.41 # Equation resolutions : 332
% 0.23/17.41 # Current number of processed clauses : 98
% 0.23/17.41 # Positive orientable unit clauses : 9
% 0.23/17.41 # Positive unorientable unit clauses: 0
% 0.23/17.41 # Negative unit clauses : 2
% 0.23/17.41 # Non-unit-clauses : 87
% 0.23/17.41 # Current number of unprocessed clauses: 1179
% 0.23/17.41 # ...number of literals in the above : 5961
% 0.23/17.41 # Current number of archived formulas : 0
% 0.23/17.41 # Current number of archived clauses : 1837
% 0.23/17.41 # Clause-clause subsumption calls (NU) : 928313
% 0.23/17.41 # Rec. Clause-clause subsumption calls : 279493
% 0.23/17.41 # Non-unit clause-clause subsumptions : 15635
% 0.23/17.41 # Unit Clause-clause subsumption calls : 160
% 0.23/17.41 # Rewrite failures with RHS unbound : 0
% 0.23/17.41 # BW rewrite match attempts : 8
% 0.23/17.41 # BW rewrite match successes : 8
% 0.23/17.41 # Condensation attempts : 0
% 0.23/17.41 # Condensation successes : 0
% 0.23/17.41 # Termbank termtop insertions : 9997742
% 0.23/17.41
% 0.23/17.41 # -------------------------------------------------
% 0.23/17.41 # User time : 16.890 s
% 0.23/17.41 # System time : 0.106 s
% 0.23/17.41 # Total time : 16.996 s
% 0.23/17.41 # Maximum resident set size: 133824 pages
%------------------------------------------------------------------------------