TSTP Solution File: NUM563+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM563+3 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 09:33:51 EDT 2022
% Result : Theorem 0.24s 3.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 14 unt; 0 def)
% Number of atoms : 267 ( 52 equ)
% Maximal formula atoms : 88 ( 5 avg)
% Number of connectives : 347 ( 125 ~; 130 |; 71 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 61 ( 4 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xK = sz00
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mCardEmpty) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefEmp) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& ! [X1] :
( ( aElementOf0(X1,szDzozmdt0(xc))
=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = xK ) )
& ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) ) )
| aSubsetOf0(X1,xS) )
& sbrdtbr0(X1) = xK )
=> aElementOf0(X1,szDzozmdt0(xc)) ) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
<=> ? [X2] :
( aElementOf0(X2,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
=> aElementOf0(X1,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3453) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mSubRefl) ).
fof(m__3435,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3435) ).
fof(mImgRng,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mImgRng) ).
fof(c_0_7,negated_conjecture,
~ ( xK = sz00
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X2] :
( ( sbrdtbr0(X2) != sz00
| X2 = slcrc0
| ~ aSet0(X2) )
& ( X2 != slcrc0
| sbrdtbr0(X2) = sz00
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
fof(c_0_9,negated_conjecture,
! [X5,X6,X9] :
( xK = sz00
& ( aSet0(esk2_2(X5,X6))
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( ~ aElementOf0(X9,esk2_2(X5,X6))
| aElementOf0(X9,X6)
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aSubsetOf0(esk2_2(X5,X6),X6)
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sbrdtbr0(esk2_2(X5,X6)) = xK
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aElementOf0(esk2_2(X5,X6),slbdtsldtrb0(X6,xK))
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sdtlpdtrp0(xc,esk2_2(X5,X6)) != X5
| aElementOf0(esk1_2(X5,X6),X6)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aSet0(esk2_2(X5,X6))
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( ~ aElementOf0(X9,esk2_2(X5,X6))
| aElementOf0(X9,X6)
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aSubsetOf0(esk2_2(X5,X6),X6)
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sbrdtbr0(esk2_2(X5,X6)) = xK
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aElementOf0(esk2_2(X5,X6),slbdtsldtrb0(X6,xK))
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sdtlpdtrp0(xc,esk2_2(X5,X6)) != X5
| ~ aElementOf0(esk1_2(X5,X6),xS)
| ~ aSet0(X6)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aSet0(esk2_2(X5,X6))
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( ~ aElementOf0(X9,esk2_2(X5,X6))
| aElementOf0(X9,X6)
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aSubsetOf0(esk2_2(X5,X6),X6)
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sbrdtbr0(esk2_2(X5,X6)) = xK
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( aElementOf0(esk2_2(X5,X6),slbdtsldtrb0(X6,xK))
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sdtlpdtrp0(xc,esk2_2(X5,X6)) != X5
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) ) ),
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)],[c_0_7])])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk15_1(X3),X3)
| X3 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
cnf(c_0_11,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
xK = sz00,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,hypothesis,
! [X3,X4,X3,X6,X6,X8,X9] :
( aFunction0(xc)
& ( aSet0(X3)
| ~ aElementOf0(X3,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X4,X3)
| aElementOf0(X4,xS)
| ~ aElementOf0(X3,szDzozmdt0(xc)) )
& ( aSubsetOf0(X3,xS)
| ~ aElementOf0(X3,szDzozmdt0(xc)) )
& ( sbrdtbr0(X3) = xK
| ~ aElementOf0(X3,szDzozmdt0(xc)) )
& ( aElementOf0(esk3_1(X3),X3)
| ~ aSet0(X3)
| sbrdtbr0(X3) != xK
| aElementOf0(X3,szDzozmdt0(xc)) )
& ( ~ aElementOf0(esk3_1(X3),xS)
| ~ aSet0(X3)
| sbrdtbr0(X3) != xK
| aElementOf0(X3,szDzozmdt0(xc)) )
& ( ~ aSubsetOf0(X3,xS)
| sbrdtbr0(X3) != xK
| aElementOf0(X3,szDzozmdt0(xc)) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ( aElementOf0(esk4_1(X6),szDzozmdt0(xc))
| ~ aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( sdtlpdtrp0(xc,esk4_1(X6)) = X6
| ~ aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X8,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X8) != X6
| aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X9,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X9,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
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)],[m__3453])])])])])])]) ).
cnf(c_0_15,plain,
( sbrdtbr0(X1) = xK
| X1 != slcrc0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X1,szDzozmdt0(xc))
| aElementOf0(esk3_1(X1),X1)
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
sbrdtbr0(slcrc0) = xK,
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X2] :
( ~ aSet0(X2)
| aSubsetOf0(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
fof(c_0_20,hypothesis,
! [X2] :
( aSet0(xS)
& ( ~ aElementOf0(X2,xS)
| aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
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)],[m__3435])])])])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ aFunction0(X3)
| ~ aElementOf0(X4,szDzozmdt0(X3))
| aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(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)],[mImgRng])])])])]) ).
cnf(c_0_22,plain,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,hypothesis,
( aElementOf0(esk3_1(slcrc0),slcrc0)
| aElementOf0(slcrc0,szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aElementOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,hypothesis,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( sbrdtbr0(esk2_2(X1,X2)) = xK
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,hypothesis,
aSubsetOf0(xS,xS),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_34,negated_conjecture,
( aSet0(esk2_2(X1,X2))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
( X1 = slcrc0
| ~ aSet0(X1)
| sbrdtbr0(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
( sbrdtbr0(esk2_2(X1,xS)) = xK
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( aSet0(esk2_2(X1,xS))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_35,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
sbrdtbr0(esk2_2(sdtlpdtrp0(xc,slcrc0),xS)) = xK,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
aSet0(esk2_2(sdtlpdtrp0(xc,slcrc0),xS)),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk2_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
esk2_2(sdtlpdtrp0(xc,slcrc0),xS) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_30]),c_0_31]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM563+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 : Wed Jul 6 19:17:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/3.43 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/3.43 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/3.43 # Preprocessing time : 0.022 s
% 0.24/3.43
% 0.24/3.43 # Proof found!
% 0.24/3.43 # SZS status Theorem
% 0.24/3.43 # SZS output start CNFRefutation
% See solution above
% 0.24/3.43 # Proof object total steps : 45
% 0.24/3.43 # Proof object clause steps : 30
% 0.24/3.43 # Proof object formula steps : 15
% 0.24/3.43 # Proof object conjectures : 13
% 0.24/3.43 # Proof object clause conjectures : 10
% 0.24/3.43 # Proof object formula conjectures : 3
% 0.24/3.43 # Proof object initial clauses used : 15
% 0.24/3.43 # Proof object initial formulas used : 7
% 0.24/3.43 # Proof object generating inferences : 13
% 0.24/3.43 # Proof object simplifying inferences : 17
% 0.24/3.43 # Training examples: 0 positive, 0 negative
% 0.24/3.43 # Parsed axioms : 78
% 0.24/3.43 # Removed by relevancy pruning/SinE : 27
% 0.24/3.43 # Initial clauses : 116
% 0.24/3.43 # Removed in clause preprocessing : 6
% 0.24/3.43 # Initial clauses in saturation : 110
% 0.24/3.43 # Processed clauses : 4835
% 0.24/3.43 # ...of these trivial : 67
% 0.24/3.43 # ...subsumed : 1581
% 0.24/3.43 # ...remaining for further processing : 3187
% 0.24/3.43 # Other redundant clauses eliminated : 0
% 0.24/3.43 # Clauses deleted for lack of memory : 0
% 0.24/3.43 # Backward-subsumed : 7
% 0.24/3.43 # Backward-rewritten : 275
% 0.24/3.43 # Generated clauses : 120310
% 0.24/3.43 # ...of the previous two non-trivial : 118501
% 0.24/3.43 # Contextual simplify-reflections : 162
% 0.24/3.43 # Paramodulations : 120153
% 0.24/3.43 # Factorizations : 0
% 0.24/3.43 # Equation resolutions : 133
% 0.24/3.43 # Current number of processed clauses : 2881
% 0.24/3.43 # Positive orientable unit clauses : 768
% 0.24/3.43 # Positive unorientable unit clauses: 0
% 0.24/3.43 # Negative unit clauses : 132
% 0.24/3.43 # Non-unit-clauses : 1981
% 0.24/3.43 # Current number of unprocessed clauses: 106502
% 0.24/3.43 # ...number of literals in the above : 321037
% 0.24/3.43 # Current number of archived formulas : 0
% 0.24/3.43 # Current number of archived clauses : 306
% 0.24/3.43 # Clause-clause subsumption calls (NU) : 213875
% 0.24/3.43 # Rec. Clause-clause subsumption calls : 141910
% 0.24/3.43 # Non-unit clause-clause subsumptions : 1503
% 0.24/3.43 # Unit Clause-clause subsumption calls : 24220
% 0.24/3.43 # Rewrite failures with RHS unbound : 0
% 0.24/3.43 # BW rewrite match attempts : 27687
% 0.24/3.43 # BW rewrite match successes : 38
% 0.24/3.43 # Condensation attempts : 0
% 0.24/3.43 # Condensation successes : 0
% 0.24/3.43 # Termbank termtop insertions : 21175321
% 0.24/3.43
% 0.24/3.43 # -------------------------------------------------
% 0.24/3.43 # User time : 2.803 s
% 0.24/3.43 # System time : 0.071 s
% 0.24/3.43 # Total time : 2.874 s
% 0.24/3.43 # Maximum resident set size: 108556 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------