%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUN082+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 01:57:57 PM UTC 2026
% Result : Theorem 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 68 ( 35 unt; 0 def)
% Number of atoms : 173 ( 67 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 161 ( 56 ~; 43 |; 62 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 1 con; 0-2 aty)
% Number of variables : 142 ( 14 sgn 44 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_5a,axiom,
! [X33] :
? [X34] :
( ? [X36] :
( X34 = X36
& r1(X36) )
& ? [X35] :
( r4(X33,X35,X34)
& r1(X35) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(axiom_4,axiom,
! [X10,X11] :
? [X12] :
! [X13] :
( ( X13 = X12
& r4(X10,X11,X13) )
| ( X13 != X12
& ~ r4(X10,X11,X13) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( X31 = X30
& ? [X32] :
( r3(X30,X32,X31)
& r1(X32) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( X9 = X8
& r3(X6,X7,X9) )
| ( X9 != X8
& ~ r3(X6,X7,X9) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(axiom_2a,axiom,
! [X20,X21] :
? [X22] :
( ? [X25] :
( r4(X20,X21,X25)
& r3(X25,X20,X22) )
& ? [X23] :
( X23 = X22
& ? [X24] :
( r4(X20,X24,X23)
& r2(X21,X24) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X19] :
( r3(X14,X15,X19)
& r2(X19,X16) )
& ? [X17] :
( X17 = X16
& ? [X18] :
( r3(X14,X18,X17)
& r2(X15,X18) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(xtimesoneeqzero,conjecture,
? [X39,X22] :
( ? [X17] :
( X22 = X17
& r1(X17) )
& ? [X23] :
( ? [X16] :
( r2(X16,X23)
& r1(X16) )
& r4(X39,X23,X22) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xtimesoneeqzero) ).
fof(c_0_9,plain,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_10,plain,
! [X50] :
( ( X50 != esk1_0
| X50 = esk1_0 )
& ( X50 != esk1_0
| r1(X50) )
& ( ~ r1(X50)
| X50 = esk1_0 )
& ( ~ r1(X50)
| r1(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,plain,
! [X54] :
( esk4_1(X54) = esk6_1(X54)
& r1(esk6_1(X54))
& r4(X54,esk5_1(X54),esk4_1(X54))
& r1(esk5_1(X54)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
cnf(c_0_12,plain,
( ~ r1(X1)
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
r1(esk6_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X10,X11] :
? [X12] :
! [X13] :
( ( X13 = X12
& r4(X10,X11,X13) )
| ( X13 != X12
& ~ r4(X10,X11,X13) ) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_15,plain,
r1(esk5_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
esk4_1(X1) = esk6_1(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
esk6_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X51] :
( esk2_1(X51) = X51
& r3(X51,esk3_1(X51),esk2_1(X51))
& r1(esk3_1(X51)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_19,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( X9 = X8
& r3(X6,X7,X9) )
| ( X9 != X8
& ~ r3(X6,X7,X9) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_20,plain,
! [X72,X73,X75] :
( ( X75 != esk11_2(X72,X73)
| X75 = esk11_2(X72,X73) )
& ( X75 != esk11_2(X72,X73)
| r4(X72,X73,X75) )
& ( ~ r4(X72,X73,X75)
| X75 = esk11_2(X72,X73) )
& ( ~ r4(X72,X73,X75)
| r4(X72,X73,X75) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_21,plain,
r4(X1,esk5_1(X1),esk4_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
esk5_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_23,plain,
esk4_1(X1) = esk1_0,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_24,plain,
! [X76,X77] :
( r4(X76,X77,esk15_2(X76,X77))
& r3(esk15_2(X76,X77),X76,esk12_2(X76,X77))
& esk13_2(X76,X77) = esk12_2(X76,X77)
& r4(X76,esk14_2(X76,X77),esk13_2(X76,X77))
& r2(X77,esk14_2(X76,X77)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])]) ).
cnf(c_0_25,plain,
r1(esk3_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X82,X83,X85] :
( ( X85 != esk16_2(X82,X83)
| X85 = esk16_2(X82,X83) )
& ( X85 != esk16_2(X82,X83)
| r3(X82,X83,X85) )
& ( ~ r3(X82,X83,X85)
| X85 = esk16_2(X82,X83) )
& ( ~ r3(X82,X83,X85)
| r3(X82,X83,X85) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_19])])])]) ).
fof(c_0_27,plain,
! [X86,X87] :
( r3(X86,X87,esk20_2(X86,X87))
& r2(esk20_2(X86,X87),esk17_2(X86,X87))
& esk18_2(X86,X87) = esk17_2(X86,X87)
& r3(X86,esk19_2(X86,X87),esk18_2(X86,X87))
& r2(X87,esk19_2(X86,X87)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
cnf(c_0_28,plain,
( ~ r4(X2,X3,X1)
| X1 = esk11_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
r4(X1,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
r4(X1,X2,esk15_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_32,plain,
r3(X1,esk3_1(X1),esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
esk3_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_34,plain,
esk2_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_35,plain,
( ~ r3(X2,X3,X1)
| X1 = esk16_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
r3(X1,X2,esk20_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
r3(esk15_2(X1,X2),X1,esk12_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
esk13_2(X1,X2) = esk12_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_39,plain,
esk11_2(X1,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,plain,
esk11_2(X1,X2) = esk15_2(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
fof(c_0_41,plain,
! [X65,X67] :
( ( X67 != esk10_1(X65)
| X67 = esk10_1(X65) )
& ( X67 != esk10_1(X65)
| r2(X65,X67) )
& ( ~ r2(X65,X67)
| X67 = esk10_1(X65) )
& ( ~ r2(X65,X67)
| r2(X65,X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_31])])])]) ).
cnf(c_0_42,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_43,plain,
esk16_2(X1,X2) = esk20_2(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
r3(esk15_2(X1,X2),X1,esk13_2(X1,X2)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
esk15_2(X1,esk1_0) = esk1_0,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_46,negated_conjecture,
~ ? [X39,X22] :
( ? [X17] :
( X22 = X17
& r1(X17) )
& ? [X23] :
( ? [X16] :
( r2(X16,X23)
& r1(X16) )
& r4(X39,X23,X22) ) ),
inference(assume_negation,[status(cth)],[xtimesoneeqzero]) ).
cnf(c_0_47,plain,
( ~ r2(X2,X1)
| X1 = esk10_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
r2(X1,esk14_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_49,plain,
esk16_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_50,plain,
( ~ r3(X2,X3,X1)
| X1 = esk20_2(X2,X3) ),
inference(rw,[status(thm)],[c_0_35,c_0_43]) ).
cnf(c_0_51,plain,
r3(esk1_0,X1,esk13_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_52,negated_conjecture,
! [X44,X45,X46,X47,X48] :
( X45 != X48
| ~ r1(X48)
| ~ r2(X47,X46)
| ~ r1(X47)
| ~ r4(X44,X46,X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
cnf(c_0_53,plain,
r4(X1,esk14_2(X1,X2),esk13_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_54,plain,
esk14_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
esk20_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_56,plain,
esk20_2(esk1_0,X1) = esk13_2(X1,esk1_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( X3 != X5
| ~ r1(X5)
| ~ r2(X4,X2)
| ~ r1(X4)
| ~ r4(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
r4(X1,esk10_1(X2),esk13_2(X1,X2)),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
esk13_2(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( X1 != esk1_0
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_61,negated_conjecture,
( ~ r1(X4)
| ~ r1(X3)
| ~ r2(X4,X2)
| ~ r4(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_62,plain,
r4(esk1_0,esk10_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_64,plain,
( X2 != esk10_1(X1)
| r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_65,negated_conjecture,
( ~ r1(X1)
| ~ r2(X1,esk10_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_66,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN082+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n006.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 03:25:12 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.23/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % new_bool_3 with pid 1909777 completed with status 0
% 0.23/0.58 % Result found by new_bool_3
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 1909780 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % Preprocessing time : 0.001 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Theorem
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 12
% 0.23/0.58 % Removed by relevancy pruning/SinE : 0
% 0.23/0.58 % Initial clauses : 40
% 0.23/0.58 % Removed in clause preprocessing : 8
% 0.23/0.58 % Initial clauses in saturation : 32
% 0.23/0.58 % Processed clauses : 168
% 0.23/0.58 % ...of these trivial : 8
% 0.23/0.58 % ...subsumed : 34
% 0.23/0.58 % ...remaining for further processing : 126
% 0.23/0.58 % Other redundant clauses eliminated : 7
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 0
% 0.23/0.58 % Backward-rewritten : 23
% 0.23/0.58 % Generated clauses : 441
% 0.23/0.58 % ...of the previous two non-redundant : 332
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 2
% 0.23/0.58 % Paramodulations : 434
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 7
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 277
% 0.23/0.58 % ...of those cached : 149
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 96
% 0.23/0.58 % Positive orientable unit clauses : 60
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 3
% 0.23/0.58 % Non-unit-clauses : 33
% 0.23/0.58 % Current number of unprocessed clauses: 178
% 0.23/0.58 % ...number of literals in the above : 340
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 23
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 230
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 187
% 0.23/0.58 % Non-unit clause-clause subsumptions : 25
% 0.23/0.58 % Unit Clause-clause subsumption calls : 20
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 47
% 0.23/0.58 % BW rewrite match successes : 22
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 5545
% 0.23/0.58 % Search garbage collected termcells : 310
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.014 s
% 0.23/0.58 % System time : 0.003 s
% 0.23/0.58 % Total time : 0.017 s
% 0.23/0.58 % Maximum resident set size: 3668 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.017 s
% 0.23/0.58 % System time : 0.009 s
% 0.23/0.58 % Total time : 0.026 s
% 0.23/0.58 % Maximum resident set size: 4864 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------