%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC079+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 : n018.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:54 PM UTC 2026
% Result : Theorem 5.34s 1.36s
% Output : CNFRefutation 5.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of formulae : 144 ( 14 unt; 0 def)
% Number of atoms : 610 ( 146 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 811 ( 345 ~; 327 |; 57 &)
% ( 8 <=>; 74 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 221 ( 0 sgn 114 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(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(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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( frontsegP(X3,X4)
& X1 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
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(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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(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(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(c_0_24,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_25,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_27,plain,
! [X214] :
( cons(hd(X214),tl(X214)) = X214
| nil = X214
| ~ ssList(X214) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_28,plain,
! [X126,X127] :
( hd(cons(X127,X126)) = X127
| ~ ssItem(X127)
| ~ ssList(X126) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
fof(c_0_29,plain,
! [X112,X113] :
( ssList(cons(X113,X112))
| ~ ssItem(X113)
| ~ ssList(X112) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_30,plain,
! [X123,X124] :
( nil != cons(X124,X123)
| ~ ssItem(X124)
| ~ ssList(X123) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_32,plain,
! [X114,X115] :
( cons(X115,X114) != X114
| ~ ssItem(X115)
| ~ ssList(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| hd(cons(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
fof(c_0_40,plain,
! [X18,X20] :
( ( ~ ssList(X18)
| singletonP(X18)
| cons(X20,nil) != X18
| ~ ssItem(X20) )
& ( ~ ssList(X18)
| ~ singletonP(X18)
| cons(esk5_1(X18),nil) = X18 )
& ( ~ ssList(X18)
| ~ singletonP(X18)
| ssItem(esk5_1(X18)) ) ),
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)],[ax4])])])])])]) ).
fof(c_0_41,negated_conjecture,
! [X256,X257,X258] :
( ( ~ neq(nil,esk51_0)
| hd(esk51_0) != X258
| cons(X258,nil) != X257
| ~ ssItem(X258)
| esk50_0 = X257
| ~ ssList(X257)
| ~ neq(esk51_0,nil) )
& ( ~ neq(nil,esk51_0)
| hd(esk51_0) != X258
| cons(X258,nil) != X257
| ~ ssItem(X258)
| esk50_0 = X257
| ~ ssList(X257)
| neq(esk49_0,nil) )
& ( ~ segmentP(esk48_0,X256)
| ~ segmentP(esk49_0,X256)
| ~ neq(X256,nil)
| ~ ssList(X256)
| ~ neq(esk51_0,nil) )
& ( ~ segmentP(esk48_0,X256)
| ~ segmentP(esk49_0,X256)
| ~ neq(X256,nil)
| ~ ssList(X256)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ neq(esk51_0,nil) )
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_37])])])])])]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(tl(cons(X1,X2)))
| tl(cons(X1,X2)) != cons(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk5_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| singletonP(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(tl(X1))
| ~ singletonP(X1)
| tl(X1) != X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_46]) ).
fof(c_0_50,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_51,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_53,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(tl(cons(X1,nil)))
| tl(cons(X1,nil)) != cons(X1,nil) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| tl(cons(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_56,plain,
! [X29,X30,X33,X34] :
( ( ~ ssList(X29)
| ~ ssList(X30)
| segmentP(X29,X30)
| app(app(X33,X30),X34) != X29
| ~ ssList(X34)
| ~ ssList(X33) )
& ( ~ ssList(X29)
| ~ ssList(X30)
| ~ segmentP(X29,X30)
| app(app(esk8_2(X29,X30),X30),esk9_2(X29,X30)) = X29 )
& ( ~ ssList(X29)
| ~ ssList(X30)
| ~ segmentP(X29,X30)
| ssList(esk9_2(X29,X30)) )
& ( ~ ssList(X29)
| ~ ssList(X30)
| ~ segmentP(X29,X30)
| ssList(esk8_2(X29,X30)) ) ),
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])])])])])]) ).
cnf(c_0_57,negated_conjecture,
( ~ neq(nil,esk51_0)
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ neq(esk51_0,nil)
| esk50_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_58,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_59,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_60,plain,
! [X229,X230] :
( hd(app(X229,X230)) = hd(X229)
| nil = X229
| ~ ssList(X230)
| ~ ssList(X229) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])])]) ).
fof(c_0_61,plain,
! [X221,X222] :
( cons(X222,X221) = app(cons(X222,nil),X221)
| ~ ssItem(X222)
| ~ ssList(X221) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_62,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_44])]) ).
fof(c_0_63,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_64,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_56]) ).
fof(c_0_65,plain,
! [X136] :
( app(nil,X136) = X136
| ~ ssList(X136) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_66,plain,
! [X131,X132] :
( ssList(app(X131,X132))
| ~ ssList(X132)
| ~ ssList(X131) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil))
| cons(hd(esk51_0),nil) = esk48_0 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59])])])]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X1,X2)) = hd(X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_69,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_35]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
( ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_72,plain,
! [X110,X111] :
( ( ~ ssList(X110)
| ~ ssList(X111)
| neq(X110,X111)
| X110 = X111 )
& ( ~ ssList(X110)
| ~ ssList(X111)
| X110 != X111
| ~ neq(X110,X111) ) ),
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_63])])])])]) ).
cnf(c_0_73,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_64]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
fof(c_0_76,plain,
! [X21,X22,X24] :
( ( ~ ssList(X21)
| ~ ssList(X22)
| frontsegP(X21,X22)
| app(X22,X24) != X21
| ~ ssList(X24) )
& ( ~ ssList(X21)
| ~ ssList(X22)
| ~ frontsegP(X21,X22)
| app(X22,esk6_2(X21,X22)) = X21 )
& ( ~ ssList(X21)
| ~ ssList(X22)
| ~ frontsegP(X21,X22)
| ssList(esk6_2(X21,X22)) ) ),
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])])])])])]) ).
fof(c_0_77,plain,
! [X168,X169,X170,X171] :
( ( ~ ssItem(X168)
| ~ ssItem(X169)
| ~ ssList(X170)
| ~ ssList(X171)
| frontsegP(cons(X168,X170),cons(X169,X171))
| ~ frontsegP(X170,X171)
| X168 != X169 )
& ( ~ ssItem(X168)
| ~ ssItem(X169)
| ~ ssList(X170)
| ~ ssList(X171)
| ~ frontsegP(cons(X168,X170),cons(X169,X171))
| frontsegP(X170,X171) )
& ( ~ ssItem(X168)
| ~ ssItem(X169)
| ~ ssList(X170)
| ~ ssList(X171)
| ~ frontsegP(cons(X168,X170),cons(X169,X171))
| X168 = X169 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| cons(hd(esk51_0),nil) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_35]),c_0_44])]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| esk5_1(X1) = hd(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_80,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_81,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| hd(cons(X1,X2)) = hd(cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_82,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ segmentP(esk48_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_52]),c_0_59])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_84,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_73,c_0_74]),c_0_44])]),c_0_75]) ).
cnf(c_0_85,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_87,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| X1 != X2
| frontsegP(cons(X1,X3),cons(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| tl(esk48_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_78]),c_0_44])]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| esk48_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_78]),c_0_44])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(hd(X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_79]) ).
cnf(c_0_91,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| singletonP(esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_78]),c_0_80])]) ).
cnf(c_0_92,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(hd(cons(X1,X2)),X2) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_55]),c_0_35]),c_0_36]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil))
| hd(cons(hd(esk51_0),nil)) = hd(esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_78]),c_0_44])]) ).
fof(c_0_94,plain,
! [X173] :
( ( ~ ssList(X173)
| frontsegP(nil,X173)
| nil != X173 )
& ( ~ ssList(X173)
| nil = X173
| ~ frontsegP(nil,X173) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
fof(c_0_95,plain,
! [X133,X134,X135] :
( cons(X135,app(X134,X133)) = app(cons(X135,X134),X133)
| ~ ssItem(X135)
| ~ ssList(X134)
| ~ ssList(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_96,plain,
! [X226,X227] :
( ( ~ ssList(X226)
| ~ ssList(X227)
| nil = app(X226,X227)
| nil != X226
| nil != X227 )
& ( ~ ssList(X226)
| ~ ssList(X227)
| nil != app(X226,X227)
| nil = X226 )
& ( ~ ssList(X226)
| ~ ssList(X227)
| nil != app(X226,X227)
| nil = X227 ) ),
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_97,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ segmentP(esk48_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_44])]) ).
cnf(c_0_99,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).
cnf(c_0_100,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_101,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_102,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| cons(hd(esk48_0),nil) = esk48_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_88]),c_0_80])]),c_0_89]) ).
cnf(c_0_103,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ssItem(hd(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_80])]) ).
cnf(c_0_104,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil))
| cons(hd(esk48_0),nil) = cons(hd(esk51_0),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_44])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_106,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_107,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
fof(c_0_108,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_109,plain,
! [X125] :
( ssItem(hd(X125))
| nil = X125
| ~ ssList(X125) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])])]) ).
fof(c_0_110,plain,
! [X191,X192,X193,X194] :
( segmentP(app(app(X193,X191),X194),X192)
| ~ segmentP(X191,X192)
| ~ ssList(X194)
| ~ ssList(X193)
| ~ ssList(X192)
| ~ ssList(X191) ),
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,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_80])]) ).
cnf(c_0_112,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_100,c_0_52]) ).
cnf(c_0_113,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(X1)
| ~ frontsegP(nil,X1)
| frontsegP(esk48_0,cons(hd(esk48_0),X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_44])]),c_0_103]) ).
cnf(c_0_114,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| cons(hd(esk48_0),nil) = cons(hd(esk51_0),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_35]),c_0_44])]) ).
cnf(c_0_115,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_105]),c_0_44])]) ).
cnf(c_0_116,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_106]),c_0_35]) ).
cnf(c_0_117,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_107])]),c_0_44])]) ).
fof(c_0_118,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_108])])]) ).
cnf(c_0_119,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| hd(esk48_0) = hd(esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_78]),c_0_44])]) ).
cnf(c_0_120,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_121,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_122,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk51_0,X1)
| ~ frontsegP(esk48_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_99]),c_0_112])]) ).
cnf(c_0_123,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| frontsegP(esk48_0,cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]),c_0_44])]) ).
cnf(c_0_124,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_44])]) ).
cnf(c_0_125,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_126,negated_conjecture,
( ~ neq(nil,esk51_0)
| esk51_0 = nil
| hd(esk48_0) = hd(esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_112])]) ).
cnf(c_0_127,negated_conjecture,
( ~ neq(nil,esk51_0)
| esk48_0 != nil
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_120]),c_0_112])]) ).
cnf(c_0_128,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_121,c_0_117]),c_0_44])]) ).
cnf(c_0_129,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ frontsegP(esk51_0,cons(hd(esk51_0),nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]),c_0_70]) ).
cnf(c_0_130,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(tl(X1),X2)
| frontsegP(X1,cons(hd(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_33]),c_0_120]),c_0_125]) ).
cnf(c_0_131,negated_conjecture,
( ~ neq(nil,esk51_0)
| ssItem(hd(esk51_0))
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_126]),c_0_80])]),c_0_127]) ).
fof(c_0_132,plain,
! [X172] :
( frontsegP(X172,nil)
| ~ ssList(X172) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_128,c_0_74]) ).
cnf(c_0_134,negated_conjecture,
( ~ neq(nil,esk51_0)
| ~ frontsegP(tl(esk51_0),nil)
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_44]),c_0_112])]),c_0_131]) ).
cnf(c_0_135,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_136,negated_conjecture,
( ~ segmentP(esk51_0,esk51_0)
| ~ segmentP(esk48_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_59]),c_0_112])]) ).
cnf(c_0_137,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_133,c_0_99]),c_0_44])]) ).
cnf(c_0_138,negated_conjecture,
( ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_139,negated_conjecture,
( ~ frontsegP(nil,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_80]),c_0_112])]) ).
cnf(c_0_140,negated_conjecture,
( ~ neq(nil,esk51_0)
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_125]),c_0_112])]) ).
cnf(c_0_141,negated_conjecture,
~ frontsegP(nil,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_137]),c_0_112])]) ).
cnf(c_0_142,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_83]),c_0_112]),c_0_44])]) ).
cnf(c_0_143,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_142]),c_0_115])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC079+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 % Computer : n018.cluster.edu
% 0.14/0.43 % Model : x86_64 x86_64
% 0.14/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.43 % Memory : 8046.5625MB
% 0.14/0.43 % OS : Linux 6.8.0-71-generic
% 0.14/0.43 % CPULimit : 300
% 0.14/0.43 % WCLimit : 300
% 0.14/0.43 % DateTime : Mon Sep 21 07:55:58 UTC 2026
% 0.14/0.43 % CPUTime :
% 0.14/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.48 Running first-order theorem proving
% 0.14/0.48 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
% 5.34/1.36 % Version: 3.5.1
% 5.34/1.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.34/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.34/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.34/1.36 % Starting new_bool_3 with 300s (1) cores
% 5.34/1.36 % Starting new_bool_1 with 300s (1) cores
% 5.34/1.36 % Starting sh5l with 300s (1) cores
% 5.34/1.36 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1387368 completed with status 0
% 5.34/1.36 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 5.34/1.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.34/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.34/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.34/1.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.34/1.36 % No SInE strategy applied
% 5.34/1.36 % Search class: FGHSF-FSLM21-MFFFFFNN
% 5.34/1.36 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.34/1.36 % Starting SubtermCWHack with 136s (1) cores
% 5.34/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.34/1.36 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 5.34/1.36 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 5.34/1.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 5.34/1.36 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 1387379 completed with status 0
% 5.34/1.36 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 5.34/1.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.34/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.34/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.34/1.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.34/1.36 % No SInE strategy applied
% 5.34/1.36 % Search class: FGHSF-FSLM21-MFFFFFNN
% 5.34/1.36 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.34/1.36 % Starting SubtermCWHack with 136s (1) cores
% 5.34/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.34/1.36 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 5.34/1.36 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 5.34/1.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 5.34/1.36 % Preprocessing time : 0.006 s
% 5.34/1.36 % Presaturation interreduction done
% 5.34/1.36
% 5.34/1.36 % Proof found!
% 5.34/1.36 % SZS status Theorem
% 5.34/1.36 % SZS output start CNFRefutation
% See solution above
% 5.34/1.36 % Parsed axioms : 96
% 5.34/1.36 % Removed by relevancy pruning/SinE : 0
% 5.34/1.36 % Initial clauses : 202
% 5.34/1.36 % Removed in clause preprocessing : 2
% 5.34/1.36 % Initial clauses in saturation : 200
% 5.34/1.36 % Processed clauses : 2735
% 5.34/1.36 % ...of these trivial : 5
% 5.34/1.36 % ...subsumed : 1717
% 5.34/1.36 % ...remaining for further processing : 1013
% 5.34/1.36 % Other redundant clauses eliminated : 191
% 5.34/1.36 % Clauses deleted for lack of memory : 0
% 5.34/1.36 % Backward-subsumed : 109
% 5.34/1.36 % Backward-rewritten : 252
% 5.34/1.36 % Generated clauses : 11200
% 5.34/1.36 % ...of the previous two non-redundant : 10482
% 5.34/1.36 % ...aggressively subsumed : 0
% 5.34/1.36 % Contextual simplify-reflections : 437
% 5.34/1.36 % Paramodulations : 11004
% 5.34/1.36 % Factorizations : 0
% 5.34/1.36 % NegExts : 0
% 5.34/1.36 % Equation resolutions : 199
% 5.34/1.36 % Disequality decompositions : 0
% 5.34/1.36 % Total rewrite steps : 4664
% 5.34/1.36 % ...of those cached : 4644
% 5.34/1.36 % Propositional unsat checks : 0
% 5.34/1.36 % Propositional check models : 0
% 5.34/1.36 % Propositional check unsatisfiable : 0
% 5.34/1.36 % Propositional clauses : 0
% 5.34/1.36 % Propositional clauses after purity: 0
% 5.34/1.36 % Propositional unsat core size : 0
% 5.34/1.36 % Propositional preprocessing time : 0.000
% 5.34/1.36 % Propositional encoding time : 0.000
% 5.34/1.36 % Propositional solver time : 0.000
% 5.34/1.36 % Success case prop preproc time : 0.000
% 5.34/1.36 % Success case prop encoding time : 0.000
% 5.34/1.36 % Success case prop solver time : 0.000
% 5.34/1.36 % Current number of processed clauses : 437
% 5.34/1.36 % Positive orientable unit clauses : 19
% 5.34/1.36 % Positive unorientable unit clauses: 0
% 5.34/1.36 % Negative unit clauses : 2
% 5.34/1.36 % Non-unit-clauses : 416
% 5.34/1.36 % Current number of unprocessed clauses: 8060
% 5.34/1.36 % ...number of literals in the above : 55812
% 5.34/1.36 % Current number of archived formulas : 0
% 5.34/1.36 % Current number of archived clauses : 552
% 5.34/1.36 % Clause-clause subsumption calls (NU) : 124632
% 5.34/1.36 % Rec. Clause-clause subsumption calls : 28087
% 5.34/1.36 % Non-unit clause-clause subsumptions : 2186
% 5.34/1.36 % Unit Clause-clause subsumption calls : 377
% 5.34/1.36 % Rewrite failures with RHS unbound : 0
% 5.34/1.36 % BW rewrite match attempts : 3
% 5.34/1.36 % BW rewrite match successes : 3
% 5.34/1.36 % Condensation attempts : 0
% 5.34/1.36 % Condensation successes : 0
% 5.34/1.36 % Termbank termtop insertions : 244016
% 5.34/1.36 % Search garbage collected termcells : 4345
% 5.34/1.36
% 5.34/1.36 % -------------------------------------------------
% 5.34/1.36 % User time : 0.639 s
% 5.34/1.36 % System time : 0.024 s
% 5.34/1.36 % Total time : 0.663 s
% 5.34/1.36 % Maximum resident set size: 4016 pages
% 5.34/1.36
% 5.34/1.36 % -------------------------------------------------
% 5.34/1.36 % User time : 3.308 s
% 5.34/1.36 % System time : 0.106 s
% 5.34/1.36 % Total time : 3.413 s
% 5.34/1.36 % Maximum resident set size: 4608 pages
% 5.34/1.36 % E exiting
%------------------------------------------------------------------------------