TSTP Solution File: RNG126+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG126+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Tue May 21 02:36:30 EDT 2024
% Result : Theorem 0.77s 0.58s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 9 unt; 0 def)
% Number of atoms : 258 ( 60 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 312 ( 108 ~; 104 |; 76 &)
% ( 9 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 9 con; 0-3 aty)
% Number of variables : 116 ( 0 sgn 62 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2174,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
=> ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xc )
| aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(m__2744,hypothesis,
? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xc ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2744) ).
fof(c_0_10,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( aSet0(xI)
& ( ~ aElementOf0(X123,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X122,xI) )
& ( ~ aElement0(X124)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElementOf0(X122,xI) )
& aIdeal0(xI)
& ( aElement0(esk24_1(X125))
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk24_1(X125)) = X125
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( ~ aElement0(X128)
| sdtasdt0(xa,X128) != X127
| aElementOf0(X127,slsdtgt0(xa)) )
& ( aElement0(esk25_1(X129))
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk25_1(X129)) = X129
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( ~ aElement0(X132)
| sdtasdt0(xb,X132) != X131
| aElementOf0(X131,slsdtgt0(xb)) )
& ( aElementOf0(esk26_1(X133),slsdtgt0(xa))
| ~ aElementOf0(X133,xI) )
& ( aElementOf0(esk27_1(X133),slsdtgt0(xb))
| ~ aElementOf0(X133,xI) )
& ( sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133
| ~ aElementOf0(X133,xI) )
& ( ~ aElementOf0(X137,slsdtgt0(xa))
| ~ aElementOf0(X138,slsdtgt0(xb))
| sdtpldt0(X137,X138) != X136
| aElementOf0(X136,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
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)],[m__2174])])])])])])]) ).
fof(c_0_11,plain,
! [X34,X35] :
( ~ aSet0(X34)
| ~ aElementOf0(X35,X34)
| aElement0(X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(X2,slsdtgt0(xa))
| ~ aElement0(X1)
| sdtasdt0(xa,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X105,X106,X107,X109,X110,X111,X113] :
( ( aSet0(X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( aElement0(esk18_3(X105,X106,X107))
| ~ aElementOf0(X107,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( sdtasdt0(X105,esk18_3(X105,X106,X107)) = X107
| ~ aElementOf0(X107,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( ~ aElement0(X110)
| sdtasdt0(X105,X110) != X109
| aElementOf0(X109,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( ~ aElementOf0(esk19_2(X105,X111),X111)
| ~ aElement0(X113)
| sdtasdt0(X105,X113) != esk19_2(X105,X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) )
& ( aElement0(esk20_2(X105,X111))
| aElementOf0(esk19_2(X105,X111),X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) )
& ( sdtasdt0(X105,esk20_2(X105,X111)) = esk19_2(X105,X111)
| aElementOf0(esk19_2(X105,X111),X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) ) ),
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)],[mDefPrIdeal])])])])])])]) ).
cnf(c_0_14,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
( aElementOf0(sdtasdt0(xa,X1),slsdtgt0(xa))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
=> ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xc )
| aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_18,hypothesis,
( aElement0(sdtasdt0(xa,X1))
| ~ aSet0(slsdtgt0(xa))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_21,negated_conjecture,
! [X160,X162,X163,X164,X166,X167,X168,X169] :
( ( aElement0(esk42_1(X160))
| ~ aElementOf0(X160,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk42_1(X160)) = X160
| ~ aElementOf0(X160,slsdtgt0(xa)) )
& ( ~ aElement0(X163)
| sdtasdt0(xa,X163) != X162
| aElementOf0(X162,slsdtgt0(xa)) )
& ( aElement0(esk43_1(X164))
| ~ aElementOf0(X164,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk43_1(X164)) = X164
| ~ aElementOf0(X164,slsdtgt0(xb)) )
& ( ~ aElement0(X167)
| sdtasdt0(xb,X167) != X166
| aElementOf0(X166,slsdtgt0(xb)) )
& ( ~ aElementOf0(X168,slsdtgt0(xa))
| ~ aElementOf0(X169,slsdtgt0(xb))
| sdtpldt0(X168,X169) != xc )
& ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
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_17])])])])])])]) ).
fof(c_0_22,plain,
! [X11,X12] :
( ~ aElement0(X11)
| ~ aElement0(X12)
| aElement0(sdtasdt0(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_23,hypothesis,
( aElement0(sdtasdt0(xa,X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
( sdtasdt0(xa,esk42_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( aElement0(esk42_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sdtasdt0(xb,esk43_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_29,negated_conjecture,
( aElement0(esk43_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X9,X10] :
( ~ aElement0(X9)
| ~ aElement0(X10)
| aElement0(sdtpldt0(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_31,negated_conjecture,
( aElement0(X1)
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(esk26_1(X1),slsdtgt0(xa))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,negated_conjecture,
( aElement0(X1)
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_34,hypothesis,
( aElementOf0(esk27_1(X1),slsdtgt0(xb))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_35,plain,
! [X20,X21] :
( ~ aElement0(X20)
| ~ aElement0(X21)
| sdtasdt0(X20,X21) = sdtasdt0(X21,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_36,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,hypothesis,
( sdtpldt0(esk26_1(X1),esk27_1(X1)) = X1
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( aElement0(esk26_1(X1))
| ~ aElementOf0(X1,xI) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( aElement0(esk27_1(X1))
| ~ aElementOf0(X1,xI) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_40,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_41,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,hypothesis,
( aElement0(X1)
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]) ).
fof(c_0_44,hypothesis,
( aElement0(esk41_0)
& sdtasdt0(xu,esk41_0) = xc ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2744])]) ).
fof(c_0_45,hypothesis,
! [X154,X155,X156] :
( aElementOf0(esk37_0,slsdtgt0(xa))
& aElementOf0(esk38_0,slsdtgt0(xb))
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X155,slsdtgt0(xa))
| ~ aElementOf0(X156,slsdtgt0(xb))
| sdtpldt0(X155,X156) != X154
| X154 = sz00
| ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X154,xI)
| X154 = sz00
| ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])])]) ).
cnf(c_0_46,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElementOf0(X1,xI)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_49,hypothesis,
sdtasdt0(xu,esk41_0) = xc,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,hypothesis,
aElement0(esk41_0),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,negated_conjecture,
~ aElementOf0(xc,xI),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG126+4 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n019.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 : 300
% 0.12/0.34 % DateTime : Sat May 18 12:05:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.77/0.58 # Version: 3.1.0
% 0.77/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.58 # Starting sh5l with 300s (1) cores
% 0.77/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 17917 completed with status 0
% 0.77/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.77/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.58 # No SInE strategy applied
% 0.77/0.58 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.77/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.58 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.77/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.77/0.58 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.77/0.58 # SAT001_MinMin_p005000_rr_RG with pid 17925 completed with status 0
% 0.77/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.77/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.58 # No SInE strategy applied
% 0.77/0.58 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.77/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.58 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.77/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.77/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.77/0.58 # Preprocessing time : 0.003 s
% 0.77/0.58 # Presaturation interreduction done
% 0.77/0.58
% 0.77/0.58 # Proof found!
% 0.77/0.58 # SZS status Theorem
% 0.77/0.58 # SZS output start CNFRefutation
% See solution above
% 0.77/0.58 # Parsed axioms : 48
% 0.77/0.58 # Removed by relevancy pruning/SinE : 0
% 0.77/0.58 # Initial clauses : 197
% 0.77/0.58 # Removed in clause preprocessing : 4
% 0.77/0.58 # Initial clauses in saturation : 193
% 0.77/0.58 # Processed clauses : 1524
% 0.77/0.58 # ...of these trivial : 49
% 0.77/0.58 # ...subsumed : 717
% 0.77/0.58 # ...remaining for further processing : 758
% 0.77/0.58 # Other redundant clauses eliminated : 230
% 0.77/0.58 # Clauses deleted for lack of memory : 0
% 0.77/0.58 # Backward-subsumed : 112
% 0.77/0.58 # Backward-rewritten : 39
% 0.77/0.58 # Generated clauses : 3474
% 0.77/0.58 # ...of the previous two non-redundant : 2610
% 0.77/0.58 # ...aggressively subsumed : 0
% 0.77/0.58 # Contextual simplify-reflections : 39
% 0.77/0.58 # Paramodulations : 3241
% 0.77/0.58 # Factorizations : 0
% 0.77/0.58 # NegExts : 0
% 0.77/0.58 # Equation resolutions : 230
% 0.77/0.58 # Disequality decompositions : 0
% 0.77/0.58 # Total rewrite steps : 3713
% 0.77/0.58 # ...of those cached : 3633
% 0.77/0.58 # Propositional unsat checks : 0
% 0.77/0.58 # Propositional check models : 0
% 0.77/0.58 # Propositional check unsatisfiable : 0
% 0.77/0.58 # Propositional clauses : 0
% 0.77/0.58 # Propositional clauses after purity: 0
% 0.77/0.58 # Propositional unsat core size : 0
% 0.77/0.58 # Propositional preprocessing time : 0.000
% 0.77/0.58 # Propositional encoding time : 0.000
% 0.77/0.58 # Propositional solver time : 0.000
% 0.77/0.58 # Success case prop preproc time : 0.000
% 0.77/0.58 # Success case prop encoding time : 0.000
% 0.77/0.58 # Success case prop solver time : 0.000
% 0.77/0.58 # Current number of processed clauses : 392
% 0.77/0.58 # Positive orientable unit clauses : 96
% 0.77/0.58 # Positive unorientable unit clauses: 0
% 0.77/0.58 # Negative unit clauses : 43
% 0.77/0.58 # Non-unit-clauses : 253
% 0.77/0.58 # Current number of unprocessed clauses: 1232
% 0.77/0.58 # ...number of literals in the above : 5518
% 0.77/0.58 # Current number of archived formulas : 0
% 0.77/0.58 # Current number of archived clauses : 344
% 0.77/0.58 # Clause-clause subsumption calls (NU) : 14604
% 0.77/0.58 # Rec. Clause-clause subsumption calls : 7314
% 0.77/0.58 # Non-unit clause-clause subsumptions : 339
% 0.77/0.58 # Unit Clause-clause subsumption calls : 2816
% 0.77/0.58 # Rewrite failures with RHS unbound : 0
% 0.77/0.58 # BW rewrite match attempts : 25
% 0.77/0.58 # BW rewrite match successes : 25
% 0.77/0.58 # Condensation attempts : 0
% 0.77/0.58 # Condensation successes : 0
% 0.77/0.58 # Termbank termtop insertions : 60326
% 0.77/0.58 # Search garbage collected termcells : 2803
% 0.77/0.58
% 0.77/0.58 # -------------------------------------------------
% 0.77/0.58 # User time : 0.090 s
% 0.77/0.58 # System time : 0.006 s
% 0.77/0.58 # Total time : 0.095 s
% 0.77/0.58 # Maximum resident set size: 2288 pages
% 0.77/0.58
% 0.77/0.58 # -------------------------------------------------
% 0.77/0.58 # User time : 0.390 s
% 0.77/0.58 # System time : 0.027 s
% 0.77/0.58 # Total time : 0.417 s
% 0.77/0.58 # Maximum resident set size: 1772 pages
% 0.77/0.58 % E---3.1 exiting
% 0.77/0.58 % E exiting
%------------------------------------------------------------------------------