TSTP Solution File: SWC329+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC329+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:28:05 EDT 2022
% Result : Theorem 0.53s 52.68s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 78 ( 11 unt; 0 def)
% Number of atoms : 334 ( 122 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 429 ( 173 ~; 191 |; 37 &)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn 45 !; 6 ?)
% 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 ) )
| ( segmentP(X2,X1)
& equalelemsP(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(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(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
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_11,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 ) )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,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) )
& ( ~ segmentP(esk49_0,esk48_0)
| ~ equalelemsP(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_11])])])])])])])]) ).
fof(c_0_13,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_14,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_15,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_16,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,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_19,plain,
! [X2] :
( ~ ssItem(X2)
| equalelemsP(cons(X2,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_20,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_13]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( cons(esk52_0,nil) = esk48_0
| nil = esk48_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_25,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
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_20,c_0_21]),c_0_22])]) ).
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_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
fof(c_0_31,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_32,negated_conjecture,
( ~ equalelemsP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk48_0
| equalelemsP(esk48_0)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_34,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])]) ).
cnf(c_0_35,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,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_30,c_0_28]),c_0_29])]) ).
cnf(c_0_38,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_31]) ).
cnf(c_0_39,negated_conjecture,
( nil = esk48_0
| ~ segmentP(esk49_0,esk48_0)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,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_34,c_0_24]),c_0_22])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,negated_conjecture,
( ssItem(esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,negated_conjecture,
( cons(esk52_0,nil) = esk48_0
| nil = esk49_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_17]) ).
cnf(c_0_44,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_37,c_0_38])]) ).
cnf(c_0_45,plain,
( ssList(esk4_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk48_0
| esk48_0 != esk49_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( nil = esk48_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_42,c_0_17]) ).
fof(c_0_48,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_49,negated_conjecture,
( nil = esk49_0
| equalelemsP(esk48_0)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_43]) ).
cnf(c_0_50,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_44,c_0_45]) ).
cnf(c_0_51,plain,
( ssList(esk3_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_52,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_53,negated_conjecture,
( nil = esk48_0
| esk48_0 != esk49_0 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( nil = esk49_0
| ~ segmentP(esk49_0,esk48_0)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_49]) ).
fof(c_0_56,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_57,negated_conjecture,
( nil = esk48_0
| segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(X1)
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( memberP(esk51_0,esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_59,negated_conjecture,
( equalelemsP(esk48_0)
| esk48_0 != esk49_0 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( segmentP(X1,X2)
| nil != X1
| nil != X3
| nil != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| esk48_0 != esk49_0
| ~ ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_41])]) ).
cnf(c_0_62,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( ssItem(esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_64,negated_conjecture,
( 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_39,c_0_57]),c_0_41])]) ).
cnf(c_0_65,negated_conjecture,
( nil = esk48_0
| memberP(esk49_0,esk52_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_17]),c_0_36]) ).
cnf(c_0_66,negated_conjecture,
( esk48_0 != esk49_0
| ~ segmentP(esk49_0,esk48_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_59]) ).
cnf(c_0_67,plain,
( segmentP(X1,X2)
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_22]) ).
cnf(c_0_68,negated_conjecture,
( nil = esk49_0
| nil = esk48_0
| esk48_0 != esk49_0 ),
inference(spm,[status(thm)],[c_0_61,c_0_47]) ).
cnf(c_0_69,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_62,c_0_43]),c_0_22])]) ).
cnf(c_0_70,negated_conjecture,
( nil = esk49_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_63,c_0_36]) ).
cnf(c_0_71,negated_conjecture,
( nil = esk48_0
| ~ ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
( esk48_0 != esk49_0
| nil != esk49_0
| nil != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_29]),c_0_41])]) ).
cnf(c_0_73,negated_conjecture,
( nil = esk49_0
| esk48_0 != esk49_0 ),
inference(ef,[status(thm)],[c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( nil = esk49_0
| nil != esk48_0 ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
nil = esk48_0,
inference(spm,[status(thm)],[c_0_71,c_0_47]) ).
cnf(c_0_76,negated_conjecture,
esk48_0 != esk49_0,
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC329+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.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 17:14:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.36/23.41
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.49/46.42 eprover: CPU time limit exceeded, terminating
% 0.49/46.43 eprover: CPU time limit exceeded, terminating
% 0.49/46.43 eprover: CPU time limit exceeded, terminating
% 0.49/46.43 eprover: CPU time limit exceeded, terminating
% 0.53/52.68 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.53/52.68
% 0.53/52.68 # Failure: Resource limit exceeded (time)
% 0.53/52.68 # OLD status Res
% 0.53/52.68 # Preprocessing time : 0.025 s
% 0.53/52.68 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.53/52.68
% 0.53/52.68 # Failure: Resource limit exceeded (time)
% 0.53/52.68 # OLD status Res
% 0.53/52.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.53/52.68 # Preprocessing time : 0.011 s
% 0.53/52.68 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.53/52.68 # Preprocessing time : 0.013 s
% 0.53/52.68
% 0.53/52.68 # Proof found!
% 0.53/52.68 # SZS status Theorem
% 0.53/52.68 # SZS output start CNFRefutation
% See solution above
% 0.53/52.68 # Proof object total steps : 78
% 0.53/52.68 # Proof object clause steps : 57
% 0.53/52.68 # Proof object formula steps : 21
% 0.53/52.68 # Proof object conjectures : 44
% 0.53/52.68 # Proof object clause conjectures : 41
% 0.53/52.68 # Proof object formula conjectures : 3
% 0.53/52.68 # Proof object initial clauses used : 22
% 0.53/52.68 # Proof object initial formulas used : 11
% 0.53/52.68 # Proof object generating inferences : 29
% 0.53/52.68 # Proof object simplifying inferences : 32
% 0.53/52.68 # Training examples: 0 positive, 0 negative
% 0.53/52.68 # Parsed axioms : 96
% 0.53/52.68 # Removed by relevancy pruning/SinE : 0
% 0.53/52.68 # Initial clauses : 205
% 0.53/52.68 # Removed in clause preprocessing : 2
% 0.53/52.68 # Initial clauses in saturation : 203
% 0.53/52.68 # Processed clauses : 75800
% 0.53/52.68 # ...of these trivial : 6031
% 0.53/52.68 # ...subsumed : 66147
% 0.53/52.68 # ...remaining for further processing : 3622
% 0.53/52.68 # Other redundant clauses eliminated : 388
% 0.53/52.68 # Clauses deleted for lack of memory : 71730
% 0.53/52.68 # Backward-subsumed : 1934
% 0.53/52.68 # Backward-rewritten : 1526
% 0.53/52.68 # Generated clauses : 319149
% 0.53/52.68 # ...of the previous two non-trivial : 257446
% 0.53/52.68 # Contextual simplify-reflections : 0
% 0.53/52.68 # Paramodulations : 318331
% 0.53/52.68 # Factorizations : 1
% 0.53/52.68 # Equation resolutions : 817
% 0.53/52.68 # Current number of processed clauses : 156
% 0.53/52.68 # Positive orientable unit clauses : 7
% 0.53/52.68 # Positive unorientable unit clauses: 0
% 0.53/52.68 # Negative unit clauses : 2
% 0.53/52.68 # Non-unit-clauses : 147
% 0.53/52.68 # Current number of unprocessed clauses: 1455
% 0.53/52.68 # ...number of literals in the above : 6464
% 0.53/52.68 # Current number of archived formulas : 0
% 0.53/52.68 # Current number of archived clauses : 3460
% 0.53/52.68 # Clause-clause subsumption calls (NU) : 2260234
% 0.53/52.68 # Rec. Clause-clause subsumption calls : 299577
% 0.53/52.68 # Non-unit clause-clause subsumptions : 65361
% 0.53/52.68 # Unit Clause-clause subsumption calls : 121
% 0.53/52.68 # Rewrite failures with RHS unbound : 0
% 0.53/52.68 # BW rewrite match attempts : 2
% 0.53/52.68 # BW rewrite match successes : 2
% 0.53/52.68 # Condensation attempts : 0
% 0.53/52.68 # Condensation successes : 0
% 0.53/52.68 # Termbank termtop insertions : 7782904
% 0.53/52.68
% 0.53/52.68 # -------------------------------------------------
% 0.53/52.68 # User time : 6.016 s
% 0.53/52.68 # System time : 0.094 s
% 0.53/52.68 # Total time : 6.110 s
% 0.53/52.68 # Maximum resident set size: 129528 pages
% 0.53/69.44 eprover: CPU time limit exceeded, terminating
% 0.53/69.44 eprover: CPU time limit exceeded, terminating
% 0.53/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.45 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: CPU time limit exceeded, terminating
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.52 eprover: No such file or directory
% 0.53/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------