TSTP Solution File: SWC123+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC123+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:27 EDT 2023
% Result : Theorem 1.83s 0.68s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 29
% Syntax : Number of formulae : 149 ( 29 unt; 0 def)
% Number of atoms : 546 ( 139 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 672 ( 275 ~; 282 |; 45 &)
% ( 7 <=>; 63 =>; 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 : 206 ( 0 sgn; 111 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.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/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax51) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax5) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax6) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax84) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax85) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.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/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax19) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax21) ).
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/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax28) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax24) ).
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/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax44) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax22) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax45) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax15) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax57) ).
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/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax82) ).
fof(ax52,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax52) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax73) ).
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/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax27) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax18) ).
fof(ax49,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p',ax49) ).
fof(c_0_29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_30,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& frontsegP(esk4_0,esk3_0)
& equalelemsP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ frontsegP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ equalelemsP(X11) )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
fof(c_0_31,plain,
! [X100,X101,X102] :
( ~ ssList(X100)
| ~ ssList(X101)
| ~ ssList(X102)
| ~ rearsegP(X100,X101)
| rearsegP(app(X102,X100),X101) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_32,plain,
! [X126] :
( ~ ssList(X126)
| rearsegP(X126,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).
fof(c_0_33,plain,
! [X57,X58,X60] :
( ( ssList(esk13_2(X57,X58))
| ~ frontsegP(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) )
& ( app(X58,esk13_2(X57,X58)) = X57
| ~ frontsegP(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) )
& ( ~ ssList(X60)
| app(X58,X60) != X57
| frontsegP(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) ) ),
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_34,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_41,plain,
( app(X1,esk13_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( ssList(esk13_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_46,plain,
! [X96,X97,X99] :
( ( ssList(esk14_2(X96,X97))
| ~ rearsegP(X96,X97)
| ~ ssList(X97)
| ~ ssList(X96) )
& ( app(esk14_2(X96,X97),X97) = X96
| ~ rearsegP(X96,X97)
| ~ ssList(X97)
| ~ ssList(X96) )
& ( ~ ssList(X99)
| app(X99,X97) != X96
| rearsegP(X96,X97)
| ~ ssList(X97)
| ~ ssList(X96) ) ),
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_47,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
app(esk3_0,esk13_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_41,c_0_42]),c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk13_2(esk4_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_44]),c_0_43])]) ).
fof(c_0_50,plain,
! [X46] :
( ~ ssList(X46)
| app(X46,nil) = X46 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_51,plain,
( app(esk14_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
rearsegP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_44]),c_0_49])]) ).
cnf(c_0_53,plain,
( ssList(esk14_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_54,plain,
! [X119] :
( ~ ssList(X119)
| nil = X119
| cons(hd(X119),tl(X119)) = X119 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_55,plain,
! [X103,X104] :
( ~ ssList(X103)
| ~ ssList(X104)
| nil = X103
| hd(app(X103,X104)) = hd(X103) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).
fof(c_0_56,plain,
! [X82,X83] :
( ~ ssList(X82)
| ~ ssList(X83)
| ssList(app(X82,X83)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_57,plain,
! [X44,X45] :
( ( nil = X45
| nil != app(X44,X45)
| ~ ssList(X45)
| ~ ssList(X44) )
& ( nil = X44
| nil != app(X44,X45)
| ~ ssList(X45)
| ~ ssList(X44) )
& ( nil != X45
| nil != X44
| nil = app(X44,X45)
| ~ ssList(X45)
| ~ ssList(X44) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_58,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,negated_conjecture,
app(esk14_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_51,c_0_52]),c_0_40]),c_0_43])]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk14_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_40]),c_0_43])]) ).
fof(c_0_61,plain,
! [X78,X79,X80,X81] :
( ( X80 = X81
| cons(X80,X78) != cons(X81,X79)
| ~ ssItem(X81)
| ~ ssItem(X80)
| ~ ssList(X79)
| ~ ssList(X78) )
& ( X79 = X78
| cons(X80,X78) != cons(X81,X79)
| ~ ssItem(X81)
| ~ ssItem(X80)
| ~ ssList(X79)
| ~ ssList(X78) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
fof(c_0_62,plain,
! [X34] :
( ( ssList(esk7_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( ssItem(esk8_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( cons(esk8_1(X34),esk7_1(X34)) = X34
| nil = X34
| ~ ssList(X34) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
fof(c_0_63,plain,
! [X74,X75] :
( ~ ssList(X74)
| ~ ssItem(X75)
| ssList(cons(X75,X74)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_64,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssItem(X38)
| nil != cons(X38,X37) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_65,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_66,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_67,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_68,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,negated_conjecture,
esk14_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
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_61]) ).
cnf(c_0_71,plain,
( cons(esk8_1(X1),esk7_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_72,plain,
( ssItem(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_73,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
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_65,c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_76,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(rw,[status(thm)],[c_0_59,c_0_69]) ).
fof(c_0_77,plain,
! [X12,X13,X16,X17] :
( ( ssList(esk5_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ssList(esk6_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( app(app(esk5_2(X12,X13),X13),esk6_2(X12,X13)) = X12
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ~ ssList(X16)
| ~ ssList(X17)
| app(app(X16,X13),X17) != X12
| segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) ) ),
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_78,plain,
( esk7_1(cons(X1,X2)) = X2
| ~ ssList(esk7_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
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_40]),c_0_43])]) ).
cnf(c_0_80,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_77]) ).
fof(c_0_81,plain,
! [X39] :
( ~ ssList(X39)
| app(nil,X39) = X39 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_82,negated_conjecture,
( esk7_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssList(esk7_1(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_83,plain,
( ssList(esk7_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
fof(c_0_84,plain,
! [X137] :
( ~ ssList(X137)
| nil = X137
| ssList(tl(X137)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_85,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_80]) ).
cnf(c_0_86,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
fof(c_0_87,plain,
! [X70,X71,X72,X73] :
( ( X70 = X71
| ~ frontsegP(cons(X70,X72),cons(X71,X73))
| ~ ssList(X73)
| ~ ssList(X72)
| ~ ssItem(X71)
| ~ ssItem(X70) )
& ( frontsegP(X72,X73)
| ~ frontsegP(cons(X70,X72),cons(X71,X73))
| ~ ssList(X73)
| ~ ssList(X72)
| ~ ssItem(X71)
| ~ ssItem(X70) )
& ( X70 != X71
| ~ frontsegP(X72,X73)
| frontsegP(cons(X70,X72),cons(X71,X73))
| ~ ssList(X73)
| ~ ssList(X72)
| ~ ssItem(X71)
| ~ ssItem(X70) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])]) ).
cnf(c_0_88,negated_conjecture,
( esk7_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_43])]) ).
cnf(c_0_89,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
fof(c_0_90,plain,
! [X128] :
( ~ ssList(X128)
| nil = X128
| ssItem(hd(X128)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_91,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_92,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_85,c_0_86]),c_0_40])]),c_0_67]) ).
cnf(c_0_93,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_87]) ).
fof(c_0_94,plain,
! [X40] :
( ~ ssList(X40)
| frontsegP(X40,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_95,negated_conjecture,
( esk7_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_43])]) ).
cnf(c_0_96,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_97,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_37]),c_0_35]),c_0_37]) ).
cnf(c_0_98,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_92,c_0_48]),c_0_44]),c_0_49])]) ).
fof(c_0_99,plain,
! [X32,X33] :
( ( ~ neq(X32,X33)
| X32 != X33
| ~ ssList(X33)
| ~ ssList(X32) )
& ( X32 = X33
| neq(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_100,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_101,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_102,negated_conjecture,
( esk7_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_43])]) ).
cnf(c_0_103,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]) ).
cnf(c_0_104,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
fof(c_0_105,plain,
! [X28] :
( ~ ssList(X28)
| segmentP(X28,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_106,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_100,c_0_101]),c_0_40])]) ).
cnf(c_0_107,negated_conjecture,
( cons(esk8_1(esk4_0),tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_102]),c_0_43])]) ).
cnf(c_0_108,negated_conjecture,
( esk4_0 = nil
| ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_102]),c_0_43])]) ).
cnf(c_0_109,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ equalelemsP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_110,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_40]),c_0_44])]) ).
cnf(c_0_111,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_112,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,cons(esk8_1(esk4_0),nil))
| ~ ssItem(esk8_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]) ).
fof(c_0_113,plain,
! [X93,X94,X95] :
( ~ ssList(X93)
| ~ ssList(X94)
| ~ ssList(X95)
| app(app(X93,X94),X95) = app(X93,app(X94,X95)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
fof(c_0_114,plain,
! [X127] :
( ( ~ rearsegP(nil,X127)
| nil = X127
| ~ ssList(X127) )
& ( nil != X127
| rearsegP(nil,X127)
| ~ ssList(X127) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])]) ).
cnf(c_0_115,negated_conjecture,
( ~ equalelemsP(X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_110]),c_0_111]) ).
cnf(c_0_116,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,cons(esk8_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_72]),c_0_43])]) ).
fof(c_0_117,plain,
! [X56] :
( ~ ssItem(X56)
| equalelemsP(cons(X56,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
fof(c_0_118,plain,
! [X84,X85,X86] :
( ~ ssList(X84)
| ~ ssList(X85)
| ~ ssItem(X86)
| cons(X86,app(X85,X84)) = app(cons(X86,X85),X84) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_119,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_120,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_121,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_122,negated_conjecture,
( esk4_0 = nil
| ~ equalelemsP(cons(esk8_1(esk4_0),nil))
| ~ ssList(cons(esk8_1(esk4_0),nil))
| ~ neq(nil,cons(esk8_1(esk4_0),nil)) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_123,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
fof(c_0_124,plain,
! [X76,X77] :
( ~ ssList(X76)
| ~ ssItem(X77)
| cons(X77,X76) != X76 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_125,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_126,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_119]),c_0_67]) ).
cnf(c_0_127,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_120])]),c_0_40])]) ).
fof(c_0_128,plain,
! [X125] :
( ~ ssList(X125)
| rearsegP(X125,X125) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])]) ).
cnf(c_0_129,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_121]),c_0_40])]) ).
cnf(c_0_130,negated_conjecture,
( esk4_0 = nil
| ~ neq(nil,cons(esk8_1(esk4_0),nil))
| ~ ssItem(esk8_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_73]),c_0_40])]),c_0_123]) ).
cnf(c_0_131,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_132,plain,
( cons(X1,app(X2,nil)) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_125]),c_0_40])]),c_0_73]) ).
cnf(c_0_133,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_40])]) ).
cnf(c_0_134,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_135,plain,
app(esk14_2(nil,nil),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_129]),c_0_40])]) ).
cnf(c_0_136,plain,
ssList(esk14_2(nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_129]),c_0_40])]) ).
cnf(c_0_137,negated_conjecture,
( esk4_0 = nil
| ~ neq(nil,cons(esk8_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_72]),c_0_43])]) ).
cnf(c_0_138,plain,
( cons(X1,X2) != app(X2,nil)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]) ).
cnf(c_0_139,plain,
( app(esk14_2(X1,X1),X1) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_134]) ).
cnf(c_0_140,plain,
esk14_2(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_135]),c_0_40]),c_0_136])]) ).
cnf(c_0_141,negated_conjecture,
( cons(esk8_1(esk4_0),nil) = nil
| esk4_0 = nil
| ~ ssList(cons(esk8_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_104]),c_0_40])]) ).
cnf(c_0_142,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]),c_0_140]),c_0_40]),c_0_40])]) ).
cnf(c_0_143,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_144,negated_conjecture,
( esk4_0 = nil
| ~ ssItem(esk8_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_73]),c_0_40])]),c_0_142]) ).
cnf(c_0_145,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_143,c_0_35]) ).
cnf(c_0_146,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_72]),c_0_43])]) ).
cnf(c_0_147,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_103,c_0_110]) ).
cnf(c_0_148,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146]),c_0_147]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC123+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n023.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:12:37 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.scZZuD5a1v/E---3.1_7027.p
% 1.83/0.68 # Version: 3.1pre001
% 1.83/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.83/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.83/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.68 # Starting sh5l with 300s (1) cores
% 1.83/0.68 # sh5l with pid 7108 completed with status 0
% 1.83/0.68 # Result found by sh5l
% 1.83/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.83/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.83/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.68 # Starting sh5l with 300s (1) cores
% 1.83/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.68 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.83/0.68 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.68 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.83/0.68 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 7111 completed with status 0
% 1.83/0.68 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 1.83/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.83/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.83/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.68 # Starting sh5l with 300s (1) cores
% 1.83/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.68 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.83/0.68 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.68 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.83/0.68 # Preprocessing time : 0.003 s
% 1.83/0.68 # Presaturation interreduction done
% 1.83/0.68
% 1.83/0.68 # Proof found!
% 1.83/0.68 # SZS status Theorem
% 1.83/0.68 # SZS output start CNFRefutation
% See solution above
% 1.83/0.68 # Parsed axioms : 96
% 1.83/0.68 # Removed by relevancy pruning/SinE : 13
% 1.83/0.68 # Initial clauses : 172
% 1.83/0.68 # Removed in clause preprocessing : 2
% 1.83/0.68 # Initial clauses in saturation : 170
% 1.83/0.68 # Processed clauses : 2029
% 1.83/0.68 # ...of these trivial : 19
% 1.83/0.68 # ...subsumed : 1028
% 1.83/0.68 # ...remaining for further processing : 982
% 1.83/0.68 # Other redundant clauses eliminated : 112
% 1.83/0.68 # Clauses deleted for lack of memory : 0
% 1.83/0.68 # Backward-subsumed : 80
% 1.83/0.68 # Backward-rewritten : 285
% 1.83/0.68 # Generated clauses : 8404
% 1.83/0.68 # ...of the previous two non-redundant : 7161
% 1.83/0.68 # ...aggressively subsumed : 0
% 1.83/0.68 # Contextual simplify-reflections : 250
% 1.83/0.68 # Paramodulations : 8284
% 1.83/0.68 # Factorizations : 0
% 1.83/0.68 # NegExts : 0
% 1.83/0.68 # Equation resolutions : 121
% 1.83/0.68 # Total rewrite steps : 8044
% 1.83/0.68 # Propositional unsat checks : 0
% 1.83/0.68 # Propositional check models : 0
% 1.83/0.68 # Propositional check unsatisfiable : 0
% 1.83/0.68 # Propositional clauses : 0
% 1.83/0.68 # Propositional clauses after purity: 0
% 1.83/0.68 # Propositional unsat core size : 0
% 1.83/0.68 # Propositional preprocessing time : 0.000
% 1.83/0.68 # Propositional encoding time : 0.000
% 1.83/0.68 # Propositional solver time : 0.000
% 1.83/0.68 # Success case prop preproc time : 0.000
% 1.83/0.68 # Success case prop encoding time : 0.000
% 1.83/0.68 # Success case prop solver time : 0.000
% 1.83/0.68 # Current number of processed clauses : 434
% 1.83/0.68 # Positive orientable unit clauses : 48
% 1.83/0.68 # Positive unorientable unit clauses: 0
% 1.83/0.68 # Negative unit clauses : 2
% 1.83/0.68 # Non-unit-clauses : 384
% 1.83/0.68 # Current number of unprocessed clauses: 5286
% 1.83/0.68 # ...number of literals in the above : 31534
% 1.83/0.68 # Current number of archived formulas : 0
% 1.83/0.68 # Current number of archived clauses : 529
% 1.83/0.68 # Clause-clause subsumption calls (NU) : 88278
% 1.83/0.68 # Rec. Clause-clause subsumption calls : 28190
% 1.83/0.68 # Non-unit clause-clause subsumptions : 1349
% 1.83/0.68 # Unit Clause-clause subsumption calls : 1733
% 1.83/0.68 # Rewrite failures with RHS unbound : 0
% 1.83/0.68 # BW rewrite match attempts : 36
% 1.83/0.68 # BW rewrite match successes : 28
% 1.83/0.68 # Condensation attempts : 0
% 1.83/0.68 # Condensation successes : 0
% 1.83/0.68 # Termbank termtop insertions : 169300
% 1.83/0.68
% 1.83/0.68 # -------------------------------------------------
% 1.83/0.68 # User time : 0.220 s
% 1.83/0.68 # System time : 0.009 s
% 1.83/0.68 # Total time : 0.229 s
% 1.83/0.68 # Maximum resident set size: 2472 pages
% 1.83/0.68
% 1.83/0.68 # -------------------------------------------------
% 1.83/0.68 # User time : 0.223 s
% 1.83/0.68 # System time : 0.011 s
% 1.83/0.68 # Total time : 0.234 s
% 1.83/0.68 # Maximum resident set size: 1796 pages
% 1.83/0.68 % E---3.1 exiting
% 1.83/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------