TSTP Solution File: NUM558+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM558+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : 300s
% DateTime : Sat May 4 09:06:42 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 55 ( 21 unt; 0 def)
% Number of atoms : 293 ( 59 equ)
% Maximal formula atoms : 54 ( 5 avg)
% Number of connectives : 400 ( 162 ~; 169 |; 52 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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; 10 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
( aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& slbdtsldtrb0(xS,xk) != slcrc0 ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2227) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',mDefSub) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',mDefSel) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2202_02) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2202) ).
fof(mDefCons,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtpldt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& ( aElementOf0(X4,X1)
| X4 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',mDefCons) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',mEOfElem) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',mDefDiff) ).
fof(m__2256,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2256) ).
fof(m__2378,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2378) ).
fof(m__2357,hypothesis,
xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2357) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__) ).
fof(m__2304,hypothesis,
( aElement0(xy)
& aElementOf0(xy,xQ) ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2304) ).
fof(m__2291,hypothesis,
( aSet0(xQ)
& isFinite0(xQ)
& sbrdtbr0(xQ) = xk ),
file('/export/starexec/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p',m__2291) ).
fof(c_0_14,hypothesis,
( aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& slbdtsldtrb0(xS,xk) != slcrc0 ),
inference(fof_simplification,[status(thm)],[m__2227]) ).
fof(c_0_15,plain,
! [X11,X12,X13,X14] :
( ( aSet0(X12)
| ~ aSubsetOf0(X12,X11)
| ~ aSet0(X11) )
& ( ~ aElementOf0(X13,X12)
| aElementOf0(X13,X11)
| ~ aSubsetOf0(X12,X11)
| ~ aSet0(X11) )
& ( aElementOf0(esk2_2(X11,X14),X14)
| ~ aSet0(X14)
| aSubsetOf0(X14,X11)
| ~ aSet0(X11) )
& ( ~ aElementOf0(esk2_2(X11,X14),X11)
| ~ aSet0(X14)
| aSubsetOf0(X14,X11)
| ~ aSet0(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_16,hypothesis,
( aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& slbdtsldtrb0(xS,xk) != slcrc0 ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X90,X91,X92,X93,X94,X95] :
( ( aSet0(X92)
| X92 != slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( aSubsetOf0(X93,X90)
| ~ aElementOf0(X93,X92)
| X92 != slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( sbrdtbr0(X93) = X91
| ~ aElementOf0(X93,X92)
| X92 != slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( ~ aSubsetOf0(X94,X90)
| sbrdtbr0(X94) != X91
| aElementOf0(X94,X92)
| X92 != slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( ~ aElementOf0(esk7_3(X90,X91,X95),X95)
| ~ aSubsetOf0(esk7_3(X90,X91,X95),X90)
| sbrdtbr0(esk7_3(X90,X91,X95)) != X91
| ~ aSet0(X95)
| X95 = slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( aSubsetOf0(esk7_3(X90,X91,X95),X90)
| aElementOf0(esk7_3(X90,X91,X95),X95)
| ~ aSet0(X95)
| X95 = slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) )
& ( sbrdtbr0(esk7_3(X90,X91,X95)) = X91
| aElementOf0(esk7_3(X90,X91,X95),X95)
| ~ aSet0(X95)
| X95 = slbdtsldtrb0(X90,X91)
| ~ aSet0(X90)
| ~ aElementOf0(X91,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSel])])])])])])]) ).
fof(c_0_18,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_19,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( aSet0(X1)
| X1 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X4,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| ~ aSet0(slbdtsldtrb0(xT,xk)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( aSet0(slbdtsldtrb0(X1,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_27,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X37,X38,X39,X40,X41,X42] :
( ( aSet0(X39)
| X39 != sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( aElement0(X40)
| ~ aElementOf0(X40,X39)
| X39 != sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( aElementOf0(X40,X37)
| X40 = X38
| ~ aElementOf0(X40,X39)
| X39 != sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( ~ aElementOf0(X41,X37)
| ~ aElement0(X41)
| aElementOf0(X41,X39)
| X39 != sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( X41 != X38
| ~ aElement0(X41)
| aElementOf0(X41,X39)
| X39 != sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( ~ aElementOf0(esk4_3(X37,X38,X42),X37)
| ~ aElement0(esk4_3(X37,X38,X42))
| ~ aElementOf0(esk4_3(X37,X38,X42),X42)
| ~ aSet0(X42)
| X42 = sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( esk4_3(X37,X38,X42) != X38
| ~ aElement0(esk4_3(X37,X38,X42))
| ~ aElementOf0(esk4_3(X37,X38,X42),X42)
| ~ aSet0(X42)
| X42 = sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( aElement0(esk4_3(X37,X38,X42))
| aElementOf0(esk4_3(X37,X38,X42),X42)
| ~ aSet0(X42)
| X42 = sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) )
& ( aElementOf0(esk4_3(X37,X38,X42),X37)
| esk4_3(X37,X38,X42) = X38
| aElementOf0(esk4_3(X37,X38,X42),X42)
| ~ aSet0(X42)
| X42 = sdtpldt0(X37,X38)
| ~ aSet0(X37)
| ~ aElement0(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefCons])])])])])])]) ).
fof(c_0_29,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,X5)
| aElement0(X6) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_30,plain,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
cnf(c_0_31,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,plain,
( aElementOf0(X1,X3)
| X1 != X2
| ~ aElement0(X1)
| X3 != sdtpldt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__2256]) ).
cnf(c_0_36,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_37,plain,
! [X44,X45,X46,X47,X48,X49] :
( ( aSet0(X46)
| X46 != sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( aElement0(X47)
| ~ aElementOf0(X47,X46)
| X46 != sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( aElementOf0(X47,X44)
| ~ aElementOf0(X47,X46)
| X46 != sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( X47 != X45
| ~ aElementOf0(X47,X46)
| X46 != sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( ~ aElement0(X48)
| ~ aElementOf0(X48,X44)
| X48 = X45
| aElementOf0(X48,X46)
| X46 != sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( ~ aElementOf0(esk5_3(X44,X45,X49),X49)
| ~ aElement0(esk5_3(X44,X45,X49))
| ~ aElementOf0(esk5_3(X44,X45,X49),X44)
| esk5_3(X44,X45,X49) = X45
| ~ aSet0(X49)
| X49 = sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( aElement0(esk5_3(X44,X45,X49))
| aElementOf0(esk5_3(X44,X45,X49),X49)
| ~ aSet0(X49)
| X49 = sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( aElementOf0(esk5_3(X44,X45,X49),X44)
| aElementOf0(esk5_3(X44,X45,X49),X49)
| ~ aSet0(X49)
| X49 = sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) )
& ( esk5_3(X44,X45,X49) != X45
| aElementOf0(esk5_3(X44,X45,X49),X49)
| ~ aSet0(X49)
| X49 = sdtmndt0(X44,X45)
| ~ aSet0(X44)
| ~ aElement0(X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_30])])])])])])]) ).
cnf(c_0_38,hypothesis,
( aSubsetOf0(X1,xT)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[m__2378]) ).
cnf(c_0_40,plain,
( aElementOf0(X1,sdtpldt0(X2,X1))
| ~ aElement0(X1)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).
cnf(c_0_41,hypothesis,
xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
inference(split_conjunct,[status(thm)],[m__2357]) ).
cnf(c_0_42,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_44,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_45,hypothesis,
aSubsetOf0(xP,xT),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,hypothesis,
( aElementOf0(xx,xP)
| ~ aSet0(sdtmndt0(xQ,xy)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_47,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__2304]) ).
cnf(c_0_49,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[m__2291]) ).
fof(c_0_50,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_44]) ).
cnf(c_0_51,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_45]),c_0_27])]) ).
cnf(c_0_52,hypothesis,
aElementOf0(xx,xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM558+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.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 : 300
% 0.13/0.34 % DateTime : Fri May 3 09:14:50 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.iObcdYPPyy/E---3.1_6336.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # sh5l with pid 6416 completed with status 0
% 0.20/0.53 # Result found by sh5l
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.53 # SAT001_MinMin_p005000_rr_RG with pid 6422 completed with status 0
% 0.20/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.003 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 72
% 0.20/0.53 # Removed by relevancy pruning/SinE : 3
% 0.20/0.53 # Initial clauses : 122
% 0.20/0.53 # Removed in clause preprocessing : 5
% 0.20/0.53 # Initial clauses in saturation : 117
% 0.20/0.53 # Processed clauses : 497
% 0.20/0.53 # ...of these trivial : 1
% 0.20/0.53 # ...subsumed : 116
% 0.20/0.53 # ...remaining for further processing : 380
% 0.20/0.53 # Other redundant clauses eliminated : 34
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 7
% 0.20/0.53 # Backward-rewritten : 12
% 0.20/0.53 # Generated clauses : 682
% 0.20/0.53 # ...of the previous two non-redundant : 599
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 31
% 0.20/0.53 # Paramodulations : 650
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 35
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 388
% 0.20/0.53 # ...of those cached : 360
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 220
% 0.20/0.53 # Positive orientable unit clauses : 39
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 9
% 0.20/0.53 # Non-unit-clauses : 172
% 0.20/0.53 # Current number of unprocessed clauses: 327
% 0.20/0.53 # ...number of literals in the above : 1822
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 135
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 7463
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 2521
% 0.20/0.53 # Non-unit clause-clause subsumptions : 107
% 0.20/0.53 # Unit Clause-clause subsumption calls : 686
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 9
% 0.20/0.53 # BW rewrite match successes : 9
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 21045
% 0.20/0.53 # Search garbage collected termcells : 2188
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.040 s
% 0.20/0.53 # System time : 0.001 s
% 0.20/0.53 # Total time : 0.041 s
% 0.20/0.53 # Maximum resident set size: 2232 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.042 s
% 0.20/0.53 # System time : 0.003 s
% 0.20/0.53 # Total time : 0.045 s
% 0.20/0.53 # Maximum resident set size: 1768 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------