%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV058^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 : 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 : Wed Sep 30 08:35:53 AM UTC 2026
% Result : Theorem 0.06s 0.26s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 240 ( 19 equ; 0 cnn)
% Maximal formula atoms : 48 ( 7 avg)
% Number of connectives : 433 ( 44 ~; 52 |; 14 &; 314 @)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 30 !; 2 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
epred1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_24,type,
epred2_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_25,type,
esk1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i ).
thf(decl_26,type,
epred3_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_27,type,
epred4_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_28,type,
epred5_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_29,type,
epred6_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(cTHM122_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( X1 @ X2 @ X3 )
=> ! [X4: $i] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
& ! [X5: $i > $o] : ( X1 @ X5 @ X5 )
& ! [X5: $i > $o,X6: $i > $o,X7: $i > $o] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X7 ) )
=> ( X1 @ X5 @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QCtLMRkyW3/E---3.1_465408.p',cTHM122_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( X1 @ X2 @ X3 )
=> ! [X4: $i] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
& ! [X5: $i > $o] : ( X1 @ X5 @ X5 )
& ! [X5: $i > $o,X6: $i > $o,X7: $i > $o] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X7 ) )
=> ( X1 @ X5 @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM122_pme]) ).
thf(c_0_2,negated_conjecture,
! [X16: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X16 @ ( epred4_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ( X16 @ ( epred1_1 @ X16 ) @ ( epred2_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( X16 @ ( epred1_1 @ X16 ) @ ( epred2_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ~ ( X16 @ ( epred4_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( X16 @ ( epred1_1 @ X16 ) @ ( epred2_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ( X16 @ ( epred4_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ( epred1_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( epred1_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ~ ( X16 @ ( epred4_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( epred1_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ( X16 @ ( epred4_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ~ ( epred2_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ~ ( epred2_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) )
& ( ~ ( X16 @ ( epred4_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ~ ( epred2_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred3_1 @ X16 ) @ ( epred3_1 @ X16 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred4_1 @ X1 ) @ ( epred5_1 @ X1 ) )
| ( X1 @ ( epred1_1 @ X1 ) @ ( epred2_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred1_1 @ X1 ) @ ( epred2_1 @ X1 ) )
| ~ ( X1 @ ( epred4_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) )
| ( ( epred2_1 @ $eq )
= ( epred1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( ( epred2_1 @ $eq )
= ( epred1_1 @ $eq ) )
| ( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X44: $i] :
( ( ( epred2_1 @ $eq @ X44 )
<=> ( epred1_1 @ $eq @ X44 ) )
| ( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred4_1 @ X1 ) @ ( epred5_1 @ X1 ) )
| ( epred1_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred4_1 @ X1 ) @ ( epred5_1 @ X1 ) )
| ~ ( epred2_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X1 @ ( epred4_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ~ ( epred2_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X39: $i] :
( ( ( epred2_1 @ $eq @ X39 )
<=> ( epred1_1 @ $eq @ X39 ) )
| ( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) ) ),
inference(arg_cong,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( epred1_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred4_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ( X1 @ ( epred1_1 @ X1 ) @ ( epred2_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X4: $i] :
( ( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) )
| ( epred2_1 @ $eq @ X4 )
| ~ ( epred1_1 @ $eq @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
( ( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) )
| ( epred1_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8]) ).
thf(c_0_16,negated_conjecture,
( ( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) )
| ~ ( epred2_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_9]) ).
thf(c_0_17,negated_conjecture,
( ( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) )
| ~ ( epred2_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_10]) ).
thf(c_0_18,negated_conjecture,
! [X4: $i] :
( ( epred2_1 @ $eq @ X4 )
| ( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) )
| ~ ( epred1_1 @ $eq @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_1 @ $eq @ ( esk1_1 @ $eq ) )
| ( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_12]) ).
thf(c_0_20,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ( ( epred2_1 @ $eq )
= ( epred1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_13]) ).
thf(c_0_21,negated_conjecture,
( ( epred5_1 @ $eq )
= ( epred4_1 @ $eq ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_22,negated_conjecture,
( ( epred6_1 @ $eq )
!= ( epred4_1 @ $eq ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_23,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ~ ( epred2_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_24,negated_conjecture,
( ( epred2_1 @ $eq )
= ( epred1_1 @ $eq ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ( epred1_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred3_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_26,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ~ ( epred2_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X75: $i] :
( ( epred2_1 @ $eq @ X75 )
<=> ( epred1_1 @ $eq @ X75 ) ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ( epred1_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_25]) ).
thf(c_0_29,negated_conjecture,
~ ( epred2_1 @ $eq @ ( esk1_1 @ $eq ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_21]),c_0_22]) ).
thf(c_0_30,negated_conjecture,
! [X4: $i] :
( ( epred2_1 @ $eq @ X4 )
| ~ ( epred1_1 @ $eq @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
epred1_1 @ $eq @ ( esk1_1 @ $eq ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21]),c_0_22]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV058^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.06/0.17 % Computer : n016.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 15:10:34 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running higher-order theorem proving
% 0.06/0.22 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.QCtLMRkyW3/E---3.1_465408.p
% 0.06/0.26 % Version: 3.5.1-ho
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting sh2lt with 1200s (4) cores
% 0.06/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.06/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.06/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.06/0.26 % Starting ehoh_best3_rw with 300s (1) cores
% 0.06/0.26 % sh2lt with pid 465435 completed with status 0
% 0.06/0.26 % Result found by sh2lt
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting sh2lt with 1200s (4) cores
% 0.06/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.06/0.26 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.06/0.26 % Search class: HGHNF-FFSF11-SHHFFMBN
% 0.06/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.06/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.06/0.26 % Starting sh2lt with 121s (1) cores
% 0.06/0.26 % Starting post_as_ho1 with 109s (1) cores
% 0.06/0.26 % Starting ehoh_best_sine_rwall with 109s (1) cores
% 0.06/0.26 % SubtermCWHack with pid 465441 completed with status 10
% 0.06/0.26 % Starting lpo1_def_fix with 109s (1) cores
% 0.06/0.26 % post_as_ho1 with pid 465445 completed with status 10
% 0.06/0.26 % Starting ehoh_best3_rw with 109s (1) cores
% 0.06/0.26 % sh2lt with pid 465442 completed with status 0
% 0.06/0.26 % Result found by sh2lt
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting sh2lt with 1200s (4) cores
% 0.06/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.06/0.26 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.06/0.26 % Search class: HGHNF-FFSF11-SHHFFMBN
% 0.06/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.06/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.06/0.26 % Starting sh2lt with 121s (1) cores
% 0.06/0.26 % Preprocessing time : 0.001 s
% 0.06/0.26 % Presaturation interreduction done
% 0.06/0.26
% 0.06/0.26 % Proof found!
% 0.06/0.26 % SZS status Theorem
% 0.06/0.26 % SZS output start CNFRefutation
% See solution above
% 0.06/0.26 % Parsed axioms : 1
% 0.06/0.26 % Removed by relevancy pruning/SinE : 0
% 0.06/0.26 % Initial clauses : 9
% 0.06/0.26 % Removed in clause preprocessing : 0
% 0.06/0.26 % Initial clauses in saturation : 9
% 0.06/0.26 % Processed clauses : 86
% 0.06/0.26 % ...of these trivial : 0
% 0.06/0.26 % ...subsumed : 9
% 0.06/0.26 % ...remaining for further processing : 77
% 0.06/0.26 % Other redundant clauses eliminated : 0
% 0.06/0.26 % Clauses deleted for lack of memory : 0
% 0.06/0.26 % Backward-subsumed : 12
% 0.06/0.26 % Backward-rewritten : 10
% 0.06/0.26 % Generated clauses : 150
% 0.06/0.26 % ...of the previous two non-redundant : 115
% 0.06/0.26 % ...aggressively subsumed : 0
% 0.06/0.26 % Contextual simplify-reflections : 2
% 0.06/0.26 % Paramodulations : 11
% 0.06/0.26 % Factorizations : 0
% 0.06/0.26 % NegExts : 6
% 0.06/0.26 % Equation resolutions : 0
% 0.06/0.26 % Disequality decompositions : 0
% 0.06/0.26 % Total rewrite steps : 11
% 0.06/0.26 % ...of those cached : 8
% 0.06/0.26 % Propositional unsat checks : 0
% 0.06/0.26 % Propositional check models : 0
% 0.06/0.26 % Propositional check unsatisfiable : 0
% 0.06/0.26 % Propositional clauses : 0
% 0.06/0.26 % Propositional clauses after purity: 0
% 0.06/0.26 % Propositional unsat core size : 0
% 0.06/0.26 % Propositional preprocessing time : 0.000
% 0.06/0.26 % Propositional encoding time : 0.000
% 0.06/0.26 % Propositional solver time : 0.000
% 0.06/0.26 % Success case prop preproc time : 0.000
% 0.06/0.26 % Success case prop encoding time : 0.000
% 0.06/0.26 % Success case prop solver time : 0.000
% 0.06/0.26 % Current number of processed clauses : 25
% 0.06/0.26 % Positive orientable unit clauses : 4
% 0.06/0.26 % Positive unorientable unit clauses: 0
% 0.06/0.26 % Negative unit clauses : 3
% 0.06/0.26 % Non-unit-clauses : 18
% 0.06/0.26 % Current number of unprocessed clauses: 43
% 0.06/0.26 % ...number of literals in the above : 134
% 0.06/0.26 % Current number of archived formulas : 0
% 0.06/0.26 % Current number of archived clauses : 52
% 0.06/0.26 % Clause-clause subsumption calls (NU) : 103
% 0.06/0.26 % Rec. Clause-clause subsumption calls : 56
% 0.06/0.26 % Non-unit clause-clause subsumptions : 12
% 0.06/0.26 % Unit Clause-clause subsumption calls : 39
% 0.06/0.26 % Rewrite failures with RHS unbound : 0
% 0.06/0.26 % BW rewrite match attempts : 2
% 0.06/0.26 % BW rewrite match successes : 2
% 0.06/0.26 % Condensation attempts : 0
% 0.06/0.26 % Condensation successes : 0
% 0.06/0.26 % Termbank termtop insertions : 31850
% 0.06/0.26 % Search garbage collected termcells : 180
% 0.06/0.26
% 0.06/0.26 % -------------------------------------------------
% 0.06/0.26 % User time : 0.016 s
% 0.06/0.26 % System time : 0.007 s
% 0.06/0.26 % Total time : 0.022 s
% 0.06/0.26 % Maximum resident set size: 3632 pages
% 0.06/0.26
% 0.06/0.26 % -------------------------------------------------
% 0.06/0.26 % User time : 0.042 s
% 0.06/0.26 % System time : 0.014 s
% 0.06/0.26 % Total time : 0.056 s
% 0.06/0.26 % Maximum resident set size: 4864 pages
% 0.06/0.26 % E exiting
%------------------------------------------------------------------------------