%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG097+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 : n014.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:50 PM UTC 2026
% Result : Theorem 19.31s 3.40s
% Output : CNFRefutation 19.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 30 unt; 0 def)
% Number of atoms : 159 ( 36 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 153 ( 60 ~; 59 |; 22 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) )
& ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) ) ) )
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1205,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205) ).
fof(m__1294,hypothesis,
( sdtpldt0(xa,xb) = sz10
& aElementOf0(xb,xJ)
& aElementOf0(xa,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1294) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
& sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulMnOne) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
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(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtpldt0(smndt0(X1),X1)
& sdtpldt0(X1,smndt0(X1)) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddInvr) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(m__,conjecture,
aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1217,hypothesis,
( aElement0(xy)
& aElement0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1217) ).
fof(c_0_13,plain,
! [X62,X63,X64,X65,X66] :
( ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk9_1(X66),X66) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElement0(X65) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X64,X62) )
& ( ~ aIdeal0(X62)
| aSet0(X62) ) ),
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)],[mDefIdeal])])])])])])]) ).
fof(c_0_14,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_15,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_17,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_18,plain,
( ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xa,xI),
inference(split_conjunct,[status(thm)],[m__1294]) ).
fof(c_0_20,plain,
! [X29] :
( ( ~ aElement0(X29)
| smndt0(X29) = sdtasdt0(X29,smndt0(sz10)) )
& ( ~ aElement0(X29)
| sdtasdt0(smndt0(sz10),X29) = smndt0(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,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])])]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xb,xJ),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_25,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_26,hypothesis,
( ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,xa),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_27,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,hypothesis,
aElement0(xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_22])]) ).
fof(c_0_29,plain,
! [X8] :
( aElement0(smndt0(X8))
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
fof(c_0_30,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])])]) ).
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,hypothesis,
sdtpldt0(xa,xb) = sz10,
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_33,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,hypothesis,
aElement0(xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_25])]) ).
cnf(c_0_35,hypothesis,
( ~ aElement0(smndt0(sz10))
| aElementOf0(smndt0(xa),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_36,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_38,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( ~ aElement0(X1)
| sz00 = sdtpldt0(smndt0(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,hypothesis,
sdtpldt0(xb,xa) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]),c_0_34])]) ).
cnf(c_0_41,hypothesis,
aElementOf0(smndt0(xa),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,plain,
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]) ).
cnf(c_0_43,hypothesis,
( ~ aElement0(X1)
| sdtpldt0(xb,sdtpldt0(xa,X1)) = sdtpldt0(sz10,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_28]),c_0_34])]) ).
cnf(c_0_44,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,smndt0(X1)) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,hypothesis,
aElement0(smndt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_41]),c_0_22])]) ).
fof(c_0_46,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])])])]) ).
cnf(c_0_47,hypothesis,
sdtpldt0(smndt0(xa),sz10) = sdtpldt0(sz00,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_34]),c_0_28])]) ).
cnf(c_0_48,hypothesis,
sdtpldt0(sz10,smndt0(xa)) = sdtpldt0(xb,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_28])]) ).
cnf(c_0_49,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,hypothesis,
sdtpldt0(xb,sz00) = sdtpldt0(sz00,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_47]),c_0_48]),c_0_37]),c_0_45])]) ).
cnf(c_0_51,hypothesis,
sdtpldt0(sz00,xb) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]) ).
fof(c_0_52,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_53,hypothesis,
sdtpldt0(sz10,smndt0(xa)) = xb,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_50]),c_0_51]) ).
fof(c_0_54,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),
inference(fof_simplification,[status(thm)],[c_0_52]) ).
cnf(c_0_55,hypothesis,
sdtpldt0(smndt0(sz10),xb) = sdtpldt0(sz00,smndt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_53]),c_0_45]),c_0_37])]) ).
fof(c_0_56,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),
inference(fof_nnf,[status(thm)],[c_0_54]) ).
cnf(c_0_57,hypothesis,
( ~ aElement0(smndt0(sz10))
| sdtpldt0(xb,smndt0(sz10)) = sdtpldt0(sz00,smndt0(xa)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_55]),c_0_34])]) ).
cnf(c_0_58,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_59,hypothesis,
sdtpldt0(xb,smndt0(sz10)) = sdtpldt0(sz00,smndt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_36]),c_0_37])]) ).
cnf(c_0_60,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,sdtpldt0(sz00,smndt0(xa))),xI),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( ~ aElement0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_62,negated_conjecture,
~ aElementOf0(sdtasdt0(xx,smndt0(xa)),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_45])]) ).
cnf(c_0_63,hypothesis,
( ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,smndt0(xa)),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_41]),c_0_16])]) ).
cnf(c_0_64,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG097+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 % Computer : n014.cluster.edu
% 0.15/0.45 % Model : x86_64 x86_64
% 0.15/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.45 % Memory : 8046.5625MB
% 0.15/0.45 % OS : Linux 6.8.0-71-generic
% 0.15/0.45 % CPULimit : 300
% 0.15/0.45 % WCLimit : 300
% 0.15/0.45 % DateTime : Mon Sep 21 04:19:20 UTC 2026
% 0.15/0.45 % CPUTime :
% 0.15/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.53 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
% 19.31/3.40 % Version: 3.5.1
% 19.31/3.40 % Preprocessing class: FSMSSMSMSSSNFFN.
% 19.31/3.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 19.31/3.40 % Starting new_bool_3 with 300s (1) cores
% 19.31/3.40 % Starting new_bool_1 with 300s (1) cores
% 19.31/3.40 % Starting sh5l with 300s (1) cores
% 19.31/3.40 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3122378 completed with status 0
% 19.31/3.40 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 19.31/3.40 % Preprocessing class: FSMSSMSMSSSNFFN.
% 19.31/3.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 19.31/3.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.31/3.40 % No SInE strategy applied
% 19.31/3.40 % Search class: FGUSF-FFMM32-MFFFFFNN
% 19.31/3.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.31/3.40 % Starting SubtermCWHack with 136s (1) cores
% 19.31/3.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 19.31/3.40 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 19.31/3.40 % Starting new_bool_3 with 136s (1) cores
% 19.31/3.40 % Starting new_bool_1 with 136s (1) cores
% 19.31/3.40 % new_bool_1 with pid 3122388 completed with status 0
% 19.31/3.40 % Result found by new_bool_1
% 19.31/3.40 % Preprocessing class: FSMSSMSMSSSNFFN.
% 19.31/3.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 19.31/3.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.31/3.40 % No SInE strategy applied
% 19.31/3.40 % Search class: FGUSF-FFMM32-MFFFFFNN
% 19.31/3.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.31/3.40 % Starting SubtermCWHack with 136s (1) cores
% 19.31/3.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 19.31/3.40 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 19.31/3.40 % Starting new_bool_3 with 136s (1) cores
% 19.31/3.40 % Starting new_bool_1 with 136s (1) cores
% 19.31/3.40 % Preprocessing time : 0.003 s
% 19.31/3.40 % Presaturation interreduction done
% 19.31/3.40
% 19.31/3.40 % Proof found!
% 19.31/3.40 % SZS status Theorem
% 19.31/3.40 % SZS output start CNFRefutation
% See solution above
% 19.31/3.40 % Parsed axioms : 34
% 19.31/3.40 % Removed by relevancy pruning/SinE : 0
% 19.31/3.40 % Initial clauses : 69
% 19.31/3.40 % Removed in clause preprocessing : 2
% 19.31/3.40 % Initial clauses in saturation : 67
% 19.31/3.40 % Processed clauses : 5363
% 19.31/3.40 % ...of these trivial : 1229
% 19.31/3.40 % ...subsumed : 1813
% 19.31/3.40 % ...remaining for further processing : 2321
% 19.31/3.40 % Other redundant clauses eliminated : 28
% 19.31/3.40 % Clauses deleted for lack of memory : 0
% 19.31/3.40 % Backward-subsumed : 19
% 19.31/3.40 % Backward-rewritten : 489
% 19.31/3.40 % Generated clauses : 82448
% 19.31/3.40 % ...of the previous two non-redundant : 68004
% 19.31/3.40 % ...aggressively subsumed : 0
% 19.31/3.40 % Contextual simplify-reflections : 184
% 19.31/3.40 % Paramodulations : 82400
% 19.31/3.40 % Factorizations : 20
% 19.31/3.40 % NegExts : 0
% 19.31/3.40 % Equation resolutions : 29
% 19.31/3.40 % Disequality decompositions : 0
% 19.31/3.40 % Total rewrite steps : 111512
% 19.31/3.40 % ...of those cached : 110382
% 19.31/3.40 % Propositional unsat checks : 0
% 19.31/3.40 % Propositional check models : 0
% 19.31/3.40 % Propositional check unsatisfiable : 0
% 19.31/3.40 % Propositional clauses : 0
% 19.31/3.40 % Propositional clauses after purity: 0
% 19.31/3.40 % Propositional unsat core size : 0
% 19.31/3.40 % Propositional preprocessing time : 0.000
% 19.31/3.40 % Propositional encoding time : 0.000
% 19.31/3.40 % Propositional solver time : 0.000
% 19.31/3.40 % Success case prop preproc time : 0.000
% 19.31/3.40 % Success case prop encoding time : 0.000
% 19.31/3.40 % Success case prop solver time : 0.000
% 19.31/3.40 % Current number of processed clauses : 1737
% 19.31/3.40 % Positive orientable unit clauses : 1037
% 19.31/3.40 % Positive unorientable unit clauses: 0
% 19.31/3.40 % Negative unit clauses : 5
% 19.31/3.40 % Non-unit-clauses : 695
% 19.31/3.40 % Current number of unprocessed clauses: 62122
% 19.31/3.40 % ...number of literals in the above : 279536
% 19.31/3.40 % Current number of archived formulas : 0
% 19.31/3.40 % Current number of archived clauses : 575
% 19.31/3.40 % Clause-clause subsumption calls (NU) : 73022
% 19.31/3.40 % Rec. Clause-clause subsumption calls : 46962
% 19.31/3.40 % Non-unit clause-clause subsumptions : 2011
% 19.31/3.40 % Unit Clause-clause subsumption calls : 6858
% 19.31/3.40 % Rewrite failures with RHS unbound : 0
% 19.31/3.40 % BW rewrite match attempts : 7967
% 19.31/3.40 % BW rewrite match successes : 229
% 19.31/3.40 % Condensation attempts : 0
% 19.31/3.40 % Condensation successes : 0
% 19.31/3.40 % Termbank termtop insertions : 2093250
% 19.31/3.40 % Search garbage collected termcells : 1100
% 19.31/3.40
% 19.31/3.40 % -------------------------------------------------
% 19.31/3.40 % User time : 2.628 s
% 19.31/3.40 % System time : 0.099 s
% 19.31/3.40 % Total time : 2.727 s
% 19.31/3.40 % Maximum resident set size: 3624 pages
% 19.31/3.40
% 19.31/3.40 % -------------------------------------------------
% 19.31/3.40 % User time : 12.892 s
% 19.31/3.40 % System time : 0.544 s
% 19.31/3.40 % Total time : 13.435 s
% 19.31/3.40 % Maximum resident set size: 4864 pages
% 19.31/3.40 % E exiting
%------------------------------------------------------------------------------