%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG082+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:06:19 PM UTC 2026
% Result : Theorem 250.58s 42.19s
% Output : CNFRefutation 250.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 75 ( 30 unt; 0 def)
% Number of atoms : 163 ( 67 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 158 ( 70 ~; 64 |; 15 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtpldt0(smndt0(X1),X1)
& sdtpldt0(X1,smndt0(X1)) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddInvr) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAMDistr) ).
fof(m__444,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__444) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
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/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(m__,conjecture,
sdtasdt0(smndt0(sz10),xx) = smndt0(xx),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_13,plain,
! [X13] :
( ( ~ aElement0(X13)
| X13 = sdtasdt0(sz10,X13) )
& ( ~ aElement0(X13)
| sdtasdt0(X13,sz10) = X13 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
fof(c_0_14,plain,
! [X8,X9] :
( sdtasdt0(X8,X9) = sdtasdt0(X9,X8)
| ~ aElement0(X9)
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_15,plain,
! [X5] :
( ( ~ aElement0(X5)
| sz00 = sdtpldt0(smndt0(X5),X5) )
& ( ~ aElement0(X5)
| sdtpldt0(X5,smndt0(X5)) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
fof(c_0_16,plain,
! [X14,X15,X16] :
( ( ~ aElement0(X16)
| ~ aElement0(X15)
| ~ aElement0(X14)
| sdtasdt0(sdtpldt0(X15,X16),X14) = sdtpldt0(sdtasdt0(X15,X14),sdtasdt0(X16,X14)) )
& ( ~ aElement0(X16)
| ~ aElement0(X15)
| ~ aElement0(X14)
| sdtasdt0(X14,sdtpldt0(X15,X16)) = sdtpldt0(sdtasdt0(X14,X15),sdtasdt0(X14,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
cnf(c_0_17,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__444]) ).
cnf(c_0_19,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X25] :
( ( ~ aElement0(X25)
| X25 = sdtpldt0(sz00,X25) )
& ( ~ aElement0(X25)
| sdtpldt0(X25,sz00) = X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_21,plain,
! [X22,X23,X24] :
( sdtpldt0(sdtpldt0(X22,X23),X24) = sdtpldt0(X22,sdtpldt0(X23,X24))
| ~ aElement0(X24)
| ~ aElement0(X23)
| ~ aElement0(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
fof(c_0_22,plain,
! [X6,X7] :
( aElement0(sdtasdt0(X6,X7))
| ~ aElement0(X7)
| ~ aElement0(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_23,plain,
! [X4] :
( aElement0(smndt0(X4))
| ~ aElement0(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X1)
| sz00 = sdtpldt0(smndt0(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,hypothesis,
sdtasdt0(xx,sz10) = xx,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_28,hypothesis,
( ~ aElement0(X1)
| sdtasdt0(X1,xx) = sdtasdt0(xx,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_29,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_30,plain,
( ~ aElement0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,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_32,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,hypothesis,
sdtpldt0(smndt0(xx),xx) = sz00,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
fof(c_0_35,plain,
! [X20,X21] :
( sdtpldt0(X20,X21) = sdtpldt0(X21,X20)
| ~ aElement0(X21)
| ~ aElement0(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_36,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(xx,X1),xx) = sdtasdt0(xx,sdtpldt0(X1,sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_18])]) ).
cnf(c_0_37,hypothesis,
sdtasdt0(xx,sz00) = sdtasdt0(sz00,xx),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,plain,
sdtpldt0(sz00,sz10) = sz10,
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_39,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_40,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_41,plain,
( ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(sdtpldt0(X1,X2),sdtasdt0(X3,X4)) = sdtpldt0(X1,sdtpldt0(X2,sdtasdt0(X3,X4))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(X1),sz10) = smndt0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_43,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,smndt0(X1)) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_44,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(smndt0(xx))
| sdtpldt0(smndt0(xx),sdtpldt0(xx,X1)) = sdtpldt0(sz00,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_34]),c_0_18])]) ).
cnf(c_0_45,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,hypothesis,
sdtpldt0(sdtasdt0(sz00,xx),xx) = xx,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_37]),c_0_38]),c_0_26]) ).
cnf(c_0_47,hypothesis,
aElement0(sdtasdt0(sz00,xx)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_29]),c_0_18])]) ).
cnf(c_0_48,plain,
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(sdtasdt0(X1,X2),sz00) = sdtasdt0(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
fof(c_0_49,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(fof_simplification,[status(thm)],[c_0_40]) ).
cnf(c_0_50,hypothesis,
( ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1)
| sdtpldt0(sdtpldt0(X1,xx),sdtasdt0(X2,X3)) = sdtpldt0(X1,sdtpldt0(xx,sdtasdt0(X2,X3))) ),
inference(spm,[status(thm)],[c_0_41,c_0_18]) ).
cnf(c_0_51,hypothesis,
sdtasdt0(smndt0(xx),sz10) = smndt0(xx),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_52,hypothesis,
sdtpldt0(xx,smndt0(xx)) = sz00,
inference(spm,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_53,hypothesis,
( ~ aElement0(X1)
| sdtasdt0(smndt0(X1),xx) = sdtasdt0(xx,smndt0(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_54,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(smndt0(xx),sdtpldt0(xx,X1)) = sdtpldt0(sz00,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_18])]) ).
cnf(c_0_55,hypothesis,
sdtpldt0(xx,sdtasdt0(sz00,xx)) = xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_18]),c_0_47])]) ).
cnf(c_0_56,hypothesis,
sdtpldt0(sz00,sdtasdt0(sz00,xx)) = sdtasdt0(sz00,xx),
inference(spm,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_57,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(X1,xx),sz00) = sdtasdt0(X1,xx) ),
inference(spm,[status(thm)],[c_0_48,c_0_18]) ).
fof(c_0_58,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(fof_nnf,[status(thm)],[c_0_49]) ).
cnf(c_0_59,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(smndt0(xx))
| sdtpldt0(sdtpldt0(X1,xx),smndt0(xx)) = sdtpldt0(X1,sz00) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_27])]) ).
cnf(c_0_60,hypothesis,
sdtasdt0(smndt0(sz10),xx) = sdtasdt0(xx,smndt0(sz10)),
inference(spm,[status(thm)],[c_0_53,c_0_27]) ).
cnf(c_0_61,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(xx,smndt0(X1)),xx) = sdtasdt0(xx,sdtpldt0(smndt0(X1),sz10)) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_62,plain,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_63,hypothesis,
sdtasdt0(sz00,xx) = sz00,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_47]),c_0_55]),c_0_34]),c_0_56]) ).
cnf(c_0_64,plain,
( ~ aElement0(X1)
| sdtpldt0(sz00,smndt0(X1)) = smndt0(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_65,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(smndt0(X1),xx),sz00) = sdtasdt0(smndt0(X1),xx) ),
inference(spm,[status(thm)],[c_0_57,c_0_33]) ).
cnf(c_0_66,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_67,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(sdtpldt0(X1,xx),smndt0(xx)) = sdtpldt0(X1,sz00) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_33]),c_0_18])]) ).
cnf(c_0_68,hypothesis,
( ~ aElement0(smndt0(sz10))
| aElement0(sdtasdt0(xx,smndt0(sz10))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_60]),c_0_18])]) ).
cnf(c_0_69,hypothesis,
sdtpldt0(sdtasdt0(xx,smndt0(sz10)),xx) = sz00,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_27]),c_0_62]),c_0_37]),c_0_63]) ).
cnf(c_0_70,hypothesis,
sdtpldt0(sz00,smndt0(xx)) = smndt0(xx),
inference(spm,[status(thm)],[c_0_64,c_0_18]) ).
cnf(c_0_71,hypothesis,
sdtpldt0(sdtasdt0(xx,smndt0(sz10)),sz00) = sdtasdt0(xx,smndt0(sz10)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_27]),c_0_60]),c_0_60]) ).
cnf(c_0_72,negated_conjecture,
sdtasdt0(xx,smndt0(sz10)) != smndt0(xx),
inference(rw,[status(thm)],[c_0_66,c_0_60]) ).
cnf(c_0_73,hypothesis,
~ aElement0(smndt0(sz10)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71]),c_0_72]) ).
cnf(c_0_74,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_33]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : RNG082+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.73 % Computer : n012.cluster.edu
% 0.04/5.73 % Model : x86_64 x86_64
% 0.04/5.73 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.73 % Memory : 8046.5625MB
% 0.04/5.73 % OS : Linux 6.8.0-71-generic
% 0.04/5.73 % CPULimit : 300
% 0.04/5.73 % WCLimit : 300
% 0.04/5.73 % DateTime : Mon Sep 21 04:18:23 UTC 2026
% 0.04/5.73 % CPUTime :
% 0.04/5.73 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.76 Running first-order theorem proving
% 0.04/5.76 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 250.58/42.19 % Version: 3.5.1
% 250.58/42.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 250.58/42.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 250.58/42.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 250.58/42.19 % Starting new_bool_3 with 300s (1) cores
% 250.58/42.19 % Starting new_bool_1 with 300s (1) cores
% 250.58/42.19 % Starting sh5l with 300s (1) cores
% 250.58/42.19 % sh5l with pid 1545343 completed with status 0
% 250.58/42.19 % Result found by sh5l
% 250.58/42.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 250.58/42.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 250.58/42.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 250.58/42.19 % Starting new_bool_3 with 300s (1) cores
% 250.58/42.19 % Starting new_bool_1 with 300s (1) cores
% 250.58/42.19 % Starting sh5l with 300s (1) cores
% 250.58/42.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 250.58/42.19 % SinE strategy is gf500_gu_R04_F100_L20000
% 250.58/42.19 % Search class: FHUSF-FFSS21-SFFFFFNN
% 250.58/42.19 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 250.58/42.19 % Starting SubtermCWHack with 31s (1) cores
% 250.58/42.19 % SubtermCWHack with pid 1545350 completed with status 8
% 250.58/42.19 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 250.58/42.19 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 1546339 completed with status 0
% 250.58/42.19 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 250.58/42.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 250.58/42.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 250.58/42.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 250.58/42.19 % Starting new_bool_3 with 300s (1) cores
% 250.58/42.19 % Starting new_bool_1 with 300s (1) cores
% 250.58/42.19 % Starting sh5l with 300s (1) cores
% 250.58/42.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 250.58/42.19 % SinE strategy is gf500_gu_R04_F100_L20000
% 250.58/42.19 % Search class: FHUSF-FFSS21-SFFFFFNN
% 250.58/42.19 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 250.58/42.19 % Starting SubtermCWHack with 31s (1) cores
% 250.58/42.19 % SubtermCWHack with pid 1545350 completed with status 8
% 250.58/42.19 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 250.58/42.19 % Preprocessing time : 0.001 s
% 250.58/42.19 % Presaturation interreduction done
% 250.58/42.19
% 250.58/42.19 % Proof found!
% 250.58/42.19 % SZS status Theorem
% 250.58/42.19 % SZS output start CNFRefutation
% See solution above
% 250.58/42.19 % Parsed axioms : 16
% 250.58/42.19 % Removed by relevancy pruning/SinE : 0
% 250.58/42.19 % Initial clauses : 20
% 250.58/42.19 % Removed in clause preprocessing : 1
% 250.58/42.19 % Initial clauses in saturation : 19
% 250.58/42.19 % Processed clauses : 13586
% 250.58/42.19 % ...of these trivial : 2487
% 250.58/42.19 % ...subsumed : 6479
% 250.58/42.19 % ...remaining for further processing : 4620
% 250.58/42.19 % Other redundant clauses eliminated : 0
% 250.58/42.19 % Clauses deleted for lack of memory : 0
% 250.58/42.19 % Backward-subsumed : 341
% 250.58/42.19 % Backward-rewritten : 716
% 250.58/42.19 % Generated clauses : 496699
% 250.58/42.19 % ...of the previous two non-redundant : 421985
% 250.58/42.19 % ...aggressively subsumed : 0
% 250.58/42.19 % Contextual simplify-reflections : 38
% 250.58/42.19 % Paramodulations : 496699
% 250.58/42.19 % Factorizations : 0
% 250.58/42.19 % NegExts : 0
% 250.58/42.19 % Equation resolutions : 0
% 250.58/42.19 % Disequality decompositions : 0
% 250.58/42.19 % Total rewrite steps : 662919
% 250.58/42.19 % ...of those cached : 661804
% 250.58/42.19 % Propositional unsat checks : 0
% 250.58/42.19 % Propositional check models : 0
% 250.58/42.19 % Propositional check unsatisfiable : 0
% 250.58/42.19 % Propositional clauses : 0
% 250.58/42.19 % Propositional clauses after purity: 0
% 250.58/42.19 % Propositional unsat core size : 0
% 250.58/42.19 % Propositional preprocessing time : 0.000
% 250.58/42.19 % Propositional encoding time : 0.000
% 250.58/42.19 % Propositional solver time : 0.000
% 250.58/42.19 % Success case prop preproc time : 0.000
% 250.58/42.19 % Success case prop encoding time : 0.000
% 250.58/42.19 % Success case prop solver time : 0.000
% 250.58/42.19 % Current number of processed clauses : 3544
% 250.58/42.19 % Positive orientable unit clauses : 984
% 250.58/42.19 % Positive unorientable unit clauses: 0
% 250.58/42.19 % Negative unit clauses : 2
% 250.58/42.19 % Non-unit-clauses : 2558
% 250.58/42.19 % Current number of unprocessed clauses: 406937
% 250.58/42.19 % ...number of literals in the above : 1288475
% 250.58/42.19 % Current number of archived formulas : 0
% 250.58/42.19 % Current number of archived clauses : 1076
% 250.58/42.19 % Clause-clause subsumption calls (NU) : 438398
% 250.58/42.19 % Rec. Clause-clause subsumption calls : 420115
% 250.58/42.19 % Non-unit clause-clause subsumptions : 6611
% 250.58/42.19 % Unit Clause-clause subsumption calls : 9516
% 250.58/42.19 % Rewrite failures with RHS unbound : 0
% 250.58/42.19 % BW rewrite match attempts : 4965
% 250.58/42.19 % BW rewrite match successes : 426
% 250.58/42.19 % Condensation attempts : 0
% 250.58/42.19 % Condensation successes : 0
% 250.58/42.19 % Termbank termtop insertions : 13887099
% 250.58/42.19 % Search garbage collected termcells : 191
% 250.58/42.19
% 250.58/42.19 % -------------------------------------------------
% 250.58/42.19 % User time : 34.412 s
% 250.58/42.19 % System time : 1.245 s
% 250.58/42.19 % Total time : 35.658 s
% 250.58/42.19 % Maximum resident set size: 3640 pages
% 250.58/42.19
% 250.58/42.19 % -------------------------------------------------
% 250.58/42.19 % User time : 34.415 s
% 250.58/42.19 % System time : 1.248 s
% 250.58/42.19 % Total time : 35.663 s
% 250.58/42.19 % Maximum resident set size: 4608 pages
% 250.58/42.19 % E exiting
%------------------------------------------------------------------------------