%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP070^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:04:16 AM UTC 2026
% Result : Theorem 0.50s 0.44s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 22 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 692 ( 18 ~; 12 |; 9 &; 641 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 44 ( 0 ^; 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
multiset_a: $tType ).
thf(decl_sort2,type,
tree_a: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_28,type,
heapIm1140443833left_a: tree_a > tree_a ).
thf(decl_31,type,
heapIm1257206334ight_a: tree_a > tree_a ).
thf(decl_32,type,
heapIm1091024090Down_a: tree_a > tree_a ).
thf(decl_36,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(decl_39,type,
multiset_a2: tree_a > multiset_a ).
thf(decl_40,type,
val_a: tree_a > a ).
thf(decl_51,type,
ord_less_eq_a: a > a > $o ).
thf(decl_63,type,
l1: tree_a ).
thf(decl_64,type,
l2: tree_a ).
thf(decl_65,type,
r1: tree_a ).
thf(decl_66,type,
r2: tree_a ).
thf(decl_67,type,
v1: a ).
thf(decl_68,type,
v2: a ).
thf(decl_69,type,
v: a ).
thf(conj_0,conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p',conj_0) ).
thf(fact_31_siftDown_Osimps_I5_J,axiom,
! [X16: a,X17: tree_a,X18: tree_a,X19: a,X20: tree_a,X21: tree_a,X2: a] :
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( heapIm1140443833left_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X19 @ X20 @ X21 ) ) ) ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( t_a @ X19 @ X20 @ X21 ) @ ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( heapIm1140443833left_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X16 @ X17 @ X18 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p',fact_31_siftDown_Osimps_I5_J) ).
thf(fact_30_val_Osimps,axiom,
! [X2: a,X39: tree_a,X40: tree_a] :
( ( val_a @ ( t_a @ X2 @ X39 @ X40 ) )
= X2 ),
file('/export/starexec/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p',fact_30_val_Osimps) ).
thf(fact_1_True,axiom,
ord_less_eq_a @ v1 @ v,
file('/export/starexec/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p',fact_1_True) ).
thf(fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062,axiom,
ord_less_eq_a @ v2 @ v1,
file('/export/starexec/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p',fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062) ).
thf(c_0_5,negated_conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,plain,
! [X16: a,X17: tree_a,X18: tree_a,X19: a,X20: tree_a,X21: tree_a,X2: a] :
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( heapIm1140443833left_a @ ( t_a @ X19 @ X20 @ X21 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X19 @ X20 @ X21 ) ) ) ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( val_a @ ( t_a @ X19 @ X20 @ X21 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ X2 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X19 @ X20 @ X21 ) @ ( t_a @ X16 @ X17 @ X18 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( t_a @ X19 @ X20 @ X21 ) @ ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( heapIm1140443833left_a @ ( t_a @ X16 @ X17 @ X18 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X16 @ X17 @ X18 ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_31_siftDown_Osimps_I5_J]) ).
thf(c_0_7,negated_conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1214: a,X1215: tree_a,X1216: tree_a,X1217: a,X1218: tree_a,X1219: tree_a,X1220: a] :
( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) @ X1220 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
= ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) @ X1220 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( heapIm1140443833left_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) ) ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ X1220 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
= ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
| ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ X1220 )
| ( ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( t_a @ X1214 @ X1215 @ X1216 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( t_a @ X1217 @ X1218 @ X1219 ) @ ( heapIm1091024090Down_a @ ( t_a @ X1220 @ ( heapIm1140443833left_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) ) ) ) )
| ( ord_less_eq_a @ ( val_a @ ( t_a @ X1214 @ X1215 @ X1216 ) ) @ ( val_a @ ( t_a @ X1217 @ X1218 @ X1219 ) ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_9,plain,
! [X958: a,X959: tree_a,X960: tree_a] :
( ( val_a @ ( t_a @ X958 @ X959 @ X960 ) )
= X958 ),
inference(variable_rename,[status(thm)],[fact_30_val_Osimps]) ).
thf(c_0_10,negated_conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X8: a,X6: a,X5: tree_a,X4: tree_a,X1: tree_a,X2: a,X3: tree_a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X2 @ X1 @ X3 ) @ ( t_a @ X8 @ X4 @ X5 ) ) )
= ( t_a @ X6 @ ( t_a @ X2 @ X1 @ X3 ) @ ( t_a @ X8 @ X4 @ X5 ) ) )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X2 @ X1 @ X3 ) ) @ X6 )
| ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X8 @ X4 @ X5 ) ) @ ( val_a @ ( t_a @ X2 @ X1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X3: tree_a,X1: tree_a,X2: a] :
( ( val_a @ ( t_a @ X2 @ X1 @ X3 ) )
= X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X3: tree_a,X1: tree_a,X4: tree_a,X2: a,X5: tree_a,X8: a,X6: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X2 @ ( t_a @ X6 @ X1 @ X3 ) @ ( t_a @ X8 @ X4 @ X5 ) ) )
= ( t_a @ X2 @ ( t_a @ X6 @ X1 @ X3 ) @ ( t_a @ X8 @ X4 @ X5 ) ) )
| ~ ( ord_less_eq_a @ X6 @ X2 )
| ~ ( ord_less_eq_a @ X8 @ X6 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]),c_0_12]) ).
thf(c_0_15,plain,
ord_less_eq_a @ v1 @ v,
inference(split_conjunct,[status(thm)],[fact_1_True]) ).
thf(c_0_16,plain,
ord_less_eq_a @ v2 @ v1,
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062]) ).
thf(c_0_17,negated_conjecture,
$false,
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_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP070^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.19 % Computer : n014.cluster.edu
% 0.12/0.19 % Model : x86_64 x86_64
% 0.12/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.19 % Memory : 8046.5625MB
% 0.12/0.19 % OS : Linux 6.8.0-71-generic
% 0.12/0.19 % CPULimit : 300
% 0.12/0.19 % WCLimit : 300
% 0.12/0.19 % DateTime : Tue Sep 29 19:46:29 UTC 2026
% 0.12/0.19 % CPUTime :
% 0.12/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.24 Running higher-order theorem proving
% 0.12/0.28 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.HqNh17Fdqt/E---3.1_3122061.p
% 0.50/0.44 % Version: 3.5.1-ho
% 0.50/0.44 % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.50/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.44 % Starting lpo5_fix with 1500s (5) cores
% 0.50/0.44 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.50/0.44 % Starting post_as_ho8 with 300s (1) cores
% 0.50/0.44 % Starting lpo5_rw_fix with 300s (1) cores
% 0.50/0.44 % post_as_ho8 with pid 3122076 completed with status 0
% 0.50/0.44 % Result found by post_as_ho8
% 0.50/0.44 % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.50/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.44 % Starting lpo5_fix with 1500s (5) cores
% 0.50/0.44 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.50/0.44 % Starting post_as_ho8 with 300s (1) cores
% 0.50/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.50/0.44 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.50/0.44 % Search class: HGUSM-FSLM31-MHFFFSBN
% 0.50/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.50/0.44 % SubtermCWHack with pid 3122078 completed with status 0
% 0.50/0.44 % Result found by SubtermCWHack
% 0.50/0.44 % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.50/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.44 % Starting lpo5_fix with 1500s (5) cores
% 0.50/0.44 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.50/0.44 % Starting post_as_ho8 with 300s (1) cores
% 0.50/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.50/0.44 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.50/0.44 % Search class: HGUSM-FSLM31-MHFFFSBN
% 0.50/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.50/0.44 % Preprocessing time : 0.004 s
% 0.50/0.44
% 0.50/0.44 % Proof found!
% 0.50/0.44 % SZS status Theorem
% 0.50/0.44 % SZS output start CNFRefutation
% See solution above
% 0.50/0.44 % Parsed axioms : 269
% 0.50/0.44 % Removed by relevancy pruning/SinE : 138
% 0.50/0.44 % Initial clauses : 367
% 0.50/0.44 % Removed in clause preprocessing : 12
% 0.50/0.44 % Initial clauses in saturation : 355
% 0.50/0.44 % Processed clauses : 2464
% 0.50/0.44 % ...of these trivial : 161
% 0.50/0.44 % ...subsumed : 1745
% 0.50/0.44 % ...remaining for further processing : 558
% 0.50/0.44 % Other redundant clauses eliminated : 173
% 0.50/0.44 % Clauses deleted for lack of memory : 0
% 0.50/0.44 % Backward-subsumed : 20
% 0.50/0.44 % Backward-rewritten : 25
% 0.50/0.44 % Generated clauses : 8889
% 0.50/0.44 % ...of the previous two non-redundant : 7095
% 0.50/0.44 % ...aggressively subsumed : 0
% 0.50/0.44 % Contextual simplify-reflections : 2
% 0.50/0.44 % Paramodulations : 8688
% 0.50/0.44 % Factorizations : 24
% 0.50/0.44 % NegExts : 0
% 0.50/0.44 % Equation resolutions : 184
% 0.50/0.44 % Disequality decompositions : 0
% 0.50/0.44 % Total rewrite steps : 3968
% 0.50/0.44 % ...of those cached : 3295
% 0.50/0.44 % Propositional unsat checks : 0
% 0.50/0.44 % Propositional check models : 0
% 0.50/0.44 % Propositional check unsatisfiable : 0
% 0.50/0.44 % Propositional clauses : 0
% 0.50/0.44 % Propositional clauses after purity: 0
% 0.50/0.44 % Propositional unsat core size : 0
% 0.50/0.44 % Propositional preprocessing time : 0.000
% 0.50/0.44 % Propositional encoding time : 0.000
% 0.50/0.44 % Propositional solver time : 0.000
% 0.50/0.44 % Success case prop preproc time : 0.000
% 0.50/0.44 % Success case prop encoding time : 0.000
% 0.50/0.44 % Success case prop solver time : 0.000
% 0.50/0.44 % Current number of processed clauses : 489
% 0.50/0.44 % Positive orientable unit clauses : 107
% 0.50/0.44 % Positive unorientable unit clauses: 3
% 0.50/0.44 % Negative unit clauses : 41
% 0.50/0.44 % Non-unit-clauses : 338
% 0.50/0.44 % Current number of unprocessed clauses: 4885
% 0.50/0.44 % ...number of literals in the above : 12068
% 0.50/0.44 % Current number of archived formulas : 0
% 0.50/0.44 % Current number of archived clauses : 45
% 0.50/0.44 % Clause-clause subsumption calls (NU) : 79069
% 0.50/0.44 % Rec. Clause-clause subsumption calls : 53354
% 0.50/0.44 % Non-unit clause-clause subsumptions : 1371
% 0.50/0.44 % Unit Clause-clause subsumption calls : 4251
% 0.50/0.44 % Rewrite failures with RHS unbound : 0
% 0.50/0.44 % BW rewrite match attempts : 224
% 0.50/0.44 % BW rewrite match successes : 30
% 0.50/0.44 % Condensation attempts : 0
% 0.50/0.44 % Condensation successes : 0
% 0.50/0.44 % Termbank termtop insertions : 108563
% 0.50/0.44 % Search garbage collected termcells : 7241
% 0.50/0.44
% 0.50/0.44 % -------------------------------------------------
% 0.50/0.44 % User time : 0.114 s
% 0.50/0.44 % System time : 0.010 s
% 0.50/0.44 % Total time : 0.124 s
% 0.50/0.44 % Maximum resident set size: 5332 pages
% 0.50/0.44
% 0.50/0.44 % -------------------------------------------------
% 0.50/0.44 % User time : 0.127 s
% 0.50/0.44 % System time : 0.013 s
% 0.50/0.44 % Total time : 0.140 s
% 0.50/0.44 % Maximum resident set size: 5376 pages
% 0.50/0.44 % E exiting
%------------------------------------------------------------------------------