TSTP Solution File: SWC077+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC077+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:39:12 EDT 2023
% Result : Theorem 0.94s 0.60s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 27
% Syntax : Number of formulae : 133 ( 30 unt; 0 def)
% Number of atoms : 497 ( 121 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 620 ( 256 ~; 250 |; 50 &)
% ( 6 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 184 ( 0 sgn; 102 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ? [X6] :
( ssList(X6)
& neq(X3,X6)
& frontsegP(X4,X6)
& segmentP(X6,X3)
& strictorderedP(X6) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',co1) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax51) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax5) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax6) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax84) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax85) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax83) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax19) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax21) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax24) ).
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/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax7) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax22) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax28) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax55) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax23) ).
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/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax44) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax15) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax45) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax57) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax68) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p',ax18) ).
fof(c_0_27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ? [X6] :
( ssList(X6)
& neq(X3,X6)
& frontsegP(X4,X6)
& segmentP(X6,X3)
& strictorderedP(X6) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_28,negated_conjecture,
! [X11,X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& frontsegP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( ~ ssList(X12)
| ~ neq(esk3_0,X12)
| ~ frontsegP(esk4_0,X12)
| ~ segmentP(X12,esk3_0)
| ~ strictorderedP(X12) )
& ( nil != esk2_0
| nil != esk1_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
fof(c_0_29,plain,
! [X118,X119,X120] :
( ~ ssList(X118)
| ~ ssList(X119)
| ~ ssList(X120)
| ~ rearsegP(X118,X119)
| rearsegP(app(X120,X118),X119) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_30,plain,
! [X202] :
( ~ ssList(X202)
| rearsegP(X202,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).
fof(c_0_31,plain,
! [X58,X59,X61] :
( ( ssList(esk14_2(X58,X59))
| ~ frontsegP(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) )
& ( app(X59,esk14_2(X58,X59)) = X58
| ~ frontsegP(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) )
& ( ~ ssList(X61)
| app(X59,X61) != X58
| frontsegP(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_39,plain,
( app(X1,esk14_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
( ssList(esk14_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_44,plain,
! [X114,X115,X117] :
( ( ssList(esk17_2(X114,X115))
| ~ rearsegP(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) )
& ( app(esk17_2(X114,X115),X115) = X114
| ~ rearsegP(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) )
& ( ~ ssList(X117)
| app(X117,X115) != X114
| rearsegP(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])]) ).
cnf(c_0_45,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
app(esk3_0,esk14_2(esk4_0,esk3_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk14_2(esk4_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_42]),c_0_41])]) ).
fof(c_0_48,plain,
! [X25] :
( ~ ssList(X25)
| app(X25,nil) = X25 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_49,plain,
( app(esk17_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
rearsegP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42]),c_0_47])]) ).
cnf(c_0_51,plain,
( ssList(esk17_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_52,plain,
! [X105] :
( ~ ssList(X105)
| nil = X105
| cons(hd(X105),tl(X105)) = X105 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_53,plain,
! [X121,X122] :
( ~ ssList(X121)
| ~ ssList(X122)
| nil = X121
| hd(app(X121,X122)) = hd(X121) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).
fof(c_0_54,plain,
! [X87,X88] :
( ~ ssList(X87)
| ~ ssList(X88)
| ssList(app(X87,X88)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_55,plain,
! [X23,X24] :
( ( nil = X24
| nil != app(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( nil = X23
| nil != app(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( nil != X24
| nil != X23
| nil = app(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_56,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,negated_conjecture,
app(esk17_2(esk4_0,nil),nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_38]),c_0_41])]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk17_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_50]),c_0_38]),c_0_41])]) ).
cnf(c_0_59,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_60,plain,
! [X83,X84,X85,X86] :
( ( X85 = X86
| cons(X85,X83) != cons(X86,X84)
| ~ ssItem(X86)
| ~ ssItem(X85)
| ~ ssList(X84)
| ~ ssList(X83) )
& ( X84 = X83
| cons(X85,X83) != cons(X86,X84)
| ~ ssItem(X86)
| ~ ssItem(X85)
| ~ ssList(X84)
| ~ ssList(X83) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
fof(c_0_61,plain,
! [X13] :
( ( ssList(esk5_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( ssItem(esk6_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( cons(esk6_1(X13),esk5_1(X13)) = X13
| nil = X13
| ~ ssList(X13) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
fof(c_0_62,plain,
! [X79,X80] :
( ~ ssList(X79)
| ~ ssItem(X80)
| ssList(cons(X80,X79)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_63,plain,
! [X16,X17] :
( ~ ssList(X16)
| ~ ssItem(X17)
| nil != cons(X17,X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_64,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_65,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_66,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_67,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_68,negated_conjecture,
esk17_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_69,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_35]),c_0_33]) ).
cnf(c_0_70,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_71,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_72,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_73,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_75,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]) ).
cnf(c_0_76,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(rw,[status(thm)],[c_0_57,c_0_68]) ).
cnf(c_0_77,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_46]),c_0_47]),c_0_42])]),c_0_69]) ).
cnf(c_0_78,plain,
( esk5_1(cons(X1,X2)) = X2
| ~ ssList(esk5_1(cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71])]),c_0_72]),c_0_73]),c_0_74]) ).
cnf(c_0_79,negated_conjecture,
cons(hd(esk4_0),tl(esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_38]),c_0_41])]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| ~ ssList(esk5_1(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_81,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_82,plain,
! [X158] :
( ~ ssList(X158)
| nil = X158
| ssList(tl(X158)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_83,plain,
! [X40,X41,X44,X45] :
( ( ssList(esk12_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ssList(esk13_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( app(app(esk12_2(X40,X41),X41),esk13_2(X40,X41)) = X40
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ~ ssList(X44)
| ~ ssList(X45)
| app(app(X44,X41),X45) != X40
| segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_84,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_41])]),c_0_77]) ).
cnf(c_0_85,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
fof(c_0_86,plain,
! [X151] :
( ~ ssList(X151)
| nil = X151
| ssItem(hd(X151)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_87,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
fof(c_0_88,plain,
! [X18] :
( ~ ssList(X18)
| app(nil,X18) = X18 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_89,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_41])]),c_0_77]) ).
cnf(c_0_90,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_92,plain,
! [X51] :
( ~ ssList(X51)
| segmentP(X51,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_93,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_94,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
fof(c_0_95,plain,
! [X101,X102] :
( ~ ssList(X101)
| ~ ssItem(X102)
| hd(cons(X102,X101)) = X102 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_96,negated_conjecture,
esk5_1(esk4_0) = tl(esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_41])]),c_0_77]) ).
cnf(c_0_97,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_35]),c_0_33]) ).
cnf(c_0_98,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_99,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_38])]),c_0_66]) ).
fof(c_0_100,plain,
! [X71,X72,X73,X74] :
( ( X71 = X72
| ~ frontsegP(cons(X71,X73),cons(X72,X74))
| ~ ssList(X74)
| ~ ssList(X73)
| ~ ssItem(X72)
| ~ ssItem(X71) )
& ( frontsegP(X73,X74)
| ~ frontsegP(cons(X71,X73),cons(X72,X74))
| ~ ssList(X74)
| ~ ssList(X73)
| ~ ssItem(X72)
| ~ ssItem(X71) )
& ( X71 != X72
| ~ frontsegP(X73,X74)
| frontsegP(cons(X71,X73),cons(X72,X74))
| ~ ssList(X74)
| ~ ssList(X73)
| ~ ssItem(X72)
| ~ ssItem(X71) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])]) ).
cnf(c_0_101,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_102,negated_conjecture,
cons(esk6_1(esk4_0),tl(esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_96]),c_0_41])]),c_0_77]) ).
cnf(c_0_103,negated_conjecture,
ssList(tl(esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_96]),c_0_41])]),c_0_77]) ).
cnf(c_0_104,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_42])]) ).
cnf(c_0_105,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_46]),c_0_42]),c_0_47])]) ).
fof(c_0_106,plain,
! [X77,X78] :
( ( ~ neq(X77,X78)
| X77 != X78
| ~ ssList(X78)
| ~ ssList(X77) )
& ( X77 = X78
| neq(X77,X78)
| ~ ssList(X78)
| ~ ssList(X77) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_107,plain,
( frontsegP(cons(X1,X3),cons(X2,X4))
| X1 != X2
| ~ frontsegP(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
fof(c_0_108,plain,
! [X19] :
( ~ ssList(X19)
| frontsegP(X19,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_109,negated_conjecture,
( esk6_1(esk4_0) = hd(esk4_0)
| ~ ssItem(esk6_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_110,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_111,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
fof(c_0_112,plain,
! [X56] :
( ~ ssList(X56)
| segmentP(X56,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_113,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_107]) ).
cnf(c_0_114,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_115,negated_conjecture,
esk6_1(esk4_0) = hd(esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_72]),c_0_41])]),c_0_77]) ).
cnf(c_0_116,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ strictorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_117,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_38]),c_0_42])]) ).
cnf(c_0_118,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_119,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_38])]) ).
cnf(c_0_120,negated_conjecture,
ssItem(hd(esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_115]),c_0_41])]),c_0_77]) ).
cnf(c_0_121,negated_conjecture,
( ~ strictorderedP(X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117]),c_0_117]),c_0_118]) ).
cnf(c_0_122,negated_conjecture,
frontsegP(esk4_0,cons(hd(esk4_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_79]),c_0_103]),c_0_120])]) ).
cnf(c_0_123,negated_conjecture,
( ~ strictorderedP(cons(hd(esk4_0),nil))
| ~ ssList(cons(hd(esk4_0),nil))
| ~ neq(nil,cons(hd(esk4_0),nil)) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
fof(c_0_124,plain,
! [X37] :
( ~ ssItem(X37)
| strictorderedP(cons(X37,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).
cnf(c_0_125,negated_conjecture,
( ~ strictorderedP(cons(hd(esk4_0),nil))
| ~ neq(nil,cons(hd(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_73]),c_0_38]),c_0_120])]) ).
cnf(c_0_126,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_127,negated_conjecture,
~ neq(nil,cons(hd(esk4_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_120])]) ).
fof(c_0_128,plain,
! [X81,X82] :
( ~ ssList(X81)
| ~ ssItem(X82)
| cons(X82,X81) != X81 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_129,negated_conjecture,
( cons(hd(esk4_0),nil) = nil
| ~ ssList(cons(hd(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_111]),c_0_38])]) ).
cnf(c_0_130,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_131,negated_conjecture,
cons(hd(esk4_0),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_73]),c_0_38]),c_0_120])]) ).
cnf(c_0_132,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_38]),c_0_120])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SWC077+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:55:49 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Vg746NBJeh/E---3.1_3858.p
% 0.94/0.60 # Version: 3.1pre001
% 0.94/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # Starting sh5l with 300s (1) cores
% 0.94/0.60 # sh5l with pid 3939 completed with status 0
% 0.94/0.60 # Result found by sh5l
% 0.94/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # Starting sh5l with 300s (1) cores
% 0.94/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.94/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.94/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.94/0.60 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 3942 completed with status 0
% 0.94/0.60 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.94/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # Starting sh5l with 300s (1) cores
% 0.94/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.94/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.94/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.94/0.60 # Preprocessing time : 0.003 s
% 0.94/0.60 # Presaturation interreduction done
% 0.94/0.60
% 0.94/0.60 # Proof found!
% 0.94/0.60 # SZS status Theorem
% 0.94/0.60 # SZS output start CNFRefutation
% See solution above
% 0.94/0.60 # Parsed axioms : 96
% 0.94/0.60 # Removed by relevancy pruning/SinE : 12
% 0.94/0.60 # Initial clauses : 167
% 0.94/0.60 # Removed in clause preprocessing : 2
% 0.94/0.60 # Initial clauses in saturation : 165
% 0.94/0.60 # Processed clauses : 1369
% 0.94/0.60 # ...of these trivial : 28
% 0.94/0.60 # ...subsumed : 447
% 0.94/0.60 # ...remaining for further processing : 894
% 0.94/0.60 # Other redundant clauses eliminated : 65
% 0.94/0.60 # Clauses deleted for lack of memory : 0
% 0.94/0.60 # Backward-subsumed : 49
% 0.94/0.60 # Backward-rewritten : 115
% 0.94/0.60 # Generated clauses : 4276
% 0.94/0.60 # ...of the previous two non-redundant : 3494
% 0.94/0.60 # ...aggressively subsumed : 0
% 0.94/0.60 # Contextual simplify-reflections : 149
% 0.94/0.60 # Paramodulations : 4206
% 0.94/0.60 # Factorizations : 0
% 0.94/0.60 # NegExts : 0
% 0.94/0.60 # Equation resolutions : 71
% 0.94/0.60 # Total rewrite steps : 4620
% 0.94/0.60 # Propositional unsat checks : 0
% 0.94/0.60 # Propositional check models : 0
% 0.94/0.60 # Propositional check unsatisfiable : 0
% 0.94/0.60 # Propositional clauses : 0
% 0.94/0.60 # Propositional clauses after purity: 0
% 0.94/0.60 # Propositional unsat core size : 0
% 0.94/0.60 # Propositional preprocessing time : 0.000
% 0.94/0.60 # Propositional encoding time : 0.000
% 0.94/0.60 # Propositional solver time : 0.000
% 0.94/0.60 # Success case prop preproc time : 0.000
% 0.94/0.60 # Success case prop encoding time : 0.000
% 0.94/0.60 # Success case prop solver time : 0.000
% 0.94/0.60 # Current number of processed clauses : 553
% 0.94/0.60 # Positive orientable unit clauses : 160
% 0.94/0.60 # Positive unorientable unit clauses: 0
% 0.94/0.60 # Negative unit clauses : 13
% 0.94/0.60 # Non-unit-clauses : 380
% 0.94/0.60 # Current number of unprocessed clauses: 2308
% 0.94/0.60 # ...number of literals in the above : 11918
% 0.94/0.60 # Current number of archived formulas : 0
% 0.94/0.60 # Current number of archived clauses : 323
% 0.94/0.60 # Clause-clause subsumption calls (NU) : 55121
% 0.94/0.60 # Rec. Clause-clause subsumption calls : 18915
% 0.94/0.60 # Non-unit clause-clause subsumptions : 561
% 0.94/0.60 # Unit Clause-clause subsumption calls : 4183
% 0.94/0.60 # Rewrite failures with RHS unbound : 0
% 0.94/0.60 # BW rewrite match attempts : 82
% 0.94/0.60 # BW rewrite match successes : 50
% 0.94/0.60 # Condensation attempts : 0
% 0.94/0.60 # Condensation successes : 0
% 0.94/0.60 # Termbank termtop insertions : 92339
% 0.94/0.60
% 0.94/0.60 # -------------------------------------------------
% 0.94/0.60 # User time : 0.136 s
% 0.94/0.60 # System time : 0.009 s
% 0.94/0.60 # Total time : 0.145 s
% 0.94/0.60 # Maximum resident set size: 2396 pages
% 0.94/0.60
% 0.94/0.60 # -------------------------------------------------
% 0.94/0.60 # User time : 0.138 s
% 0.94/0.60 # System time : 0.012 s
% 0.94/0.60 # Total time : 0.150 s
% 0.94/0.60 # Maximum resident set size: 1800 pages
% 0.94/0.60 % E---3.1 exiting
% 0.94/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------