TSTP Solution File: NUM563+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM563+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:44 EDT 2023
% Result : Theorem 22.94s 3.46s
% Output : CNFRefutation 22.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 11 unt; 0 def)
% Number of atoms : 287 ( 51 equ)
% Maximal formula atoms : 88 ( 6 avg)
% Number of connectives : 380 ( 140 ~; 143 |; 75 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-2 aty)
% Number of variables : 71 ( 2 sgn; 38 !; 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/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',m__) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',mSubRefl) ).
fof(m__3435,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',m__3435) ).
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/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',m__3453) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',mCardEmpty) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',mDefSub) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p',mDefEmp) ).
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,
! [X52] :
( ~ aSet0(X52)
| aSubsetOf0(X52,X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
fof(c_0_9,hypothesis,
! [X8] :
( aSet0(xS)
& ( ~ aElementOf0(X8,xS)
| aElementOf0(X8,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])]) ).
fof(c_0_10,negated_conjecture,
! [X36,X37,X40] :
( xK = sz00
& ( aSet0(esk13_2(X36,X37))
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( ~ aElementOf0(X40,esk13_2(X36,X37))
| aElementOf0(X40,X37)
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aSubsetOf0(esk13_2(X36,X37),X37)
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sbrdtbr0(esk13_2(X36,X37)) = xK
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aElementOf0(esk13_2(X36,X37),slbdtsldtrb0(X37,xK))
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sdtlpdtrp0(xc,esk13_2(X36,X37)) != X36
| aElementOf0(esk12_2(X36,X37),X37)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aSet0(esk13_2(X36,X37))
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( ~ aElementOf0(X40,esk13_2(X36,X37))
| aElementOf0(X40,X37)
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aSubsetOf0(esk13_2(X36,X37),X37)
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sbrdtbr0(esk13_2(X36,X37)) = xK
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aElementOf0(esk13_2(X36,X37),slbdtsldtrb0(X37,xK))
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sdtlpdtrp0(xc,esk13_2(X36,X37)) != X36
| ~ aElementOf0(esk12_2(X36,X37),xS)
| ~ aSet0(X37)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aSet0(esk13_2(X36,X37))
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( ~ aElementOf0(X40,esk13_2(X36,X37))
| aElementOf0(X40,X37)
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aSubsetOf0(esk13_2(X36,X37),X37)
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sbrdtbr0(esk13_2(X36,X37)) = xK
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( aElementOf0(esk13_2(X36,X37),slbdtsldtrb0(X37,xK))
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) )
& ( sdtlpdtrp0(xc,esk13_2(X36,X37)) != X36
| ~ aSubsetOf0(X37,xS)
| ~ isCountable0(X37)
| ~ aElementOf0(X36,xT) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_11,hypothesis,
! [X9,X10,X11,X13,X15,X16,X17] :
( aFunction0(xc)
& ( aSet0(X9)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X10,X9)
| aElementOf0(X10,xS)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( aSubsetOf0(X9,xS)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( sbrdtbr0(X9) = xK
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( aElementOf0(esk1_1(X11),X11)
| ~ aSet0(X11)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& ( ~ aElementOf0(esk1_1(X11),xS)
| ~ aSet0(X11)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& ( ~ aSubsetOf0(X11,xS)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ( aElementOf0(esk2_1(X13),szDzozmdt0(xc))
| ~ aElementOf0(X13,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( sdtlpdtrp0(xc,esk2_1(X13)) = X13
| ~ aElementOf0(X13,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X16,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X16) != X15
| aElementOf0(X15,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X17,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X17,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3453])])])])])]) ).
cnf(c_0_12,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( aElementOf0(esk13_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xS,xS),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X98] :
( ( sbrdtbr0(X98) != sz00
| X98 = slcrc0
| ~ aSet0(X98) )
& ( X98 != slcrc0
| sbrdtbr0(X98) = sz00
| ~ aSet0(X98) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
fof(c_0_19,plain,
! [X47,X48,X49,X50] :
( ( aSet0(X48)
| ~ aSubsetOf0(X48,X47)
| ~ aSet0(X47) )
& ( ~ aElementOf0(X49,X48)
| aElementOf0(X49,X47)
| ~ aSubsetOf0(X48,X47)
| ~ aSet0(X47) )
& ( aElementOf0(esk14_2(X47,X50),X50)
| ~ aSet0(X50)
| aSubsetOf0(X50,X47)
| ~ aSet0(X47) )
& ( ~ aElementOf0(esk14_2(X47,X50),X47)
| ~ aSet0(X50)
| aSubsetOf0(X50,X47)
| ~ aSet0(X47) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])]) ).
cnf(c_0_20,hypothesis,
( aSubsetOf0(X1,xS)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,hypothesis,
( aElementOf0(esk13_2(X1,xS),szDzozmdt0(xc))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
fof(c_0_22,plain,
! [X110,X111,X112] :
( ( aSet0(X110)
| X110 != slcrc0 )
& ( ~ aElementOf0(X111,X110)
| X110 != slcrc0 )
& ( ~ aSet0(X112)
| aElementOf0(esk24_1(X112),X112)
| X112 = slcrc0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefEmp])])])])])]) ).
cnf(c_0_23,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
xK = sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
( aSubsetOf0(esk13_2(X1,xS),xS)
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,hypothesis,
( sbrdtbr0(X1) = xK
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,hypothesis,
( aSet0(esk13_2(X1,xS))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13])]) ).
cnf(c_0_31,hypothesis,
( sbrdtbr0(esk13_2(X1,xS)) = xK
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(X2,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ aElementOf0(X1,X2)
| X2 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,negated_conjecture,
( sdtlpdtrp0(xc,esk13_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,hypothesis,
( esk13_2(X1,xS) = slcrc0
| ~ aElementOf0(X1,xT) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_38,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_40,hypothesis,
( aElementOf0(esk1_1(X1),X1)
| aElementOf0(X1,szDzozmdt0(xc))
| ~ aSet0(X1)
| sbrdtbr0(X1) != xK ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,plain,
sbrdtbr0(slcrc0) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_24])]),c_0_34])]) ).
cnf(c_0_42,plain,
~ aElementOf0(X1,slcrc0),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_16]),c_0_17])])]) ).
cnf(c_0_44,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_34])]),c_0_42]) ).
cnf(c_0_46,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM563+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n021.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 14:17:13 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.xcUecv28Pg/E---3.1_23944.p
% 22.94/3.46 # Version: 3.1pre001
% 22.94/3.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.94/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.94/3.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.94/3.46 # Starting new_bool_3 with 300s (1) cores
% 22.94/3.46 # Starting new_bool_1 with 300s (1) cores
% 22.94/3.46 # Starting sh5l with 300s (1) cores
% 22.94/3.46 # new_bool_3 with pid 24097 completed with status 0
% 22.94/3.46 # Result found by new_bool_3
% 22.94/3.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.94/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.94/3.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.94/3.46 # Starting new_bool_3 with 300s (1) cores
% 22.94/3.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.94/3.46 # Search class: FGHSF-SMLM32-SFFFFFNN
% 22.94/3.46 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 22.94/3.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 22.94/3.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 22.94/3.46 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24150 completed with status 0
% 22.94/3.46 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 22.94/3.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.94/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.94/3.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.94/3.46 # Starting new_bool_3 with 300s (1) cores
% 22.94/3.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.94/3.46 # Search class: FGHSF-SMLM32-SFFFFFNN
% 22.94/3.46 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 22.94/3.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 22.94/3.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 22.94/3.46 # Preprocessing time : 0.077 s
% 22.94/3.46 # Presaturation interreduction done
% 22.94/3.46
% 22.94/3.46 # Proof found!
% 22.94/3.46 # SZS status Theorem
% 22.94/3.46 # SZS output start CNFRefutation
% See solution above
% 22.94/3.46 # Parsed axioms : 78
% 22.94/3.46 # Removed by relevancy pruning/SinE : 17
% 22.94/3.46 # Initial clauses : 4104
% 22.94/3.46 # Removed in clause preprocessing : 7
% 22.94/3.46 # Initial clauses in saturation : 4097
% 22.94/3.46 # Processed clauses : 6329
% 22.94/3.46 # ...of these trivial : 4
% 22.94/3.46 # ...subsumed : 666
% 22.94/3.46 # ...remaining for further processing : 5659
% 22.94/3.46 # Other redundant clauses eliminated : 1914
% 22.94/3.46 # Clauses deleted for lack of memory : 0
% 22.94/3.46 # Backward-subsumed : 38
% 22.94/3.46 # Backward-rewritten : 16
% 22.94/3.46 # Generated clauses : 3011
% 22.94/3.46 # ...of the previous two non-redundant : 2798
% 22.94/3.46 # ...aggressively subsumed : 0
% 22.94/3.46 # Contextual simplify-reflections : 11
% 22.94/3.46 # Paramodulations : 1287
% 22.94/3.46 # Factorizations : 0
% 22.94/3.46 # NegExts : 0
% 22.94/3.46 # Equation resolutions : 1915
% 22.94/3.46 # Total rewrite steps : 813
% 22.94/3.46 # Propositional unsat checks : 2
% 22.94/3.46 # Propositional check models : 2
% 22.94/3.46 # Propositional check unsatisfiable : 0
% 22.94/3.46 # Propositional clauses : 0
% 22.94/3.46 # Propositional clauses after purity: 0
% 22.94/3.46 # Propositional unsat core size : 0
% 22.94/3.46 # Propositional preprocessing time : 0.000
% 22.94/3.46 # Propositional encoding time : 0.026
% 22.94/3.46 # Propositional solver time : 0.001
% 22.94/3.46 # Success case prop preproc time : 0.000
% 22.94/3.46 # Success case prop encoding time : 0.000
% 22.94/3.46 # Success case prop solver time : 0.000
% 22.94/3.46 # Current number of processed clauses : 357
% 22.94/3.46 # Positive orientable unit clauses : 86
% 22.94/3.46 # Positive unorientable unit clauses: 0
% 22.94/3.46 # Negative unit clauses : 24
% 22.94/3.46 # Non-unit-clauses : 247
% 22.94/3.46 # Current number of unprocessed clauses: 4046
% 22.94/3.46 # ...number of literals in the above : 43516
% 22.94/3.46 # Current number of archived formulas : 0
% 22.94/3.46 # Current number of archived clauses : 3583
% 22.94/3.46 # Clause-clause subsumption calls (NU) : 4610129
% 22.94/3.46 # Rec. Clause-clause subsumption calls : 73489
% 22.94/3.46 # Non-unit clause-clause subsumptions : 654
% 22.94/3.46 # Unit Clause-clause subsumption calls : 1215
% 22.94/3.46 # Rewrite failures with RHS unbound : 0
% 22.94/3.46 # BW rewrite match attempts : 16
% 22.94/3.46 # BW rewrite match successes : 11
% 22.94/3.46 # Condensation attempts : 0
% 22.94/3.46 # Condensation successes : 0
% 22.94/3.46 # Termbank termtop insertions : 789202
% 22.94/3.46
% 22.94/3.46 # -------------------------------------------------
% 22.94/3.46 # User time : 2.968 s
% 22.94/3.46 # System time : 0.030 s
% 22.94/3.46 # Total time : 2.998 s
% 22.94/3.46 # Maximum resident set size: 13100 pages
% 22.94/3.46
% 22.94/3.46 # -------------------------------------------------
% 22.94/3.46 # User time : 2.972 s
% 22.94/3.46 # System time : 0.033 s
% 22.94/3.46 # Total time : 3.005 s
% 22.94/3.46 # Maximum resident set size: 1792 pages
% 22.94/3.46 % E---3.1 exiting
%------------------------------------------------------------------------------