TSTP Solution File: SWC310+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC310+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:27:58 EDT 2022
% Result : Theorem 0.37s 23.56s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 74 ( 16 unt; 0 def)
% Number of atoms : 310 ( 126 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 412 ( 176 ~; 166 |; 41 &)
% ( 1 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 48 !; 8 ?)
% 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) != X4
| app(X6,cons(X5,nil)) != X3 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X2) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X2) = X10
& neq(nil,X2) )
& neq(nil,X2) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(c_0_11,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) != X4
| app(X6,cons(X5,nil)) != X3 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X2) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X2) = X10
& neq(nil,X2) )
& neq(nil,X2) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
! [X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk3_0
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X17)
| esk1_0 != X17
| ~ ssList(X18)
| ~ ssList(X19)
| tl(esk2_0) != X18
| app(X18,X19) != X17
| ~ ssItem(X20)
| cons(X20,nil) != X19
| hd(esk2_0) != X20
| ~ neq(nil,esk2_0)
| ~ neq(nil,esk2_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X17)
| esk1_0 != X17
| ~ ssList(X18)
| ~ ssList(X19)
| tl(esk2_0) != X18
| app(X18,X19) != X17
| ~ ssItem(X20)
| cons(X20,nil) != X19
| hd(esk2_0) != X20
| ~ neq(nil,esk2_0)
| ~ neq(nil,esk2_0)
| nil != esk1_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])])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
fof(c_0_17,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_18,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk2_0
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
neq(esk2_0,nil),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( app(cons(X1,nil),X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( esk2_0 != nil
| ~ ssList(esk6_0)
| ~ ssItem(esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_30,c_0_15]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,X3)) = X4 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk2_0
| ~ neq(nil,esk2_0)
| ~ neq(nil,esk2_0)
| hd(esk2_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk2_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| esk1_0 != X4
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 != nil
| ~ ssItem(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_37,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_25])]) ).
cnf(c_0_38,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_39,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_40,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( esk2_0 = nil
| esk1_0 != X4
| hd(esk2_0) != X1
| tl(esk2_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk1_0
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_14]),c_0_15]) ).
cnf(c_0_44,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( hd(app(cons(X1,nil),X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_40,c_0_23]) ).
fof(c_0_46,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_47,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_48,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_49,negated_conjecture,
( app(X1,cons(X2,nil)) != X3
| hd(esk2_0) != X2
| tl(esk2_0) != X1
| esk1_0 != X3
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(nil,esk2_0)
| ~ ssItem(X2) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_25])]) ).
cnf(c_0_51,negated_conjecture,
( X1 = esk6_0
| app(cons(esk5_0,nil),X1) != esk2_0
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_28]),c_0_32])]) ).
cnf(c_0_52,negated_conjecture,
esk5_0 = hd(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_32]),c_0_37])]) ).
cnf(c_0_53,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( esk5_0 != hd(esk2_0)
| esk6_0 != tl(esk2_0)
| esk1_0 != X1
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_32]),c_0_37])]) ).
cnf(c_0_57,negated_conjecture,
( X1 = esk6_0
| app(cons(hd(esk2_0),nil),X1) != esk2_0
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]) ).
cnf(c_0_58,plain,
( app(cons(hd(X1),nil),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_53]),c_0_54]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_60,negated_conjecture,
( esk6_0 != tl(esk2_0)
| esk1_0 != X1
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_52]),c_0_52])]) ).
cnf(c_0_61,negated_conjecture,
( esk6_0 = tl(esk2_0)
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_42]) ).
cnf(c_0_62,negated_conjecture,
( esk1_0 != X1
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0))
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
fof(c_0_65,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_66,negated_conjecture,
( ~ ssList(cons(hd(esk2_0),nil))
| ~ neq(nil,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_55]),c_0_59])]),c_0_42]) ).
cnf(c_0_67,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_68,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_69,negated_conjecture,
ssItem(hd(esk2_0)),
inference(rw,[status(thm)],[c_0_37,c_0_52]) ).
fof(c_0_70,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_71,negated_conjecture,
~ neq(nil,esk2_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_68]),c_0_69])]) ).
cnf(c_0_72,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_73,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_71,c_0_72]),c_0_59]),c_0_68])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC310+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n023.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.12/0.34 % DateTime : Sun Jun 12 23:22:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.37/23.41 eprover: CPU time limit exceeded, terminating
% 0.37/23.41 eprover: CPU time limit exceeded, terminating
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.56 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.37/23.56
% 0.37/23.56 # Failure: Resource limit exceeded (time)
% 0.37/23.56 # OLD status Res
% 0.37/23.56 # Preprocessing time : 0.025 s
% 0.37/23.56 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.37/23.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.37/23.56 # Preprocessing time : 0.022 s
% 0.37/23.56
% 0.37/23.56 # Proof found!
% 0.37/23.56 # SZS status Theorem
% 0.37/23.56 # SZS output start CNFRefutation
% See solution above
% 0.37/23.56 # Proof object total steps : 74
% 0.37/23.56 # Proof object clause steps : 52
% 0.37/23.56 # Proof object formula steps : 22
% 0.37/23.56 # Proof object conjectures : 42
% 0.37/23.56 # Proof object clause conjectures : 39
% 0.37/23.56 # Proof object formula conjectures : 3
% 0.37/23.56 # Proof object initial clauses used : 22
% 0.37/23.56 # Proof object initial formulas used : 11
% 0.37/23.56 # Proof object generating inferences : 15
% 0.37/23.56 # Proof object simplifying inferences : 52
% 0.37/23.56 # Training examples: 0 positive, 0 negative
% 0.37/23.56 # Parsed axioms : 96
% 0.37/23.56 # Removed by relevancy pruning/SinE : 67
% 0.37/23.56 # Initial clauses : 54
% 0.37/23.56 # Removed in clause preprocessing : 0
% 0.37/23.56 # Initial clauses in saturation : 54
% 0.37/23.56 # Processed clauses : 380
% 0.37/23.56 # ...of these trivial : 10
% 0.37/23.56 # ...subsumed : 199
% 0.37/23.56 # ...remaining for further processing : 171
% 0.37/23.56 # Other redundant clauses eliminated : 11
% 0.37/23.56 # Clauses deleted for lack of memory : 0
% 0.37/23.56 # Backward-subsumed : 16
% 0.37/23.56 # Backward-rewritten : 33
% 0.37/23.56 # Generated clauses : 932
% 0.37/23.56 # ...of the previous two non-trivial : 830
% 0.37/23.56 # Contextual simplify-reflections : 103
% 0.37/23.56 # Paramodulations : 887
% 0.37/23.56 # Factorizations : 0
% 0.37/23.56 # Equation resolutions : 31
% 0.37/23.56 # Current number of processed clauses : 119
% 0.37/23.56 # Positive orientable unit clauses : 14
% 0.37/23.56 # Positive unorientable unit clauses: 0
% 0.37/23.56 # Negative unit clauses : 8
% 0.37/23.56 # Non-unit-clauses : 97
% 0.37/23.56 # Current number of unprocessed clauses: 284
% 0.37/23.56 # ...number of literals in the above : 1607
% 0.37/23.56 # Current number of archived formulas : 0
% 0.37/23.56 # Current number of archived clauses : 49
% 0.37/23.56 # Clause-clause subsumption calls (NU) : 4959
% 0.37/23.56 # Rec. Clause-clause subsumption calls : 1600
% 0.37/23.56 # Non-unit clause-clause subsumptions : 192
% 0.37/23.56 # Unit Clause-clause subsumption calls : 148
% 0.37/23.56 # Rewrite failures with RHS unbound : 0
% 0.37/23.56 # BW rewrite match attempts : 5
% 0.37/23.56 # BW rewrite match successes : 5
% 0.37/23.56 # Condensation attempts : 0
% 0.37/23.56 # Condensation successes : 0
% 0.37/23.56 # Termbank termtop insertions : 18502
% 0.37/23.56
% 0.37/23.56 # -------------------------------------------------
% 0.37/23.56 # User time : 0.079 s
% 0.37/23.56 # System time : 0.005 s
% 0.37/23.56 # Total time : 0.084 s
% 0.37/23.56 # Maximum resident set size: 3720 pages
% 0.37/46.42 eprover: CPU time limit exceeded, terminating
% 0.37/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.44 eprover: No such file or directory
% 0.37/46.44 eprover: CPU time limit exceeded, terminating
% 0.37/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.44 eprover: No such file or directory
% 0.37/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.45 eprover: No such file or directory
% 0.37/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.45 eprover: No such file or directory
% 0.37/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.45 eprover: No such file or directory
% 0.37/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.45 eprover: No such file or directory
% 0.37/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.46 eprover: No such file or directory
% 0.37/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.46 eprover: No such file or directory
% 0.37/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.46 eprover: No such file or directory
% 0.37/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.46 eprover: No such file or directory
% 0.37/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.46 eprover: No such file or directory
% 0.37/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.47 eprover: No such file or directory
% 0.37/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.47 eprover: No such file or directory
% 0.37/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.47 eprover: No such file or directory
% 0.37/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.47 eprover: No such file or directory
% 0.37/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/46.48 eprover: No such file or directory
% 0.37/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.48 eprover: No such file or directory
% 0.37/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.48 eprover: No such file or directory
% 0.37/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.49 eprover: No such file or directory
% 0.37/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/46.50 eprover: No such file or directory
%------------------------------------------------------------------------------