TSTP Solution File: SWC363+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC363+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:47 EDT 2023
% Result : Theorem 30.50s 4.30s
% Output : CNFRefutation 30.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 116 ( 38 unt; 0 def)
% Number of atoms : 387 ( 94 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 463 ( 192 ~; 185 |; 31 &)
% ( 4 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 163 ( 0 sgn; 89 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',co1) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax26) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax3) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax16) ).
fof(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax43) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax45) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax28) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax27) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax25) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax18) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax7) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax86) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax84) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax83) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax81) ).
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/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax56) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax80) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p',ax42) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_21,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_22,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_23,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,plain,
! [X94,X95,X97] :
( ( ssList(esk14_2(X94,X95))
| ~ frontsegP(X94,X95)
| ~ ssList(X95)
| ~ ssList(X94) )
& ( app(X95,esk14_2(X94,X95)) = X94
| ~ frontsegP(X94,X95)
| ~ ssList(X95)
| ~ ssList(X94) )
& ( ~ ssList(X97)
| app(X95,X97) != X94
| frontsegP(X94,X95)
| ~ ssList(X95)
| ~ ssList(X94) ) ),
inference(distribute,[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_25,plain,
! [X83,X84] :
( ~ ssList(X83)
| ~ ssList(X84)
| ssList(app(X83,X84)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_26,plain,
! [X27,X28,X31,X32] :
( ( ssList(esk8_2(X27,X28))
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( ssList(esk9_2(X27,X28))
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( app(esk8_2(X27,X28),cons(X28,esk9_2(X27,X28))) = X27
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| app(X31,cons(X28,X32)) != X27
| memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_28])]) ).
cnf(c_0_37,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_31]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),cons(esk5_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_35]),c_0_36])]) ).
fof(c_0_41,plain,
! [X40,X41] :
( ~ ssList(X40)
| ~ ssItem(X41)
| ssList(cons(X41,X40)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_42,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_43,plain,
! [X102,X103,X104] :
( ~ ssList(X102)
| ~ ssList(X103)
| ~ ssList(X104)
| ~ frontsegP(X102,X103)
| frontsegP(app(X102,X104),X103) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])]) ).
fof(c_0_44,plain,
! [X128] :
( ~ ssList(X128)
| frontsegP(X128,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_45,negated_conjecture,
( frontsegP(esk4_0,esk8_2(esk4_0,esk5_0))
| ~ ssList(cons(esk5_0,esk9_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_46,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk9_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_48,plain,
( frontsegP(app(X1,X3),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_51,plain,
( app(X1,esk14_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_52,negated_conjecture,
frontsegP(esk4_0,esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_36])]) ).
cnf(c_0_53,plain,
( ssList(esk14_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_54,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),esk14_2(esk4_0,esk8_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_35]),c_0_40])]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk14_2(esk4_0,esk8_2(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_40]),c_0_35])]) ).
fof(c_0_57,plain,
! [X21] :
( ~ ssList(X21)
| app(nil,X21) = X21 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_58,negated_conjecture,
frontsegP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_40])]) ).
fof(c_0_59,plain,
! [X50,X51,X52] :
( ~ ssList(X50)
| ~ ssList(X51)
| ~ ssItem(X52)
| cons(X52,app(X51,X50)) = app(cons(X52,X51),X50) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_60,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_61,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_62,negated_conjecture,
app(nil,esk14_2(esk4_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_58]),c_0_35]),c_0_50])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk14_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_58]),c_0_50]),c_0_35])]) ).
cnf(c_0_64,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_65,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_28])]) ).
cnf(c_0_66,negated_conjecture,
esk14_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
fof(c_0_67,plain,
! [X181,X182] :
( ~ ssList(X181)
| ~ ssItem(X182)
| tl(cons(X182,X181)) = X181 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])]) ).
fof(c_0_68,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| cons(X43,X42) != X42 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
fof(c_0_69,plain,
! [X65,X66,X69,X70] :
( ( ssList(esk12_2(X65,X66))
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( ssList(esk13_2(X65,X66))
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( app(app(esk12_2(X65,X66),X66),esk13_2(X65,X66)) = X65
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( ~ ssList(X69)
| ~ ssList(X70)
| app(app(X69,X66),X70) != X65
| segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) ) ),
inference(distribute,[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_70,plain,
! [X110,X111] :
( ~ ssList(X110)
| ~ ssList(X111)
| nil = X110
| tl(app(X110,X111)) = app(tl(X110),X111) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])]) ).
fof(c_0_71,plain,
! [X26] :
( ~ ssList(X26)
| app(X26,nil) = X26 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_72,negated_conjecture,
( cons(esk5_0,app(nil,X1)) = app(esk3_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_50]),c_0_36])]) ).
cnf(c_0_73,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(rw,[status(thm)],[c_0_62,c_0_66]) ).
cnf(c_0_74,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_75,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_76,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
fof(c_0_78,plain,
! [X24,X25] :
( ( nil = X25
| nil != app(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( nil = X24
| nil != app(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( nil != X25
| nil != X24
| nil = app(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_79,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
fof(c_0_80,plain,
! [X22,X23] :
( ~ ssList(X22)
| ~ ssItem(X23)
| cons(X23,X22) = app(cons(X23,nil),X22) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_81,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_82,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_83,negated_conjecture,
app(esk3_0,esk4_0) = cons(esk5_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_35])]) ).
cnf(c_0_84,negated_conjecture,
tl(esk3_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_65]),c_0_50]),c_0_36])]) ).
cnf(c_0_85,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_86,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_65]),c_0_50]),c_0_36])]) ).
cnf(c_0_87,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_88,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_89,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_90,plain,
( app(tl(X1),nil) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_50])]) ).
cnf(c_0_91,negated_conjecture,
tl(cons(esk5_0,esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_83]),c_0_84]),c_0_73]),c_0_35]),c_0_85])]),c_0_86]) ).
cnf(c_0_92,negated_conjecture,
ssList(cons(esk5_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_83]),c_0_35]),c_0_85])]) ).
cnf(c_0_93,negated_conjecture,
cons(esk5_0,esk4_0) != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_83]),c_0_35]),c_0_85])]),c_0_86]) ).
fof(c_0_94,plain,
! [X77,X78,X79,X80] :
( ~ ssList(X77)
| ~ ssList(X78)
| ~ ssList(X79)
| ~ ssList(X80)
| ~ segmentP(X77,X78)
| segmentP(app(app(X79,X77),X80),X78) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_95,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_61]),c_0_50])]),c_0_32]) ).
cnf(c_0_96,negated_conjecture,
( app(esk3_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_65]),c_0_36])]) ).
fof(c_0_97,plain,
! [X88,X89,X90] :
( ~ ssList(X88)
| ~ ssList(X89)
| ~ ssList(X90)
| app(X89,X90) != app(X89,X88)
| X90 = X88 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).
cnf(c_0_98,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]),c_0_93]) ).
cnf(c_0_99,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( segmentP(cons(esk5_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_85])]) ).
cnf(c_0_101,negated_conjecture,
( ssList(cons(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_96]),c_0_85])]) ).
fof(c_0_102,plain,
! [X127] :
( ~ ssList(X127)
| frontsegP(X127,X127) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).
cnf(c_0_103,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_104,negated_conjecture,
frontsegP(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_98]),c_0_35]),c_0_50])]) ).
cnf(c_0_105,negated_conjecture,
( segmentP(app(app(X1,cons(esk5_0,X2)),X3),esk3_0)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_85])]),c_0_101]) ).
cnf(c_0_106,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_107,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_82]),c_0_50])]) ).
cnf(c_0_108,negated_conjecture,
app(esk4_0,esk14_2(esk4_0,esk4_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_104]),c_0_35])]) ).
cnf(c_0_109,negated_conjecture,
ssList(esk14_2(esk4_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_104]),c_0_35])]) ).
cnf(c_0_110,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_111,negated_conjecture,
( segmentP(app(esk4_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_39]),c_0_40]),c_0_47])]) ).
cnf(c_0_112,plain,
( app(X1,esk14_2(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_106]) ).
cnf(c_0_113,negated_conjecture,
esk14_2(esk4_0,esk4_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_35]),c_0_109])]) ).
cnf(c_0_114,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_23]),c_0_76]) ).
cnf(c_0_115,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_50]),c_0_35])]),c_0_114]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC363+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n016.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:32:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.cHIxkGaLj3/E---3.1_17931.p
% 30.50/4.30 # Version: 3.1pre001
% 30.50/4.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 30.50/4.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.50/4.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 30.50/4.30 # Starting new_bool_3 with 300s (1) cores
% 30.50/4.30 # Starting new_bool_1 with 300s (1) cores
% 30.50/4.30 # Starting sh5l with 300s (1) cores
% 30.50/4.30 # sh5l with pid 18012 completed with status 0
% 30.50/4.30 # Result found by sh5l
% 30.50/4.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 30.50/4.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.50/4.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 30.50/4.30 # Starting new_bool_3 with 300s (1) cores
% 30.50/4.30 # Starting new_bool_1 with 300s (1) cores
% 30.50/4.30 # Starting sh5l with 300s (1) cores
% 30.50/4.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 30.50/4.30 # Search class: FGHSF-FSLM21-MFFFFFNN
% 30.50/4.30 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 30.50/4.30 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 30.50/4.30 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 18015 completed with status 0
% 30.50/4.30 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 30.50/4.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 30.50/4.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.50/4.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 30.50/4.30 # Starting new_bool_3 with 300s (1) cores
% 30.50/4.30 # Starting new_bool_1 with 300s (1) cores
% 30.50/4.30 # Starting sh5l with 300s (1) cores
% 30.50/4.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 30.50/4.30 # Search class: FGHSF-FSLM21-MFFFFFNN
% 30.50/4.30 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 30.50/4.30 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 30.50/4.30 # Preprocessing time : 0.003 s
% 30.50/4.30 # Presaturation interreduction done
% 30.50/4.30
% 30.50/4.30 # Proof found!
% 30.50/4.30 # SZS status Theorem
% 30.50/4.30 # SZS output start CNFRefutation
% See solution above
% 30.50/4.30 # Parsed axioms : 96
% 30.50/4.30 # Removed by relevancy pruning/SinE : 8
% 30.50/4.30 # Initial clauses : 179
% 30.50/4.30 # Removed in clause preprocessing : 2
% 30.50/4.30 # Initial clauses in saturation : 177
% 30.50/4.30 # Processed clauses : 20522
% 30.50/4.30 # ...of these trivial : 222
% 30.50/4.30 # ...subsumed : 15737
% 30.50/4.30 # ...remaining for further processing : 4563
% 30.50/4.30 # Other redundant clauses eliminated : 496
% 30.50/4.30 # Clauses deleted for lack of memory : 0
% 30.50/4.30 # Backward-subsumed : 172
% 30.50/4.30 # Backward-rewritten : 273
% 30.50/4.30 # Generated clauses : 129158
% 30.50/4.30 # ...of the previous two non-redundant : 118240
% 30.50/4.30 # ...aggressively subsumed : 0
% 30.50/4.30 # Contextual simplify-reflections : 1368
% 30.50/4.30 # Paramodulations : 128636
% 30.50/4.30 # Factorizations : 4
% 30.50/4.30 # NegExts : 0
% 30.50/4.30 # Equation resolutions : 519
% 30.50/4.30 # Total rewrite steps : 152522
% 30.50/4.30 # Propositional unsat checks : 0
% 30.50/4.30 # Propositional check models : 0
% 30.50/4.30 # Propositional check unsatisfiable : 0
% 30.50/4.30 # Propositional clauses : 0
% 30.50/4.30 # Propositional clauses after purity: 0
% 30.50/4.30 # Propositional unsat core size : 0
% 30.50/4.30 # Propositional preprocessing time : 0.000
% 30.50/4.30 # Propositional encoding time : 0.000
% 30.50/4.30 # Propositional solver time : 0.000
% 30.50/4.30 # Success case prop preproc time : 0.000
% 30.50/4.30 # Success case prop encoding time : 0.000
% 30.50/4.30 # Success case prop solver time : 0.000
% 30.50/4.30 # Current number of processed clauses : 3927
% 30.50/4.30 # Positive orientable unit clauses : 629
% 30.50/4.30 # Positive unorientable unit clauses: 0
% 30.50/4.30 # Negative unit clauses : 558
% 30.50/4.30 # Non-unit-clauses : 2740
% 30.50/4.30 # Current number of unprocessed clauses: 97027
% 30.50/4.30 # ...number of literals in the above : 585558
% 30.50/4.30 # Current number of archived formulas : 0
% 30.50/4.30 # Current number of archived clauses : 616
% 30.50/4.30 # Clause-clause subsumption calls (NU) : 1726068
% 30.50/4.30 # Rec. Clause-clause subsumption calls : 343938
% 30.50/4.30 # Non-unit clause-clause subsumptions : 8753
% 30.50/4.30 # Unit Clause-clause subsumption calls : 103676
% 30.50/4.30 # Rewrite failures with RHS unbound : 0
% 30.50/4.30 # BW rewrite match attempts : 1783
% 30.50/4.30 # BW rewrite match successes : 123
% 30.50/4.30 # Condensation attempts : 0
% 30.50/4.30 # Condensation successes : 0
% 30.50/4.30 # Termbank termtop insertions : 3391863
% 30.50/4.30
% 30.50/4.30 # -------------------------------------------------
% 30.50/4.30 # User time : 3.699 s
% 30.50/4.30 # System time : 0.084 s
% 30.50/4.30 # Total time : 3.783 s
% 30.50/4.30 # Maximum resident set size: 2436 pages
% 30.50/4.30
% 30.50/4.30 # -------------------------------------------------
% 30.50/4.30 # User time : 3.703 s
% 30.50/4.30 # System time : 0.085 s
% 30.50/4.30 # Total time : 3.787 s
% 30.50/4.30 # Maximum resident set size: 1800 pages
% 30.50/4.30 % E---3.1 exiting
%------------------------------------------------------------------------------