%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG109+1 : 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 : n001.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:26 PM UTC 2026
% Result : Theorem 198.77s 29.73s
% Output : CNFRefutation 198.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 205 ( 55 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 271 ( 116 ~; 116 |; 30 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-4 aty)
% Number of variables : 68 ( 0 sgn 31 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( sdtpldt0(X5,X6) = X4
& aElementOf0(X6,X2)
& aElementOf0(X5,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSSum) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
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)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( sdtasdt0(X1,X4) = X3
& aElement0(X4) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__,conjecture,
? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(m__2203,hypothesis,
( aElementOf0(xb,slsdtgt0(xb))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(m__2110,hypothesis,
( xb != sz00
| xa != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2110) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_10,plain,
! [X19,X20,X21,X22,X25,X26,X27,X28,X30,X31] :
( ( ~ aSet0(X20)
| ~ aSet0(X19)
| X28 = sdtpldt1(X19,X20)
| ~ aSet0(X28)
| aElementOf0(esk5_3(X19,X20,X28),X28)
| sdtpldt0(esk6_3(X19,X20,X28),esk7_3(X19,X20,X28)) = esk5_3(X19,X20,X28) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X28 = sdtpldt1(X19,X20)
| ~ aSet0(X28)
| aElementOf0(esk5_3(X19,X20,X28),X28)
| aElementOf0(esk7_3(X19,X20,X28),X20) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X28 = sdtpldt1(X19,X20)
| ~ aSet0(X28)
| aElementOf0(esk5_3(X19,X20,X28),X28)
| aElementOf0(esk6_3(X19,X20,X28),X19) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X28 = sdtpldt1(X19,X20)
| ~ aSet0(X28)
| sdtpldt0(X30,X31) != esk5_3(X19,X20,X28)
| ~ aElementOf0(X31,X20)
| ~ aElementOf0(X30,X19)
| ~ aElementOf0(esk5_3(X19,X20,X28),X28) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X21 != sdtpldt1(X19,X20)
| aElementOf0(X25,X21)
| sdtpldt0(X26,X27) != X25
| ~ aElementOf0(X27,X20)
| ~ aElementOf0(X26,X19) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X21 != sdtpldt1(X19,X20)
| ~ aElementOf0(X22,X21)
| sdtpldt0(esk3_4(X19,X20,X21,X22),esk4_4(X19,X20,X21,X22)) = X22 )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X21 != sdtpldt1(X19,X20)
| ~ aElementOf0(X22,X21)
| aElementOf0(esk4_4(X19,X20,X21,X22),X20) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X21 != sdtpldt1(X19,X20)
| ~ aElementOf0(X22,X21)
| aElementOf0(esk3_4(X19,X20,X21,X22),X19) )
& ( ~ aSet0(X20)
| ~ aSet0(X19)
| X21 != sdtpldt1(X19,X20)
| aSet0(X21) ) ),
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)],[mDefSSum])])])])])])]) ).
cnf(c_0_11,plain,
( ~ aSet0(X4)
| ~ aSet0(X2)
| X6 != sdtpldt1(X2,X4)
| sdtpldt0(X1,X3) != X5
| ~ aElementOf0(X3,X4)
| ~ aElementOf0(X1,X2)
| aElementOf0(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X8] :
( ( ~ aElement0(X8)
| X8 = sdtpldt0(sz00,X8) )
& ( ~ aElement0(X8)
| sdtpldt0(X8,sz00) = X8 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_13,plain,
! [X13,X14] :
( aElement0(X14)
| ~ aElementOf0(X14,X13)
| ~ aSet0(X13) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_14,plain,
( ~ aSet0(X3)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,X4)
| aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).
cnf(c_0_15,plain,
( ~ aElement0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X58,X59,X60,X62,X63,X64,X66] :
( ( ~ aElement0(X58)
| X64 = slsdtgt0(X58)
| ~ aSet0(X64)
| aElementOf0(esk15_2(X58,X64),X64)
| sdtasdt0(X58,esk16_2(X58,X64)) = esk15_2(X58,X64) )
& ( ~ aElement0(X58)
| X64 = slsdtgt0(X58)
| ~ aSet0(X64)
| aElementOf0(esk15_2(X58,X64),X64)
| aElement0(esk16_2(X58,X64)) )
& ( ~ aElement0(X58)
| X64 = slsdtgt0(X58)
| ~ aSet0(X64)
| sdtasdt0(X58,X66) != esk15_2(X58,X64)
| ~ aElement0(X66)
| ~ aElementOf0(esk15_2(X58,X64),X64) )
& ( ~ aElement0(X58)
| X59 != slsdtgt0(X58)
| aElementOf0(X62,X59)
| sdtasdt0(X58,X63) != X62
| ~ aElement0(X63) )
& ( ~ aElement0(X58)
| X59 != slsdtgt0(X58)
| ~ aElementOf0(X60,X59)
| sdtasdt0(X58,esk14_3(X58,X59,X60)) = X60 )
& ( ~ aElement0(X58)
| X59 != slsdtgt0(X58)
| ~ aElementOf0(X60,X59)
| aElement0(esk14_3(X58,X59,X60)) )
& ( ~ aElement0(X58)
| X59 != slsdtgt0(X58)
| aSet0(X59) ) ),
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])])])])])])]) ).
fof(c_0_18,negated_conjecture,
~ ? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_19,plain,
( ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(sz00,X2)
| aElementOf0(X1,sdtpldt1(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_21,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[m__2203]) ).
cnf(c_0_22,plain,
( ~ aElement0(X2)
| X1 != slsdtgt0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
~ ? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
( ~ aSet0(slsdtgt0(xa))
| ~ aSet0(slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xb))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ~ aElement0(X1)
| aSet0(slsdtgt0(X1)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_27,negated_conjecture,
! [X7] :
( X7 = sz00
| ~ aElementOf0(X7,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_28,hypothesis,
( ~ aSet0(slsdtgt0(xa))
| ~ aElementOf0(X1,slsdtgt0(xb))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_30,negated_conjecture,
( ~ aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_29])]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2203]) ).
cnf(c_0_33,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00 ),
inference(rw,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xb,xI),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aElementOf0(X1,X2)
| ~ aElementOf0(sz00,X3)
| aElementOf0(X1,sdtpldt1(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_33]),c_0_16]) ).
cnf(c_0_37,hypothesis,
aElementOf0(sz00,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2203]) ).
cnf(c_0_38,negated_conjecture,
xb = sz00,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,hypothesis,
( ~ aSet0(slsdtgt0(xa))
| ~ aSet0(slsdtgt0(sz00))
| ~ aElementOf0(X1,slsdtgt0(xa))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_37]),c_0_38])]) ).
fof(c_0_40,hypothesis,
( xb != sz00
| xa != sz00 ),
inference(fof_simplification,[status(thm)],[m__2110]) ).
cnf(c_0_41,hypothesis,
( ~ aSet0(slsdtgt0(sz00))
| ~ aElementOf0(X1,slsdtgt0(xa))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_29])]) ).
cnf(c_0_42,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
fof(c_0_43,hypothesis,
( xb != sz00
| xa != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_40]) ).
cnf(c_0_44,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_42])]) ).
cnf(c_0_45,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[m__2203]) ).
cnf(c_0_46,hypothesis,
( xb != sz00
| xa != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,hypothesis,
aElementOf0(xa,xI),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,hypothesis,
xa != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_38])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG109+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 04:25:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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
% 198.77/29.73 % Version: 3.5.1
% 198.77/29.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 198.77/29.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 198.77/29.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 198.77/29.73 % Starting new_bool_3 with 300s (1) cores
% 198.77/29.73 % Starting new_bool_1 with 300s (1) cores
% 198.77/29.73 % Starting sh5l with 300s (1) cores
% 198.77/29.73 % sh5l with pid 2180730 completed with status 0
% 198.77/29.73 % Result found by sh5l
% 198.77/29.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 198.77/29.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 198.77/29.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 198.77/29.73 % Starting new_bool_3 with 300s (1) cores
% 198.77/29.73 % Starting new_bool_1 with 300s (1) cores
% 198.77/29.73 % Starting sh5l with 300s (1) cores
% 198.77/29.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 198.77/29.73 % SinE strategy is gf500_gu_R04_F100_L20000
% 198.77/29.73 % Search class: FGHSF-FFMM32-MFFFFFNN
% 198.77/29.73 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 198.77/29.73 % Starting SubtermCWHack with 28s (1) cores
% 198.77/29.73 % SubtermCWHack with pid 2180732 completed with status 8
% 198.77/29.73 % Starting sh5l with 31s (1) cores
% 198.77/29.73 % sh5l with pid 2180740 completed with status 0
% 198.77/29.73 % Result found by sh5l
% 198.77/29.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 198.77/29.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 198.77/29.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 198.77/29.73 % Starting new_bool_3 with 300s (1) cores
% 198.77/29.73 % Starting new_bool_1 with 300s (1) cores
% 198.77/29.73 % Starting sh5l with 300s (1) cores
% 198.77/29.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 198.77/29.73 % SinE strategy is gf500_gu_R04_F100_L20000
% 198.77/29.73 % Search class: FGHSF-FFMM32-MFFFFFNN
% 198.77/29.73 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 198.77/29.73 % Starting SubtermCWHack with 28s (1) cores
% 198.77/29.73 % SubtermCWHack with pid 2180732 completed with status 8
% 198.77/29.73 % Starting sh5l with 31s (1) cores
% 198.77/29.73 % Preprocessing time : 0.004 s
% 198.77/29.73 % Presaturation interreduction done
% 198.77/29.73
% 198.77/29.73 % Proof found!
% 198.77/29.73 % SZS status Theorem
% 198.77/29.73 % SZS output start CNFRefutation
% See solution above
% 198.77/29.73 % Parsed axioms : 44
% 198.77/29.73 % Removed by relevancy pruning/SinE : 0
% 198.77/29.73 % Initial clauses : 104
% 198.77/29.73 % Removed in clause preprocessing : 4
% 198.77/29.73 % Initial clauses in saturation : 100
% 198.77/29.73 % Processed clauses : 2207
% 198.77/29.73 % ...of these trivial : 49
% 198.77/29.73 % ...subsumed : 1314
% 198.77/29.73 % ...remaining for further processing : 844
% 198.77/29.73 % Other redundant clauses eliminated : 29
% 198.77/29.73 % Clauses deleted for lack of memory : 0
% 198.77/29.73 % Backward-subsumed : 127
% 198.77/29.73 % Backward-rewritten : 51
% 198.77/29.73 % Generated clauses : 12226
% 198.77/29.73 % ...of the previous two non-redundant : 9766
% 198.77/29.73 % ...aggressively subsumed : 0
% 198.77/29.73 % Contextual simplify-reflections : 105
% 198.77/29.73 % Paramodulations : 12195
% 198.77/29.73 % Factorizations : 4
% 198.77/29.73 % NegExts : 0
% 198.77/29.73 % Equation resolutions : 29
% 198.77/29.73 % Disequality decompositions : 0
% 198.77/29.73 % Total rewrite steps : 8658
% 198.77/29.73 % ...of those cached : 8604
% 198.77/29.73 % Propositional unsat checks : 0
% 198.77/29.73 % Propositional check models : 0
% 198.77/29.73 % Propositional check unsatisfiable : 0
% 198.77/29.73 % Propositional clauses : 0
% 198.77/29.73 % Propositional clauses after purity: 0
% 198.77/29.73 % Propositional unsat core size : 0
% 198.77/29.73 % Propositional preprocessing time : 0.000
% 198.77/29.73 % Propositional encoding time : 0.000
% 198.77/29.73 % Propositional solver time : 0.000
% 198.77/29.73 % Success case prop preproc time : 0.000
% 198.77/29.73 % Success case prop encoding time : 0.000
% 198.77/29.73 % Success case prop solver time : 0.000
% 198.77/29.73 % Current number of processed clauses : 552
% 198.77/29.73 % Positive orientable unit clauses : 56
% 198.77/29.73 % Positive unorientable unit clauses: 0
% 198.77/29.73 % Negative unit clauses : 3
% 198.77/29.73 % Non-unit-clauses : 493
% 198.77/29.73 % Current number of unprocessed clauses: 7583
% 198.77/29.73 % ...number of literals in the above : 42377
% 198.77/29.73 % Current number of archived formulas : 0
% 198.77/29.73 % Current number of archived clauses : 278
% 198.77/29.73 % Clause-clause subsumption calls (NU) : 38987
% 198.77/29.73 % Rec. Clause-clause subsumption calls : 19516
% 198.77/29.73 % Non-unit clause-clause subsumptions : 1591
% 198.77/29.73 % Unit Clause-clause subsumption calls : 1116
% 198.77/29.73 % Rewrite failures with RHS unbound : 0
% 198.77/29.73 % BW rewrite match attempts : 24
% 198.77/29.73 % BW rewrite match successes : 20
% 198.77/29.73 % Condensation attempts : 2207
% 198.77/29.73 % Condensation successes : 77
% 198.77/29.73 % Termbank termtop insertions : 214345
% 198.77/29.73 % Search garbage collected termcells : 1867
% 198.77/29.73
% 198.77/29.73 % -------------------------------------------------
% 198.77/29.73 % User time : 27.637 s
% 198.77/29.73 % System time : 1.001 s
% 198.77/29.73 % Total time : 28.638 s
% 198.77/29.73 % Maximum resident set size: 3948 pages
% 198.77/29.73
% 198.77/29.73 % -------------------------------------------------
% 198.77/29.73 % User time : 27.643 s
% 198.77/29.73 % System time : 1.008 s
% 198.77/29.73 % Total time : 28.651 s
% 198.77/29.73 % Maximum resident set size: 4608 pages
% 198.77/29.73 % E exiting
%------------------------------------------------------------------------------