%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP068^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:05:25 AM UTC 2026
% Result : Theorem 0.72s 0.38s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 61 ( 24 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 449 ( 19 ~; 13 |; 6 &; 406 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 9 con; 0-3 aty)
% Number of variables : 64 ( 0 ^; 64 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
tree_a: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_26,type,
heapIm1140443833left_a: tree_a > tree_a ).
thf(decl_27,type,
heapIm1257206334ight_a: tree_a > tree_a ).
thf(decl_28,type,
heapIm1091024090Down_a: tree_a > tree_a ).
thf(decl_29,type,
e_a: tree_a ).
thf(decl_30,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(decl_33,type,
is_heap_a: tree_a > $o ).
thf(decl_35,type,
val_a: tree_a > a ).
thf(decl_54,type,
ord_less_eq_a: a > a > $o ).
thf(decl_67,type,
l1: tree_a ).
thf(decl_68,type,
la: tree_a ).
thf(decl_70,type,
r1: tree_a ).
thf(decl_71,type,
ra: tree_a ).
thf(decl_74,type,
v1: a ).
thf(decl_75,type,
v2: a ).
thf(decl_76,type,
va: a ).
thf(fact_20_left_Osimps,axiom,
! [X1: a,X11: tree_a,X12: tree_a] :
( ( heapIm1140443833left_a @ ( t_a @ X1 @ X11 @ X12 ) )
= X11 ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_20_left_Osimps) ).
thf(fact_5__C4_Oprems_C_I3_J,axiom,
( ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) )
= ( t_a @ va @ la @ ra ) ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_5__C4_Oprems_C_I3_J) ).
thf(fact_22_val_Osimps,axiom,
! [X1: a,X33: tree_a,X34: tree_a] :
( ( val_a @ ( t_a @ X1 @ X33 @ X34 ) )
= X1 ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_22_val_Osimps) ).
thf(conj_0,conjecture,
is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',conj_0) ).
thf(fact_30_siftDown_Osimps_I4_J,axiom,
! [X39: a,X40: tree_a,X41: tree_a,X1: a] :
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ X1 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) )
= ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ X1 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ e_a @ ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( heapIm1140443833left_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X39 @ X40 @ X41 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_30_siftDown_Osimps_I4_J) ).
thf(fact_34_right_Osimps,axiom,
! [X1: a,X11: tree_a,X12: tree_a] :
( ( heapIm1257206334ight_a @ ( t_a @ X1 @ X11 @ X12 ) )
= X12 ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_34_right_Osimps) ).
thf(fact_32_is__heap_Osimps_I3_J,axiom,
! [X1: a,X39: a,X40: tree_a,X41: tree_a] :
( ( is_heap_a @ ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) )
<=> ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ X1 )
& ( is_heap_a @ ( t_a @ X39 @ X40 @ X41 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_32_is__heap_Osimps_I3_J) ).
thf(fact_4_True,axiom,
ord_less_eq_a @ v1 @ v2,
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_4_True) ).
thf(fact_0__C4_Oprems_C_I2_J,axiom,
is_heap_a @ ra,
file('/export/starexec/sandbox/tmp/tmp.bfMBYuSCBT/E---3.1_3829874.p',fact_0__C4_Oprems_C_I2_J) ).
thf(c_0_9,plain,
! [X1150: a,X1151: tree_a,X1152: tree_a] :
( ( heapIm1140443833left_a @ ( t_a @ X1150 @ X1151 @ X1152 ) )
= X1151 ),
inference(variable_rename,[status(thm)],[fact_20_left_Osimps]) ).
thf(c_0_10,plain,
! [X1: a,X5: tree_a,X2: tree_a] :
( ( heapIm1140443833left_a @ ( t_a @ X1 @ X2 @ X5 ) )
= X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,plain,
( ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) )
= ( t_a @ va @ la @ ra ) ),
inference(split_conjunct,[status(thm)],[fact_5__C4_Oprems_C_I3_J]) ).
thf(c_0_12,plain,
! [X923: a,X924: tree_a,X925: tree_a] :
( ( val_a @ ( t_a @ X923 @ X924 @ X925 ) )
= X923 ),
inference(variable_rename,[status(thm)],[fact_22_val_Osimps]) ).
thf(c_0_13,plain,
la = e_a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_15,plain,
! [X39: a,X40: tree_a,X41: tree_a,X1: a] :
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ X1 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) )
= ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ X1 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ e_a @ ( t_a @ X39 @ X40 @ X41 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ e_a @ ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( heapIm1140443833left_a @ ( t_a @ X39 @ X40 @ X41 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X39 @ X40 @ X41 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_30_siftDown_Osimps_I4_J]) ).
thf(c_0_16,plain,
! [X5: tree_a,X2: tree_a,X1: a] :
( ( val_a @ ( t_a @ X1 @ X2 @ X5 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
( ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) )
= ( t_a @ va @ e_a @ ra ) ),
inference(rw,[status(thm)],[c_0_11,c_0_13]) ).
thf(c_0_18,negated_conjecture,
~ ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X866: a,X867: tree_a,X868: tree_a,X869: a] :
( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X866 @ X867 @ X868 ) ) @ X869 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X869 @ e_a @ ( t_a @ X866 @ X867 @ X868 ) ) )
= ( t_a @ X869 @ e_a @ ( t_a @ X866 @ X867 @ X868 ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X866 @ X867 @ X868 ) ) @ X869 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X869 @ e_a @ ( t_a @ X866 @ X867 @ X868 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X866 @ X867 @ X868 ) ) @ e_a @ ( heapIm1091024090Down_a @ ( t_a @ X869 @ ( heapIm1140443833left_a @ ( t_a @ X866 @ X867 @ X868 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X866 @ X867 @ X868 ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
thf(c_0_20,plain,
! [X1147: a,X1148: tree_a,X1149: tree_a] :
( ( heapIm1257206334ight_a @ ( t_a @ X1147 @ X1148 @ X1149 ) )
= X1149 ),
inference(variable_rename,[status(thm)],[fact_34_right_Osimps]) ).
thf(c_0_21,plain,
va = v2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_16]) ).
thf(c_0_22,plain,
! [X827: a,X828: a,X829: tree_a,X830: tree_a] :
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X828 @ X829 @ X830 ) ) @ X827 )
| ~ ( is_heap_a @ ( t_a @ X827 @ e_a @ ( t_a @ X828 @ X829 @ X830 ) ) ) )
& ( ( is_heap_a @ ( t_a @ X828 @ X829 @ X830 ) )
| ~ ( is_heap_a @ ( t_a @ X827 @ e_a @ ( t_a @ X828 @ X829 @ X830 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X828 @ X829 @ X830 ) ) @ X827 )
| ~ ( is_heap_a @ ( t_a @ X828 @ X829 @ X830 ) )
| ( is_heap_a @ ( t_a @ X827 @ e_a @ ( t_a @ X828 @ X829 @ X830 ) ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_32_is__heap_Osimps_I3_J])])])]) ).
thf(c_0_23,negated_conjecture,
~ ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
thf(c_0_24,plain,
! [X1: a,X2: tree_a,X5: tree_a,X3: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X3 @ e_a @ ( t_a @ X1 @ X2 @ X5 ) ) )
= ( t_a @ X3 @ e_a @ ( t_a @ X1 @ X2 @ X5 ) ) )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X2 @ X5 ) ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,plain,
! [X1: a,X2: tree_a,X5: tree_a] :
( ( heapIm1257206334ight_a @ ( t_a @ X1 @ X2 @ X5 ) )
= X5 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
( ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) )
= ( t_a @ v2 @ e_a @ ra ) ),
inference(rw,[status(thm)],[c_0_17,c_0_21]) ).
thf(c_0_27,plain,
! [X1: a,X2: tree_a,X3: a,X5: tree_a] :
( ( is_heap_a @ ( t_a @ X3 @ e_a @ ( t_a @ X1 @ X2 @ X5 ) ) )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X2 @ X5 ) ) @ X3 )
| ~ ( is_heap_a @ ( t_a @ X1 @ X2 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,negated_conjecture,
~ ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v2 @ e_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
! [X5: tree_a,X3: a,X2: tree_a,X1: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ e_a @ ( t_a @ X3 @ X2 @ X5 ) ) )
= ( t_a @ X1 @ e_a @ ( t_a @ X3 @ X2 @ X5 ) ) )
| ~ ( ord_less_eq_a @ X3 @ X1 ) ),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
thf(c_0_30,plain,
( ( t_a @ v1 @ l1 @ r1 )
= ra ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]) ).
thf(c_0_31,plain,
ord_less_eq_a @ v1 @ v2,
inference(split_conjunct,[status(thm)],[fact_4_True]) ).
thf(c_0_32,plain,
! [X5: tree_a,X3: a,X2: tree_a,X1: a] :
( ( is_heap_a @ ( t_a @ X1 @ e_a @ ( t_a @ X3 @ X2 @ X5 ) ) )
| ~ ( is_heap_a @ ( t_a @ X3 @ X2 @ X5 ) )
| ~ ( ord_less_eq_a @ X3 @ X1 ) ),
inference(rw,[status(thm)],[c_0_27,c_0_16]) ).
thf(c_0_33,plain,
is_heap_a @ ra,
inference(split_conjunct,[status(thm)],[fact_0__C4_Oprems_C_I2_J]) ).
thf(c_0_34,negated_conjecture,
~ ( is_heap_a @ ( t_a @ v2 @ e_a @ ra ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
thf(c_0_35,plain,
! [X1: a] :
( ( is_heap_a @ ( t_a @ X1 @ e_a @ ra ) )
| ~ ( ord_less_eq_a @ v1 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_33])]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP068^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n007.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 19:44:56 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.26 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.bfMBYuSCBT/E---3.1_3829874.p
% 0.72/0.38 % Version: 3.5.1-ho
% 0.72/0.38 % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.72/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.38 % Starting full_lambda_5 with 1500s (5) cores
% 0.72/0.38 % Starting new_ho_12 with 300s (1) cores
% 0.72/0.38 % Starting pre_casc_5 with 300s (1) cores
% 0.72/0.38 % Starting full_lambda_9 with 300s (1) cores
% 0.72/0.38 % full_lambda_9 with pid 3829890 completed with status 0
% 0.72/0.38 % Result found by full_lambda_9
% 0.72/0.38 % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.72/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.38 % Starting full_lambda_5 with 1500s (5) cores
% 0.72/0.38 % Starting new_ho_12 with 300s (1) cores
% 0.72/0.38 % Starting pre_casc_5 with 300s (1) cores
% 0.72/0.38 % Starting full_lambda_9 with 300s (1) cores
% 0.72/0.38 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.72/0.38 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.72/0.38 % Search class: HGUSM-FSLM32-DHFFFSBN
% 0.72/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.72/0.38 % SubtermCWHack with pid 3829891 completed with status 0
% 0.72/0.38 % Result found by SubtermCWHack
% 0.72/0.38 % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.72/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.38 % Starting full_lambda_5 with 1500s (5) cores
% 0.72/0.38 % Starting new_ho_12 with 300s (1) cores
% 0.72/0.38 % Starting pre_casc_5 with 300s (1) cores
% 0.72/0.38 % Starting full_lambda_9 with 300s (1) cores
% 0.72/0.38 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.72/0.38 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.72/0.38 % Search class: HGUSM-FSLM32-DHFFFSBN
% 0.72/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.72/0.38 % Preprocessing time : 0.003 s
% 0.72/0.38
% 0.72/0.38 % Proof found!
% 0.72/0.38 % SZS status Theorem
% 0.72/0.38 % SZS output start CNFRefutation
% See solution above
% 0.72/0.38 % Parsed axioms : 240
% 0.72/0.38 % Removed by relevancy pruning/SinE : 101
% 0.72/0.38 % Initial clauses : 330
% 0.72/0.38 % Removed in clause preprocessing : 27
% 0.72/0.38 % Initial clauses in saturation : 303
% 0.72/0.38 % Processed clauses : 1475
% 0.72/0.38 % ...of these trivial : 85
% 0.72/0.38 % ...subsumed : 814
% 0.72/0.38 % ...remaining for further processing : 576
% 0.72/0.38 % Other redundant clauses eliminated : 206
% 0.72/0.38 % Clauses deleted for lack of memory : 0
% 0.72/0.38 % Backward-subsumed : 15
% 0.72/0.38 % Backward-rewritten : 19
% 0.72/0.38 % Generated clauses : 5342
% 0.72/0.38 % ...of the previous two non-redundant : 4164
% 0.72/0.38 % ...aggressively subsumed : 0
% 0.72/0.38 % Contextual simplify-reflections : 0
% 0.72/0.38 % Paramodulations : 4969
% 0.72/0.38 % Factorizations : 56
% 0.72/0.38 % NegExts : 0
% 0.72/0.38 % Equation resolutions : 214
% 0.72/0.38 % Disequality decompositions : 0
% 0.72/0.38 % Total rewrite steps : 1766
% 0.72/0.38 % ...of those cached : 1426
% 0.72/0.38 % Propositional unsat checks : 0
% 0.72/0.38 % Propositional check models : 0
% 0.72/0.38 % Propositional check unsatisfiable : 0
% 0.72/0.38 % Propositional clauses : 0
% 0.72/0.38 % Propositional clauses after purity: 0
% 0.72/0.38 % Propositional unsat core size : 0
% 0.72/0.38 % Propositional preprocessing time : 0.000
% 0.72/0.38 % Propositional encoding time : 0.000
% 0.72/0.38 % Propositional solver time : 0.000
% 0.72/0.38 % Success case prop preproc time : 0.000
% 0.72/0.38 % Success case prop encoding time : 0.000
% 0.72/0.38 % Success case prop solver time : 0.000
% 0.72/0.38 % Current number of processed clauses : 516
% 0.72/0.38 % Positive orientable unit clauses : 119
% 0.72/0.38 % Positive unorientable unit clauses: 1
% 0.72/0.38 % Negative unit clauses : 28
% 0.72/0.38 % Non-unit-clauses : 368
% 0.72/0.38 % Current number of unprocessed clauses: 2891
% 0.72/0.38 % ...number of literals in the above : 9838
% 0.72/0.38 % Current number of archived formulas : 0
% 0.72/0.38 % Current number of archived clauses : 48
% 0.72/0.38 % Clause-clause subsumption calls (NU) : 19492
% 0.72/0.38 % Rec. Clause-clause subsumption calls : 14603
% 0.72/0.38 % Non-unit clause-clause subsumptions : 668
% 0.72/0.38 % Unit Clause-clause subsumption calls : 1070
% 0.72/0.38 % Rewrite failures with RHS unbound : 0
% 0.72/0.38 % BW rewrite match attempts : 125
% 0.72/0.38 % BW rewrite match successes : 22
% 0.72/0.38 % Condensation attempts : 0
% 0.72/0.38 % Condensation successes : 0
% 0.72/0.38 % Termbank termtop insertions : 87513
% 0.72/0.38 % Search garbage collected termcells : 7355
% 0.72/0.38
% 0.72/0.38 % -------------------------------------------------
% 0.72/0.38 % User time : 0.085 s
% 0.72/0.38 % System time : 0.010 s
% 0.72/0.38 % Total time : 0.095 s
% 0.72/0.38 % Maximum resident set size: 5216 pages
% 0.72/0.38
% 0.72/0.38 % -------------------------------------------------
% 0.72/0.38 % User time : 0.093 s
% 0.72/0.38 % System time : 0.015 s
% 0.72/0.38 % Total time : 0.108 s
% 0.72/0.38 % Maximum resident set size: 5376 pages
% 0.72/0.38 % E exiting
%------------------------------------------------------------------------------