%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG112+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:05:54 PM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 308 ( 119 equ)
% Maximal formula atoms : 68 ( 11 avg)
% Number of connectives : 411 ( 131 ~; 142 |; 121 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 10 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 43 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2228,hypothesis,
? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( sdtasdt0(xb,X3) = X2
& aElement0(X3) ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( sdtasdt0(xa,X3) = X2
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2228) ).
fof(m__,conjecture,
? [X1] :
( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI)
& ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) )
& X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2351,hypothesis,
! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ? [X2] :
( ! [X3] :
( ( X3 != sz00
& ( aElementOf0(X3,xI)
| ? [X4,X5] :
( sdtpldt0(X4,X5) = X3
& aElementOf0(X5,slsdtgt0(xb))
& aElementOf0(X4,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) )
& X2 != sz00
& aElementOf0(X2,xI)
& ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2351) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) )
& ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(c_0_4,hypothesis,
? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( sdtasdt0(xb,X3) = X2
& aElement0(X3) ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( sdtasdt0(xa,X3) = X2
& aElement0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[m__2228]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI)
& ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) )
& X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ? [X2] :
( ! [X3] :
( ( X3 != sz00
& ( aElementOf0(X3,xI)
| ? [X4,X5] :
( sdtpldt0(X4,X5) = X3
& aElementOf0(X5,slsdtgt0(xb))
& aElementOf0(X4,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) )
& X2 != sz00
& aElementOf0(X2,xI)
& ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ) ),
inference(fof_simplification,[status(thm)],[m__2351]) ).
fof(c_0_7,hypothesis,
! [X144,X146,X147,X149] :
( esk32_0 != sz00
& aElementOf0(esk32_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& sdtpldt0(esk35_0,esk36_0) = esk32_0
& aElementOf0(esk36_0,slsdtgt0(xb))
& aElementOf0(esk35_0,slsdtgt0(xa))
& ( aElementOf0(X147,slsdtgt0(xb))
| sdtasdt0(xb,X149) != X147
| ~ aElement0(X149) )
& ( ~ aElementOf0(X147,slsdtgt0(xb))
| sdtasdt0(xb,esk34_1(X147)) = X147 )
& ( ~ aElementOf0(X147,slsdtgt0(xb))
| aElement0(esk34_1(X147)) )
& ( aElementOf0(X144,slsdtgt0(xa))
| sdtasdt0(xa,X146) != X144
| ~ aElement0(X146) )
& ( ~ aElementOf0(X144,slsdtgt0(xa))
| sdtasdt0(xa,esk33_1(X144)) = X144 )
& ( ~ aElementOf0(X144,slsdtgt0(xa))
| aElement0(esk33_1(X144)) ) ),
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_4])])])])])]) ).
fof(c_0_8,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X136,xI)
| sdtpldt0(X137,X138) != X136
| ~ aElementOf0(X138,slsdtgt0(xb))
| ~ aElementOf0(X137,slsdtgt0(xa)) )
& ( ~ aElementOf0(X133,xI)
| sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133 )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk27_1(X133),slsdtgt0(xb)) )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk26_1(X133),slsdtgt0(xa)) )
& ( aElementOf0(X131,slsdtgt0(xb))
| sdtasdt0(xb,X132) != X131
| ~ aElement0(X132) )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| sdtasdt0(xb,esk25_1(X129)) = X129 )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| aElement0(esk25_1(X129)) )
& ( aElementOf0(X127,slsdtgt0(xa))
| sdtasdt0(xa,X128) != X127
| ~ aElement0(X128) )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| sdtasdt0(xa,esk24_1(X125)) = X125 )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| aElement0(esk24_1(X125)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElement0(X124) )
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X123,xI) )
& aSet0(xI) ),
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_9,negated_conjecture,
~ ? [X1] :
( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI)
& ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) )
& X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_10,hypothesis,
! [X152,X153,X154,X158,X159,X160] :
( ( X152 = sz00
| ~ aElementOf0(X152,xI)
| ~ iLess0(sbrdtbr0(X158),sbrdtbr0(esk37_0))
| X158 = sz00
| ~ aElementOf0(X158,xI) )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| ~ iLess0(sbrdtbr0(X158),sbrdtbr0(esk37_0))
| X158 = sz00
| sdtpldt0(X159,X160) != X158
| ~ aElementOf0(X160,slsdtgt0(xb))
| ~ aElementOf0(X159,slsdtgt0(xa)) )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| esk37_0 != sz00 )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| aElementOf0(esk37_0,xI) )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| sdtpldt0(esk38_0,esk39_0) = esk37_0 )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| aElementOf0(esk39_0,slsdtgt0(xb)) )
& ( X152 = sz00
| ~ aElementOf0(X152,xI)
| aElementOf0(esk38_0,slsdtgt0(xa)) )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| ~ iLess0(sbrdtbr0(X158),sbrdtbr0(esk37_0))
| X158 = sz00
| ~ aElementOf0(X158,xI) )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| ~ iLess0(sbrdtbr0(X158),sbrdtbr0(esk37_0))
| X158 = sz00
| sdtpldt0(X159,X160) != X158
| ~ aElementOf0(X160,slsdtgt0(xb))
| ~ aElementOf0(X159,slsdtgt0(xa)) )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| esk37_0 != sz00 )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| aElementOf0(esk37_0,xI) )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| sdtpldt0(esk38_0,esk39_0) = esk37_0 )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| aElementOf0(esk39_0,slsdtgt0(xb)) )
& ( X152 = sz00
| sdtpldt0(X153,X154) != X152
| ~ aElementOf0(X154,slsdtgt0(xb))
| ~ aElementOf0(X153,slsdtgt0(xa))
| aElementOf0(esk38_0,slsdtgt0(xa)) ) ),
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_6])])])])])])]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk32_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
! [X161,X162,X163] :
( ( X161 = sz00
| ~ aElementOf0(X161,xI)
| iLess0(sbrdtbr0(esk40_1(X161)),sbrdtbr0(X161)) )
& ( X161 = sz00
| ~ aElementOf0(X161,xI)
| esk40_1(X161) != sz00 )
& ( X161 = sz00
| ~ aElementOf0(X161,xI)
| aElementOf0(esk40_1(X161),xI) )
& ( X161 = sz00
| ~ aElementOf0(X161,xI)
| sdtpldt0(esk41_1(X161),esk42_1(X161)) = esk40_1(X161) )
& ( X161 = sz00
| ~ aElementOf0(X161,xI)
| aElementOf0(esk42_1(X161),slsdtgt0(xb)) )
& ( X161 = sz00
| ~ aElementOf0(X161,xI)
| aElementOf0(esk41_1(X161),slsdtgt0(xa)) )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| iLess0(sbrdtbr0(esk40_1(X161)),sbrdtbr0(X161)) )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| esk40_1(X161) != sz00 )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| aElementOf0(esk40_1(X161),xI) )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| sdtpldt0(esk41_1(X161),esk42_1(X161)) = esk40_1(X161) )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| aElementOf0(esk42_1(X161),slsdtgt0(xb)) )
& ( X161 = sz00
| sdtpldt0(X162,X163) != X161
| ~ aElementOf0(X163,slsdtgt0(xb))
| ~ aElementOf0(X162,slsdtgt0(xa))
| aElementOf0(esk41_1(X161),slsdtgt0(xa)) ) ),
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_9])])])])])]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| aElementOf0(esk37_0,xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aElementOf0(esk32_0,xI),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
esk32_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X1,xI)
| esk37_0 != sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk37_0))
| ~ aElementOf0(X1,xI)
| X2 = sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| iLess0(sbrdtbr0(esk40_1(X1)),sbrdtbr0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
aElementOf0(esk37_0,xI),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,hypothesis,
esk37_0 != sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(esk40_1(esk37_0),xI)
| X1 = sz00
| esk40_1(esk37_0) = sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| aElementOf0(esk40_1(X1),xI) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| esk40_1(esk37_0) = sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20])]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElementOf0(X1,xI)
| esk40_1(X1) != sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,hypothesis,
esk40_1(esk37_0) = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG112+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:21:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.48 % Version: 3.5.1
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1989858 completed with status 0
% 0.14/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.48 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.14/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1989871 completed with status 0
% 0.14/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.48 % Preprocessing time : 0.004 s
% 0.14/0.48 % Presaturation interreduction done
% 0.14/0.48
% 0.14/0.48 % Proof found!
% 0.14/0.48 % SZS status Theorem
% 0.14/0.48 % SZS output start CNFRefutation
% See solution above
% 0.14/0.48 % Parsed axioms : 46
% 0.14/0.48 % Removed by relevancy pruning/SinE : 0
% 0.14/0.48 % Initial clauses : 198
% 0.14/0.48 % Removed in clause preprocessing : 4
% 0.14/0.48 % Initial clauses in saturation : 194
% 0.14/0.48 % Processed clauses : 394
% 0.14/0.48 % ...of these trivial : 4
% 0.14/0.48 % ...subsumed : 8
% 0.14/0.48 % ...remaining for further processing : 382
% 0.14/0.48 % Other redundant clauses eliminated : 46
% 0.14/0.48 % Clauses deleted for lack of memory : 0
% 0.14/0.48 % Backward-subsumed : 4
% 0.14/0.48 % Backward-rewritten : 11
% 0.14/0.48 % Generated clauses : 318
% 0.14/0.48 % ...of the previous two non-redundant : 196
% 0.14/0.48 % ...aggressively subsumed : 0
% 0.14/0.48 % Contextual simplify-reflections : 1
% 0.14/0.48 % Paramodulations : 275
% 0.14/0.48 % Factorizations : 0
% 0.14/0.48 % NegExts : 0
% 0.14/0.48 % Equation resolutions : 46
% 0.14/0.48 % Disequality decompositions : 0
% 0.14/0.48 % Total rewrite steps : 292
% 0.14/0.48 % ...of those cached : 248
% 0.14/0.48 % Propositional unsat checks : 0
% 0.14/0.48 % Propositional check models : 0
% 0.14/0.48 % Propositional check unsatisfiable : 0
% 0.14/0.48 % Propositional clauses : 0
% 0.14/0.48 % Propositional clauses after purity: 0
% 0.14/0.48 % Propositional unsat core size : 0
% 0.14/0.48 % Propositional preprocessing time : 0.000
% 0.14/0.48 % Propositional encoding time : 0.000
% 0.14/0.48 % Propositional solver time : 0.000
% 0.14/0.48 % Success case prop preproc time : 0.000
% 0.14/0.48 % Success case prop encoding time : 0.000
% 0.14/0.48 % Success case prop solver time : 0.000
% 0.14/0.48 % Current number of processed clauses : 143
% 0.14/0.48 % Positive orientable unit clauses : 55
% 0.14/0.48 % Positive unorientable unit clauses: 0
% 0.14/0.48 % Negative unit clauses : 3
% 0.14/0.48 % Non-unit-clauses : 85
% 0.14/0.48 % Current number of unprocessed clauses: 175
% 0.14/0.48 % ...number of literals in the above : 702
% 0.14/0.48 % Current number of archived formulas : 0
% 0.14/0.48 % Current number of archived clauses : 206
% 0.14/0.48 % Clause-clause subsumption calls (NU) : 5246
% 0.14/0.48 % Rec. Clause-clause subsumption calls : 1611
% 0.14/0.48 % Non-unit clause-clause subsumptions : 11
% 0.14/0.48 % Unit Clause-clause subsumption calls : 121
% 0.14/0.48 % Rewrite failures with RHS unbound : 0
% 0.14/0.48 % BW rewrite match attempts : 11
% 0.14/0.48 % BW rewrite match successes : 11
% 0.14/0.48 % Condensation attempts : 0
% 0.14/0.48 % Condensation successes : 0
% 0.14/0.48 % Termbank termtop insertions : 18250
% 0.14/0.48 % Search garbage collected termcells : 2813
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.036 s
% 0.14/0.48 % System time : 0.009 s
% 0.14/0.48 % Total time : 0.045 s
% 0.14/0.48 % Maximum resident set size: 3712 pages
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.152 s
% 0.14/0.48 % System time : 0.027 s
% 0.14/0.48 % Total time : 0.179 s
% 0.14/0.48 % Maximum resident set size: 4608 pages
% 0.14/0.48 % E exiting
%------------------------------------------------------------------------------