TSTP Solution File: SWC107+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC107+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:44 EDT 2022
% Result : Theorem 0.63s 53.80s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 95 ( 12 unt; 0 def)
% Number of atoms : 439 ( 153 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 584 ( 240 ~; 259 |; 48 &)
% ( 6 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 128 ( 0 sgn 58 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,negated_conjecture,
! [X12] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( nil = esk51_0
| ssItem(esk52_0) )
& ( nil = esk50_0
| ssItem(esk52_0) )
& ( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk52_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk52_0) )
& ( nil = esk51_0
| ~ ssItem(X12)
| esk52_0 = X12
| ~ memberP(esk51_0,X12)
| ~ leq(esk52_0,X12) )
& ( nil = esk50_0
| ~ ssItem(X12)
| esk52_0 = X12
| ~ memberP(esk51_0,X12)
| ~ leq(esk52_0,X12) )
& ( neq(esk49_0,nil)
| nil = esk49_0 )
& ( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0)
| nil = esk49_0 )
& ( neq(esk49_0,nil)
| nil != esk48_0 )
& ( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0)
| 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])])])])])])])]) ).
fof(c_0_16,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])])])])])])]) ).
fof(c_0_17,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_18,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_19,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,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_16]) ).
cnf(c_0_22,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( cons(esk52_0,nil) = esk48_0
| nil = esk48_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
fof(c_0_26,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_27,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_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( app(esk48_0,X1) = cons(esk52_0,X1)
| nil = esk48_0
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,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])])])])]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk49_0
| ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| cons(esk52_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
fof(c_0_34,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_35,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| ~ segmentP(esk49_0,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_29])]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| esk48_0 != X1
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_23])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,negated_conjecture,
( ssItem(esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
fof(c_0_42,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])])])])])])]) ).
cnf(c_0_43,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| esk49_0 != esk48_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
( nil = esk48_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_45,plain,
( app(nil,X1) = app(X2,app(X3,X1))
| nil != X3
| nil != X2
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| app(X2,cons(esk52_0,X3)) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_29])]) ).
cnf(c_0_47,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_42]) ).
fof(c_0_48,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[ax39]) ).
cnf(c_0_49,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| esk49_0 != esk48_0 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_50,plain,
! [X3,X5] :
( ( ssItem(esk5_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk5_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) ) ),
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)],[ax4])])])])])])]) ).
cnf(c_0_51,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_52,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_53,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_54,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_35,c_0_22]),c_0_23])]) ).
cnf(c_0_55,plain,
( app(X1,app(X2,X3)) = X3
| nil != X2
| nil != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(esk4_2(X1,esk52_0))
| ~ ssList(esk3_2(X1,esk52_0))
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_57,plain,
( ssList(esk4_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_58,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( nil = esk48_0
| esk49_0 != esk48_0 ),
inference(ef,[status(thm)],[c_0_49]) ).
cnf(c_0_60,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_61,negated_conjecture,
( cons(esk52_0,nil) = esk48_0
| nil = esk49_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_20]) ).
cnf(c_0_62,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,plain,
( app(X1,X2) = X2
| nil != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_23])]) ).
cnf(c_0_64,negated_conjecture,
( memberP(esk51_0,esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_65,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(esk3_2(X1,esk52_0))
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,plain,
( ssList(esk3_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_67,negated_conjecture,
( esk49_0 != esk48_0
| ~ singletonP(esk48_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( nil = esk49_0
| singletonP(X1)
| esk48_0 != X1
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
( ssItem(esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_70,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_71,plain,
( memberP(X1,X2)
| nil != X3
| ~ memberP(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,negated_conjecture,
( nil = esk48_0
| memberP(esk49_0,esk52_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_20]),c_0_52]) ).
cnf(c_0_73,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
( nil = esk49_0
| esk49_0 != esk48_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_29])]) ).
cnf(c_0_75,negated_conjecture,
( nil = esk49_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_69,c_0_52]) ).
fof(c_0_76,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) != 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)],[ax18])])])])]) ).
cnf(c_0_77,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,negated_conjecture,
( nil = esk48_0
| memberP(X1,esk52_0)
| nil != esk49_0
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_38])]) ).
cnf(c_0_79,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| ~ memberP(esk49_0,esk52_0)
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_73]),c_0_38])]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_81,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_82,negated_conjecture,
( nil = esk49_0
| esk49_0 != esk48_0 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_83,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( nil = esk48_0
| nil != esk49_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_23])]) ).
cnf(c_0_85,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_72]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_87,negated_conjecture,
( neq(esk49_0,esk49_0)
| esk49_0 != esk48_0 ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( nil = esk49_0
| nil != esk48_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_61]),c_0_23])]) ).
cnf(c_0_89,negated_conjecture,
( nil = esk48_0
| nil != esk49_0 ),
inference(spm,[status(thm)],[c_0_84,c_0_44]) ).
cnf(c_0_90,negated_conjecture,
( nil = esk49_0
| nil = esk48_0 ),
inference(spm,[status(thm)],[c_0_85,c_0_44]) ).
cnf(c_0_91,negated_conjecture,
esk49_0 != esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_38])]) ).
cnf(c_0_92,negated_conjecture,
( nil = esk49_0
| nil != esk48_0 ),
inference(spm,[status(thm)],[c_0_88,c_0_75]) ).
cnf(c_0_93,negated_conjecture,
nil = esk48_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_93])]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC107+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 12 22:30:48 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.42/23.44 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.42/23.44
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.58/46.46 eprover: CPU time limit exceeded, terminating
% 0.58/46.46 eprover: CPU time limit exceeded, terminating
% 0.58/46.46 eprover: CPU time limit exceeded, terminating
% 0.58/46.49 eprover: CPU time limit exceeded, terminating
% 0.63/53.80 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.63/53.80
% 0.63/53.80 # Failure: Resource limit exceeded (time)
% 0.63/53.80 # OLD status Res
% 0.63/53.80 # Preprocessing time : 0.026 s
% 0.63/53.80 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.63/53.80
% 0.63/53.80 # Failure: Resource limit exceeded (time)
% 0.63/53.80 # OLD status Res
% 0.63/53.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.63/53.80 # Preprocessing time : 0.024 s
% 0.63/53.80 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.63/53.80 # Preprocessing time : 0.027 s
% 0.63/53.80
% 0.63/53.80 # Proof found!
% 0.63/53.80 # SZS status Theorem
% 0.63/53.80 # SZS output start CNFRefutation
% See solution above
% 0.63/53.80 # Proof object total steps : 95
% 0.63/53.80 # Proof object clause steps : 67
% 0.63/53.80 # Proof object formula steps : 28
% 0.63/53.80 # Proof object conjectures : 46
% 0.63/53.80 # Proof object clause conjectures : 43
% 0.63/53.80 # Proof object formula conjectures : 3
% 0.63/53.80 # Proof object initial clauses used : 27
% 0.63/53.80 # Proof object initial formulas used : 14
% 0.63/53.80 # Proof object generating inferences : 33
% 0.63/53.80 # Proof object simplifying inferences : 44
% 0.63/53.80 # Training examples: 0 positive, 0 negative
% 0.63/53.80 # Parsed axioms : 96
% 0.63/53.80 # Removed by relevancy pruning/SinE : 0
% 0.63/53.80 # Initial clauses : 208
% 0.63/53.80 # Removed in clause preprocessing : 2
% 0.63/53.80 # Initial clauses in saturation : 206
% 0.63/53.80 # Processed clauses : 83767
% 0.63/53.80 # ...of these trivial : 6733
% 0.63/53.80 # ...subsumed : 73357
% 0.63/53.80 # ...remaining for further processing : 3677
% 0.63/53.80 # Other redundant clauses eliminated : 403
% 0.63/53.80 # Clauses deleted for lack of memory : 72112
% 0.63/53.80 # Backward-subsumed : 1105
% 0.63/53.80 # Backward-rewritten : 2406
% 0.63/53.80 # Generated clauses : 346458
% 0.63/53.80 # ...of the previous two non-trivial : 277257
% 0.63/53.80 # Contextual simplify-reflections : 0
% 0.63/53.80 # Paramodulations : 345623
% 0.63/53.80 # Factorizations : 2
% 0.63/53.80 # Equation resolutions : 833
% 0.63/53.80 # Current number of processed clauses : 160
% 0.63/53.80 # Positive orientable unit clauses : 7
% 0.63/53.80 # Positive unorientable unit clauses: 0
% 0.63/53.80 # Negative unit clauses : 2
% 0.63/53.80 # Non-unit-clauses : 151
% 0.63/53.80 # Current number of unprocessed clauses: 1489
% 0.63/53.80 # ...number of literals in the above : 6608
% 0.63/53.80 # Current number of archived formulas : 0
% 0.63/53.80 # Current number of archived clauses : 3511
% 0.63/53.80 # Clause-clause subsumption calls (NU) : 2370628
% 0.63/53.80 # Rec. Clause-clause subsumption calls : 318367
% 0.63/53.80 # Non-unit clause-clause subsumptions : 70624
% 0.63/53.80 # Unit Clause-clause subsumption calls : 140
% 0.63/53.80 # Rewrite failures with RHS unbound : 0
% 0.63/53.80 # BW rewrite match attempts : 2
% 0.63/53.80 # BW rewrite match successes : 2
% 0.63/53.80 # Condensation attempts : 0
% 0.63/53.80 # Condensation successes : 0
% 0.63/53.80 # Termbank termtop insertions : 9162481
% 0.63/53.80
% 0.63/53.80 # -------------------------------------------------
% 0.63/53.80 # User time : 6.901 s
% 0.63/53.80 # System time : 0.093 s
% 0.63/53.80 # Total time : 6.994 s
% 0.63/53.80 # Maximum resident set size: 129840 pages
% 0.63/69.48 eprover: CPU time limit exceeded, terminating
% 0.63/69.48 eprover: CPU time limit exceeded, terminating
% 0.63/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.49 eprover: No such file or directory
% 0.63/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.49 eprover: No such file or directory
% 0.63/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.50 eprover: No such file or directory
% 0.63/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.50 eprover: No such file or directory
% 0.63/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.50 eprover: No such file or directory
% 0.63/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.50 eprover: No such file or directory
% 0.63/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.51 eprover: No such file or directory
% 0.63/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.51 eprover: No such file or directory
% 0.63/69.51 eprover: CPU time limit exceeded, terminating
% 0.63/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.51 eprover: No such file or directory
% 0.63/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.51 eprover: No such file or directory
% 0.63/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.52 eprover: No such file or directory
% 0.63/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.52 eprover: No such file or directory
% 0.63/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.52 eprover: No such file or directory
% 0.63/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.52 eprover: No such file or directory
% 0.63/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.53 eprover: No such file or directory
% 0.63/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.53 eprover: No such file or directory
% 0.63/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.53 eprover: No such file or directory
% 0.63/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.53 eprover: No such file or directory
% 0.63/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.53 eprover: No such file or directory
% 0.63/69.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.63/69.54 eprover: No such file or directory
% 0.63/69.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.54 eprover: No such file or directory
% 0.63/69.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.54 eprover: No such file or directory
% 0.63/69.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.54 eprover: No such file or directory
% 0.63/69.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.55 eprover: No such file or directory
% 0.63/69.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.55 eprover: No such file or directory
% 0.63/69.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.55 eprover: No such file or directory
% 0.63/69.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.63/69.56 eprover: No such file or directory
%------------------------------------------------------------------------------