%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC394+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:28:28 EDT 2022
% Result : Theorem 0.91s 121.10s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 25 unt; 0 def)
% Number of atoms : 332 ( 71 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 430 ( 178 ~; 178 |; 35 &)
% ( 6 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 60 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
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(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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,plain,
! [X4,X5,X7] :
( ( ssList(esk6_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk6_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])])])])])])]) ).
fof(c_0_13,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk3_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk4_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk3_2(X5,X6),cons(X6,esk4_2(X5,X6))) = X5
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) ) ),
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)],[ax3])])])])])])]) ).
fof(c_0_14,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& memberP(esk48_0,esk52_0)
& ~ memberP(esk49_0,esk52_0)
& ( neq(esk50_0,nil)
| nil = esk51_0 )
& ( segmentP(esk51_0,esk50_0)
| nil = esk51_0 )
& ( neq(esk50_0,nil)
| nil = esk50_0 )
& ( segmentP(esk51_0,esk50_0)
| nil = esk50_0 ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_15,plain,
( frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
memberP(esk48_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ssList(esk3_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
app(esk3_2(esk48_0,esk52_0),cons(esk52_0,esk4_2(esk48_0,esk52_0))) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk3_2(esk48_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_19])]) ).
fof(c_0_24,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])])])])]) ).
cnf(c_0_25,plain,
( ssList(esk4_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( frontsegP(esk48_0,esk3_2(esk48_0,esk52_0))
| ~ ssList(cons(esk52_0,esk4_2(esk48_0,esk52_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_23])]) ).
cnf(c_0_27,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk4_2(esk48_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
fof(c_0_29,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_30,plain,
( app(X2,esk6_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
frontsegP(esk48_0,esk3_2(esk48_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_19])]) ).
cnf(c_0_32,plain,
( ssList(esk6_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_33,plain,
! [X4,X5,X7] :
( ( ssList(esk7_2(X4,X5))
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(esk7_2(X4,X5),X5) = X4
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X7,X5) != X4
| rearsegP(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)],[ax6])])])])])])]) ).
cnf(c_0_34,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
app(esk3_2(esk48_0,esk52_0),esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]),c_0_18])]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_23]),c_0_18])]) ).
cnf(c_0_37,plain,
( rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X3,X2) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( X1 = esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))
| app(esk3_2(esk48_0,esk52_0),X1) != esk48_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_36])]) ).
fof(c_0_39,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
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)],[ax36])])])])])]) ).
cnf(c_0_40,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_37]) ).
fof(c_0_41,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])])])])]) ).
cnf(c_0_42,negated_conjecture,
( cons(esk52_0,esk4_2(esk48_0,esk52_0)) = esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))
| ~ ssList(cons(esk52_0,esk4_2(esk48_0,esk52_0))) ),
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_43,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_44,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
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)],[ax7])])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk50_0
| segmentP(esk51_0,esk50_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_48,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_49,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(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)],[ax83])])])])])]) ).
cnf(c_0_50,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_51,negated_conjecture,
rearsegP(esk48_0,esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_18]),c_0_23]),c_0_36])]) ).
cnf(c_0_52,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_53,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_54,negated_conjecture,
cons(esk52_0,esk4_2(esk48_0,esk52_0)) = esk6_2(esk48_0,esk3_2(esk48_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_28]),c_0_19])]) ).
cnf(c_0_55,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,negated_conjecture,
( memberP(app(X1,esk48_0),esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_17]),c_0_18]),c_0_19])]) ).
fof(c_0_57,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_58,plain,
( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_59,negated_conjecture,
( nil = esk48_0
| segmentP(esk51_0,esk48_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_61,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_62,negated_conjecture,
app(esk7_2(esk48_0,esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))),esk6_2(esk48_0,esk3_2(esk48_0,esk52_0))) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_36]),c_0_18])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk7_2(esk48_0,esk6_2(esk48_0,esk3_2(esk48_0,esk52_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_36]),c_0_18])]) ).
cnf(c_0_64,negated_conjecture,
esk6_2(esk48_0,esk3_2(esk48_0,esk52_0)) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28]),c_0_19])]) ).
cnf(c_0_65,plain,
( ssList(esk9_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_66,plain,
( ssList(esk8_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_67,negated_conjecture,
( memberP(app(app(X1,esk48_0),X2),esk52_0)
| ~ ssList(app(X1,esk48_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_19])]) ).
cnf(c_0_68,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,negated_conjecture,
( app(app(esk8_2(esk51_0,esk48_0),esk48_0),esk9_2(esk51_0,esk48_0)) = esk51_0
| nil = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_18]),c_0_60])]) ).
cnf(c_0_70,negated_conjecture,
nil != esk48_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_36]),c_0_63])]),c_0_64]) ).
cnf(c_0_71,negated_conjecture,
( nil = esk48_0
| ssList(esk9_2(esk51_0,esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_59]),c_0_18]),c_0_60])]) ).
cnf(c_0_72,negated_conjecture,
( nil = esk48_0
| ssList(esk8_2(esk51_0,esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_59]),c_0_18]),c_0_60])]) ).
cnf(c_0_73,negated_conjecture,
~ memberP(esk49_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_74,negated_conjecture,
( memberP(app(app(X1,esk48_0),X2),esk52_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_18])]) ).
cnf(c_0_75,negated_conjecture,
app(app(esk8_2(esk51_0,esk48_0),esk48_0),esk9_2(esk51_0,esk48_0)) = esk51_0,
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
ssList(esk9_2(esk51_0,esk48_0)),
inference(sr,[status(thm)],[c_0_71,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
ssList(esk8_2(esk51_0,esk48_0)),
inference(sr,[status(thm)],[c_0_72,c_0_70]) ).
cnf(c_0_78,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_73,c_0_48]) ).
cnf(c_0_79,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_74,c_0_75]),c_0_76]),c_0_77])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC394+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.10 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sun Jun 12 02:10:55 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.30/23.38 eprover: CPU time limit exceeded, terminating
% 0.30/23.41 eprover: CPU time limit exceeded, terminating
% 0.30/23.42 eprover: CPU time limit exceeded, terminating
% 0.30/23.52 eprover: CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.44 eprover: CPU time limit exceeded, terminating
% 0.45/46.44 eprover: CPU time limit exceeded, terminating
% 0.45/46.53 eprover: CPU time limit exceeded, terminating
% 0.58/69.44 eprover: CPU time limit exceeded, terminating
% 0.58/69.45 eprover: CPU time limit exceeded, terminating
% 0.58/69.46 eprover: CPU time limit exceeded, terminating
% 0.58/69.54 eprover: CPU time limit exceeded, terminating
% 0.74/92.46 eprover: CPU time limit exceeded, terminating
% 0.74/92.47 eprover: CPU time limit exceeded, terminating
% 0.74/92.48 eprover: CPU time limit exceeded, terminating
% 0.74/92.56 eprover: CPU time limit exceeded, terminating
% 0.89/115.48 eprover: CPU time limit exceeded, terminating
% 0.89/115.49 eprover: CPU time limit exceeded, terminating
% 0.89/115.50 eprover: CPU time limit exceeded, terminating
% 0.89/115.58 eprover: CPU time limit exceeded, terminating
% 0.91/121.10 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.91/121.10
% 0.91/121.10 # Failure: Resource limit exceeded (time)
% 0.91/121.10 # OLD status Res
% 0.91/121.10 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.91/121.10 # Preprocessing time : 0.018 s
% 0.91/121.10 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.91/121.10
% 0.91/121.10 # Failure: Resource limit exceeded (time)
% 0.91/121.10 # OLD status Res
% 0.91/121.10 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.91/121.10 # Preprocessing time : 0.020 s
% 0.91/121.10 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.91/121.10
% 0.91/121.10 # Failure: Resource limit exceeded (time)
% 0.91/121.10 # OLD status Res
% 0.91/121.10 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.91/121.10 # Preprocessing time : 0.019 s
% 0.91/121.10 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.91/121.10
% 0.91/121.10 # Failure: Resource limit exceeded (time)
% 0.91/121.10 # OLD status Res
% 0.91/121.10 # Preprocessing time : 0.014 s
% 0.91/121.10 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.91/121.10
% 0.91/121.10 # Failure: Resource limit exceeded (time)
% 0.91/121.10 # OLD status Res
% 0.91/121.10 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.91/121.10 # Preprocessing time : 0.012 s
% 0.91/121.10 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.91/121.10 # Preprocessing time : 0.014 s
% 0.91/121.10
% 0.91/121.10 # Proof found!
% 0.91/121.10 # SZS status Theorem
% 0.91/121.10 # SZS output start CNFRefutation
% See solution above
% 0.91/121.10 # Proof object total steps : 80
% 0.91/121.10 # Proof object clause steps : 57
% 0.91/121.10 # Proof object formula steps : 23
% 0.91/121.10 # Proof object conjectures : 39
% 0.91/121.10 # Proof object clause conjectures : 36
% 0.91/121.10 # Proof object formula conjectures : 3
% 0.91/121.10 # Proof object initial clauses used : 27
% 0.91/121.10 # Proof object initial formulas used : 11
% 0.91/121.10 # Proof object generating inferences : 24
% 0.91/121.10 # Proof object simplifying inferences : 71
% 0.91/121.10 # Training examples: 0 positive, 0 negative
% 0.91/121.10 # Parsed axioms : 96
% 0.91/121.10 # Removed by relevancy pruning/SinE : 0
% 0.91/121.10 # Initial clauses : 203
% 0.91/121.10 # Removed in clause preprocessing : 2
% 0.91/121.10 # Initial clauses in saturation : 201
% 0.91/121.10 # Processed clauses : 25078
% 0.91/121.10 # ...of these trivial : 524
% 0.91/121.10 # ...subsumed : 15376
% 0.91/121.10 # ...remaining for further processing : 9178
% 0.91/121.10 # Other redundant clauses eliminated : 2026
% 0.91/121.10 # Clauses deleted for lack of memory : 60363
% 0.91/121.10 # Backward-subsumed : 2299
% 0.91/121.10 # Backward-rewritten : 1189
% 0.91/121.10 # Generated clauses : 226428
% 0.91/121.10 # ...of the previous two non-trivial : 213726
% 0.91/121.10 # Contextual simplify-reflections : 0
% 0.91/121.10 # Paramodulations : 223513
% 0.91/121.10 # Factorizations : 2
% 0.91/121.10 # Equation resolutions : 2801
% 0.91/121.10 # Current number of processed clauses : 5572
% 0.91/121.10 # Positive orientable unit clauses : 426
% 0.91/121.10 # Positive unorientable unit clauses: 0
% 0.91/121.10 # Negative unit clauses : 68
% 0.91/121.10 # Non-unit-clauses : 5078
% 0.91/121.10 # Current number of unprocessed clauses: 73641
% 0.91/121.10 # ...number of literals in the above : 472272
% 0.91/121.10 # Current number of archived formulas : 0
% 0.91/121.10 # Current number of archived clauses : 3600
% 0.91/121.10 # Clause-clause subsumption calls (NU) : 1689966
% 0.91/121.10 # Rec. Clause-clause subsumption calls : 458418
% 0.91/121.10 # Non-unit clause-clause subsumptions : 16688
% 0.91/121.10 # Unit Clause-clause subsumption calls : 107068
% 0.91/121.10 # Rewrite failures with RHS unbound : 0
% 0.91/121.10 # BW rewrite match attempts : 1274
% 0.91/121.10 # BW rewrite match successes : 279
% 0.91/121.10 # Condensation attempts : 0
% 0.91/121.10 # Condensation successes : 0
% 0.91/121.10 # Termbank termtop insertions : 7416287
% 0.91/121.10
% 0.91/121.10 # -------------------------------------------------
% 0.91/121.10 # User time : 5.104 s
% 0.91/121.10 # System time : 0.098 s
% 0.91/121.10 # Total time : 5.202 s
% 0.91/121.10 # Maximum resident set size: 136980 pages
%------------------------------------------------------------------------------