TSTP Solution File: SWC063+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC063+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:26:27 EDT 2022
% Result : Theorem 0.24s 2.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 91 ( 20 unt; 0 def)
% Number of atoms : 330 ( 106 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 418 ( 179 ~; 170 |; 36 &)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 57 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
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/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
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/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,negated_conjecture,
! [X14] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( nil = esk50_0
| nil != esk51_0 )
& ( ssItem(esk52_0)
| ~ neq(esk51_0,nil) )
& ( ssList(esk53_0)
| ~ neq(esk51_0,nil) )
& ( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) )
& ( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) )
& ( neq(esk49_0,nil)
| nil = esk49_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk49_0,X14)
| ~ segmentP(esk48_0,X14)
| nil = esk49_0 )
& ( neq(esk49_0,nil)
| nil != esk48_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk49_0,X14)
| ~ segmentP(esk48_0,X14)
| nil != esk48_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_14])])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( nil != esk48_0
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( neq(esk51_0,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk50_0
| nil != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_28,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).
cnf(c_0_33,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_17]),c_0_17]) ).
cnf(c_0_36,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22])]) ).
cnf(c_0_37,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_39,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])])])])]) ).
cnf(c_0_40,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_41,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( esk51_0 = nil
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( esk51_0 = nil
| ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
fof(c_0_44,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_45,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_49,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_50,negated_conjecture,
ssItem(esk52_0),
inference(sr,[status(thm)],[c_0_43,c_0_36]) ).
fof(c_0_51,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])])])])])]) ).
fof(c_0_52,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_53,negated_conjecture,
( nil = esk49_0
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_54,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])])])])])]) ).
fof(c_0_55,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_56,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_57,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_58,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_59,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_60,negated_conjecture,
cons(esk52_0,app(nil,esk53_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_61,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_62,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_63,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_64,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_17]),c_0_17]) ).
cnf(c_0_65,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_66,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_67,negated_conjecture,
cons(esk52_0,esk53_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_47]),c_0_48]),c_0_50])]) ).
cnf(c_0_68,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_70,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = esk51_0,
inference(sr,[status(thm)],[c_0_59,c_0_36]) ).
cnf(c_0_71,negated_conjecture,
( cons(esk52_0,nil) = esk48_0
| esk53_0 != nil ),
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_49])]) ).
cnf(c_0_72,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_73,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_74,negated_conjecture,
( X1 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_49])]),c_0_36]) ).
cnf(c_0_75,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_76,negated_conjecture,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_48]),c_0_50])]) ).
cnf(c_0_77,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_68]),c_0_49])]),c_0_69]) ).
cnf(c_0_78,negated_conjecture,
( app(esk53_0,esk48_0) = esk51_0
| esk53_0 != nil ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_72]),c_0_49])]) ).
cnf(c_0_80,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_68]),c_0_49])]),c_0_69]) ).
cnf(c_0_81,negated_conjecture,
~ segmentP(esk51_0,esk48_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_29]),c_0_75])]),c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( segmentP(X1,esk48_0)
| esk53_0 != nil
| esk51_0 != X1
| ~ ssList(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_48]),c_0_75])]) ).
cnf(c_0_83,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_79]),c_0_69]) ).
cnf(c_0_84,negated_conjecture,
( segmentP(esk48_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_47]),c_0_48])]) ).
cnf(c_0_85,negated_conjecture,
esk53_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_22])]) ).
cnf(c_0_86,negated_conjecture,
( segmentP(esk51_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_70]),c_0_48])]) ).
fof(c_0_87,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_88,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_84]),c_0_48])]),c_0_85]),c_0_86]) ).
cnf(c_0_89,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC063+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.19/0.34 % DateTime : Sun Jun 12 09:24:11 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.24/2.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/2.42 # Preprocessing time : 0.025 s
% 0.24/2.42
% 0.24/2.42 # Proof found!
% 0.24/2.42 # SZS status Theorem
% 0.24/2.42 # SZS output start CNFRefutation
% See solution above
% 0.24/2.42 # Proof object total steps : 91
% 0.24/2.42 # Proof object clause steps : 63
% 0.24/2.42 # Proof object formula steps : 28
% 0.24/2.42 # Proof object conjectures : 48
% 0.24/2.42 # Proof object clause conjectures : 45
% 0.24/2.42 # Proof object formula conjectures : 3
% 0.24/2.42 # Proof object initial clauses used : 26
% 0.24/2.42 # Proof object initial formulas used : 14
% 0.24/2.42 # Proof object generating inferences : 25
% 0.24/2.42 # Proof object simplifying inferences : 65
% 0.24/2.42 # Training examples: 0 positive, 0 negative
% 0.24/2.42 # Parsed axioms : 96
% 0.24/2.42 # Removed by relevancy pruning/SinE : 0
% 0.24/2.42 # Initial clauses : 205
% 0.24/2.42 # Removed in clause preprocessing : 2
% 0.24/2.42 # Initial clauses in saturation : 203
% 0.24/2.42 # Processed clauses : 5542
% 0.24/2.42 # ...of these trivial : 88
% 0.24/2.42 # ...subsumed : 3556
% 0.24/2.42 # ...remaining for further processing : 1898
% 0.24/2.42 # Other redundant clauses eliminated : 966
% 0.24/2.42 # Clauses deleted for lack of memory : 0
% 0.24/2.42 # Backward-subsumed : 322
% 0.24/2.42 # Backward-rewritten : 44
% 0.24/2.42 # Generated clauses : 46931
% 0.24/2.42 # ...of the previous two non-trivial : 43733
% 0.24/2.42 # Contextual simplify-reflections : 3399
% 0.24/2.42 # Paramodulations : 45799
% 0.24/2.42 # Factorizations : 0
% 0.24/2.42 # Equation resolutions : 1128
% 0.24/2.42 # Current number of processed clauses : 1522
% 0.24/2.42 # Positive orientable unit clauses : 56
% 0.24/2.42 # Positive unorientable unit clauses: 0
% 0.24/2.42 # Negative unit clauses : 30
% 0.24/2.42 # Non-unit-clauses : 1436
% 0.24/2.42 # Current number of unprocessed clauses: 34645
% 0.24/2.42 # ...number of literals in the above : 288140
% 0.24/2.42 # Current number of archived formulas : 0
% 0.24/2.42 # Current number of archived clauses : 370
% 0.24/2.42 # Clause-clause subsumption calls (NU) : 768009
% 0.24/2.42 # Rec. Clause-clause subsumption calls : 168916
% 0.24/2.42 # Non-unit clause-clause subsumptions : 5436
% 0.24/2.42 # Unit Clause-clause subsumption calls : 8521
% 0.24/2.42 # Rewrite failures with RHS unbound : 0
% 0.24/2.42 # BW rewrite match attempts : 20
% 0.24/2.42 # BW rewrite match successes : 20
% 0.24/2.42 # Condensation attempts : 0
% 0.24/2.42 # Condensation successes : 0
% 0.24/2.42 # Termbank termtop insertions : 1141115
% 0.24/2.42
% 0.24/2.42 # -------------------------------------------------
% 0.24/2.42 # User time : 1.082 s
% 0.24/2.42 # System time : 0.017 s
% 0.24/2.42 # Total time : 1.099 s
% 0.24/2.42 # Maximum resident set size: 41580 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------