TSTP Solution File: COM013+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : Fri Jul 15 01:14:03 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 6 unt; 0 def)
% Number of atoms : 289 ( 8 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 415 ( 178 ~; 184 |; 31 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 121 ( 4 sgn 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] : aNormalFormOfIn0(X3,X2,xR) ) )
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNFRDef) ).
fof(m__587,hypothesis,
( aRewritingSystem0(xR)
& isTerminating0(xR) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__587) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCRDef) ).
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3)
& aElement0(X4) )
=> ( ( sdtmndtplgtdt0(X1,X2,X3)
& sdtmndtplgtdt0(X3,X2,X4) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCTrans) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mReduct) ).
fof(mTermin,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isTerminating0(X1)
<=> ! [X2,X3] :
( ( aElement0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X2,X1,X3)
=> iLess0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTermin) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] : aNormalFormOfIn0(X3,X2,xR) ) )
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8,X7] :
( ( aElement0(X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X5,X6,X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( ~ aReductOfIn0(X8,X7,X6)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| aReductOfIn0(esk5_3(X5,X6,X7),X7,X6)
| aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) ) ),
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)],[mNFRDef])])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X5,X7] :
( aElement0(esk1_0)
& ( ~ aElement0(X5)
| ~ iLess0(X5,esk1_0)
| aNormalFormOfIn0(esk2_1(X5),X5,xR) )
& ~ aNormalFormOfIn0(X7,esk1_0,xR) ),
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)],[c_0_8])])])])])]) ).
cnf(c_0_11,plain,
( ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1)
| ~ aReductOfIn0(X4,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( aNormalFormOfIn0(esk2_1(X1),X1,xR)
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_14,plain,
( aElement0(X3)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ iLess0(X1,esk1_0)
| ~ aReductOfIn0(X2,esk2_1(X1),xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( aNormalFormOfIn0(X3,X2,X1)
| aReductOfIn0(esk5_3(X2,X1,X3),X3,X1)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(X2,X1,X3)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( aElement0(esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13])]) ).
fof(c_0_18,plain,
! [X4,X5,X6] :
( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( X4 != X6
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( ~ sdtmndtplgtdt0(X4,X5,X6)
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])]) ).
cnf(c_0_19,plain,
( sdtmndtasgtdt0(X2,X1,X3)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
~ aNormalFormOfIn0(X1,esk1_0,xR),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( aNormalFormOfIn0(esk2_1(X1),X2,xR)
| ~ sdtmndtasgtdt0(X2,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X5,X6,X7,X8] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ sdtmndtplgtdt0(X7,X6,X8)
| sdtmndtplgtdt0(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])]) ).
cnf(c_0_24,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( sdtmndtasgtdt0(X1,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_13])]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X9] :
( ( aElement0(esk6_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk6_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk6_3(X5,X6,X7),X6,X7)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aReductOfIn0(X7,X5,X6)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ) ),
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)],[mTCDef])])])])])])]) ).
fof(c_0_27,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aReductOfIn0(X6,X4,X5)
| aElement0(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)],[mReduct])])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ sdtmndtasgtdt0(esk1_0,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(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_29,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( esk2_1(X1) = X1
| sdtmndtplgtdt0(X1,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_13])]),c_0_17]) ).
cnf(c_0_32,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( aElement0(X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]),c_0_22])]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( esk2_1(X1) = X1
| sdtmndtplgtdt0(X2,xR,esk2_1(X1))
| ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_13])]),c_0_17]) ).
fof(c_0_36,plain,
! [X4,X5,X6] :
( ( ~ isTerminating0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ sdtmndtplgtdt0(X5,X4,X6)
| iLess0(X6,X5)
| ~ aRewritingSystem0(X4) )
& ( aElement0(esk3_1(X4))
| isTerminating0(X4)
| ~ aRewritingSystem0(X4) )
& ( aElement0(esk4_1(X4))
| isTerminating0(X4)
| ~ aRewritingSystem0(X4) )
& ( sdtmndtplgtdt0(esk3_1(X4),X4,esk4_1(X4))
| isTerminating0(X4)
| ~ aRewritingSystem0(X4) )
& ( ~ iLess0(esk4_1(X4),esk3_1(X4))
| isTerminating0(X4)
| ~ aRewritingSystem0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTermin])])])])])])]) ).
cnf(c_0_37,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( esk2_1(X1) = X1
| ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22])]) ).
cnf(c_0_39,plain,
( iLess0(X2,X3)
| ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X3,X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ isTerminating0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( aNormalFormOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X1,X3,esk5_3(X2,X3,X1))
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_41,plain,
( aNormalFormOfIn0(X1,X2,X3)
| aElement0(esk5_3(X2,X3,X1))
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
( ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_43,plain,
( aNormalFormOfIn0(X1,X2,X3)
| iLess0(esk5_3(X2,X3,X1),X1)
| ~ isTerminating0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( aNormalFormOfIn0(esk1_0,X1,X2)
| ~ isTerminating0(X2)
| ~ sdtmndtasgtdt0(X1,X2,esk1_0)
| ~ sdtmndtplgtdt0(esk1_0,xR,esk5_3(X1,X2,esk1_0))
| ~ aRewritingSystem0(X2)
| ~ aElement0(esk5_3(X1,X2,esk1_0))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).
cnf(c_0_45,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_46,negated_conjecture,
( aNormalFormOfIn0(esk1_0,X1,xR)
| ~ sdtmndtasgtdt0(X1,xR,esk1_0)
| ~ aElement0(esk5_3(X1,xR,esk1_0))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40]),c_0_45]),c_0_13]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
( aNormalFormOfIn0(esk1_0,X1,xR)
| ~ sdtmndtasgtdt0(X1,xR,esk1_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_13]),c_0_22])]) ).
cnf(c_0_48,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| X3 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_49,negated_conjecture,
~ sdtmndtasgtdt0(esk1_0,xR,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_47]),c_0_22])]) ).
cnf(c_0_50,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_13]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 17:08:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 52
% 0.24/1.41 # Proof object clause steps : 36
% 0.24/1.41 # Proof object formula steps : 16
% 0.24/1.41 # Proof object conjectures : 21
% 0.24/1.41 # Proof object clause conjectures : 18
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 16
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 18
% 0.24/1.41 # Proof object simplifying inferences : 40
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 15
% 0.24/1.41 # Removed by relevancy pruning/SinE : 2
% 0.24/1.41 # Initial clauses : 29
% 0.24/1.41 # Removed in clause preprocessing : 4
% 0.24/1.41 # Initial clauses in saturation : 25
% 0.24/1.41 # Processed clauses : 141
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 60
% 0.24/1.41 # ...remaining for further processing : 81
% 0.24/1.41 # Other redundant clauses eliminated : 1
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 5
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 247
% 0.24/1.41 # ...of the previous two non-trivial : 221
% 0.24/1.41 # Contextual simplify-reflections : 119
% 0.24/1.41 # Paramodulations : 246
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 1
% 0.24/1.41 # Current number of processed clauses : 75
% 0.24/1.41 # Positive orientable unit clauses : 3
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 3
% 0.24/1.41 # Non-unit-clauses : 69
% 0.24/1.41 # Current number of unprocessed clauses: 98
% 0.24/1.41 # ...number of literals in the above : 839
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 5
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 3393
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 473
% 0.24/1.41 # Non-unit clause-clause subsumptions : 169
% 0.24/1.41 # Unit Clause-clause subsumption calls : 45
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 9463
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.030 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.032 s
% 0.24/1.41 # Maximum resident set size: 3252 pages
%------------------------------------------------------------------------------