%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM769^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:17:04 AM UTC 2026
% Result : Theorem 1.33s 0.72s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 116 ( 46 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 360 ( 10 ~; 6 |; 3 &; 329 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 5 con; 0-3 aty)
% Number of variables : 80 ( 69 ^; 11 !; 0 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_26,type,
in: $i > $i > $o ).
thf(decl_73,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_78,type,
e_is: $i > $i > $i > $o ).
thf(decl_124,type,
nat: $i ).
thf(decl_125,type,
n_is: $i > $i > $o ).
thf(decl_128,type,
n_some: ( $i > $o ) > $o ).
thf(decl_143,type,
n_pl: $i > $i > $i ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_149,type,
d_29_ii: $i > $i > $o ).
thf(decl_163,type,
n_ts: $i > $i > $i ).
thf(decl_190,type,
frac: $i ).
thf(decl_192,type,
num: $i > $i ).
thf(decl_193,type,
den: $i > $i ).
thf(decl_194,type,
n_eq: $i > $i > $o ).
thf(decl_195,type,
moref: $i > $i > $o ).
thf(decl_199,type,
n_pf: $i > $i > $i ).
thf(decl_201,type,
d_367_w: $i > $i > $i ).
thf(decl_202,type,
esk1_0: $i ).
thf(decl_203,type,
esk2_0: $i ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_d_29_ii) ).
thf(def_moref,axiom,
( moref
= ( ^ [X1: $i,X449: $i] : ( d_29_ii @ ( n_ts @ ( num @ X1 ) @ ( den @ X449 ) ) @ ( n_ts @ ( num @ X449 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_moref) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_n_some) ).
thf(def_n_eq,axiom,
( n_eq
= ( ^ [X1: $i,X436: $i] : ( n_is @ ( n_ts @ ( num @ X1 ) @ ( den @ X436 ) ) @ ( n_ts @ ( num @ X436 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_n_eq) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',def_is_of) ).
thf(satz67d,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X578: $i] : ( in @ X578 @ frac )
@ ^ [X579: $i] :
( ( moref @ X1 @ X579 )
=> ( n_eq @ X1 @ ( n_pf @ X579 @ ( d_367_w @ X1 @ X579 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',satz67d) ).
thf(k_satz67c,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X576: $i] : ( in @ X576 @ frac )
@ ^ [X577: $i] :
( ( moref @ X1 @ X577 )
=> ( n_eq @ ( n_pf @ X577 @ ( d_367_w @ X1 @ X577 ) ) @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.O5Q3a6Ia3E/E---3.1_3476156.p',k_satz67c) ).
thf(c_0_11,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_12,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_13,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_11]) ).
thf(c_0_14,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_15,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moref]) ).
thf(c_0_17,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,def_n_some]),c_0_15]) ).
thf(c_0_18,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_n_eq]) ).
thf(c_0_19,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_20,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_21,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_13]) ).
thf(c_0_23,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X578: $i] : ( in @ X578 @ frac )
@ ^ [X579: $i] :
( ( moref @ X1 @ X579 )
=> ( n_eq @ X1 @ ( n_pf @ X579 @ ( d_367_w @ X1 @ X579 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz67d]) ).
thf(c_0_25,plain,
! [X654: $i] :
( ( in @ X654 @ frac )
=> ! [X653: $i] :
( ( in @ X653 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X654 ) @ ( den @ X653 ) )
= ( n_pl @ ( n_ts @ ( num @ X653 ) @ ( den @ X654 ) ) @ Z0 ) ) )
=> ( ( n_ts @ ( num @ ( n_pf @ X653 @ ( d_367_w @ X654 @ X653 ) ) ) @ ( den @ X654 ) )
= ( n_ts @ ( num @ X654 ) @ ( den @ ( n_pf @ X653 @ ( d_367_w @ X654 @ X653 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[k_satz67c]),c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_26,negated_conjecture,
~ ! [X621: $i] :
( ( in @ X621 @ frac )
=> ! [X620: $i] :
( ( in @ X620 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X621 ) @ ( den @ X620 ) )
= ( n_pl @ ( n_ts @ ( num @ X620 ) @ ( den @ X621 ) ) @ Z0 ) ) )
=> ( ( n_ts @ ( num @ X621 ) @ ( den @ ( n_pf @ X620 @ ( d_367_w @ X621 @ X620 ) ) ) )
= ( n_ts @ ( num @ ( n_pf @ X620 @ ( d_367_w @ X621 @ X620 ) ) ) @ ( den @ X621 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_24]),c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_27,plain,
! [X979: $i,X980: $i] :
( ~ ( in @ X979 @ frac )
| ~ ( in @ X980 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X979 ) @ ( den @ X980 ) )
= ( n_pl @ ( n_ts @ ( num @ X980 ) @ ( den @ X979 ) ) @ Z0 ) ) )
| ( ( n_ts @ ( num @ ( n_pf @ X980 @ ( d_367_w @ X979 @ X980 ) ) ) @ ( den @ X979 ) )
= ( n_ts @ ( num @ X979 ) @ ( den @ ( n_pf @ X980 @ ( d_367_w @ X979 @ X980 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_28,negated_conjecture,
( ( in @ esk1_0 @ frac )
& ( in @ esk2_0 @ frac )
& ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
= ( n_pl @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ Z0 ) ) )
& ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) )
!= ( n_ts @ ( num @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) @ ( den @ esk1_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
thf(c_0_29,plain,
! [X4: $i,X1: $i] :
( ( ( n_ts @ ( num @ ( n_pf @ X4 @ ( d_367_w @ X1 @ X4 ) ) ) @ ( den @ X1 ) )
= ( n_ts @ ( num @ X1 ) @ ( den @ ( n_pf @ X4 @ ( d_367_w @ X1 @ X4 ) ) ) ) )
| ~ ( in @ X1 @ frac )
| ~ ( in @ X4 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
= ( n_pl @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
= ( n_pl @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
in @ esk2_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
in @ esk1_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,negated_conjecture,
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) )
!= ( n_ts @ ( num @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) @ ( den @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM769^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.28 % Computer : n015.cluster.edu
% 0.12/0.28 % Model : x86_64 x86_64
% 0.12/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.28 % Memory : 8046.5625MB
% 0.12/0.28 % OS : Linux 6.8.0-71-generic
% 0.12/0.28 % CPULimit : 300
% 0.12/0.28 % WCLimit : 300
% 0.12/0.28 % DateTime : Tue Sep 29 12:58:17 UTC 2026
% 0.12/0.29 % CPUTime :
% 0.12/0.29 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.29/0.36 Running higher-order theorem proving
% 0.33/0.48 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.O5Q3a6Ia3E/E---3.1_3476156.p
% 1.33/0.71 % Version: 3.5.1-ho
% 1.33/0.71 % Preprocessing class: HSLMSMSMLLLCHSA.
% 1.33/0.71 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.71 % Starting pre_casc_4 with 1200s (4) cores
% 1.33/0.71 % Starting full_lambda_6 with 300s (1) cores
% 1.33/0.71 % Starting sh10 with 300s (1) cores
% 1.33/0.71 % Starting post_as_ho9 with 300s (1) cores
% 1.33/0.71 % Starting post_as_ho8 with 300s (1) cores
% 1.33/0.71 % pre_casc_4 with pid 3476169 completed with status 0
% 1.33/0.71 % Result found by pre_casc_4
% 1.33/0.71 % Preprocessing class: HSLMSMSMLLLCHSA.
% 1.33/0.71 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.71 % Starting pre_casc_4 with 1200s (4) cores
% 1.33/0.71 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 1.33/0.71 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.33/0.71 % Search class: HGUSM-FSLM31-DHSMMFBN
% 1.33/0.71 % partial match(2): HGUSM-FSLM31-DHSFFFBN
% 1.33/0.71 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 1.33/0.71 % Starting SubtermCWHack with 109s (1) cores
% 1.33/0.71 % Starting pre_casc_4 with 121s (1) cores
% 1.33/0.71 % Starting sh5l with 135s (1) cores
% 1.33/0.72 % Starting ehoh_best8_lambda with 135s (1) cores
% 1.33/0.72 % pre_casc_4 with pid 3476175 completed with status 0
% 1.33/0.72 % Result found by pre_casc_4
% 1.33/0.72 % Preprocessing class: HSLMSMSMLLLCHSA.
% 1.33/0.72 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.72 % Starting pre_casc_4 with 1200s (4) cores
% 1.33/0.72 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 1.33/0.72 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.33/0.72 % Search class: HGUSM-FSLM31-DHSMMFBN
% 1.33/0.72 % partial match(2): HGUSM-FSLM31-DHSFFFBN
% 1.33/0.72 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 1.33/0.72 % Starting SubtermCWHack with 109s (1) cores
% 1.33/0.72 % Starting pre_casc_4 with 121s (1) cores
% 1.33/0.72 % Preprocessing time : 0.010 s
% 1.33/0.72 % Presaturation interreduction done
% 1.33/0.72
% 1.33/0.72 % Proof found!
% 1.33/0.72 % SZS status Theorem
% 1.33/0.72 % SZS output start CNFRefutation
% See solution above
% 1.33/0.72 % Parsed axioms : 613
% 1.33/0.72 % Removed by relevancy pruning/SinE : 451
% 1.33/0.72 % Initial clauses : 160
% 1.33/0.72 % Removed in clause preprocessing : 12
% 1.33/0.72 % Initial clauses in saturation : 148
% 1.33/0.72 % Processed clauses : 305
% 1.33/0.72 % ...of these trivial : 2
% 1.33/0.72 % ...subsumed : 50
% 1.33/0.72 % ...remaining for further processing : 253
% 1.33/0.72 % Other redundant clauses eliminated : 20
% 1.33/0.72 % Clauses deleted for lack of memory : 0
% 1.33/0.72 % Backward-subsumed : 0
% 1.33/0.72 % Backward-rewritten : 5
% 1.33/0.72 % Generated clauses : 493
% 1.33/0.72 % ...of the previous two non-redundant : 458
% 1.33/0.72 % ...aggressively subsumed : 0
% 1.33/0.72 % Contextual simplify-reflections : 0
% 1.33/0.72 % Paramodulations : 281
% 1.33/0.72 % Factorizations : 0
% 1.33/0.72 % NegExts : 0
% 1.33/0.72 % Equation resolutions : 21
% 1.33/0.72 % Disequality decompositions : 0
% 1.33/0.72 % Total rewrite steps : 50
% 1.33/0.72 % ...of those cached : 26
% 1.33/0.72 % Propositional unsat checks : 0
% 1.33/0.72 % Propositional check models : 0
% 1.33/0.72 % Propositional check unsatisfiable : 0
% 1.33/0.72 % Propositional clauses : 0
% 1.33/0.72 % Propositional clauses after purity: 0
% 1.33/0.72 % Propositional unsat core size : 0
% 1.33/0.72 % Propositional preprocessing time : 0.000
% 1.33/0.72 % Propositional encoding time : 0.000
% 1.33/0.72 % Propositional solver time : 0.000
% 1.33/0.72 % Success case prop preproc time : 0.000
% 1.33/0.72 % Success case prop encoding time : 0.000
% 1.33/0.72 % Success case prop solver time : 0.000
% 1.33/0.72 % Current number of processed clauses : 134
% 1.33/0.72 % Positive orientable unit clauses : 47
% 1.33/0.72 % Positive unorientable unit clauses: 0
% 1.33/0.72 % Negative unit clauses : 14
% 1.33/0.72 % Non-unit-clauses : 73
% 1.33/0.72 % Current number of unprocessed clauses: 393
% 1.33/0.72 % ...number of literals in the above : 1910
% 1.33/0.72 % Current number of archived formulas : 0
% 1.33/0.72 % Current number of archived clauses : 111
% 1.33/0.72 % Clause-clause subsumption calls (NU) : 8342
% 1.33/0.72 % Rec. Clause-clause subsumption calls : 1262
% 1.33/0.72 % Non-unit clause-clause subsumptions : 47
% 1.33/0.72 % Unit Clause-clause subsumption calls : 145
% 1.33/0.72 % Rewrite failures with RHS unbound : 0
% 1.33/0.72 % BW rewrite match attempts : 13
% 1.33/0.72 % BW rewrite match successes : 5
% 1.33/0.72 % Condensation attempts : 0
% 1.33/0.72 % Condensation successes : 0
% 1.33/0.72 % Termbank termtop insertions : 69816
% 1.33/0.72 % Search garbage collected termcells : 21279
% 1.33/0.72
% 1.33/0.72 % -------------------------------------------------
% 1.33/0.72 % User time : 0.127 s
% 1.33/0.72 % System time : 0.017 s
% 1.33/0.72 % Total time : 0.144 s
% 1.33/0.72 % Maximum resident set size: 7880 pages
% 1.33/0.72
% 1.33/0.72 % -------------------------------------------------
% 1.33/0.72 % User time : 0.442 s
% 1.33/0.72 % System time : 0.062 s
% 1.33/0.72 % Total time : 0.504 s
% 1.33/0.72 % Maximum resident set size: 5632 pages
% 1.33/0.72 % E exiting
%------------------------------------------------------------------------------