%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU468^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 : n003.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:23:53 AM UTC 2026
% Result : Theorem 0.29s 0.26s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 79 ( 10 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 407 ( 26 ~; 37 |; 20 &; 297 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 73 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 98 ( 18 ^; 80 !; 0 ?; 98 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_27,type,
mono: ( ( $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_52,type,
epred1_0: $i > $i > $o ).
thf(decl_53,type,
epred2_0: $i > $i > $o ).
thf(decl_54,type,
esk1_0: $i ).
thf(decl_55,type,
esk2_0: $i ).
thf(decl_56,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(decl_57,type,
esk4_1: ( $i > $i > $o ) > $i ).
thf(decl_58,type,
esk5_1: ( $i > $i > $o ) > $i ).
thf(decl_59,type,
esk6_1: ( $i > $i > $o ) > $i ).
thf(decl_60,type,
esk7_1: ( $i > $i > $o ) > $i ).
thf(decl_61,type,
epred3_0: $i > $i > $o ).
thf(monotonic,axiom,
( mono
= ( ^ [X5: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( subrel @ X1 @ X2 )
=> ( subrel @ ( X5 @ X1 ) @ ( X5 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TkdNf7Cx78/E---3.1_2519228.p',monotonic) ).
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.TkdNf7Cx78/E---3.1_2519228.p',subrel) ).
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.TkdNf7Cx78/E---3.1_2519228.p',transitive_closure) ).
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.TkdNf7Cx78/E---3.1_2519228.p',transitive) ).
thf(transitive_closure_op_is_monotonic,conjecture,
mono @ tc,
file('/export/starexec/sandbox/tmp/tmp.TkdNf7Cx78/E---3.1_2519228.p',transitive_closure_op_is_monotonic) ).
thf(c_0_5,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X11: $i,X12: $i] :
( ( X1 @ X11 @ X12 )
=> ( X2 @ X11 @ X12 ) )
=> ! [X13: $i,X14: $i] :
( ( Z0 @ X1 @ X13 @ X14 )
=> ( Z0 @ X2 @ X13 @ X14 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[monotonic]) ).
thf(c_0_6,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_7,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X15: $i,X16: $i,X17: $i] :
( ( ( X2 @ X15 @ X16 )
& ( X2 @ X16 @ X17 ) )
=> ( X2 @ X15 @ X17 ) )
& ! [X18: $i,X19: $i] :
( ( Z0 @ X18 @ X19 )
=> ( X2 @ X18 @ X19 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive_closure]) ).
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,negated_conjecture,
~ ( mono @ tc ),
inference(assume_negation,[status(cth)],[transitive_closure_op_is_monotonic]) ).
thf(c_0_10,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X11: $i,X12: $i] :
( ( X1 @ X11 @ X12 )
=> ( X2 @ X11 @ X12 ) )
=> ! [X13: $i,X14: $i] :
( ( Z0 @ X1 @ X13 @ X14 )
=> ( Z0 @ X2 @ X13 @ X14 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_11,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X15: $i,X16: $i,X17: $i] :
( ( ( X2 @ X15 @ X16 )
& ( X2 @ X16 @ X17 ) )
=> ( X2 @ X15 @ X17 ) )
& ! [X18: $i,X19: $i] :
( ( Z0 @ X18 @ X19 )
=> ( X2 @ X18 @ X19 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_6]),c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ! [X163: $i > $i > $o,X164: $i > $i > $o] :
( ! [X165: $i,X166: $i] :
( ( X163 @ X165 @ X166 )
=> ( X164 @ X165 @ X166 ) )
=> ! [X167: $i,X168: $i] :
( ! [X157: $i > $i > $o] :
( ( ! [X158: $i,X159: $i,X160: $i] :
( ( ( X157 @ X158 @ X159 )
& ( X157 @ X159 @ X160 ) )
=> ( X157 @ X158 @ X160 ) )
& ! [X161: $i,X162: $i] :
( ( X163 @ X161 @ X162 )
=> ( X157 @ X161 @ X162 ) ) )
=> ( X157 @ X167 @ X168 ) )
=> ! [X157: $i > $i > $o] :
( ( ! [X158: $i,X159: $i,X160: $i] :
( ( ( X157 @ X158 @ X159 )
& ( X157 @ X159 @ X160 ) )
=> ( X157 @ X158 @ X160 ) )
& ! [X161: $i,X162: $i] :
( ( X164 @ X161 @ X162 )
=> ( X157 @ X161 @ X162 ) ) )
=> ( X157 @ X167 @ X168 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X171: $i,X172: $i,X175: $i > $i > $o,X182: $i,X183: $i,X184: $i,X185: $i,X186: $i] :
( ( ~ ( epred1_0 @ X171 @ X172 )
| ( epred2_0 @ X171 @ X172 ) )
& ( ( epred1_0 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ( X175 @ ( esk3_1 @ X175 ) @ ( esk4_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X175 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ( X175 @ ( esk3_1 @ X175 ) @ ( esk4_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ( X175 @ ( esk4_1 @ X175 ) @ ( esk5_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X175 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ( X175 @ ( esk4_1 @ X175 ) @ ( esk5_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ~ ( X175 @ ( esk3_1 @ X175 ) @ ( esk5_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X175 @ ( esk6_1 @ X175 ) @ ( esk7_1 @ X175 ) )
| ~ ( X175 @ ( esk3_1 @ X175 ) @ ( esk5_1 @ X175 ) )
| ( X175 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred3_0 @ X182 @ X183 )
| ~ ( epred3_0 @ X183 @ X184 )
| ( epred3_0 @ X182 @ X184 ) )
& ( ~ ( epred2_0 @ X185 @ X186 )
| ( epred3_0 @ X185 @ X186 ) )
& ~ ( epred3_0 @ esk1_0 @ esk2_0 ) ),
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_12])])])])])]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X4: $i,X6: $i] :
( ( epred3_0 @ X3 @ X6 )
| ~ ( epred3_0 @ X3 @ X4 )
| ~ ( epred3_0 @ X4 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
~ ( epred3_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ) )
| ( epred3_0 @ X3 @ ( esk5_1 @ epred3_0 ) )
| ~ ( epred3_0 @ X3 @ ( esk4_1 @ epred3_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred3_0 @ X3 @ X4 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_22,negated_conjecture,
( ( epred3_0 @ ( esk3_1 @ epred3_0 ) @ ( esk5_1 @ epred3_0 ) )
| ( epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred3_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_26,negated_conjecture,
epred3_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 @ ( esk5_1 @ epred3_0 ) )
| ~ ( epred3_0 @ X3 @ ( esk4_1 @ epred3_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_16]),c_0_26])]) ).
thf(c_0_29,negated_conjecture,
~ ( epred3_0 @ ( esk3_1 @ epred3_0 ) @ ( esk4_1 @ epred3_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]),c_0_16]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU468^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n003.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 13:43:58 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 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.TkdNf7Cx78/E---3.1_2519228.p
% 0.29/0.26 % Version: 3.5.1-ho
% 0.29/0.26 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.29/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.29/0.26 % Starting pre_casc_5 with 300s (1) cores
% 0.29/0.26 % Starting post_as_ho11 with 300s (1) cores
% 0.29/0.26 % Starting ho_unfolding_1 with 300s (1) cores
% 0.29/0.26 % ho_unfolding_1 with pid 2519244 completed with status 0
% 0.29/0.26 % Result found by ho_unfolding_1
% 0.29/0.26 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.29/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.29/0.26 % Starting pre_casc_5 with 300s (1) cores
% 0.29/0.26 % Starting post_as_ho11 with 300s (1) cores
% 0.29/0.26 % Starting ho_unfolding_1 with 300s (1) cores
% 0.29/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.26 % No SInE strategy applied
% 0.29/0.26 % Search class: HGUNF-FFSF11-SHHSMMBN
% 0.29/0.26 % partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.29/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.29/0.26 % SubtermCWHack with pid 2519245 completed with status 0
% 0.29/0.26 % Result found by SubtermCWHack
% 0.29/0.26 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.29/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.29/0.26 % Starting pre_casc_5 with 300s (1) cores
% 0.29/0.26 % Starting post_as_ho11 with 300s (1) cores
% 0.29/0.26 % Starting ho_unfolding_1 with 300s (1) cores
% 0.29/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.26 % No SInE strategy applied
% 0.29/0.26 % Search class: HGUNF-FFSF11-SHHSMMBN
% 0.29/0.26 % partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.29/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.29/0.26 % Preprocessing time : 0.001 s
% 0.29/0.26
% 0.29/0.26 % Proof found!
% 0.29/0.26 % SZS status Theorem
% 0.29/0.26 % SZS output start CNFRefutation
% See solution above
% 0.29/0.26 % Parsed axioms : 59
% 0.29/0.26 % Removed by relevancy pruning/SinE : 0
% 0.29/0.26 % Initial clauses : 39
% 0.29/0.26 % Removed in clause preprocessing : 29
% 0.29/0.26 % Initial clauses in saturation : 10
% 0.29/0.26 % Processed clauses : 30
% 0.29/0.26 % ...of these trivial : 0
% 0.29/0.26 % ...subsumed : 0
% 0.29/0.26 % ...remaining for further processing : 30
% 0.29/0.26 % Other redundant clauses eliminated : 0
% 0.29/0.26 % Clauses deleted for lack of memory : 0
% 0.29/0.26 % Backward-subsumed : 1
% 0.29/0.26 % Backward-rewritten : 3
% 0.29/0.26 % Generated clauses : 37
% 0.29/0.26 % ...of the previous two non-redundant : 33
% 0.29/0.26 % ...aggressively subsumed : 0
% 0.29/0.26 % Contextual simplify-reflections : 1
% 0.29/0.26 % Paramodulations : 37
% 0.29/0.26 % Factorizations : 0
% 0.29/0.26 % NegExts : 0
% 0.29/0.26 % Equation resolutions : 0
% 0.29/0.26 % Disequality decompositions : 0
% 0.29/0.26 % Total rewrite steps : 8
% 0.29/0.26 % ...of those cached : 6
% 0.29/0.26 % Propositional unsat checks : 0
% 0.29/0.26 % Propositional check models : 0
% 0.29/0.26 % Propositional check unsatisfiable : 0
% 0.29/0.26 % Propositional clauses : 0
% 0.29/0.26 % Propositional clauses after purity: 0
% 0.29/0.26 % Propositional unsat core size : 0
% 0.29/0.26 % Propositional preprocessing time : 0.000
% 0.29/0.26 % Propositional encoding time : 0.000
% 0.29/0.26 % Propositional solver time : 0.000
% 0.29/0.26 % Success case prop preproc time : 0.000
% 0.29/0.26 % Success case prop encoding time : 0.000
% 0.29/0.26 % Success case prop solver time : 0.000
% 0.29/0.26 % Current number of processed clauses : 26
% 0.29/0.26 % Positive orientable unit clauses : 2
% 0.29/0.26 % Positive unorientable unit clauses: 0
% 0.29/0.26 % Negative unit clauses : 2
% 0.29/0.26 % Non-unit-clauses : 22
% 0.29/0.26 % Current number of unprocessed clauses: 12
% 0.29/0.26 % ...number of literals in the above : 42
% 0.29/0.26 % Current number of archived formulas : 0
% 0.29/0.26 % Current number of archived clauses : 4
% 0.29/0.26 % Clause-clause subsumption calls (NU) : 121
% 0.29/0.26 % Rec. Clause-clause subsumption calls : 112
% 0.29/0.26 % Non-unit clause-clause subsumptions : 2
% 0.29/0.26 % Unit Clause-clause subsumption calls : 1
% 0.29/0.26 % Rewrite failures with RHS unbound : 0
% 0.29/0.26 % BW rewrite match attempts : 1
% 0.29/0.26 % BW rewrite match successes : 1
% 0.29/0.26 % Condensation attempts : 0
% 0.29/0.26 % Condensation successes : 0
% 0.29/0.26 % Termbank termtop insertions : 4495
% 0.29/0.26 % Search garbage collected termcells : 978
% 0.29/0.26
% 0.29/0.26 % -------------------------------------------------
% 0.29/0.26 % User time : 0.005 s
% 0.29/0.26 % System time : 0.004 s
% 0.29/0.26 % Total time : 0.009 s
% 0.29/0.26 % Maximum resident set size: 3940 pages
% 0.29/0.26
% 0.29/0.26 % -------------------------------------------------
% 0.29/0.26 % User time : 0.006 s
% 0.29/0.26 % System time : 0.010 s
% 0.29/0.26 % Total time : 0.016 s
% 0.29/0.26 % Maximum resident set size: 4608 pages
% 0.29/0.26 % E exiting
%------------------------------------------------------------------------------