%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG122+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 : n007.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:56 PM UTC 2026
% Result : Theorem 0.70s 0.55s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 51 ( 20 unt; 0 def)
% Number of atoms : 187 ( 57 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 204 ( 68 ~; 56 |; 65 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 11 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 46 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2690,hypothesis,
( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2690) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
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(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__2666,hypothesis,
( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 )
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& aElement0(xr)
& aElement0(xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2666) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtpldt0(smndt0(X1),X1)
& sdtpldt0(X1,smndt0(X1)) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddInvr) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_12,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_13,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_14,hypothesis,
( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& sdtpldt0(esk42_0,esk43_0) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(esk43_0,slsdtgt0(xb))
& aElementOf0(esk42_0,slsdtgt0(xa)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2690])]) ).
fof(c_0_15,plain,
! [X13,X14] :
( sdtpldt0(X13,X14) = sdtpldt0(X14,X13)
| ~ aElement0(X14)
| ~ aElement0(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
fof(c_0_16,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_18,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
sdtpldt0(esk42_0,esk43_0) = smndt0(sdtasdt0(xq,xu)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,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_21,plain,
! [X15,X16,X17] :
( sdtpldt0(sdtpldt0(X15,X16),X17) = sdtpldt0(X15,sdtpldt0(X16,X17))
| ~ aElement0(X17)
| ~ aElement0(X16)
| ~ aElement0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
cnf(c_0_22,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_23,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
aElement0(xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_25,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,hypothesis,
aElementOf0(sdtpldt0(esk42_0,esk43_0),xI),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,hypothesis,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sdtasdt0(xq,xu)) = xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
fof(c_0_31,plain,
! [X19] :
( ( ~ aElement0(X19)
| sz00 = sdtpldt0(smndt0(X19),X19) )
& ( ~ aElement0(X19)
| sdtpldt0(X19,smndt0(X19)) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
cnf(c_0_32,negated_conjecture,
sdtpldt0(sdtpldt0(esk42_0,esk43_0),xb) != xr,
inference(rw,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_33,hypothesis,
aElement0(sdtpldt0(esk42_0,esk43_0)),
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,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_35,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sdtpldt0(sdtasdt0(xq,xu),X1)) = sdtpldt0(xb,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]) ).
cnf(c_0_36,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,smndt0(X1)) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_37,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_38,negated_conjecture,
sdtpldt0(xb,sdtpldt0(esk42_0,esk43_0)) != xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_33]),c_0_34])]) ).
cnf(c_0_39,hypothesis,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xb,sdtpldt0(esk42_0,esk43_0)) = sdtpldt0(xr,sz00) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_19]),c_0_19]),c_0_33])]) ).
fof(c_0_40,plain,
! [X18] :
( ( ~ aElement0(X18)
| X18 = sdtpldt0(sz00,X18) )
& ( ~ aElement0(X18)
| sdtpldt0(X18,sz00) = X18 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_41,hypothesis,
! [X154,X155,X156] :
( ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| ~ aElementOf0(X154,xI) )
& ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| sdtpldt0(X155,X156) != X154
| ~ aElementOf0(X156,slsdtgt0(xb))
| ~ aElementOf0(X155,slsdtgt0(xa)) )
& xu != sz00
& aElementOf0(xu,xI)
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(esk38_0,slsdtgt0(xb))
& aElementOf0(esk37_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(fof_nnf,[status(thm)],[c_0_37])])])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sz00) != xr ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_44,plain,
! [X11,X12] :
( aElement0(sdtasdt0(X11,X12))
| ~ aElement0(X12)
| ~ aElement0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_45,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24])]) ).
cnf(c_0_47,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_28])]) ).
cnf(c_0_49,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_50,negated_conjecture,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG122+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:19:50 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.70/0.55 % Version: 3.5.1
% 0.70/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.70/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.70/0.55 % Starting sh5l with 300s (1) cores
% 0.70/0.55 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 159880 completed with status 0
% 0.70/0.55 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.70/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.70/0.55 % No SInE strategy applied
% 0.70/0.55 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.70/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.70/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.70/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.70/0.55 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.70/0.55 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.70/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 159888 completed with status 0
% 0.70/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.70/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.70/0.55 % No SInE strategy applied
% 0.70/0.55 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.70/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.70/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.70/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.70/0.55 % Preprocessing time : 0.004 s
% 0.70/0.55 % Presaturation interreduction done
% 0.70/0.55
% 0.70/0.55 % Proof found!
% 0.70/0.55 % SZS status Theorem
% 0.70/0.55 % SZS output start CNFRefutation
% See solution above
% 0.70/0.55 % Parsed axioms : 54
% 0.70/0.55 % Removed by relevancy pruning/SinE : 0
% 0.70/0.55 % Initial clauses : 210
% 0.70/0.55 % Removed in clause preprocessing : 4
% 0.70/0.55 % Initial clauses in saturation : 206
% 0.70/0.55 % Processed clauses : 1390
% 0.70/0.55 % ...of these trivial : 22
% 0.70/0.55 % ...subsumed : 578
% 0.70/0.55 % ...remaining for further processing : 790
% 0.70/0.55 % Other redundant clauses eliminated : 164
% 0.70/0.55 % Clauses deleted for lack of memory : 0
% 0.70/0.55 % Backward-subsumed : 47
% 0.70/0.55 % Backward-rewritten : 27
% 0.70/0.55 % Generated clauses : 4338
% 0.70/0.55 % ...of the previous two non-redundant : 3555
% 0.70/0.55 % ...aggressively subsumed : 0
% 0.70/0.55 % Contextual simplify-reflections : 22
% 0.70/0.55 % Paramodulations : 4176
% 0.70/0.55 % Factorizations : 0
% 0.70/0.55 % NegExts : 0
% 0.70/0.55 % Equation resolutions : 164
% 0.70/0.55 % Disequality decompositions : 0
% 0.70/0.55 % Total rewrite steps : 4278
% 0.70/0.55 % ...of those cached : 4191
% 0.70/0.55 % Propositional unsat checks : 0
% 0.70/0.55 % Propositional check models : 0
% 0.70/0.55 % Propositional check unsatisfiable : 0
% 0.70/0.55 % Propositional clauses : 0
% 0.70/0.55 % Propositional clauses after purity: 0
% 0.70/0.55 % Propositional unsat core size : 0
% 0.70/0.55 % Propositional preprocessing time : 0.000
% 0.70/0.55 % Propositional encoding time : 0.000
% 0.70/0.55 % Propositional solver time : 0.000
% 0.70/0.55 % Success case prop preproc time : 0.000
% 0.70/0.55 % Success case prop encoding time : 0.000
% 0.70/0.55 % Success case prop solver time : 0.000
% 0.70/0.55 % Current number of processed clauses : 501
% 0.70/0.55 % Positive orientable unit clauses : 111
% 0.70/0.55 % Positive unorientable unit clauses: 0
% 0.70/0.55 % Negative unit clauses : 60
% 0.70/0.55 % Non-unit-clauses : 330
% 0.70/0.55 % Current number of unprocessed clauses: 2468
% 0.70/0.55 % ...number of literals in the above : 10429
% 0.70/0.55 % Current number of archived formulas : 0
% 0.70/0.55 % Current number of archived clauses : 269
% 0.70/0.55 % Clause-clause subsumption calls (NU) : 13597
% 0.70/0.55 % Rec. Clause-clause subsumption calls : 5227
% 0.70/0.55 % Non-unit clause-clause subsumptions : 347
% 0.70/0.55 % Unit Clause-clause subsumption calls : 2330
% 0.70/0.55 % Rewrite failures with RHS unbound : 0
% 0.70/0.55 % BW rewrite match attempts : 23
% 0.70/0.55 % BW rewrite match successes : 23
% 0.70/0.55 % Condensation attempts : 0
% 0.70/0.55 % Condensation successes : 0
% 0.70/0.55 % Termbank termtop insertions : 80163
% 0.70/0.55 % Search garbage collected termcells : 2680
% 0.70/0.55
% 0.70/0.55 % -------------------------------------------------
% 0.70/0.55 % User time : 0.120 s
% 0.70/0.55 % System time : 0.010 s
% 0.70/0.55 % Total time : 0.131 s
% 0.70/0.55 % Maximum resident set size: 3976 pages
% 0.70/0.55
% 0.70/0.55 % -------------------------------------------------
% 0.70/0.55 % User time : 0.501 s
% 0.70/0.55 % System time : 0.041 s
% 0.70/0.55 % Total time : 0.542 s
% 0.70/0.55 % Maximum resident set size: 4608 pages
% 0.70/0.55 % E exiting
%------------------------------------------------------------------------------