%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU481^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:26:17 AM UTC 2026
% Result : Theorem 0.38s 0.28s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 13 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 404 ( 56 ~; 40 |; 22 &; 245 @)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 2 con; 0-4 aty)
% Number of variables : 152 ( 32 ^; 114 !; 6 ?; 152 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_35,type,
trans: ( $i > $i > $o ) > $o ).
thf(decl_36,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_42,type,
term: ( $i > $i > $o ) > $o ).
thf(decl_43,type,
ind: ( $i > $i > $o ) > $o ).
thf(decl_52,type,
epred1_0: $i > $i > $o ).
thf(decl_53,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_54,type,
epred2_2: ( $i > $o ) > $i > $i > $i > $o ).
thf(decl_55,type,
epred3_0: $i > $o ).
thf(decl_56,type,
esk2_0: $i ).
thf(decl_57,type,
esk3_1: $i > $i ).
thf(transitive_closure,axiom,
( tc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
! [X2: $i > $i > $o] :
( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 ) )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',transitive_closure) ).
thf(subrel,axiom,
( subrel
= ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',subrel) ).
thf(transitive,axiom,
( trans
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X6 ) )
=> ( X1 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',transitive) ).
thf(satisfying_the_induction_principle,axiom,
( ind
= ( ^ [X1: $i > $i > $o] :
! [X8: $i > $o] :
( ! [X3: $i] :
( ! [X4: $i] :
( ( tc @ X1 @ X3 @ X4 )
=> ( X8 @ X4 ) )
=> ( X8 @ X3 ) )
=> ! [X3: $i] : ( X8 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',satisfying_the_induction_principle) ).
thf(induction_implies_termination,conjecture,
! [X1: $i > $i > $o] :
( ( ind @ X1 )
=> ( term @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',induction_implies_termination) ).
thf(terminating,axiom,
( term
= ( ^ [X1: $i > $i > $o] :
! [X7: $i > $o] :
( ? [X3: $i] : ( X7 @ X3 )
=> ? [X3: $i] :
( ( X7 @ X3 )
& ! [X4: $i] :
( ( X7 @ X4 )
=> ~ ( X1 @ X3 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ltVFV0FpEU/E---3.1_2874455.p',terminating) ).
thf(c_0_6,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X16: $i,X17: $i,X18: $i] :
( ( ( X2 @ X16 @ X17 )
& ( X2 @ X17 @ X18 ) )
=> ( X2 @ X16 @ X18 ) )
& ! [X19: $i,X20: $i] :
( ( Z0 @ X19 @ X20 )
=> ( X2 @ X19 @ X20 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive_closure]) ).
thf(c_0_7,plain,
( subrel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( Z0 @ X3 @ X4 )
=> ( Z1 @ X3 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subrel]) ).
thf(c_0_8,plain,
( trans
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X6 ) )
=> ( Z0 @ X3 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_9,plain,
( ind
= ( ^ [Z0: $i > $i > $o] :
! [X8: $i > $o] :
( ! [X3: $i] :
( ! [X4: $i] :
( ! [X44: $i > $i > $o] :
( ( ! [X45: $i,X46: $i,X47: $i] :
( ( ( X44 @ X45 @ X46 )
& ( X44 @ X46 @ X47 ) )
=> ( X44 @ X45 @ X47 ) )
& ! [X48: $i,X49: $i] :
( ( Z0 @ X48 @ X49 )
=> ( X44 @ X48 @ X49 ) ) )
=> ( X44 @ X3 @ X4 ) )
=> ( X8 @ X4 ) )
=> ( X8 @ X3 ) )
=> ! [X3: $i] : ( X8 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satisfying_the_induction_principle]) ).
thf(c_0_10,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X16: $i,X17: $i,X18: $i] :
( ( ( X2 @ X16 @ X17 )
& ( X2 @ X17 @ X18 ) )
=> ( X2 @ X16 @ X18 ) )
& ! [X19: $i,X20: $i] :
( ( Z0 @ X19 @ X20 )
=> ( X2 @ X19 @ X20 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( ind @ X1 )
=> ( term @ X1 ) ),
inference(assume_negation,[status(cth)],[induction_implies_termination]) ).
thf(c_0_12,plain,
( term
= ( ^ [Z0: $i > $i > $o] :
! [X7: $i > $o] :
( ? [X3: $i] : ( X7 @ X3 )
=> ? [X3: $i] :
( ( X7 @ X3 )
& ! [X4: $i] :
( ( X7 @ X4 )
=> ~ ( Z0 @ X3 @ X4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[terminating]) ).
thf(c_0_13,plain,
( ind
= ( ^ [Z0: $i > $i > $o] :
! [X8: $i > $o] :
( ! [X3: $i] :
( ! [X4: $i] :
( ! [X44: $i > $i > $o] :
( ( ! [X45: $i,X46: $i,X47: $i] :
( ( ( X44 @ X45 @ X46 )
& ( X44 @ X46 @ X47 ) )
=> ( X44 @ X45 @ X47 ) )
& ! [X48: $i,X49: $i] :
( ( Z0 @ X48 @ X49 )
=> ( X44 @ X48 @ X49 ) ) )
=> ( X44 @ X3 @ X4 ) )
=> ( X8 @ X4 ) )
=> ( X8 @ X3 ) )
=> ! [X3: $i] : ( X8 @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ! [X158: $i > $o] :
( ! [X159: $i] :
( ! [X160: $i] :
( ! [X161: $i > $i > $o] :
( ( ! [X162: $i,X163: $i,X164: $i] :
( ( ( X161 @ X162 @ X163 )
& ( X161 @ X163 @ X164 ) )
=> ( X161 @ X162 @ X164 ) )
& ! [X165: $i,X166: $i] :
( ( X1 @ X165 @ X166 )
=> ( X161 @ X165 @ X166 ) ) )
=> ( X161 @ X159 @ X160 ) )
=> ( X158 @ X160 ) )
=> ( X158 @ X159 ) )
=> ! [X167: $i] : ( X158 @ X167 ) )
=> ! [X168: $i > $o] :
( ? [X169: $i] : ( X168 @ X169 )
=> ? [X170: $i] :
( ( X168 @ X170 )
& ! [X171: $i] :
( ( X168 @ X171 )
=> ~ ( X1 @ X170 @ X171 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X173: $i > $o,X175: $i,X177: $i,X178: $i,X179: $i,X180: $i,X181: $i,X182: $i,X185: $i] :
( ( ~ ( epred2_2 @ X173 @ X175 @ X177 @ X178 )
| ~ ( epred2_2 @ X173 @ X175 @ X178 @ X179 )
| ( epred2_2 @ X173 @ X175 @ X177 @ X179 )
| ( X173 @ X175 )
| ( X173 @ X182 ) )
& ( ~ ( epred1_0 @ X180 @ X181 )
| ( epred2_2 @ X173 @ X175 @ X180 @ X181 )
| ( X173 @ X175 )
| ( X173 @ X182 ) )
& ( ~ ( epred2_2 @ X173 @ X175 @ ( esk1_1 @ X173 ) @ X175 )
| ( X173 @ X175 )
| ( X173 @ X182 ) )
& ( ~ ( X173 @ ( esk1_1 @ X173 ) )
| ( X173 @ X182 ) )
& ( epred3_0 @ esk2_0 )
& ( ( epred3_0 @ ( esk3_1 @ X185 ) )
| ~ ( epred3_0 @ X185 ) )
& ( ( epred1_0 @ X185 @ ( esk3_1 @ X185 ) )
| ~ ( epred3_0 @ X185 ) ) ),
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_14])])])])])]) ).
thf(c_0_16,negated_conjecture,
! [X7: $i > $o,X4: $i,X3: $i] :
( ( X7 @ X3 )
| ( X7 @ X4 )
| ~ ( epred2_2 @ X7 @ X3 @ ( esk1_1 @ X7 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X6: $i,X10: $i,X7: $i > $o,X4: $i] :
( ( epred2_2 @ X7 @ X6 @ X3 @ X4 )
| ( X7 @ X6 )
| ( X7 @ X10 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X7: $i > $o,X4: $i,X3: $i] :
( ~ ( epred2_2
@ ^ [Z0: $i] :
~ ( X7 @ Z0 )
@ X3
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) )
@ X3 )
| ~ ( X7 @ X4 )
| ~ ( X7 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X4: $i,X10: $i,X7: $i > $o,X6: $i,X3: $i] :
( ( epred2_2
@ ^ [Z0: $i] :
~ ( X7 @ Z0 )
@ X3
@ X4
@ X6 )
| ~ ( epred1_0 @ X4 @ X6 )
| ~ ( X7 @ X10 )
| ~ ( X7 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_17]) ).
thf(c_0_20,plain,
! [X6: $i,X4: $i,X8: $i > $o,X7: $i > $o,X3: $i] :
( ( ( ^ [Z0: $i] :
~ ( X7 @ Z0 ) )
!= ( ^ [Z0: $i] :
~ ( X8 @ Z0 ) ) )
| ~ ( epred1_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) )
@ X3 )
| ~ ( X7 @ X4 )
| ~ ( X7 @ X3 )
| ~ ( X8 @ X6 )
| ~ ( X8 @ X3 ) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_18,c_0_19])])])]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i,X7: $i > $o] :
( ( X7 @ X3 )
| ~ ( X7 @ ( esk1_1 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_22,plain,
! [X3: $i,X4: $i,X7: $i > $o,X6: $i] :
( ~ ( epred1_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) )
@ X3 )
| ~ ( X7 @ X4 )
| ~ ( X7 @ X3 )
| ~ ( X7 @ X6 ) ),
inference(er,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ ( esk3_1 @ X3 ) )
| ~ ( epred3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_24,negated_conjecture,
! [X7: $i > $o,X3: $i] :
( ( X7
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) ) )
| ~ ( X7 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_21]) ).
thf(c_0_25,negated_conjecture,
epred3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i,X7: $i > $o,X4: $i] :
( ~ ( X7
@ ( esk3_1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) ) ) )
| ~ ( epred3_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X7 @ Z0 ) ) )
| ~ ( X7 @ X3 )
| ~ ( X7 @ X4 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_27,negated_conjecture,
( epred3_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( epred3_0 @ Z0 ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i,X4: $i] :
( ~ ( epred3_0
@ ( esk3_1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( epred3_0 @ Z0 ) ) ) )
| ~ ( epred3_0 @ X3 )
| ~ ( epred3_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ ( esk3_1 @ X3 ) )
| ~ ( epred3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i,X4: $i] :
( ~ ( epred3_0 @ X3 )
| ~ ( epred3_0 @ X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i] :
~ ( epred3_0 @ X3 ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU481^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.15 % Computer : n010.cluster.edu
% 0.08/0.15 % Model : x86_64 x86_64
% 0.08/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.15 % Memory : 8046.5625MB
% 0.08/0.15 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Sep 29 13:43:47 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running higher-order theorem proving
% 0.08/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.ltVFV0FpEU/E---3.1_2874455.p
% 0.38/0.28 % Version: 3.5.1-ho
% 0.38/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.38/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.38/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.38/0.28 % Starting sh1l with 300s (1) cores
% 0.38/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.38/0.28 % new_ho_9 with pid 2874468 completed with status 0
% 0.38/0.28 % Result found by new_ho_9
% 0.38/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.38/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.38/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.28 % No SInE strategy applied
% 0.38/0.28 % Search class: HGUNF-FFSF11-SHSSMMBN
% 0.38/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.28 % Starting new_ho_9 with 151s (1) cores
% 0.38/0.28 % Starting new_bool_3 with 136s (1) cores
% 0.38/0.28 % Starting new_bool_2 with 136s (1) cores
% 0.38/0.28 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.38/0.28 % new_bool_3 with pid 2874477 completed with status 0
% 0.38/0.28 % Result found by new_bool_3
% 0.38/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.38/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.38/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.28 % No SInE strategy applied
% 0.38/0.28 % Search class: HGUNF-FFSF11-SHSSMMBN
% 0.38/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.28 % Starting new_ho_9 with 151s (1) cores
% 0.38/0.28 % Starting new_bool_3 with 136s (1) cores
% 0.38/0.28 % Preprocessing time : 0.002 s
% 0.38/0.28 % Presaturation interreduction done
% 0.38/0.28
% 0.38/0.28 % Proof found!
% 0.38/0.28 % SZS status Theorem
% 0.38/0.28 % SZS output start CNFRefutation
% See solution above
% 0.38/0.28 % Parsed axioms : 59
% 0.38/0.28 % Removed by relevancy pruning/SinE : 0
% 0.38/0.28 % Initial clauses : 36
% 0.38/0.28 % Removed in clause preprocessing : 29
% 0.38/0.28 % Initial clauses in saturation : 7
% 0.38/0.28 % Processed clauses : 110
% 0.38/0.28 % ...of these trivial : 1
% 0.38/0.28 % ...subsumed : 31
% 0.38/0.28 % ...remaining for further processing : 78
% 0.38/0.28 % Other redundant clauses eliminated : 17
% 0.38/0.28 % Clauses deleted for lack of memory : 0
% 0.38/0.28 % Backward-subsumed : 31
% 0.38/0.28 % Backward-rewritten : 0
% 0.38/0.28 % Generated clauses : 462
% 0.38/0.28 % ...of the previous two non-redundant : 419
% 0.38/0.28 % ...aggressively subsumed : 0
% 0.38/0.28 % Contextual simplify-reflections : 0
% 0.38/0.28 % Paramodulations : 373
% 0.38/0.28 % Factorizations : 0
% 0.38/0.28 % NegExts : 9
% 0.38/0.28 % Equation resolutions : 19
% 0.38/0.28 % Disequality decompositions : 0
% 0.38/0.28 % Total rewrite steps : 20
% 0.38/0.28 % ...of those cached : 18
% 0.38/0.28 % Propositional unsat checks : 0
% 0.38/0.28 % Propositional check models : 0
% 0.38/0.28 % Propositional check unsatisfiable : 0
% 0.38/0.28 % Propositional clauses : 0
% 0.38/0.28 % Propositional clauses after purity: 0
% 0.38/0.28 % Propositional unsat core size : 0
% 0.38/0.28 % Propositional preprocessing time : 0.000
% 0.38/0.28 % Propositional encoding time : 0.000
% 0.38/0.28 % Propositional solver time : 0.000
% 0.38/0.28 % Success case prop preproc time : 0.000
% 0.38/0.28 % Success case prop encoding time : 0.000
% 0.38/0.28 % Success case prop solver time : 0.000
% 0.38/0.28 % Current number of processed clauses : 32
% 0.38/0.28 % Positive orientable unit clauses : 0
% 0.38/0.28 % Positive unorientable unit clauses: 1
% 0.38/0.28 % Negative unit clauses : 3
% 0.38/0.28 % Non-unit-clauses : 28
% 0.38/0.28 % Current number of unprocessed clauses: 323
% 0.38/0.28 % ...number of literals in the above : 742
% 0.38/0.28 % Current number of archived formulas : 0
% 0.38/0.28 % Current number of archived clauses : 46
% 0.38/0.28 % Clause-clause subsumption calls (NU) : 582
% 0.38/0.28 % Rec. Clause-clause subsumption calls : 457
% 0.38/0.28 % Non-unit clause-clause subsumptions : 31
% 0.38/0.28 % Unit Clause-clause subsumption calls : 38
% 0.38/0.28 % Rewrite failures with RHS unbound : 0
% 0.38/0.28 % BW rewrite match attempts : 22
% 0.38/0.28 % BW rewrite match successes : 6
% 0.38/0.28 % Condensation attempts : 0
% 0.38/0.28 % Condensation successes : 0
% 0.38/0.28 % Termbank termtop insertions : 39836
% 0.38/0.28 % Search garbage collected termcells : 988
% 0.38/0.28
% 0.38/0.28 % -------------------------------------------------
% 0.38/0.28 % User time : 0.038 s
% 0.38/0.28 % System time : 0.009 s
% 0.38/0.28 % Total time : 0.047 s
% 0.38/0.28 % Maximum resident set size: 3944 pages
% 0.38/0.28
% 0.38/0.28 % -------------------------------------------------
% 0.38/0.28 % User time : 0.169 s
% 0.38/0.28 % System time : 0.019 s
% 0.38/0.28 % Total time : 0.189 s
% 0.38/0.28 % Maximum resident set size: 4608 pages
% 0.38/0.28 % E exiting
%------------------------------------------------------------------------------