%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC062+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:42:49 PM UTC 2026
% Result : Theorem 86.16s 13.23s
% Output : CNFRefutation 86.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 32
% Syntax : Number of formulae : 230 ( 15 unt; 0 def)
% Number of atoms : 905 ( 226 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 1159 ( 484 ~; 511 |; 63 &)
% ( 7 <=>; 94 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 382 ( 1 sgn 142 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax2,axiom,
? [X1] :
( ? [X2] :
( X1 != X2
& ssItem(X2) )
& ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax2) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax47,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( rearsegP(X2,X3)
& rearsegP(X1,X2) )
=> rearsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax47) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
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(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X2,X3)
& frontsegP(X1,X2) )
=> frontsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax40) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
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(ax49,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(c_0_32,plain,
! [X56,X57] :
( ssList(app(X56,X57))
| ~ ssList(X57)
| ~ ssList(X56) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_33,plain,
! [X67,X68,X69] :
( app(app(X67,X68),X69) = app(X67,app(X68,X69))
| ~ ssList(X69)
| ~ ssList(X68)
| ~ ssList(X67) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_34,plain,
! [X45,X46] :
( ( ~ ssList(X45)
| ~ ssList(X46)
| nil = app(X45,X46)
| nil != X45
| nil != X46 )
& ( ~ ssList(X45)
| ~ ssList(X46)
| nil != app(X45,X46)
| nil = X45 )
& ( ~ ssList(X45)
| ~ ssList(X46)
| nil != app(X45,X46)
| nil = X46 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
fof(c_0_35,plain,
! [X43,X44] :
( cons(X44,X43) = app(cons(X44,nil),X43)
| ~ ssItem(X44)
| ~ ssList(X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_36,plain,
! [X58,X59,X60] :
( cons(X60,app(X59,X58)) = app(cons(X60,X59),X58)
| ~ ssItem(X60)
| ~ ssList(X59)
| ~ ssList(X58) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_37,plain,
! [X47] :
( app(X47,nil) = X47
| ~ ssList(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_38,plain,
! [X48,X49] :
( ssList(cons(X49,X48))
| ~ ssItem(X49)
| ~ ssList(X48) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_43,plain,
! [X74,X75,X77] :
( ( ~ ssList(X74)
| ~ ssList(X75)
| rearsegP(X74,X75)
| app(X77,X75) != X74
| ~ ssList(X77) )
& ( ~ ssList(X74)
| ~ ssList(X75)
| ~ rearsegP(X74,X75)
| app(esk10_2(X74,X75),X75) = X74 )
& ( ~ ssList(X74)
| ~ ssList(X75)
| ~ rearsegP(X74,X75)
| ssList(esk10_2(X74,X75)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])])]) ).
fof(c_0_44,plain,
! [X129,X130] :
( tl(cons(X130,X129)) = X129
| ~ ssItem(X130)
| ~ ssList(X129) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_45,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_39]) ).
cnf(c_0_50,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])]),c_0_42])]) ).
cnf(c_0_51,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| rearsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| tl(cons(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,app(nil,X2)) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42])]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,app(X2,nil)) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_42])]),c_0_48]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| app(nil,app(nil,X1)) = app(nil,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_50]),c_0_42])]) ).
fof(c_0_57,plain,
? [X1] :
( ? [X2] :
( X1 != X2
& ssItem(X2) )
& ssItem(X1) ),
inference(fof_simplification,[status(thm)],[ax2]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk10_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_39]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(nil,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_47]),c_0_42])]) ).
fof(c_0_62,plain,
! [X42] :
( app(nil,X42) = X42
| ~ ssList(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_63,plain,
! [X70,X71,X73] :
( ( ~ ssList(X70)
| ~ ssList(X71)
| frontsegP(X70,X71)
| app(X71,X73) != X70
| ~ ssList(X73) )
& ( ~ ssList(X70)
| ~ ssList(X71)
| ~ frontsegP(X70,X71)
| app(X71,esk9_2(X70,X71)) = X70 )
& ( ~ ssList(X70)
| ~ ssList(X71)
| ~ frontsegP(X70,X71)
| ssList(esk9_2(X70,X71)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_64,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(app(nil,X2))
| tl(cons(X1,X2)) = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| tl(cons(X1,X2)) = app(X2,nil) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_54]),c_0_55]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ssList(app(nil,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_56]),c_0_42])]) ).
fof(c_0_67,plain,
( esk11_0 != esk12_0
& ssItem(esk12_0)
& ssItem(esk11_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_57])])]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(esk10_2(nil,X1))
| ~ rearsegP(nil,X1)
| esk10_2(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59])]),c_0_42])]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_70,plain,
! [X110,X111,X112] :
( rearsegP(X110,X112)
| ~ rearsegP(X111,X112)
| ~ rearsegP(X110,X111)
| ~ ssList(X112)
| ~ ssList(X111)
| ~ ssList(X110) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax47])])])]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(nil,X2))
| rearsegP(app(X1,X2),app(nil,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_73,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_74,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(X1,nil) = app(nil,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_75,plain,
ssItem(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| esk10_2(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_42])]) ).
cnf(c_0_77,plain,
( ~ rearsegP(X2,X3)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(app(nil,X1))
| rearsegP(X1,app(nil,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_42])]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_73]),c_0_39]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| app(X1,nil) = app(nil,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| app(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_76]),c_0_42])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| rearsegP(X1,app(nil,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_66]) ).
fof(c_0_83,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_84,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
fof(c_0_85,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| frontsegP(app(nil,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_42])]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| app(nil,app(nil,X1)) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_42])]),c_0_66]) ).
fof(c_0_88,plain,
! [X116] :
( rearsegP(X116,nil)
| ~ ssList(X116) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
fof(c_0_89,plain,
! [X128] :
( ssList(tl(X128))
| nil = X128
| ~ ssList(X128) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_83])])]) ).
fof(c_0_90,plain,
! [X86,X87] :
( tl(app(X86,X87)) = app(tl(X86),X87)
| nil = X86
| ~ ssList(X87)
| ~ ssList(X86) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_84])])])]) ).
fof(c_0_91,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_85]) ).
fof(c_0_92,plain,
! [X64,X65,X66] :
( X66 = X64
| app(X65,X66) != app(X65,X64)
| ~ ssList(X66)
| ~ ssList(X65)
| ~ ssList(X64) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
fof(c_0_93,plain,
! [X78,X79,X80] :
( frontsegP(app(X78,X80),X79)
| ~ frontsegP(X78,X79)
| ~ ssList(X80)
| ~ ssList(X79)
| ~ ssList(X78) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])])]) ).
cnf(c_0_94,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| frontsegP(nil,app(nil,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_66]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_80]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| app(esk10_2(X1,X2),app(X2,X3)) = app(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_59]),c_0_69]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
fof(c_0_100,plain,
! [X15,X16,X19,X20] :
( ( ~ ssList(X15)
| ~ ssList(X16)
| segmentP(X15,X16)
| app(app(X19,X16),X20) != X15
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| app(app(esk5_2(X15,X16),X16),esk6_2(X15,X16)) = X15 )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| ssList(esk6_2(X15,X16)) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| ssList(esk5_2(X15,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
fof(c_0_101,negated_conjecture,
! [X12,X13,X14] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( nil != esk4_0
| nil = esk3_0 )
& ( app(cons(X12,nil),X13) != esk4_0
| app(X13,cons(X12,nil)) = esk3_0
| ~ ssList(X13)
| ~ ssItem(X12) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_91])])])])])]) ).
cnf(c_0_102,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
fof(c_0_103,plain,
! [X102,X103,X104] :
( frontsegP(X102,X104)
| ~ frontsegP(X103,X104)
| ~ frontsegP(X102,X103)
| ~ ssList(X104)
| ~ ssList(X103)
| ~ ssList(X102) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])])]) ).
cnf(c_0_104,plain,
( ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,app(X1,nil))
| frontsegP(nil,app(nil,X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_42])]),c_0_55]) ).
cnf(c_0_106,plain,
( ~ ssList(X1)
| rearsegP(X1,app(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_80]),c_0_55]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| app(esk10_2(X1,nil),nil) = app(X1,nil) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_50]),c_0_42])]),c_0_97]) ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssList(app(tl(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_39]),c_0_58]) ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| esk10_2(X1,X2) = nil
| app(tl(esk10_2(X1,X2)),X2) = tl(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_59]),c_0_69]) ).
fof(c_0_110,plain,
! [X27,X28,X29,X30] :
( segmentP(app(app(X29,X27),X30),X28)
| ~ segmentP(X27,X28)
| ~ ssList(X30)
| ~ ssList(X29)
| ~ ssList(X28)
| ~ ssList(X27) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_111,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_112,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_101]) ).
cnf(c_0_113,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_114,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_115,negated_conjecture,
( nil != esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_116,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_117,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_118,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X3,X1) != app(X3,X2)
| X1 = app(nil,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_61]),c_0_66]) ).
cnf(c_0_119,plain,
( ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_120,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(nil,X2)
| frontsegP(app(X1,nil),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_80]),c_0_42])]) ).
cnf(c_0_121,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,app(nil,X1))
| frontsegP(nil,app(nil,X1)) ),
inference(spm,[status(thm)],[c_0_105,c_0_80]) ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| ~ ssList(esk10_2(X1,nil))
| rearsegP(esk10_2(X1,nil),app(X1,nil)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_123,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(tl(X1))
| esk10_2(X1,X2) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_69]) ).
cnf(c_0_124,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_125,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_111]) ).
cnf(c_0_126,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(esk1_0,esk2_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114])]) ).
cnf(c_0_127,negated_conjecture,
( esk2_0 != nil
| esk1_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116]),c_0_117]) ).
fof(c_0_128,plain,
! [X26] :
( segmentP(X26,X26)
| ~ ssList(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_129,negated_conjecture,
( app(cons(X1,nil),X2) != esk4_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
fof(c_0_130,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_131,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_132,plain,
( ~ ssList(X1)
| app(nil,app(nil,X1)) = X1 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_72]),c_0_42])])]),c_0_66]) ).
cnf(c_0_133,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,app(X2,X3))
| frontsegP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_79]),c_0_39]) ).
cnf(c_0_134,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(nil,X2)
| frontsegP(app(nil,X1),X2) ),
inference(spm,[status(thm)],[c_0_120,c_0_80]) ).
cnf(c_0_135,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,app(X1,nil))
| frontsegP(nil,app(X1,nil)) ),
inference(spm,[status(thm)],[c_0_121,c_0_80]) ).
cnf(c_0_136,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| rearsegP(nil,app(X1,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_42])]),c_0_97]) ).
cnf(c_0_137,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(app(nil,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_50]),c_0_42])]) ).
cnf(c_0_138,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_72]),c_0_42])]),c_0_39]) ).
cnf(c_0_139,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk9_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_140,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_141,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(nil,esk2_0)
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_142,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_143,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(cons(X2,nil),X1) != esk2_0
| app(X1,cons(X2,nil)) = esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_116]),c_0_117]) ).
cnf(c_0_144,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_48]) ).
fof(c_0_145,plain,
! [X127] :
( cons(hd(X127),tl(X127)) = X127
| nil = X127
| ~ ssList(X127) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_130])])]) ).
fof(c_0_146,plain,
! [X84,X85] :
( hd(app(X84,X85)) = hd(X84)
| nil = X84
| ~ ssList(X85)
| ~ ssList(X84) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_131])])])]) ).
fof(c_0_147,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_148,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ frontsegP(app(X1,X2),X4)
| frontsegP(app(X1,app(X2,X3)),X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_40]),c_0_39]) ).
cnf(c_0_149,plain,
( ~ ssList(X1)
| app(nil,app(X1,nil)) = X1 ),
inference(spm,[status(thm)],[c_0_132,c_0_80]) ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ frontsegP(nil,app(X2,X3))
| frontsegP(app(nil,X1),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_39]),c_0_66]) ).
cnf(c_0_151,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| frontsegP(nil,app(X1,nil)) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_152,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_153,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_154,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_137,c_0_72]) ).
cnf(c_0_155,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_156,negated_conjecture,
( ~ segmentP(nil,esk2_0)
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_114])]) ).
cnf(c_0_157,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk2_0
| app(X1,cons(X2,nil)) = esk1_0 ),
inference(spm,[status(thm)],[c_0_143,c_0_45]) ).
cnf(c_0_158,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_50]),c_0_42])]) ).
cnf(c_0_159,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_160,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X1,X2)) = hd(X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
fof(c_0_161,plain,
! [X118] :
( ssItem(hd(X118))
| nil = X118
| ~ ssList(X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_147])])]) ).
cnf(c_0_162,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(app(nil,X1),X2)
| frontsegP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_42])]) ).
cnf(c_0_163,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssList(tl(X2))
| frontsegP(app(nil,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_42])]) ).
cnf(c_0_164,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(esk1_0,esk2_0)
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_114])]) ).
cnf(c_0_165,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(nil,X2)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_42])]) ).
cnf(c_0_166,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_167,negated_conjecture,
( ~ frontsegP(nil,esk2_0)
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_155]),c_0_114]),c_0_42])]) ).
cnf(c_0_168,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk2_0
| frontsegP(esk1_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_157]),c_0_158]) ).
cnf(c_0_169,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil = X1
| cons(hd(X1),tl(app(X1,X2))) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_39]),c_0_58]) ).
cnf(c_0_170,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_171,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssList(tl(X2))
| frontsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_172,negated_conjecture,
( ~ frontsegP(nil,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166]),c_0_114])]),c_0_167]) ).
fof(c_0_173,plain,
! [X81,X82,X83] :
( rearsegP(app(X83,X81),X82)
| ~ rearsegP(X81,X82)
| ~ ssList(X83)
| ~ ssList(X82)
| ~ ssList(X81) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])])]) ).
cnf(c_0_174,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(tl(app(X1,X2)))
| app(X1,X2) != esk2_0
| frontsegP(esk1_0,tl(app(X1,X2)))
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_170]) ).
cnf(c_0_175,negated_conjecture,
( ~ ssList(X1)
| ssList(tl(esk2_0))
| frontsegP(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_171,c_0_114]) ).
cnf(c_0_176,negated_conjecture,
~ frontsegP(nil,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_165]),c_0_114])]) ).
cnf(c_0_177,plain,
( ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_173]) ).
fof(c_0_178,plain,
! [X37] :
( ( ~ ssList(X37)
| nil = X37
| cons(esk8_1(X37),esk7_1(X37)) = X37 )
& ( ~ ssList(X37)
| nil = X37
| ssItem(esk8_1(X37)) )
& ( ~ ssList(X37)
| nil = X37
| ssList(esk7_1(X37)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_179,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| esk10_2(X1,X2) = nil
| hd(esk10_2(X1,X2)) = hd(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_59]),c_0_69]) ).
cnf(c_0_180,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_72]),c_0_42])]) ).
fof(c_0_181,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_182,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_72]),c_0_42])]) ).
cnf(c_0_183,negated_conjecture,
( ~ ssList(tl(esk2_0))
| frontsegP(esk1_0,tl(esk2_0))
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_47]),c_0_42])])]),c_0_114])]) ).
cnf(c_0_184,negated_conjecture,
ssList(tl(esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_42]),c_0_176]) ).
cnf(c_0_185,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X2,X3)
| rearsegP(cons(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_45]),c_0_158]) ).
cnf(c_0_186,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk8_1(X1),esk7_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_178]) ).
cnf(c_0_187,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_178]) ).
cnf(c_0_188,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_178]) ).
fof(c_0_189,plain,
! [X115] :
( rearsegP(X115,X115)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_190,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssItem(hd(X1))
| esk10_2(X1,X2) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_179]),c_0_69]) ).
cnf(c_0_191,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk2_0
| app(nil,esk1_0) = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_157]),c_0_158]) ).
fof(c_0_192,plain,
! [X35,X36] :
( ( ~ ssList(X35)
| ~ ssList(X36)
| neq(X35,X36)
| X35 = X36 )
& ( ~ ssList(X35)
| ~ ssList(X36)
| X35 != X36
| ~ neq(X35,X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_181])])])])]) ).
cnf(c_0_193,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ frontsegP(X1,X3)
| ~ segmentP(X3,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_139]),c_0_140]) ).
cnf(c_0_194,negated_conjecture,
( frontsegP(esk1_0,tl(esk2_0))
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_184])]) ).
cnf(c_0_195,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_47]),c_0_42])]),c_0_39]) ).
cnf(c_0_196,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(esk7_1(X1),X2)
| rearsegP(X1,X2)
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_186]),c_0_187]),c_0_188]) ).
cnf(c_0_197,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_189]) ).
cnf(c_0_198,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| rearsegP(nil,app(X1,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_190]),c_0_42])]),c_0_97]) ).
cnf(c_0_199,negated_conjecture,
( ~ ssItem(esk8_1(esk2_0))
| ~ ssList(esk7_1(esk2_0))
| esk2_0 = nil
| app(nil,esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_186])]),c_0_114])]) ).
cnf(c_0_200,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_192]) ).
cnf(c_0_201,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(tl(esk2_0),X1)
| segmentP(esk1_0,X1)
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_193,c_0_194]),c_0_184]),c_0_166])]) ).
cnf(c_0_202,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_195,c_0_59]),c_0_69]) ).
cnf(c_0_203,plain,
( ~ ssList(X1)
| rearsegP(X1,esk7_1(X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197]),c_0_188]) ).
cnf(c_0_204,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| frontsegP(nil,app(X1,nil)) ),
inference(spm,[status(thm)],[c_0_135,c_0_198]) ).
cnf(c_0_205,negated_conjecture,
( ~ ssList(esk7_1(esk2_0))
| esk2_0 = nil
| app(nil,esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_199,c_0_187]),c_0_114])]) ).
cnf(c_0_206,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| X1 = nil
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_200]),c_0_42])]) ).
cnf(c_0_207,negated_conjecture,
( segmentP(esk1_0,tl(esk2_0))
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_142]),c_0_184])]) ).
cnf(c_0_208,plain,
( ~ ssList(X1)
| segmentP(X1,esk7_1(X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_188]) ).
cnf(c_0_209,plain,
( ~ ssList(X1)
| nil = X1
| esk7_1(X1) = tl(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_186]),c_0_187]),c_0_188]) ).
cnf(c_0_210,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssItem(hd(X2))
| frontsegP(app(nil,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_204]),c_0_42])]) ).
cnf(c_0_211,negated_conjecture,
( esk2_0 = nil
| app(nil,esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_188]),c_0_114])]) ).
cnf(c_0_212,negated_conjecture,
( ~ segmentP(esk2_0,tl(esk2_0))
| esk2_0 = nil
| tl(esk2_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_184])]) ).
cnf(c_0_213,plain,
( ~ ssList(X1)
| segmentP(X1,tl(X1))
| nil = X1 ),
inference(spm,[status(thm)],[c_0_208,c_0_209]) ).
cnf(c_0_214,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssItem(hd(X2))
| frontsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_162,c_0_210]) ).
cnf(c_0_215,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| segmentP(esk1_0,X1)
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_211]),c_0_166]),c_0_42])]) ).
cnf(c_0_216,negated_conjecture,
( esk2_0 = nil
| tl(esk2_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_114])]) ).
cnf(c_0_217,negated_conjecture,
( ~ ssList(X1)
| ssItem(hd(esk2_0))
| frontsegP(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_214,c_0_114]) ).
cnf(c_0_218,negated_conjecture,
( ~ frontsegP(esk1_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0)
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_155]),c_0_114]),c_0_166])]) ).
fof(c_0_219,plain,
! [X32] :
( ( ~ ssList(X32)
| segmentP(nil,X32)
| nil != X32 )
& ( ~ ssList(X32)
| nil = X32
| ~ segmentP(nil,X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_220,negated_conjecture,
( ~ segmentP(nil,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_215]),c_0_114])]),c_0_156]) ).
cnf(c_0_221,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != esk2_0
| frontsegP(esk1_0,cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_157]),c_0_42])]),c_0_158]) ).
cnf(c_0_222,negated_conjecture,
( esk2_0 = nil
| cons(hd(esk2_0),nil) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_216]),c_0_114])]) ).
cnf(c_0_223,negated_conjecture,
ssItem(hd(esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_42]),c_0_176]) ).
cnf(c_0_224,negated_conjecture,
( ~ frontsegP(esk1_0,esk2_0)
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_142]),c_0_114])]) ).
cnf(c_0_225,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_219]) ).
cnf(c_0_226,negated_conjecture,
~ segmentP(nil,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_142]),c_0_114])]) ).
cnf(c_0_227,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223])]),c_0_224]) ).
cnf(c_0_228,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_225]),c_0_42])]) ).
cnf(c_0_229,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_227]),c_0_228])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC062+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n019.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 07:52:50 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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/benchmark/theBenchmark.p
% 86.16/13.23 % Version: 3.5.1
% 86.16/13.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 86.16/13.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.16/13.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 86.16/13.23 % Starting new_bool_3 with 300s (1) cores
% 86.16/13.23 % Starting new_bool_1 with 300s (1) cores
% 86.16/13.23 % Starting sh5l with 300s (1) cores
% 86.16/13.23 % sh5l with pid 2073793 completed with status 0
% 86.16/13.23 % Result found by sh5l
% 86.16/13.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 86.16/13.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.16/13.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 86.16/13.23 % Starting new_bool_3 with 300s (1) cores
% 86.16/13.23 % Starting new_bool_1 with 300s (1) cores
% 86.16/13.23 % Starting sh5l with 300s (1) cores
% 86.16/13.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 86.16/13.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 86.16/13.23 % Search class: FGHSF-FSLM21-MFFFFFNN
% 86.16/13.23 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 86.16/13.23 % Starting SubtermCWHack with 28s (1) cores
% 86.16/13.23 % SubtermCWHack with pid 2073795 completed with status 0
% 86.16/13.23 % Result found by SubtermCWHack
% 86.16/13.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 86.16/13.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.16/13.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 86.16/13.23 % Starting new_bool_3 with 300s (1) cores
% 86.16/13.23 % Starting new_bool_1 with 300s (1) cores
% 86.16/13.23 % Starting sh5l with 300s (1) cores
% 86.16/13.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 86.16/13.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 86.16/13.23 % Search class: FGHSF-FSLM21-MFFFFFNN
% 86.16/13.23 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 86.16/13.23 % Starting SubtermCWHack with 28s (1) cores
% 86.16/13.23 % Preprocessing time : 0.005 s
% 86.16/13.23
% 86.16/13.23 % Proof found!
% 86.16/13.23 % SZS status Theorem
% 86.16/13.23 % SZS output start CNFRefutation
% See solution above
% 86.16/13.24 % Parsed axioms : 96
% 86.16/13.24 % Removed by relevancy pruning/SinE : 12
% 86.16/13.24 % Initial clauses : 168
% 86.16/13.24 % Removed in clause preprocessing : 2
% 86.16/13.24 % Initial clauses in saturation : 166
% 86.16/13.24 % Processed clauses : 30707
% 86.16/13.24 % ...of these trivial : 35
% 86.16/13.24 % ...subsumed : 27079
% 86.16/13.24 % ...remaining for further processing : 3593
% 86.16/13.24 % Other redundant clauses eliminated : 3175
% 86.16/13.24 % Clauses deleted for lack of memory : 0
% 86.16/13.24 % Backward-subsumed : 163
% 86.16/13.24 % Backward-rewritten : 597
% 86.16/13.24 % Generated clauses : 373236
% 86.16/13.24 % ...of the previous two non-redundant : 353215
% 86.16/13.24 % ...aggressively subsumed : 0
% 86.16/13.24 % Contextual simplify-reflections : 1975
% 86.16/13.24 % Paramodulations : 369996
% 86.16/13.24 % Factorizations : 0
% 86.16/13.24 % NegExts : 0
% 86.16/13.24 % Equation resolutions : 3241
% 86.16/13.24 % Disequality decompositions : 0
% 86.16/13.24 % Total rewrite steps : 200872
% 86.16/13.24 % ...of those cached : 200847
% 86.16/13.24 % Propositional unsat checks : 0
% 86.16/13.24 % Propositional check models : 0
% 86.16/13.24 % Propositional check unsatisfiable : 0
% 86.16/13.24 % Propositional clauses : 0
% 86.16/13.24 % Propositional clauses after purity: 0
% 86.16/13.24 % Propositional unsat core size : 0
% 86.16/13.24 % Propositional preprocessing time : 0.000
% 86.16/13.24 % Propositional encoding time : 0.000
% 86.16/13.24 % Propositional solver time : 0.000
% 86.16/13.24 % Success case prop preproc time : 0.000
% 86.16/13.24 % Success case prop encoding time : 0.000
% 86.16/13.24 % Success case prop solver time : 0.000
% 86.16/13.24 % Current number of processed clauses : 2815
% 86.16/13.24 % Positive orientable unit clauses : 25
% 86.16/13.24 % Positive unorientable unit clauses: 0
% 86.16/13.24 % Negative unit clauses : 1
% 86.16/13.24 % Non-unit-clauses : 2789
% 86.16/13.24 % Current number of unprocessed clauses: 321928
% 86.16/13.24 % ...number of literals in the above : 2071048
% 86.16/13.24 % Current number of archived formulas : 0
% 86.16/13.24 % Current number of archived clauses : 760
% 86.16/13.24 % Clause-clause subsumption calls (NU) : 2109940
% 86.16/13.24 % Rec. Clause-clause subsumption calls : 1002378
% 86.16/13.24 % Non-unit clause-clause subsumptions : 29185
% 86.16/13.24 % Unit Clause-clause subsumption calls : 3939
% 86.16/13.24 % Rewrite failures with RHS unbound : 0
% 86.16/13.24 % BW rewrite match attempts : 13
% 86.16/13.24 % BW rewrite match successes : 13
% 86.16/13.24 % Condensation attempts : 0
% 86.16/13.24 % Condensation successes : 0
% 86.16/13.24 % Termbank termtop insertions : 8318182
% 86.16/13.24 % Search garbage collected termcells : 3709
% 86.16/13.24
% 86.16/13.24 % -------------------------------------------------
% 86.16/13.24 % User time : 11.962 s
% 86.16/13.24 % System time : 0.380 s
% 86.16/13.24 % Total time : 12.342 s
% 86.16/13.24 % Maximum resident set size: 4272 pages
% 86.16/13.24
% 86.16/13.24 % -------------------------------------------------
% 86.16/13.24 % User time : 11.968 s
% 86.16/13.24 % System time : 0.389 s
% 86.16/13.24 % Total time : 12.357 s
% 86.16/13.24 % Maximum resident set size: 4864 pages
% 86.16/13.24 % E exiting
%------------------------------------------------------------------------------