TSTP Solution File: SWC052+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC052+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:23 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 23
% Syntax : Number of formulae : 145 ( 23 unt; 0 def)
% Number of atoms : 570 ( 138 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 741 ( 316 ~; 319 |; 49 &)
% ( 7 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 196 ( 0 sgn 96 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X3) )
=> frontsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax40) ).
fof(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax43) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
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(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( X1 = X2
& frontsegP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(c_0_23,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_24,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssList(esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12)
| 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_23])])])])])])])]) ).
cnf(c_0_25,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_24]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( nil != esk3_0
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( neq(esk4_0,nil)
| nil != esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_29,c_0_27]) ).
fof(c_0_33,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
fof(c_0_34,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,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)],[ax53])])])])]) ).
fof(c_0_35,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])])]) ).
fof(c_0_36,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( nil != esk3_0
| ~ segmentP(esk3_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_39,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_43,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_45,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_46,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_47,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X5,X6)
| frontsegP(X4,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)],[ax40])])])])]) ).
fof(c_0_48,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ frontsegP(X4,X5)
| frontsegP(app(X4,X6),X5) ),
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)],[ax43])])])])]) ).
fof(c_0_49,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_50,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_51,negated_conjecture,
( nil = esk4_0
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_27]),c_0_27]) ).
cnf(c_0_52,negated_conjecture,
( nil != esk3_0
| ~ segmentP(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_53,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_44,c_0_26]) ).
cnf(c_0_55,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_56,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_57,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_58,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_59,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_60,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_61,plain,
( frontsegP(X1,X2)
| ~ frontsegP(X3,X2)
| ~ frontsegP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_62,plain,
( frontsegP(app(X1,X2),X3)
| ~ frontsegP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_63,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_64,plain,
! [X4,X5,X7] :
( ( ssList(esk10_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk10_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
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)],[ax5])])])])])])]) ).
cnf(c_0_65,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_24]) ).
cnf(c_0_66,negated_conjecture,
( nil = esk4_0
| neq(esk5_0,nil) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_67,negated_conjecture,
nil != esk4_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_32]),c_0_54])]),c_0_55]) ).
cnf(c_0_68,negated_conjecture,
( nil = esk4_0
| ssList(esk5_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_51]) ).
fof(c_0_69,plain,
! [X2] :
( ( ~ frontsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| frontsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_70,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_57,c_0_31]) ).
cnf(c_0_71,negated_conjecture,
( ssList(esk5_0)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_31]) ).
cnf(c_0_72,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_42])]) ).
cnf(c_0_73,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_74,plain,
( frontsegP(X1,X2)
| ~ frontsegP(X1,app(X3,X4))
| ~ frontsegP(X3,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_75,plain,
( app(X2,esk10_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_76,plain,
( ssList(esk10_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_77,negated_conjecture,
( nil = esk4_0
| frontsegP(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_51]) ).
fof(c_0_78,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])])])])]) ).
cnf(c_0_79,negated_conjecture,
( nil = esk4_0
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_27]),c_0_26]),c_0_27]) ).
cnf(c_0_80,negated_conjecture,
neq(esk5_0,nil),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_81,negated_conjecture,
ssList(esk5_0),
inference(sr,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_82,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_83,negated_conjecture,
( frontsegP(X1,esk5_0)
| nil != esk3_0
| ~ frontsegP(X1,esk3_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_70]),c_0_54])]),c_0_71]) ).
cnf(c_0_84,plain,
( app(nil,nil) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_85,plain,
( frontsegP(X1,X2)
| ~ frontsegP(X1,X3)
| ~ frontsegP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_86,negated_conjecture,
frontsegP(esk3_0,esk5_0),
inference(sr,[status(thm)],[c_0_77,c_0_67]) ).
fof(c_0_87,plain,
! [X2] :
( ~ ssList(X2)
| frontsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).
cnf(c_0_88,plain,
( frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_89,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
fof(c_0_90,plain,
! [X4] :
( ( ssList(esk8_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk9_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk9_1(X4),esk8_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
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)],[ax20])])])])])]) ).
cnf(c_0_91,negated_conjecture,
( ~ segmentP(esk3_0,esk5_0)
| ~ segmentP(esk4_0,esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),c_0_67]) ).
cnf(c_0_92,negated_conjecture,
( neq(esk5_0,nil)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_50,c_0_31]) ).
cnf(c_0_93,negated_conjecture,
( nil = esk5_0
| nil != esk3_0
| ~ frontsegP(nil,esk3_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_42])]),c_0_71]) ).
cnf(c_0_94,plain,
( frontsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
fof(c_0_95,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_96,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])])])])]) ).
cnf(c_0_97,plain,
( app(nil,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_42]) ).
fof(c_0_98,plain,
! [X5,X6,X7,X8] :
( ( X5 = X6
| ~ frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) )
& ( frontsegP(X7,X8)
| ~ frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) )
& ( X5 != X6
| ~ frontsegP(X7,X8)
| frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) ) ),
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)],[ax44])])])])])]) ).
cnf(c_0_99,negated_conjecture,
( frontsegP(esk3_0,X1)
| ~ frontsegP(esk5_0,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_54]),c_0_81])]) ).
cnf(c_0_100,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_101,plain,
( frontsegP(X1,cons(X2,nil))
| cons(X2,X3) != X1
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_102,plain,
( nil = X1
| cons(esk9_1(X1),esk8_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_103,plain,
( nil = X1
| ssItem(esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_104,plain,
( nil = X1
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_105,negated_conjecture,
( nil != esk5_0
| ~ segmentP(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_53]),c_0_81]),c_0_32])]) ).
cnf(c_0_106,negated_conjecture,
( nil != esk3_0
| ~ segmentP(esk3_0,esk5_0)
| ~ segmentP(esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_92]),c_0_71]) ).
cnf(c_0_107,negated_conjecture,
( nil = esk5_0
| nil != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_54])]) ).
cnf(c_0_108,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_109,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_110,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[c_0_97,c_0_42]) ).
cnf(c_0_111,plain,
( X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_112,negated_conjecture,
( frontsegP(esk3_0,X1)
| ~ frontsegP(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_81])]) ).
cnf(c_0_113,plain,
( nil = X1
| frontsegP(X1,cons(esk9_1(X1),nil))
| ~ ssList(cons(esk9_1(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102])]),c_0_103]),c_0_104]) ).
cnf(c_0_114,negated_conjecture,
nil != esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_53]),c_0_81]),c_0_54])]) ).
cnf(c_0_115,negated_conjecture,
( nil != esk3_0
| ~ segmentP(esk3_0,esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_53]),c_0_32])]),c_0_71]),c_0_107]) ).
cnf(c_0_116,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_108,c_0_89]) ).
cnf(c_0_117,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_42])]) ).
cnf(c_0_118,plain,
( esk9_1(X1) = X2
| nil = X1
| ~ frontsegP(X1,cons(X2,X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_102]),c_0_103]),c_0_104]) ).
cnf(c_0_119,negated_conjecture,
( frontsegP(esk3_0,cons(esk9_1(esk5_0),nil))
| ~ ssList(cons(esk9_1(esk5_0),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_81])]),c_0_114]) ).
cnf(c_0_120,negated_conjecture,
nil != esk3_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_53]),c_0_54])]),c_0_71]),c_0_107]) ).
cnf(c_0_121,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_42])]) ).
fof(c_0_122,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_123,negated_conjecture,
( esk9_1(esk5_0) = esk9_1(esk3_0)
| ~ ssItem(esk9_1(esk5_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_42]),c_0_54])]),c_0_120]),c_0_121]) ).
cnf(c_0_124,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_125,negated_conjecture,
esk9_1(esk5_0) = esk9_1(esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_103]),c_0_81])]),c_0_114]) ).
cnf(c_0_126,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_109,c_0_124]),c_0_42])]) ).
cnf(c_0_127,negated_conjecture,
cons(esk9_1(esk3_0),esk8_1(esk5_0)) = esk5_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_125]),c_0_81])]),c_0_114]) ).
cnf(c_0_128,negated_conjecture,
ssItem(esk9_1(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_125]),c_0_81])]),c_0_114]) ).
fof(c_0_129,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk6_2(X5,X6),X6),esk7_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])])])])])])]) ).
cnf(c_0_130,negated_conjecture,
( app(esk5_0,nil) = esk5_0
| ~ ssList(esk8_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128])]) ).
cnf(c_0_131,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_129]) ).
cnf(c_0_132,negated_conjecture,
app(esk5_0,nil) = esk5_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_104]),c_0_81])]),c_0_114]) ).
fof(c_0_133,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_134,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,app(X3,X2))
| ~ ssList(esk10_2(X1,app(X3,X2)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_75])]),c_0_63]) ).
cnf(c_0_135,negated_conjecture,
app(nil,esk5_0) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_132]),c_0_42]),c_0_81])]) ).
cnf(c_0_136,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_137,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_138,negated_conjecture,
( segmentP(X1,esk5_0)
| ~ frontsegP(X1,esk5_0)
| ~ ssList(esk10_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_42]),c_0_81])]) ).
cnf(c_0_139,negated_conjecture,
( nil = esk4_0
| frontsegP(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_136,c_0_51]) ).
cnf(c_0_140,negated_conjecture,
( nil = esk4_0
| X1 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_137]),c_0_42])]) ).
cnf(c_0_141,negated_conjecture,
( segmentP(X1,esk5_0)
| ~ frontsegP(X1,esk5_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_76]),c_0_81])]) ).
cnf(c_0_142,negated_conjecture,
frontsegP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_139,c_0_67]) ).
cnf(c_0_143,negated_conjecture,
~ segmentP(esk3_0,esk5_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_81]),c_0_142]),c_0_32])]),c_0_67]),c_0_114]) ).
cnf(c_0_144,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_141]),c_0_86]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC052+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 11 21:19:36 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.021 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 145
% 0.26/1.44 # Proof object clause steps : 99
% 0.26/1.44 # Proof object formula steps : 46
% 0.26/1.44 # Proof object conjectures : 60
% 0.26/1.44 # Proof object clause conjectures : 57
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 40
% 0.26/1.44 # Proof object initial formulas used : 23
% 0.26/1.44 # Proof object generating inferences : 49
% 0.26/1.44 # Proof object simplifying inferences : 116
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 96
% 0.26/1.44 # Removed by relevancy pruning/SinE : 62
% 0.26/1.44 # Initial clauses : 66
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 66
% 0.26/1.44 # Processed clauses : 2861
% 0.26/1.44 # ...of these trivial : 99
% 0.26/1.44 # ...subsumed : 2129
% 0.26/1.44 # ...remaining for further processing : 633
% 0.26/1.44 # Other redundant clauses eliminated : 84
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 72
% 0.26/1.44 # Backward-rewritten : 30
% 0.26/1.44 # Generated clauses : 11616
% 0.26/1.44 # ...of the previous two non-trivial : 10160
% 0.26/1.44 # Contextual simplify-reflections : 1183
% 0.26/1.44 # Paramodulations : 11491
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 120
% 0.26/1.44 # Current number of processed clauses : 523
% 0.26/1.44 # Positive orientable unit clauses : 39
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 23
% 0.26/1.44 # Non-unit-clauses : 461
% 0.26/1.44 # Current number of unprocessed clauses: 6977
% 0.26/1.44 # ...number of literals in the above : 45655
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 107
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 86626
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 52774
% 0.26/1.44 # Non-unit clause-clause subsumptions : 2394
% 0.26/1.44 # Unit Clause-clause subsumption calls : 2775
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 20
% 0.26/1.44 # BW rewrite match successes : 20
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 196485
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.440 s
% 0.26/1.44 # System time : 0.009 s
% 0.26/1.44 # Total time : 0.449 s
% 0.26/1.44 # Maximum resident set size: 10584 pages
%------------------------------------------------------------------------------