%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC379+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:44:09 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 42 ( 10 unt; 0 def)
% Number of atoms : 253 ( 38 equ)
% Maximal formula atoms : 51 ( 6 avg)
% Number of connectives : 335 ( 124 ~; 133 |; 57 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 49 ( 0 sgn 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( memberP(X1,X7)
& memberP(X2,X7)
& ! [X8] :
( ssItem(X8)
=> ( X7 = X8
| ~ leq(X8,X7)
| ~ memberP(X2,X8) ) ) )
| ( ( ? [X8] :
( leq(X8,X7)
& memberP(X2,X8)
& X7 != X8
& ssItem(X8) )
| ~ memberP(X2,X7) )
& ~ memberP(X1,X7) ) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( memberP(X1,X7)
& memberP(X2,X7)
& ! [X8] :
( ssItem(X8)
=> ( X7 = X8
| ~ leq(X8,X7)
| ~ memberP(X2,X8) ) ) )
| ( ( ? [X8] :
( leq(X8,X7)
& memberP(X2,X8)
& X7 != X8
& ssItem(X8) )
| ~ memberP(X2,X7) )
& ~ memberP(X1,X7) ) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( memberP(X1,X7)
& memberP(X2,X7)
& ! [X8] :
( ssItem(X8)
=> ( X7 = X8
| ~ leq(X8,X7)
| ~ memberP(X2,X8) ) ) )
| ( ( ? [X8] :
( leq(X8,X7)
& memberP(X2,X8)
& X7 != X8
& ssItem(X8) )
| ~ memberP(X2,X7) )
& ~ memberP(X1,X7) ) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X13,X15,X17] :
( ( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| esk6_0 != esk7_0 )
& ( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| leq(esk7_0,esk6_0) )
& ( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| memberP(esk2_0,esk7_0) )
& ( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| ssItem(esk7_0) )
& ( memberP(esk1_0,esk6_0)
| ~ leq(X17,esk6_0)
| ~ memberP(esk2_0,X17)
| esk6_0 = X17
| ~ ssItem(X17) )
& ( memberP(esk1_0,esk6_0)
| memberP(esk2_0,esk6_0) )
& ssItem(esk6_0)
& ( ~ ssItem(X13)
| ~ memberP(esk3_0,X13)
| ~ leq(X15,X13)
| ~ memberP(esk4_0,X15)
| X13 = X15
| ~ ssItem(X15) )
& ( ~ ssItem(X13)
| ~ memberP(esk3_0,X13)
| memberP(esk4_0,X13) )
& ( ~ ssItem(X13)
| ~ memberP(esk4_0,X13)
| memberP(esk3_0,X13)
| X13 != esk5_1(X13) )
& ( ~ ssItem(X13)
| ~ memberP(esk4_0,X13)
| memberP(esk3_0,X13)
| leq(esk5_1(X13),X13) )
& ( ~ ssItem(X13)
| ~ memberP(esk4_0,X13)
| memberP(esk3_0,X13)
| memberP(esk4_0,esk5_1(X13)) )
& ( ~ ssItem(X13)
| ~ memberP(esk4_0,X13)
| memberP(esk3_0,X13)
| ssItem(esk5_1(X13)) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( memberP(esk1_0,esk6_0)
| memberP(esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ leq(X1,esk6_0)
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1)
| memberP(esk1_0,esk6_0)
| esk6_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| memberP(esk3_0,X1)
| leq(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk1_0,X1)
| memberP(esk4_0,X1) ),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( memberP(esk1_0,esk6_0)
| memberP(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| ~ leq(X1,esk6_0)
| memberP(esk1_0,esk6_0)
| esk6_0 = X1 ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| memberP(esk1_0,X1)
| leq(esk5_1(X1),X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_15,negated_conjecture,
memberP(esk4_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| memberP(esk3_0,X1)
| memberP(esk4_0,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ ssItem(esk5_1(esk6_0))
| ~ memberP(esk4_0,esk5_1(esk6_0))
| memberP(esk1_0,esk6_0)
| esk5_1(esk6_0) = esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| memberP(esk1_0,X1)
| memberP(esk4_0,esk5_1(X1)) ),
inference(rw,[status(thm)],[c_0_16,c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| memberP(esk3_0,X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| X1 != esk5_1(X1)
| memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(esk5_1(esk6_0))
| memberP(esk1_0,esk6_0)
| esk5_1(esk6_0) = esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_12])]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| ssItem(esk5_1(X1))
| memberP(esk1_0,X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| ssItem(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| leq(esk7_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| esk5_1(X1) != X1
| memberP(esk1_0,X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( memberP(esk1_0,esk6_0)
| esk5_1(esk6_0) = esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]),c_0_12])]) ).
cnf(c_0_27,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| memberP(esk2_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_28,negated_conjecture,
( ~ memberP(esk4_0,esk6_0)
| ~ memberP(esk1_0,esk6_0)
| ssItem(esk7_0) ),
inference(rw,[status(thm)],[c_0_23,c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| esk6_0 != esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssItem(X2)
| ~ memberP(esk3_0,X2)
| ~ leq(X1,X2)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_31,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| leq(esk7_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_7]),c_0_15])]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| memberP(esk4_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_7]),c_0_7]),c_0_15])]) ).
cnf(c_0_34,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ssItem(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| esk7_0 != esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_7]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ memberP(esk4_0,X1)
| ~ memberP(esk1_0,X2)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_30,c_0_5]) ).
cnf(c_0_37,negated_conjecture,
leq(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
memberP(esk4_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
ssItem(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
esk7_0 != esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_32])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_38]),c_0_12]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC379+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.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 : Mon Sep 21 08:24:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_3 with pid 2003619 completed with status 0
% 0.11/0.45 % Result found by new_bool_3
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 2003625 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.002 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 96
% 0.11/0.45 % Removed by relevancy pruning/SinE : 66
% 0.11/0.45 % Initial clauses : 64
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 64
% 0.11/0.45 % Processed clauses : 110
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 20
% 0.11/0.45 % ...remaining for further processing : 90
% 0.11/0.45 % Other redundant clauses eliminated : 12
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 2
% 0.11/0.45 % Backward-rewritten : 11
% 0.11/0.45 % Generated clauses : 114
% 0.11/0.45 % ...of the previous two non-redundant : 78
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 6
% 0.11/0.45 % Paramodulations : 99
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 16
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 115
% 0.11/0.45 % ...of those cached : 104
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 74
% 0.11/0.45 % Positive orientable unit clauses : 14
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 4
% 0.11/0.45 % Non-unit-clauses : 56
% 0.11/0.45 % Current number of unprocessed clauses: 31
% 0.11/0.45 % ...number of literals in the above : 181
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 13
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 425
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 143
% 0.11/0.45 % Non-unit clause-clause subsumptions : 24
% 0.11/0.45 % Unit Clause-clause subsumption calls : 65
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 4
% 0.11/0.45 % BW rewrite match successes : 4
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 8479
% 0.11/0.45 % Search garbage collected termcells : 1949
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.013 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.017 s
% 0.11/0.45 % Maximum resident set size: 3764 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.017 s
% 0.11/0.45 % System time : 0.008 s
% 0.11/0.45 % Total time : 0.026 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------