TSTP Solution File: SWC015+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC015+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:41:03 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of formulae : 81 ( 12 unt; 0 def)
% Number of atoms : 315 ( 137 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 378 ( 144 ~; 167 |; 30 &)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn; 56 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X1
& app(cons(X7,nil),X8) = X2 ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax17) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax24) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax26) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax86) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax79) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax28) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax85) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax22) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax18) ).
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/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p',ax27) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X1
& app(cons(X7,nil),X8) = X2 ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_15,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk4_0 = X13
| ~ ssList(X14)
| tl(esk4_0) != X14
| app(esk3_0,X14) != X13
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk4_0 = X13
| ~ ssList(X14)
| tl(esk4_0) != X14
| app(esk3_0,X14) != X13
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ ssItem(X15)
| ~ ssList(X16)
| cons(X15,nil) != esk1_0
| app(cons(X15,nil),X16) != esk2_0 )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X15)
| ~ ssList(X16)
| cons(X15,nil) != esk1_0
| app(cons(X15,nil),X16) != esk2_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
cnf(c_0_16,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_16]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( esk4_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| tl(esk4_0) != X2
| app(esk3_0,X2) != X1
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssList(X20)
| ~ ssList(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| ~ ssList(app(esk1_0,tl(esk4_0)))
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])])])]) ).
cnf(c_0_25,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X56] :
( ~ ssList(X56)
| nil = X56
| ssList(tl(X56)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_29,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(app(esk1_0,tl(esk4_0)))
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X26,X27] :
( ~ ssList(X26)
| ~ ssList(X27)
| ssList(app(X26,X27)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_32,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(app(esk1_0,tl(esk4_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26])]) ).
cnf(c_0_33,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
! [X64,X65] :
( ~ ssList(X64)
| ~ ssList(X65)
| nil = X64
| tl(app(X64,X65)) = app(tl(X64),X65) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])]) ).
cnf(c_0_36,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
fof(c_0_37,plain,
! [X32,X33,X34] :
( ~ ssList(X32)
| ~ ssList(X33)
| ~ ssList(X34)
| app(X34,X33) != app(X32,X33)
| X34 = X32 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).
fof(c_0_38,plain,
! [X31] :
( ~ ssList(X31)
| app(nil,X31) = X31 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_39,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_26])]) ).
fof(c_0_41,plain,
! [X71,X72] :
( ~ ssList(X71)
| ~ ssList(X72)
| nil = X71
| hd(app(X71,X72)) = hd(X71) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).
cnf(c_0_42,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( app(tl(esk1_0),tl(esk4_0)) = tl(esk4_0)
| esk4_0 = nil
| esk1_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]) ).
cnf(c_0_45,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( X1 = nil
| app(X1,X2) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27])]) ).
cnf(c_0_47,negated_conjecture,
( app(tl(esk1_0),tl(esk4_0)) = tl(esk4_0)
| esk1_0 = nil
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_26])]) ).
cnf(c_0_48,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,nil) != esk1_0
| app(cons(X1,nil),X2) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_49,plain,
! [X38,X39] :
( ~ ssList(X38)
| ~ ssItem(X39)
| cons(X39,X38) = app(cons(X39,nil),X38) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_50,plain,
! [X63] :
( ~ ssList(X63)
| nil = X63
| cons(hd(X63),tl(X63)) = X63 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_51,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk4_0 = nil
| esk1_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_34])]) ).
cnf(c_0_52,negated_conjecture,
( tl(esk1_0) = nil
| esk4_0 = nil
| esk1_0 = nil
| ~ ssList(tl(esk4_0))
| ~ ssList(tl(esk1_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( app(cons(X1,nil),X2) != esk4_0
| cons(X1,nil) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_18]),c_0_21])]) ).
cnf(c_0_54,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk1_0 = nil
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_30]),c_0_26])]) ).
cnf(c_0_57,negated_conjecture,
( tl(esk1_0) = nil
| esk1_0 = nil
| esk4_0 = nil
| ~ ssList(tl(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_30]),c_0_26])]) ).
fof(c_0_58,plain,
! [X66] :
( ~ ssList(X66)
| nil = X66
| ssItem(hd(X66)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_59,plain,
! [X48,X49] :
( ~ ssList(X48)
| ~ ssItem(X49)
| cons(X49,X48) != X48 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
fof(c_0_60,plain,
! [X28,X29,X30] :
( ~ ssList(X28)
| ~ ssList(X29)
| ~ ssItem(X30)
| cons(X30,app(X29,X28)) = app(cons(X30,X29),X28) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_61,negated_conjecture,
( cons(X1,nil) != esk1_0
| cons(X1,X2) != esk4_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
( cons(hd(esk4_0),tl(esk1_0)) = esk1_0
| esk4_0 = nil
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_34])]) ).
cnf(c_0_63,negated_conjecture,
( tl(esk1_0) = nil
| esk4_0 = nil
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_30]),c_0_34])]) ).
cnf(c_0_64,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_66,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( esk4_0 = nil
| cons(hd(esk4_0),nil) != esk1_0
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_55])]),c_0_26])]) ).
cnf(c_0_68,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk1_0 = nil
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( esk4_0 = nil
| esk1_0 = nil
| ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_56]),c_0_34])]) ).
cnf(c_0_70,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_33]) ).
cnf(c_0_71,negated_conjecture,
( esk1_0 = nil
| esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_72,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_54]),c_0_27])]) ).
cnf(c_0_73,negated_conjecture,
( esk4_0 = nil
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_30]),c_0_26])]) ).
cnf(c_0_74,plain,
( nil = X1
| app(nil,tl(X1)) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_55]),c_0_64]),c_0_30]) ).
cnf(c_0_75,negated_conjecture,
( app(nil,tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_40,c_0_73]) ).
cnf(c_0_76,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_77,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_26])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_79,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_21,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC015+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:36:34 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.NAHyUZy0v6/E---3.1_6017.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 6095 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 6099 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.002 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 96
% 0.17/0.47 # Removed by relevancy pruning/SinE : 67
% 0.17/0.47 # Initial clauses : 51
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 51
% 0.17/0.47 # Processed clauses : 267
% 0.17/0.47 # ...of these trivial : 5
% 0.17/0.47 # ...subsumed : 74
% 0.17/0.47 # ...remaining for further processing : 188
% 0.17/0.47 # Other redundant clauses eliminated : 22
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 56
% 0.17/0.47 # Backward-rewritten : 15
% 0.17/0.47 # Generated clauses : 487
% 0.17/0.47 # ...of the previous two non-redundant : 386
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 28
% 0.17/0.47 # Paramodulations : 462
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 27
% 0.17/0.47 # Total rewrite steps : 350
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 67
% 0.17/0.47 # Positive orientable unit clauses : 9
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 1
% 0.17/0.47 # Non-unit-clauses : 57
% 0.17/0.47 # Current number of unprocessed clauses: 208
% 0.17/0.47 # ...number of literals in the above : 1198
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 117
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 2936
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 734
% 0.17/0.47 # Non-unit clause-clause subsumptions : 158
% 0.17/0.47 # Unit Clause-clause subsumption calls : 60
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 1
% 0.17/0.47 # BW rewrite match successes : 1
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 12218
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.022 s
% 0.17/0.47 # System time : 0.001 s
% 0.17/0.47 # Total time : 0.023 s
% 0.17/0.47 # Maximum resident set size: 2044 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.024 s
% 0.17/0.47 # System time : 0.004 s
% 0.17/0.47 # Total time : 0.028 s
% 0.17/0.47 # Maximum resident set size: 1796 pages
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------