%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO500+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 12:28:21 PM UTC 2026
% Result : Theorem 3.30s 1.00s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 28 unt; 0 def)
% Number of atoms : 138 ( 47 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 136 ( 64 ~; 65 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 160 ( 1 sgn 103 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz7_19,conjecture,
! [X12,X15,X13] :
( X12 = X15
| s(X12,s(X15,X13)) != s(X15,s(X12,X13)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_19) ).
fof(d_Defn7_1,axiom,
! [X12,X29,X15] :
( ( s_m(X12,X29,X15)
| ~ s_e(X29,X12,X29,X15)
| ~ s_t(X12,X29,X15) )
& ( s_e(X29,X12,X29,X15)
| ~ s_m(X12,X29,X15) )
& ( s_t(X12,X29,X15)
| ~ s_m(X12,X29,X15) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_Defn7_1) ).
fof(aSatz7_4a,axiom,
! [X13,X12] : s_m(X13,X12,s(X12,X13)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_4a) ).
fof(aSatz7_16a,axiom,
! [X13,X16,X27,X28,X12] :
( s_e(s(X12,X13),s(X12,X16),s(X12,X27),s(X12,X28))
| ~ s_e(X13,X16,X27,X28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_16a) ).
fof(aSatz7_15b,axiom,
! [X13,X16,X27,X12] :
( ~ s_t(s(X12,X13),s(X12,X16),s(X12,X27))
| s_t(X13,X16,X27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_15b) ).
fof(aSatz7_10b,axiom,
! [X12,X13] :
( X13 != X12
| s(X12,X13) = X13 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_10b) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).
fof(aSatz4_18,axiom,
! [X12,X15,X14,X22] :
( X14 = X22
| ~ s_e(X15,X14,X15,X22)
| ~ s_e(X12,X14,X12,X22)
| ~ s_col(X12,X15,X14)
| X12 = X15 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz4_18) ).
fof(aSatz7_17,axiom,
! [X13,X12,X16,X15] :
( X12 = X15
| ~ s_m(X13,X15,X16)
| ~ s_m(X13,X12,X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_17) ).
fof(aSatz4_12b,axiom,
! [X12,X15] : s_col(X12,X15,X12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz4_12b) ).
fof(aSatz7_13,axiom,
! [X13,X16,X12] : s_e(X13,X16,s(X12,X13),s(X12,X16)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_13) ).
fof(aSatz7_10a,axiom,
! [X12,X13] :
( X13 = X12
| s(X12,X13) != X13 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_10a) ).
fof(aSatz2_8,axiom,
! [X12,X15] : s_e(X12,X12,X15,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz2_8) ).
fof(c_0_13,negated_conjecture,
~ ! [X12,X15,X13] :
( X12 = X15
| s(X12,s(X15,X13)) != s(X15,s(X12,X13)) ),
inference(assume_negation,[status(cth)],[aSatz7_19]) ).
fof(c_0_14,negated_conjecture,
~ ! [X12,X15,X13] :
( X12 = X15
| s(X12,s(X15,X13)) != s(X15,s(X12,X13)) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X12,X29,X15] :
( ( s_m(X12,X29,X15)
| ~ s_e(X29,X12,X29,X15)
| ~ s_t(X12,X29,X15) )
& ( s_e(X29,X12,X29,X15)
| ~ s_m(X12,X29,X15) )
& ( s_t(X12,X29,X15)
| ~ s_m(X12,X29,X15) ) ),
inference(fof_simplification,[status(thm)],[d_Defn7_1]) ).
fof(c_0_16,plain,
! [X398,X399] : s_m(X398,X399,s(X399,X398)),
inference(variable_rename,[status(thm)],[aSatz7_4a]) ).
fof(c_0_17,negated_conjecture,
( esk1_0 != esk2_0
& s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_18,plain,
! [X13,X16,X27,X28,X12] :
( s_e(s(X12,X13),s(X12,X16),s(X12,X27),s(X12,X28))
| ~ s_e(X13,X16,X27,X28) ),
inference(fof_simplification,[status(thm)],[aSatz7_16a]) ).
fof(c_0_19,plain,
! [X496,X497,X498] :
( ( s_m(X496,X497,X498)
| ~ s_e(X497,X496,X497,X498)
| ~ s_t(X496,X497,X498) )
& ( s_e(X497,X496,X497,X498)
| ~ s_m(X496,X497,X498) )
& ( s_t(X496,X497,X498)
| ~ s_m(X496,X497,X498) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_20,plain,
s_m(X1,X2,s(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X13,X16,X27,X12] :
( ~ s_t(s(X12,X13),s(X12,X16),s(X12,X27))
| s_t(X13,X16,X27) ),
inference(fof_simplification,[status(thm)],[aSatz7_15b]) ).
fof(c_0_23,plain,
! [X12,X13] :
( X13 != X12
| s(X12,X13) = X13 ),
inference(fof_simplification,[status(thm)],[aSatz7_10b]) ).
fof(c_0_24,plain,
! [X431,X432,X433,X434,X435] :
( s_e(s(X435,X431),s(X435,X432),s(X435,X433),s(X435,X434))
| ~ s_e(X431,X432,X433,X434) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
cnf(c_0_25,plain,
( ~ s_m(X1,X2,X3)
| s_e(X2,X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
s_m(s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_27,plain,
! [X427,X428,X429,X430] :
( ~ s_t(s(X430,X427),s(X430,X428),s(X430,X429))
| s_t(X427,X428,X429) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
fof(c_0_28,plain,
! [X407,X408] : s(X407,s(X407,X408)) = X408,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
fof(c_0_29,plain,
! [X12,X15,X14,X22] :
( X14 = X22
| ~ s_e(X15,X14,X15,X22)
| ~ s_e(X12,X14,X12,X22)
| ~ s_col(X12,X15,X14)
| X12 = X15 ),
inference(fof_simplification,[status(thm)],[aSatz4_18]) ).
fof(c_0_30,plain,
! [X418,X419] :
( X419 != X418
| s(X418,X419) = X419 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
fof(c_0_31,plain,
! [X13,X12,X16,X15] :
( X12 = X15
| ~ s_m(X13,X15,X16)
| ~ s_m(X13,X12,X16) ),
inference(fof_simplification,[status(thm)],[aSatz7_17]) ).
cnf(c_0_32,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(s(X5,X1),s(X5,X2),s(X5,X3),s(X5,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( ~ s_t(s(X4,X1),s(X4,X2),s(X4,X3))
| s_t(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ s_m(X1,X2,X3)
| s_t(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_37,plain,
! [X228,X229,X230,X231] :
( X230 = X231
| ~ s_e(X229,X230,X229,X231)
| ~ s_e(X228,X230,X228,X231)
| ~ s_col(X228,X229,X230)
| X228 = X229 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).
fof(c_0_38,plain,
! [X202,X203] : s_col(X202,X203,X202),
inference(variable_rename,[status(thm)],[aSatz4_12b]) ).
fof(c_0_39,plain,
! [X420,X421,X422] : s_e(X420,X421,s(X422,X420),s(X422,X421)),
inference(variable_rename,[status(thm)],[aSatz7_13]) ).
cnf(c_0_40,plain,
( X2 != X1
| s(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_41,plain,
! [X12,X13] :
( X13 = X12
| s(X12,X13) != X13 ),
inference(fof_simplification,[status(thm)],[aSatz7_10a]) ).
fof(c_0_42,plain,
! [X441,X442,X443,X444] :
( X442 = X444
| ~ s_m(X441,X444,X443)
| ~ s_m(X441,X442,X443) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
s_e(s(X1,esk1_0),s(X1,s(esk2_0,esk3_0)),s(X1,esk1_0),s(X1,s(esk2_0,s(esk1_0,esk3_0)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,plain,
( ~ s_t(s(X2,X1),X3,s(X2,X4))
| s_t(X1,s(X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
s_t(s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_46,plain,
( ~ s_e(X2,X3,X2,X4)
| ~ s_e(X1,X3,X1,X4)
| ~ s_col(X1,X2,X3)
| X3 = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
s_col(X1,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
s_e(X1,X2,s(X3,X1),s(X3,X2)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
s(X1,X1) = X1,
inference(er,[status(thm)],[c_0_40]) ).
fof(c_0_50,plain,
! [X416,X417] :
( X417 = X416
| s(X416,X417) != X417 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_41])]) ).
cnf(c_0_51,plain,
( ~ s_m(X1,X4,X3)
| ~ s_m(X1,X2,X3)
| X2 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,plain,
( ~ s_e(X2,X1,X2,X3)
| ~ s_t(X1,X2,X3)
| s_m(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_53,negated_conjecture,
s_e(s(esk2_0,esk1_0),esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_35]) ).
cnf(c_0_54,negated_conjecture,
s_t(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,plain,
( ~ s_e(X1,X1,X1,X3)
| ~ s_e(X2,X1,X2,X3)
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
s_e(X1,X2,X1,s(X1,X2)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( s(X1,X2) != X2
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
( ~ s_m(X3,X1,s(X2,X3))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_51,c_0_20]) ).
cnf(c_0_59,negated_conjecture,
s_m(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
fof(c_0_60,plain,
! [X90,X91] : s_e(X90,X90,X91,X91),
inference(variable_rename,[status(thm)],[aSatz2_8]) ).
cnf(c_0_61,plain,
( ~ s_e(X1,X1,X1,s(X2,X1))
| X1 = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_62,negated_conjecture,
s(esk2_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
s_e(X1,X1,X2,X2),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_64,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO500+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 16:55:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 3.30/1.00 % Version: 3.5.1
% 3.30/1.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.30/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.30/1.00 % Starting new_bool_3 with 300s (1) cores
% 3.30/1.00 % Starting new_bool_1 with 300s (1) cores
% 3.30/1.00 % Starting sh5l with 300s (1) cores
% 3.30/1.00 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3829298 completed with status 0
% 3.30/1.00 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.30/1.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.30/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.30/1.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.30/1.00 % No SInE strategy applied
% 3.30/1.00 % Search class: FGHSM-FSLF33-MFFFFFNN
% 3.30/1.00 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 3.30/1.00 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.30/1.00 % Starting SubtermCWHack with 136s (1) cores
% 3.30/1.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.30/1.00 % Starting new_bool_3 with 393s (1) cores
% 3.30/1.00 % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 3.30/1.00 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 3.30/1.00 % new_bool_3 with pid 3829307 completed with status 0
% 3.30/1.00 % Result found by new_bool_3
% 3.30/1.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.30/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.30/1.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.30/1.00 % No SInE strategy applied
% 3.30/1.00 % Search class: FGHSM-FSLF33-MFFFFFNN
% 3.30/1.00 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 3.30/1.00 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.30/1.00 % Starting SubtermCWHack with 136s (1) cores
% 3.30/1.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.30/1.00 % Starting new_bool_3 with 393s (1) cores
% 3.30/1.00 % Preprocessing time : 0.004 s
% 3.30/1.00 % Presaturation interreduction done
% 3.30/1.00
% 3.30/1.00 % Proof found!
% 3.30/1.00 % SZS status Theorem
% 3.30/1.00 % SZS output start CNFRefutation
% See solution above
% 3.30/1.00 % Parsed axioms : 121
% 3.30/1.00 % Removed by relevancy pruning/SinE : 0
% 3.30/1.00 % Initial clauses : 172
% 3.30/1.00 % Removed in clause preprocessing : 1
% 3.30/1.00 % Initial clauses in saturation : 171
% 3.30/1.00 % Processed clauses : 1855
% 3.30/1.00 % ...of these trivial : 403
% 3.30/1.00 % ...subsumed : 339
% 3.30/1.00 % ...remaining for further processing : 1113
% 3.30/1.00 % Other redundant clauses eliminated : 13
% 3.30/1.00 % Clauses deleted for lack of memory : 0
% 3.30/1.00 % Backward-subsumed : 3
% 3.30/1.00 % Backward-rewritten : 169
% 3.30/1.00 % Generated clauses : 14164
% 3.30/1.00 % ...of the previous two non-redundant : 11327
% 3.30/1.00 % ...aggressively subsumed : 0
% 3.30/1.00 % Contextual simplify-reflections : 6
% 3.30/1.00 % Paramodulations : 14147
% 3.30/1.00 % Factorizations : 2
% 3.30/1.00 % NegExts : 0
% 3.30/1.00 % Equation resolutions : 15
% 3.30/1.00 % Disequality decompositions : 0
% 3.30/1.00 % Total rewrite steps : 4071
% 3.30/1.00 % ...of those cached : 3419
% 3.30/1.00 % Propositional unsat checks : 0
% 3.30/1.00 % Propositional check models : 0
% 3.30/1.00 % Propositional check unsatisfiable : 0
% 3.30/1.00 % Propositional clauses : 0
% 3.30/1.00 % Propositional clauses after purity: 0
% 3.30/1.00 % Propositional unsat core size : 0
% 3.30/1.00 % Propositional preprocessing time : 0.000
% 3.30/1.00 % Propositional encoding time : 0.000
% 3.30/1.00 % Propositional solver time : 0.000
% 3.30/1.00 % Success case prop preproc time : 0.000
% 3.30/1.00 % Success case prop encoding time : 0.000
% 3.30/1.00 % Success case prop solver time : 0.000
% 3.30/1.00 % Current number of processed clauses : 774
% 3.30/1.00 % Positive orientable unit clauses : 268
% 3.30/1.00 % Positive unorientable unit clauses: 0
% 3.30/1.00 % Negative unit clauses : 18
% 3.30/1.00 % Non-unit-clauses : 488
% 3.30/1.00 % Current number of unprocessed clauses: 9621
% 3.30/1.00 % ...number of literals in the above : 21033
% 3.30/1.00 % Current number of archived formulas : 0
% 3.30/1.00 % Current number of archived clauses : 332
% 3.30/1.00 % Clause-clause subsumption calls (NU) : 56971
% 3.30/1.00 % Rec. Clause-clause subsumption calls : 39790
% 3.30/1.00 % Non-unit clause-clause subsumptions : 340
% 3.30/1.00 % Unit Clause-clause subsumption calls : 10785
% 3.30/1.00 % Rewrite failures with RHS unbound : 0
% 3.30/1.00 % BW rewrite match attempts : 2890
% 3.30/1.00 % BW rewrite match successes : 15
% 3.30/1.00 % Condensation attempts : 0
% 3.30/1.00 % Condensation successes : 0
% 3.30/1.00 % Termbank termtop insertions : 259304
% 3.30/1.00 % Search garbage collected termcells : 1234
% 3.30/1.00
% 3.30/1.00 % -------------------------------------------------
% 3.30/1.00 % User time : 0.296 s
% 3.30/1.00 % System time : 0.015 s
% 3.30/1.00 % Total time : 0.311 s
% 3.30/1.00 % Maximum resident set size: 4304 pages
% 3.30/1.00
% 3.30/1.00 % -------------------------------------------------
% 3.30/1.00 % User time : 2.102 s
% 3.30/1.00 % System time : 0.092 s
% 3.30/1.00 % Total time : 2.194 s
% 3.30/1.00 % Maximum resident set size: 5120 pages
% 3.30/1.00 % E exiting
%------------------------------------------------------------------------------