TSTP Solution File: SWC022+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC022+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:26:12 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 24
% Syntax : Number of formulae : 166 ( 21 unt; 0 def)
% Number of atoms : 625 ( 182 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 803 ( 344 ~; 352 |; 44 &)
% ( 4 <=>; 59 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 226 ( 1 sgn 102 !; 9 ?)
% 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)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
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(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(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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax19) ).
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(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax41) ).
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(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( X1 = X2
& frontsegP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
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(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_25,negated_conjecture,
! [X12,X13,X14] :
( 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(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_24])])])])])])])]) ).
cnf(c_0_26,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( esk3_0 = X2
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk1_0 = X1
| cons(X2,nil) != X1
| hd(esk2_0) != X2
| ~ ssList(X1)
| ~ neq(nil,esk2_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_29]),c_0_29]),c_0_30])]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).
fof(c_0_33,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])])]) ).
fof(c_0_34,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_35,negated_conjecture,
( cons(X1,nil) = esk1_0
| hd(esk2_0) != X1
| ~ ssList(cons(X1,nil))
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_38,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( cons(X1,nil) = esk1_0
| hd(esk2_0) != X1
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ frontsegP(X4,X5)
| frontsegP(app(X4,X6),X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])])])]) ).
fof(c_0_43,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_44,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
( cons(hd(esk2_0),nil) = esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(er,[status(thm)],[c_0_40]) ).
fof(c_0_46,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_47,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_29]),c_0_30])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_49,plain,
! [X2] :
( ~ ssList(X2)
| frontsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).
cnf(c_0_50,plain,
( frontsegP(app(X1,X2),X3)
| ~ frontsegP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_52,plain,
! [X2] :
( ( ~ frontsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| frontsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_53,negated_conjecture,
( app(esk1_0,nil) = esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37])]) ).
cnf(c_0_54,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_55,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])])])]) ).
cnf(c_0_56,negated_conjecture,
( ~ frontsegP(esk1_0,esk2_0)
| ~ frontsegP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_30]),c_0_48])]) ).
cnf(c_0_57,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,plain,
( frontsegP(X1,X2)
| ~ frontsegP(nil,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_37])]) ).
cnf(c_0_59,plain,
( frontsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( app(esk1_0,nil) = esk1_0
| nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48])]) ).
cnf(c_0_61,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,negated_conjecture,
~ frontsegP(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_48])]) ).
cnf(c_0_63,plain,
( frontsegP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_65,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
cnf(c_0_66,negated_conjecture,
( app(esk1_0,nil) = esk1_0
| nil = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_48]),c_0_37])]) ).
cnf(c_0_67,negated_conjecture,
nil != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_48]),c_0_64])]) ).
fof(c_0_68,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])])]) ).
fof(c_0_69,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])])]) ).
cnf(c_0_70,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_71,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
fof(c_0_73,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
fof(c_0_74,plain,
! [X5,X6,X7,X8] :
( ( X7 = X8
| cons(X7,X5) != cons(X8,X6)
| ~ ssItem(X8)
| ~ ssItem(X7)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( X6 = X5
| cons(X7,X5) != cons(X8,X6)
| ~ ssItem(X8)
| ~ ssItem(X7)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])])])]) ).
fof(c_0_75,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,X3)) = X4 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
cnf(c_0_76,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_77,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_38]),c_0_70]) ).
cnf(c_0_78,negated_conjecture,
( app(cons(X1,esk1_0),nil) = cons(X1,esk1_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_71]),c_0_37]),c_0_64])]) ).
cnf(c_0_79,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_51]),c_0_37])]) ).
cnf(c_0_80,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_81,plain,
( X3 = X4
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X4)
| cons(X3,X1) != cons(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_83,negated_conjecture,
( cons(hd(esk2_0),X1) = app(esk1_0,X1)
| ~ ssList(X1)
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(spm,[status(thm)],[c_0_76,c_0_45]) ).
cnf(c_0_84,negated_conjecture,
( ssList(cons(X1,esk1_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_37]),c_0_64])]) ).
cnf(c_0_85,negated_conjecture,
( app(nil,esk1_0) = esk1_0
| nil = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_66]),c_0_37]),c_0_64])]) ).
fof(c_0_86,plain,
! [X2] :
( ~ ssList(X2)
| frontsegP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_87,negated_conjecture,
( nil != esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_45]),c_0_37])]) ).
cnf(c_0_88,plain,
( X1 = X2
| cons(X1,X3) != app(cons(X2,nil),X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_76]) ).
cnf(c_0_89,negated_conjecture,
( hd(esk2_0) = hd(esk1_0)
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_45]),c_0_37])]) ).
cnf(c_0_90,negated_conjecture,
( app(app(esk1_0,esk1_0),nil) = app(esk1_0,esk1_0)
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_83]),c_0_64])]) ).
cnf(c_0_91,negated_conjecture,
( ssList(app(esk1_0,esk1_0))
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_83]),c_0_64])]) ).
fof(c_0_92,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ frontsegP(X4,X3)
| X3 = X4 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])])])]) ).
cnf(c_0_93,negated_conjecture,
( nil = esk2_0
| frontsegP(esk1_0,X1)
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_85]),c_0_64]),c_0_37])]) ).
cnf(c_0_94,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_95,negated_conjecture,
( nil = esk2_0
| nil != esk1_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_54]),c_0_48])]) ).
cnf(c_0_96,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_38]),c_0_70]) ).
cnf(c_0_97,plain,
( X1 = X2
| cons(X1,X3) != cons(X2,nil)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_44]),c_0_37])]) ).
cnf(c_0_98,negated_conjecture,
( hd(esk2_0) = hd(esk1_0)
| nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_54]),c_0_48])]) ).
fof(c_0_99,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])])])]) ).
cnf(c_0_100,negated_conjecture,
( app(app(esk1_0,esk1_0),nil) = app(esk1_0,esk1_0)
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_54]),c_0_48])]),c_0_67]) ).
cnf(c_0_101,negated_conjecture,
( ssList(app(esk1_0,esk1_0))
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_54]),c_0_48])]),c_0_67]) ).
cnf(c_0_102,plain,
( X1 = X2
| ~ frontsegP(X2,X1)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_103,negated_conjecture,
( nil = esk2_0
| frontsegP(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_37])]) ).
cnf(c_0_104,negated_conjecture,
( nil = esk2_0
| nil != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_61]),c_0_48]),c_0_37])]) ).
cnf(c_0_105,negated_conjecture,
( cons(X1,esk1_0) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_78]),c_0_37]),c_0_64])]) ).
cnf(c_0_106,negated_conjecture,
( hd(esk2_0) = X1
| cons(X1,nil) != esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_45]),c_0_37])]) ).
cnf(c_0_107,negated_conjecture,
( nil = esk2_0
| ssItem(hd(esk1_0))
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_98]),c_0_48])]) ).
cnf(c_0_108,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_109,negated_conjecture,
app(app(esk1_0,esk1_0),nil) = app(esk1_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_61]),c_0_48]),c_0_37])]),c_0_67]) ).
cnf(c_0_110,negated_conjecture,
ssList(app(esk1_0,esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_61]),c_0_48]),c_0_37])]),c_0_67]) ).
cnf(c_0_111,negated_conjecture,
( nil = esk2_0
| ~ frontsegP(nil,esk1_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_64]),c_0_37])]),c_0_104]) ).
cnf(c_0_112,negated_conjecture,
( app(esk1_0,esk1_0) != nil
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_83]),c_0_64])]) ).
cnf(c_0_113,negated_conjecture,
( hd(esk2_0) = X1
| cons(X1,nil) != esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_54]),c_0_48])]),c_0_67]) ).
cnf(c_0_114,negated_conjecture,
( cons(hd(esk1_0),nil) = esk1_0
| nil = esk2_0
| ~ neq(nil,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_98]),c_0_107]) ).
cnf(c_0_115,plain,
( hd(app(X1,app(X2,X3))) = hd(app(X1,X2))
| app(X1,X2) = nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_72]),c_0_70]) ).
cnf(c_0_116,negated_conjecture,
app(nil,app(esk1_0,esk1_0)) = app(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_109]),c_0_37]),c_0_110])]) ).
cnf(c_0_117,negated_conjecture,
app(nil,esk1_0) = esk1_0,
inference(sr,[status(thm)],[c_0_85,c_0_67]) ).
cnf(c_0_118,negated_conjecture,
nil != esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_63]),c_0_64]),c_0_37])]),c_0_67]) ).
cnf(c_0_119,negated_conjecture,
( app(esk1_0,esk1_0) != nil
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_54]),c_0_48])]),c_0_67]) ).
fof(c_0_120,plain,
! [X5,X6,X7,X8] :
( ( X5 = X6
| ~ frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) )
& ( frontsegP(X7,X8)
| ~ frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) )
& ( X5 != X6
| ~ frontsegP(X7,X8)
| frontsegP(cons(X5,X7),cons(X6,X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ ssItem(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])])])]) ).
cnf(c_0_121,negated_conjecture,
( hd(esk2_0) = hd(esk1_0)
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_67]) ).
cnf(c_0_122,negated_conjecture,
hd(app(esk1_0,esk1_0)) = hd(esk1_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_115,c_0_116]),c_0_117]),c_0_117]),c_0_64]),c_0_37])]),c_0_118]) ).
cnf(c_0_123,negated_conjecture,
app(esk1_0,esk1_0) != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_61]),c_0_48]),c_0_37])]),c_0_67]) ).
fof(c_0_124,plain,
! [X4] :
( ( ssList(esk5_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk6_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk6_1(X4),esk5_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])])]) ).
cnf(c_0_125,plain,
( frontsegP(cons(X1,X3),cons(X2,X4))
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_126,negated_conjecture,
( cons(hd(esk1_0),nil) = esk1_0
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk1_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_121]) ).
cnf(c_0_127,negated_conjecture,
ssItem(hd(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_122]),c_0_110])]),c_0_123]) ).
fof(c_0_128,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X5,X6) != app(X5,X4)
| X6 = X4 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])])]) ).
cnf(c_0_129,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_76]) ).
cnf(c_0_130,plain,
( X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_131,plain,
( nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_132,plain,
( nil = X1
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_133,plain,
( nil = X1
| ssList(esk5_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_134,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_125]) ).
cnf(c_0_135,negated_conjecture,
( cons(hd(esk1_0),nil) = esk1_0
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127])]) ).
cnf(c_0_136,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_137,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_44]),c_0_37])]) ).
cnf(c_0_138,plain,
( X1 = esk6_1(X2)
| nil = X2
| ~ frontsegP(cons(X1,X3),X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132]),c_0_133]) ).
cnf(c_0_139,negated_conjecture,
( frontsegP(cons(hd(esk1_0),X1),esk1_0)
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_37]),c_0_127])]),c_0_94]) ).
cnf(c_0_140,plain,
( X1 = X2
| app(cons(X3,nil),X1) != cons(X3,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_76]),c_0_137]) ).
cnf(c_0_141,negated_conjecture,
( esk6_1(esk1_0) = hd(esk1_0)
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_64]),c_0_127])]),c_0_118]) ).
cnf(c_0_142,plain,
( X1 = X2
| cons(X3,X1) != cons(X3,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(spm,[status(thm)],[c_0_140,c_0_76]) ).
cnf(c_0_143,negated_conjecture,
( esk6_1(esk1_0) = hd(esk1_0)
| ~ neq(nil,esk2_0) ),
inference(spm,[status(thm)],[c_0_141,c_0_48]) ).
cnf(c_0_144,negated_conjecture,
( X1 = nil
| cons(hd(esk1_0),X1) != esk1_0
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_135]),c_0_37]),c_0_127])]) ).
cnf(c_0_145,negated_conjecture,
( cons(hd(esk1_0),esk5_1(esk1_0)) = esk1_0
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_143]),c_0_64])]),c_0_118]) ).
cnf(c_0_146,negated_conjecture,
( esk5_1(esk1_0) = nil
| ~ ssList(esk5_1(esk1_0))
| ~ neq(nil,esk2_0) ),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_147,negated_conjecture,
( esk5_1(esk1_0) = nil
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_133]),c_0_64])]),c_0_118]) ).
cnf(c_0_148,negated_conjecture,
( cons(esk6_1(esk1_0),nil) = esk1_0
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_147]),c_0_64])]),c_0_118]) ).
cnf(c_0_149,negated_conjecture,
( esk6_1(esk1_0) = hd(esk2_0)
| ~ neq(nil,esk2_0)
| ~ ssItem(esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_113,c_0_148]) ).
cnf(c_0_150,negated_conjecture,
( esk6_1(esk1_0) = hd(esk2_0)
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_132]),c_0_64])]),c_0_118]) ).
cnf(c_0_151,negated_conjecture,
( cons(hd(esk2_0),nil) = esk1_0
| ~ neq(nil,esk2_0) ),
inference(spm,[status(thm)],[c_0_148,c_0_150]) ).
cnf(c_0_152,negated_conjecture,
( ssItem(hd(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_150]),c_0_64])]),c_0_118]) ).
cnf(c_0_153,plain,
( esk6_1(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_131]),c_0_132]),c_0_133]) ).
fof(c_0_154,plain,
! [X4,X5,X7] :
( ( ssList(esk10_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk10_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])])]) ).
cnf(c_0_155,negated_conjecture,
( frontsegP(cons(hd(esk2_0),X1),esk1_0)
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_151]),c_0_37])]),c_0_152]),c_0_94]) ).
cnf(c_0_156,plain,
( cons(hd(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_131,c_0_153]) ).
cnf(c_0_157,plain,
( frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_158,negated_conjecture,
( frontsegP(esk2_0,esk1_0)
| ~ ssList(esk5_1(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_48])]),c_0_67]) ).
cnf(c_0_159,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_157]),c_0_70]) ).
cnf(c_0_160,negated_conjecture,
( frontsegP(esk2_0,esk1_0)
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_133]),c_0_48])]),c_0_67]) ).
cnf(c_0_161,negated_conjecture,
( nil = esk2_0
| frontsegP(esk1_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_66]),c_0_37]),c_0_64])]) ).
cnf(c_0_162,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_61]),c_0_37])]) ).
cnf(c_0_163,negated_conjecture,
frontsegP(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_61]),c_0_48]),c_0_37])]),c_0_67]) ).
cnf(c_0_164,negated_conjecture,
frontsegP(esk1_0,esk1_0),
inference(sr,[status(thm)],[c_0_161,c_0_67]) ).
cnf(c_0_165,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_164]),c_0_64])]),c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC022+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 08:37:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.020 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 166
% 0.23/1.42 # Proof object clause steps : 118
% 0.23/1.42 # Proof object formula steps : 48
% 0.23/1.42 # Proof object conjectures : 77
% 0.23/1.42 # Proof object clause conjectures : 74
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 33
% 0.23/1.42 # Proof object initial formulas used : 24
% 0.23/1.42 # Proof object generating inferences : 77
% 0.23/1.42 # Proof object simplifying inferences : 184
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 96
% 0.23/1.42 # Removed by relevancy pruning/SinE : 65
% 0.23/1.42 # Initial clauses : 57
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 57
% 0.23/1.42 # Processed clauses : 2369
% 0.23/1.42 # ...of these trivial : 52
% 0.23/1.42 # ...subsumed : 1777
% 0.23/1.42 # ...remaining for further processing : 540
% 0.23/1.42 # Other redundant clauses eliminated : 23
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 99
% 0.23/1.42 # Backward-rewritten : 26
% 0.23/1.42 # Generated clauses : 10287
% 0.23/1.42 # ...of the previous two non-trivial : 9186
% 0.23/1.42 # Contextual simplify-reflections : 1370
% 0.23/1.42 # Paramodulations : 10217
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 65
% 0.23/1.42 # Current number of processed clauses : 407
% 0.23/1.42 # Positive orientable unit clauses : 26
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 15
% 0.23/1.42 # Non-unit-clauses : 366
% 0.23/1.42 # Current number of unprocessed clauses: 6210
% 0.23/1.42 # ...number of literals in the above : 37411
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 130
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 60373
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 30032
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2534
% 0.23/1.42 # Unit Clause-clause subsumption calls : 225
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 10
% 0.23/1.42 # BW rewrite match successes : 10
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 176864
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.433 s
% 0.23/1.42 # System time : 0.006 s
% 0.23/1.42 # Total time : 0.439 s
% 0.23/1.42 # Maximum resident set size: 9256 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------