%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU861^5 : 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 : n008.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 : Wed Sep 30 08:25:51 AM UTC 2026
% Result : Theorem 0.09s 0.27s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 169 ( 15 equ; 0 cnn)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 443 ( 55 ~; 87 |; 21 &; 260 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 65 ( 65 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 78 ( 0 ^; 74 !; 4 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cB: a > $o ).
thf(decl_24,type,
cC: a > $o ).
thf(decl_25,type,
epred1_1: ( ( a > $o ) > $o ) > a > $o ).
thf(decl_26,type,
epred2_1: ( ( a > $o ) > $o ) > a > $o ).
thf(decl_27,type,
esk1_1: ( ( a > $o ) > $o ) > a ).
thf(decl_28,type,
epred3_1: ( ( a > $o ) > $o ) > a > $o ).
thf(decl_29,type,
epred4_0: ( a > $o ) > $o ).
thf(decl_30,type,
esk2_1: ( a > $o ) > a ).
thf(decl_31,type,
esk3_3: ( a > $o ) > a > ( a > $o ) > a ).
thf(cTHM531E_pme,conjecture,
( ( ! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ~ ? [X3: a] : ( X2 @ X3 )
=> ( X1 @ X2 ) )
& ! [X4: a > $o,X5: a,X6: a > $o] :
( ( ( X1 @ X4 )
& ! [X7: a] :
( ( X6 @ X7 )
=> ( ( X4 @ X7 )
| ( X7 = X5 ) ) ) )
=> ( X1 @ X6 ) ) )
=> ( X1 @ cC ) )
& ! [X5: a] :
( ( cB @ X5 )
=> ( cC @ X5 ) ) )
=> ! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ~ ? [X3: a] : ( X2 @ X3 )
=> ( X1 @ X2 ) )
& ! [X4: a > $o,X5: a,X6: a > $o] :
( ( ( X1 @ X4 )
& ! [X8: a] :
( ( X6 @ X8 )
=> ( ( X4 @ X8 )
| ( X8 = X5 ) ) ) )
=> ( X1 @ X6 ) ) )
=> ( X1 @ cB ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rTBwh5X7Rh/E---3.1_3251621.p',cTHM531E_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ~ ? [X3: a] : ( X2 @ X3 )
=> ( X1 @ X2 ) )
& ! [X4: a > $o,X5: a,X6: a > $o] :
( ( ( X1 @ X4 )
& ! [X7: a] :
( ( X6 @ X7 )
=> ( ( X4 @ X7 )
| ( X7 = X5 ) ) ) )
=> ( X1 @ X6 ) ) )
=> ( X1 @ cC ) )
& ! [X5: a] :
( ( cB @ X5 )
=> ( cC @ X5 ) ) )
=> ! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ~ ? [X3: a] : ( X2 @ X3 )
=> ( X1 @ X2 ) )
& ! [X4: a > $o,X5: a,X6: a > $o] :
( ( ( X1 @ X4 )
& ! [X8: a] :
( ( X6 @ X8 )
=> ( ( X4 @ X8 )
| ( X8 = X5 ) ) ) )
=> ( X1 @ X6 ) ) )
=> ( X1 @ cB ) ) ),
inference(assume_negation,[status(cth)],[cTHM531E_pme]) ).
thf(c_0_2,negated_conjecture,
! [X24: ( a > $o ) > $o,X26: a,X30: a,X31: a,X33: a > $o,X35: a > $o,X36: a,X37: a > $o] :
( ( ( X24 @ ( epred2_1 @ X24 ) )
| ~ ( epred1_1 @ X24 @ X26 )
| ( X24 @ cC ) )
& ( ~ ( epred3_1 @ X24 @ X30 )
| ( epred2_1 @ X24 @ X30 )
| ( X30
= ( esk1_1 @ X24 ) )
| ~ ( epred1_1 @ X24 @ X26 )
| ( X24 @ cC ) )
& ( ~ ( X24 @ ( epred3_1 @ X24 ) )
| ~ ( epred1_1 @ X24 @ X26 )
| ( X24 @ cC ) )
& ( ( X24 @ ( epred2_1 @ X24 ) )
| ~ ( X24 @ ( epred1_1 @ X24 ) )
| ( X24 @ cC ) )
& ( ~ ( epred3_1 @ X24 @ X30 )
| ( epred2_1 @ X24 @ X30 )
| ( X30
= ( esk1_1 @ X24 ) )
| ~ ( X24 @ ( epred1_1 @ X24 ) )
| ( X24 @ cC ) )
& ( ~ ( X24 @ ( epred3_1 @ X24 ) )
| ~ ( X24 @ ( epred1_1 @ X24 ) )
| ( X24 @ cC ) )
& ( ~ ( cB @ X31 )
| ( cC @ X31 ) )
& ( ( X33 @ ( esk2_1 @ X33 ) )
| ( epred4_0 @ X33 ) )
& ( ( X37 @ ( esk3_3 @ X35 @ X36 @ X37 ) )
| ~ ( epred4_0 @ X35 )
| ( epred4_0 @ X37 ) )
& ( ~ ( X35 @ ( esk3_3 @ X35 @ X36 @ X37 ) )
| ~ ( epred4_0 @ X35 )
| ( epred4_0 @ X37 ) )
& ( ( ( esk3_3 @ X35 @ X36 @ X37 )
!= X36 )
| ~ ( epred4_0 @ X35 )
| ( epred4_0 @ X37 ) )
& ~ ( epred4_0 @ cB ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a,X5: a] :
( ( epred2_1 @ X1 @ X3 )
| ( X3
= ( esk1_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred3_1 @ X1 @ X3 )
| ~ ( epred1_1 @ X1 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a > $o] :
( ( X2 @ ( esk2_1 @ X2 ) )
| ( epred4_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a] :
( ( X3
= ( esk1_1 @ X1 ) )
| ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( epred2_1 @ X1 @ X3 )
| ( X1 @ cC )
| ~ ( epred3_1 @ X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: a > $o,X3: a,X4: a > $o] :
( ( X2 @ ( esk3_3 @ X4 @ X3 @ X2 ) )
| ( epred4_0 @ X2 )
| ~ ( epred4_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: a > $o,X3: a,X2: a > $o] :
( ( epred4_0 @ X4 )
| ~ ( X2 @ ( esk3_3 @ X2 @ X3 @ X4 ) )
| ~ ( epred4_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a,X2: a > $o] :
( ( ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) )
= ( esk1_1 @ X1 ) )
| ( epred2_1 @ X1 @ ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) ) )
| ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred4_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: a] :
( ( cC @ X3 )
| ~ ( cB @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
~ ( epred4_0 @ cB ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: a,X1: ( a > $o ) > $o] :
( ( epred2_1 @ X1 @ X3 )
| ( X3
= ( esk1_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred3_1 @ X1 @ X3 )
| ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a] :
( ( X1 @ cC )
| ~ ( X1 @ ( epred3_1 @ X1 ) )
| ~ ( epred1_1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X4: a > $o,X3: a,X2: a > $o] :
( ( epred4_0 @ X4 )
| ( ( esk3_3 @ X2 @ X3 @ X4 )
!= X3 )
| ~ ( epred4_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X3: a,X1: ( a > $o ) > $o] :
( ( ( esk3_3 @ ( epred2_1 @ X1 ) @ X3 @ ( epred3_1 @ X1 ) )
= ( esk1_1 @ X1 ) )
| ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred4_0 @ ( epred2_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X3: a,X2: a > $o] :
( ( cC @ ( esk3_3 @ X2 @ X3 @ cB ) )
| ~ ( epred4_0 @ X2 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a,X2: a > $o] :
( ( ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) )
= ( esk1_1 @ X1 ) )
| ( epred2_1 @ X1 @ ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) ) )
| ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( X1 @ ( epred1_1 @ X1 ) )
| ~ ( epred4_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
thf(c_0_17,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( X1 @ ( epred3_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
thf(c_0_18,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred4_0 @ ( epred2_1 @ X1 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_19,negated_conjecture,
~ ( epred4_0 @ cC ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_10]) ).
thf(c_0_20,negated_conjecture,
! [X1: ( a > $o ) > $o,X3: a] :
( ( X1 @ ( epred2_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred1_1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_21,negated_conjecture,
! [X3: a,X1: ( a > $o ) > $o] :
( ( ( esk3_3 @ ( epred2_1 @ X1 ) @ X3 @ ( epred3_1 @ X1 ) )
= ( esk1_1 @ X1 ) )
| ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred4_0 @ ( epred2_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
thf(c_0_22,negated_conjecture,
( ( epred4_0 @ ( epred1_1 @ epred4_0 ) )
| ~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_23,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( epred4_0 @ ( epred1_1 @ X1 ) )
| ( X1 @ ( epred2_1 @ X1 ) )
| ( X1 @ cC ) ),
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
thf(c_0_24,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( epred4_0 @ ( epred3_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( epred4_0 @ ( epred2_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21])]) ).
thf(c_0_25,negated_conjecture,
epred4_0 @ ( epred1_1 @ epred4_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).
thf(c_0_26,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( X1 @ cC )
| ~ ( X1 @ ( epred3_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
( ( epred4_0 @ ( epred3_1 @ epred4_0 ) )
| ~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).
thf(c_0_28,negated_conjecture,
~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),c_0_19]) ).
thf(c_0_29,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) )
| ( X1 @ cC )
| ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU861^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n008.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 14:41:52 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rTBwh5X7Rh/E---3.1_3251621.p
% 0.09/0.27 % Version: 3.5.1-ho
% 0.09/0.27 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.27 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.27 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.09/0.27 % Starting ho_unfolding_1 with 300s (1) cores
% 0.09/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.27 % Starting ho_unfolding_2 with 300s (1) cores
% 0.09/0.27 % ho_unfolding_1 with pid 3251645 completed with status 0
% 0.09/0.27 % Result found by ho_unfolding_1
% 0.09/0.27 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.27 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.27 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.09/0.27 % Starting ho_unfolding_1 with 300s (1) cores
% 0.09/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27 % No SInE strategy applied
% 0.09/0.27 % Search class: HGUSF-FFSF31-SHHFFMBN
% 0.09/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.27 % SubtermCWHack with pid 3251648 completed with status 0
% 0.09/0.27 % Result found by SubtermCWHack
% 0.09/0.27 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.27 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.27 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.09/0.27 % Starting ho_unfolding_1 with 300s (1) cores
% 0.09/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27 % No SInE strategy applied
% 0.09/0.27 % Search class: HGUSF-FFSF31-SHHFFMBN
% 0.09/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.27 % Preprocessing time : 0.001 s
% 0.09/0.27
% 0.09/0.27 % Proof found!
% 0.09/0.27 % SZS status Theorem
% 0.09/0.27 % SZS output start CNFRefutation
% See solution above
% 0.09/0.27 % Parsed axioms : 4
% 0.09/0.27 % Removed by relevancy pruning/SinE : 0
% 0.09/0.27 % Initial clauses : 15
% 0.09/0.27 % Removed in clause preprocessing : 3
% 0.09/0.27 % Initial clauses in saturation : 12
% 0.09/0.27 % Processed clauses : 33
% 0.09/0.27 % ...of these trivial : 0
% 0.09/0.27 % ...subsumed : 3
% 0.09/0.27 % ...remaining for further processing : 30
% 0.09/0.27 % Other redundant clauses eliminated : 2
% 0.09/0.27 % Clauses deleted for lack of memory : 0
% 0.09/0.27 % Backward-subsumed : 3
% 0.09/0.27 % Backward-rewritten : 1
% 0.09/0.27 % Generated clauses : 33
% 0.09/0.27 % ...of the previous two non-redundant : 25
% 0.09/0.27 % ...aggressively subsumed : 0
% 0.09/0.27 % Contextual simplify-reflections : 0
% 0.09/0.27 % Paramodulations : 31
% 0.09/0.27 % Factorizations : 0
% 0.09/0.27 % NegExts : 0
% 0.09/0.27 % Equation resolutions : 2
% 0.09/0.27 % Disequality decompositions : 0
% 0.09/0.27 % Total rewrite steps : 5
% 0.09/0.27 % ...of those cached : 4
% 0.09/0.27 % Propositional unsat checks : 0
% 0.09/0.27 % Propositional check models : 0
% 0.09/0.27 % Propositional check unsatisfiable : 0
% 0.09/0.27 % Propositional clauses : 0
% 0.09/0.27 % Propositional clauses after purity: 0
% 0.09/0.27 % Propositional unsat core size : 0
% 0.09/0.27 % Propositional preprocessing time : 0.000
% 0.09/0.27 % Propositional encoding time : 0.000
% 0.09/0.27 % Propositional solver time : 0.000
% 0.09/0.27 % Success case prop preproc time : 0.000
% 0.09/0.27 % Success case prop encoding time : 0.000
% 0.09/0.27 % Success case prop solver time : 0.000
% 0.09/0.27 % Current number of processed clauses : 26
% 0.09/0.27 % Positive orientable unit clauses : 2
% 0.09/0.27 % Positive unorientable unit clauses: 0
% 0.09/0.27 % Negative unit clauses : 3
% 0.09/0.27 % Non-unit-clauses : 21
% 0.09/0.27 % Current number of unprocessed clauses: 0
% 0.09/0.27 % ...number of literals in the above : 0
% 0.09/0.27 % Current number of archived formulas : 0
% 0.09/0.27 % Current number of archived clauses : 4
% 0.09/0.27 % Clause-clause subsumption calls (NU) : 201
% 0.09/0.27 % Rec. Clause-clause subsumption calls : 17
% 0.09/0.27 % Non-unit clause-clause subsumptions : 5
% 0.09/0.27 % Unit Clause-clause subsumption calls : 8
% 0.09/0.27 % Rewrite failures with RHS unbound : 0
% 0.09/0.27 % BW rewrite match attempts : 1
% 0.09/0.27 % BW rewrite match successes : 1
% 0.09/0.27 % Condensation attempts : 0
% 0.09/0.27 % Condensation successes : 0
% 0.09/0.27 % Termbank termtop insertions : 2578
% 0.09/0.27 % Search garbage collected termcells : 496
% 0.09/0.27
% 0.09/0.27 % -------------------------------------------------
% 0.09/0.27 % User time : 0.006 s
% 0.09/0.27 % System time : 0.002 s
% 0.09/0.27 % Total time : 0.008 s
% 0.09/0.27 % Maximum resident set size: 3640 pages
% 0.09/0.27
% 0.09/0.27 % -------------------------------------------------
% 0.09/0.27 % User time : 0.007 s
% 0.09/0.27 % System time : 0.010 s
% 0.09/0.27 % Total time : 0.017 s
% 0.09/0.27 % Maximum resident set size: 4608 pages
% 0.09/0.27 % E exiting
%------------------------------------------------------------------------------