%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL868^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:12:39 AM UTC 2026
% Result : Theorem 0.30s 0.26s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 132 ( 8 equ; 0 cnn)
% Maximal formula atoms : 31 ( 2 avg)
% Number of connectives : 417 ( 48 ~; 59 |; 26 &; 274 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 69 ( 8 ^; 58 !; 3 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_42,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_43,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_44,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(decl_54,type,
epred1_0: $i > $i > $o ).
thf(decl_55,type,
esk1_0: $i ).
thf(decl_56,type,
esk2_0: $i ).
thf(decl_57,type,
esk3_0: $i ).
thf(decl_58,type,
esk4_0: $i ).
thf(decl_59,type,
esk5_0: $i ).
thf(decl_60,type,
esk6_0: $i ).
thf(decl_61,type,
esk7_0: $i ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( ( mreflexive @ X13 )
& ( meuclidean @ X13 ) )
=> ( ( mserial @ X13 )
& ( mtransitive @ X13 )
& ( meuclidean @ X13 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XuHhhx3QuY/E---3.1_3812363.p',conj) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XuHhhx3QuY/E---3.1_3812363.p',mreflexive) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XuHhhx3QuY/E---3.1_3812363.p',mserial) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X16 @ X17 ) )
=> ( X13 @ X15 @ X17 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XuHhhx3QuY/E---3.1_3812363.p',mtransitive) ).
thf(meuclidean,axiom,
( meuclidean
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X15 @ X17 ) )
=> ( X13 @ X16 @ X17 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XuHhhx3QuY/E---3.1_3812363.p',meuclidean) ).
thf(c_0_5,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ( ( mreflexive @ X13 )
& ( meuclidean @ X13 ) )
=> ( ( mserial @ X13 )
& ( mtransitive @ X13 )
& ( meuclidean @ X13 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_6,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_7,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_8,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X16 @ X17 ) )
=> ( Z0 @ X15 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_9,plain,
( meuclidean
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X15 @ X17 ) )
=> ( Z0 @ X16 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[meuclidean]) ).
thf(c_0_10,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ( ! [X22: $i] : ( X13 @ X22 @ X22 )
& ! [X23: $i,X24: $i,X25: $i] :
( ( ( X13 @ X23 @ X24 )
& ( X13 @ X23 @ X25 ) )
=> ( X13 @ X24 @ X25 ) ) )
=> ( ! [X26: $i] :
? [X27: $i] : ( X13 @ X26 @ X27 )
& ! [X28: $i,X29: $i,X30: $i] :
( ( ( X13 @ X28 @ X29 )
& ( X13 @ X29 @ X30 ) )
=> ( X13 @ X28 @ X30 ) )
& ! [X31: $i,X32: $i,X33: $i] :
( ( ( X13 @ X31 @ X32 )
& ( X13 @ X31 @ X33 ) )
=> ( X13 @ X32 @ X33 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X35: $i,X36: $i,X37: $i,X38: $i,X40: $i] :
( ( epred1_0 @ X35 @ X35 )
& ( ~ ( epred1_0 @ X36 @ X37 )
| ~ ( epred1_0 @ X36 @ X38 )
| ( epred1_0 @ X37 @ X38 ) )
& ( ( epred1_0 @ esk5_0 @ esk6_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ( epred1_0 @ esk5_0 @ esk6_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ( epred1_0 @ esk5_0 @ esk6_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X40 ) ) ),
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_10])])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk7_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i] : ( epred1_0 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X14: $i,X15: $i] :
( ( epred1_0 @ X14 @ X15 )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( epred1_0 @ X3 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ esk5_0 @ esk7_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk6_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ X3 @ esk7_0 )
| ~ ( epred1_0 @ esk5_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ esk5_0 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk7_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_21,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk5_0 @ esk7_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk6_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ X3 @ esk7_0 )
| ~ ( epred1_0 @ esk5_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
thf(c_0_26,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk5_0 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
thf(c_0_27,negated_conjecture,
! [X14: $i,X3: $i] :
( ( epred1_0 @ X3 @ X14 )
| ~ ( epred1_0 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
thf(c_0_28,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_30,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_31,negated_conjecture,
epred1_0 @ esk3_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_34,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
thf(c_0_35,negated_conjecture,
epred1_0 @ esk3_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_32,c_0_13]) ).
thf(c_0_36,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
thf(c_0_37,negated_conjecture,
epred1_0 @ esk4_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk5_0 @ esk6_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk5_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
thf(c_0_40,negated_conjecture,
epred1_0 @ esk2_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
thf(c_0_41,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk6_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_13]) ).
thf(c_0_42,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk7_0 )
| ~ ( epred1_0 @ esk5_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
thf(c_0_43,negated_conjecture,
epred1_0 @ esk5_0 @ esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_40])]) ).
thf(c_0_44,negated_conjecture,
! [X3: $i] :
( ~ ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred1_0 @ esk2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_45,negated_conjecture,
epred1_0 @ esk6_0 @ esk7_0,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_46,negated_conjecture,
! [X3: $i] :
~ ( epred1_0 @ esk1_0 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_40])]),c_0_45])]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_46,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL868^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n009.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.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 10:16:45 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.XuHhhx3QuY/E---3.1_3812363.p
% 0.30/0.26 % Version: 3.5.1-ho
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.30/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.30/0.26 % ehoh_best2_full_lfho with pid 3812400 completed with status 0
% 0.30/0.26 % Result found by ehoh_best2_full_lfho
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.30/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26 % SubtermCWHack with pid 3812406 completed with status 0
% 0.30/0.26 % Result found by SubtermCWHack
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.30/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26 % Preprocessing time : 0.001 s
% 0.30/0.26
% 0.30/0.26 % Proof found!
% 0.30/0.26 % SZS status Theorem
% 0.30/0.26 % SZS output start CNFRefutation
% See solution above
% 0.30/0.26 % Parsed axioms : 64
% 0.30/0.26 % Removed by relevancy pruning/SinE : 0
% 0.30/0.26 % Initial clauses : 43
% 0.30/0.26 % Removed in clause preprocessing : 32
% 0.30/0.26 % Initial clauses in saturation : 11
% 0.30/0.26 % Processed clauses : 62
% 0.30/0.26 % ...of these trivial : 2
% 0.30/0.26 % ...subsumed : 8
% 0.30/0.26 % ...remaining for further processing : 52
% 0.30/0.26 % Other redundant clauses eliminated : 0
% 0.30/0.26 % Clauses deleted for lack of memory : 0
% 0.30/0.26 % Backward-subsumed : 8
% 0.30/0.26 % Backward-rewritten : 22
% 0.30/0.26 % Generated clauses : 109
% 0.30/0.26 % ...of the previous two non-redundant : 83
% 0.30/0.26 % ...aggressively subsumed : 0
% 0.30/0.26 % Contextual simplify-reflections : 0
% 0.30/0.26 % Paramodulations : 109
% 0.30/0.26 % Factorizations : 0
% 0.30/0.26 % NegExts : 0
% 0.30/0.26 % Equation resolutions : 0
% 0.30/0.26 % Disequality decompositions : 0
% 0.30/0.26 % Total rewrite steps : 56
% 0.30/0.26 % ...of those cached : 40
% 0.30/0.26 % Propositional unsat checks : 0
% 0.30/0.26 % Propositional check models : 0
% 0.30/0.26 % Propositional check unsatisfiable : 0
% 0.30/0.26 % Propositional clauses : 0
% 0.30/0.26 % Propositional clauses after purity: 0
% 0.30/0.26 % Propositional unsat core size : 0
% 0.30/0.26 % Propositional preprocessing time : 0.000
% 0.30/0.26 % Propositional encoding time : 0.000
% 0.30/0.26 % Propositional solver time : 0.000
% 0.30/0.26 % Success case prop preproc time : 0.000
% 0.30/0.26 % Success case prop encoding time : 0.000
% 0.30/0.26 % Success case prop solver time : 0.000
% 0.30/0.26 % Current number of processed clauses : 22
% 0.30/0.26 % Positive orientable unit clauses : 13
% 0.30/0.26 % Positive unorientable unit clauses: 0
% 0.30/0.26 % Negative unit clauses : 1
% 0.30/0.26 % Non-unit-clauses : 8
% 0.30/0.26 % Current number of unprocessed clauses: 7
% 0.30/0.26 % ...number of literals in the above : 14
% 0.30/0.26 % Current number of archived formulas : 0
% 0.30/0.26 % Current number of archived clauses : 30
% 0.30/0.26 % Clause-clause subsumption calls (NU) : 97
% 0.30/0.26 % Rec. Clause-clause subsumption calls : 93
% 0.30/0.26 % Non-unit clause-clause subsumptions : 16
% 0.30/0.26 % Unit Clause-clause subsumption calls : 0
% 0.30/0.26 % Rewrite failures with RHS unbound : 0
% 0.30/0.26 % BW rewrite match attempts : 3
% 0.30/0.26 % BW rewrite match successes : 3
% 0.30/0.26 % Condensation attempts : 0
% 0.30/0.26 % Condensation successes : 0
% 0.30/0.26 % Termbank termtop insertions : 3775
% 0.30/0.26 % Search garbage collected termcells : 599
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.005 s
% 0.30/0.26 % System time : 0.002 s
% 0.30/0.26 % Total time : 0.008 s
% 0.30/0.26 % Maximum resident set size: 3692 pages
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.008 s
% 0.30/0.26 % System time : 0.007 s
% 0.30/0.26 % Total time : 0.015 s
% 0.30/0.26 % Maximum resident set size: 4864 pages
% 0.30/0.26 % E exiting
%------------------------------------------------------------------------------