%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM824^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:17:11 AM UTC 2026
% Result : Theorem 0.41s 0.38s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 36 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 122 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 575 ( 82 ~; 119 |; 21 &; 337 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 ^; 71 !; 0 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cN: $i > $o ).
thf(decl_24,type,
cODD: $i > $o ).
thf(decl_25,type,
cEVEN: $i > $o ).
thf(decl_26,type,
cS: $i > $i ).
thf(decl_27,type,
c0: $i ).
thf(decl_28,type,
esk1_2: ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_29,type,
esk2_2: ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(cTHM623_pme,conjecture,
( ( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X1 @ c0 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 @ ( cS @ X3 ) ) )
& ! [X4: $i] :
( ( X2 @ X4 )
=> ( X1 @ ( cS @ X4 ) ) ) )
=> ( ! [X5: $i] :
( ( cEVEN @ X5 )
=> ( X1 @ X5 ) )
& ! [X5: $i] :
( ( cODD @ X5 )
=> ( X2 @ X5 ) ) ) )
& ( cN @ c0 )
& ! [X6: $i] :
( ( cN @ X6 )
=> ( cN @ ( cS @ X6 ) ) ) )
=> ! [X7: $i] :
( ( ( cEVEN @ X7 )
| ( cODD @ X7 ) )
=> ( cN @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gG3M5avReD/E---3.1_2468198.p',cTHM623_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X1 @ c0 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 @ ( cS @ X3 ) ) )
& ! [X4: $i] :
( ( X2 @ X4 )
=> ( X1 @ ( cS @ X4 ) ) ) )
=> ( ! [X5: $i] :
( ( cEVEN @ X5 )
=> ( X1 @ X5 ) )
& ! [X5: $i] :
( ( cODD @ X5 )
=> ( X2 @ X5 ) ) ) )
& ( cN @ c0 )
& ! [X6: $i] :
( ( cN @ X6 )
=> ( cN @ ( cS @ X6 ) ) ) )
=> ! [X7: $i] :
( ( ( cEVEN @ X7 )
| ( cODD @ X7 ) )
=> ( cN @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM623_pme]) ).
thf(c_0_2,negated_conjecture,
! [X16: $i > $o,X17: $i > $o,X20: $i,X21: $i,X22: $i] :
( ( ~ ( cEVEN @ X20 )
| ( X16 @ X20 )
| ( X17 @ ( esk2_2 @ X16 @ X17 ) )
| ( X16 @ ( esk1_2 @ X16 @ X17 ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cODD @ X21 )
| ( X17 @ X21 )
| ( X17 @ ( esk2_2 @ X16 @ X17 ) )
| ( X16 @ ( esk1_2 @ X16 @ X17 ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cEVEN @ X20 )
| ( X16 @ X20 )
| ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
| ( X16 @ ( esk1_2 @ X16 @ X17 ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cODD @ X21 )
| ( X17 @ X21 )
| ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
| ( X16 @ ( esk1_2 @ X16 @ X17 ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cEVEN @ X20 )
| ( X16 @ X20 )
| ( X17 @ ( esk2_2 @ X16 @ X17 ) )
| ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cODD @ X21 )
| ( X17 @ X21 )
| ( X17 @ ( esk2_2 @ X16 @ X17 ) )
| ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cEVEN @ X20 )
| ( X16 @ X20 )
| ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
| ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
| ~ ( X16 @ c0 ) )
& ( ~ ( cODD @ X21 )
| ( X17 @ X21 )
| ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
| ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
| ~ ( X16 @ c0 ) )
& ( cN @ c0 )
& ( ~ ( cN @ X22 )
| ( cN @ ( cS @ X22 ) ) )
& ( ( cEVEN @ esk3_0 )
| ( cODD @ esk3_0 ) )
& ~ ( cN @ esk3_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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i > $o] :
( ( X1 @ X3 )
| ( X2 @ ( esk2_2 @ X1 @ X2 ) )
| ( X1 @ ( esk1_2 @ X1 @ X2 ) )
| ~ ( cEVEN @ X3 )
| ~ ( X1 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cEVEN @ esk3_0 )
| ( cODD @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i > $o] :
( ( X1 @ X3 )
| ( X1 @ ( esk1_2 @ X1 @ X2 ) )
| ~ ( cEVEN @ X3 )
| ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ X2 ) ) )
| ~ ( X1 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i] :
( ( cN @ ( cS @ X3 ) )
| ~ ( cN @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
cN @ c0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $o,X2: $i > $o] :
( ( X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ( cODD @ esk3_0 )
| ( X2 @ esk3_0 )
| ~ ( X2 @ c0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_9,negated_conjecture,
~ ( cN @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i > $o] :
( ( X1 @ X3 )
| ~ ( cEVEN @ X3 )
| ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ X2 ) ) )
| ~ ( X2 @ ( cS @ ( esk1_2 @ X1 @ X2 ) ) )
| ~ ( X1 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i > $o] :
( ( X1 @ X3 )
| ( X2 @ ( esk2_2 @ X1 @ X2 ) )
| ~ ( cEVEN @ X3 )
| ~ ( X2 @ ( cS @ ( esk1_2 @ X1 @ X2 ) ) )
| ~ ( X1 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( cN @ ( esk1_2 @ cN @ X1 ) )
| ( cN @ X3 )
| ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
| ~ ( cEVEN @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i > $o] :
( ( cN @ ( esk1_2 @ cN @ X1 ) )
| ( X1 @ ( esk2_2 @ cN @ X1 ) )
| ( cODD @ esk3_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X1: $i > $o] :
( ( X1 @ X3 )
| ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ cN ) ) )
| ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
| ~ ( cEVEN @ X3 )
| ~ ( X1 @ c0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i,X1: $i > $o] :
( ( cN @ ( esk2_2 @ X1 @ cN ) )
| ( X1 @ X3 )
| ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
| ~ ( cEVEN @ X3 )
| ~ ( X1 @ c0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] :
( ( cN @ ( esk1_2 @ cN @ cN ) )
| ( cODD @ esk3_0 )
| ( cN @ X3 )
| ~ ( cEVEN @ X3 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( ( cN @ X3 )
| ~ ( cN @ ( esk2_2 @ cN @ cN ) )
| ~ ( cEVEN @ X3 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_7])]),c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $o] :
( ( cN @ ( esk2_2 @ X1 @ cN ) )
| ( cODD @ esk3_0 )
| ( X1 @ esk3_0 )
| ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
| ~ ( X1 @ c0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_4]) ).
thf(c_0_19,negated_conjecture,
( ( cN @ ( esk1_2 @ cN @ cN ) )
| ( cODD @ esk3_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_4]),c_0_9]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
( ( cODD @ esk3_0 )
| ( cN @ X3 )
| ~ ( cEVEN @ X3 ) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_7])]),c_0_9]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o] :
( ( X1 @ X3 )
| ~ ( cODD @ X3 )
| ~ ( X2 @ ( cS @ ( esk2_2 @ X2 @ X1 ) ) )
| ~ ( X1 @ ( cS @ ( esk1_2 @ X2 @ X1 ) ) )
| ~ ( X2 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o] :
( ( X1 @ X3 )
| ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( cODD @ X3 )
| ~ ( X2 @ ( cS @ ( esk2_2 @ X2 @ X1 ) ) )
| ~ ( X2 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o] :
( ( X1 @ X3 )
| ( X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( cODD @ X3 )
| ~ ( X2 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_24,negated_conjecture,
cODD @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_4]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( X1 @ X3 )
| ~ ( X1 @ ( cS @ ( esk1_2 @ cN @ X1 ) ) )
| ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
| ~ ( cODD @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_6]),c_0_7])]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( cN @ ( esk1_2 @ cN @ X1 ) )
| ( X1 @ X3 )
| ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
| ~ ( cODD @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_6]),c_0_7])]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i > $o,X1: $i > $o] :
( ( X1 @ ( esk1_2 @ X1 @ X2 ) )
| ( X2 @ ( esk2_2 @ X1 @ X2 ) )
| ( X2 @ esk3_0 )
| ~ ( X1 @ c0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( cN @ X3 )
| ~ ( cN @ ( esk2_2 @ cN @ cN ) )
| ~ ( cODD @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_6]),c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i > $o] :
( ( cN @ ( esk1_2 @ cN @ X1 ) )
| ( X1 @ ( esk2_2 @ cN @ X1 ) )
| ( X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o] :
( ( X1 @ X3 )
| ( X1 @ ( esk2_2 @ X2 @ X1 ) )
| ~ ( cODD @ X3 )
| ~ ( X1 @ ( cS @ ( esk1_2 @ X2 @ X1 ) ) )
| ~ ( X2 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i] :
( ( cN @ ( esk1_2 @ cN @ cN ) )
| ( cN @ X3 )
| ~ ( cODD @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_9]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i,X1: $i > $o] :
( ( cN @ ( esk2_2 @ X1 @ cN ) )
| ( cN @ X3 )
| ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
| ~ ( cODD @ X3 )
| ~ ( X1 @ c0 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_6]) ).
thf(c_0_33,negated_conjecture,
cN @ ( esk1_2 @ cN @ cN ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_9]) ).
thf(c_0_34,negated_conjecture,
! [X3: $i] :
( ( cN @ X3 )
| ~ ( cODD @ X3 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_7])]),c_0_28]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_34]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM824^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 % Computer : n003.cluster.edu
% 0.08/0.25 % Model : x86_64 x86_64
% 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25 % Memory : 8046.5625MB
% 0.08/0.25 % OS : Linux 6.8.0-71-generic
% 0.08/0.25 % CPULimit : 300
% 0.08/0.25 % WCLimit : 300
% 0.08/0.25 % DateTime : Tue Sep 29 13:04:43 UTC 2026
% 0.08/0.26 % CPUTime :
% 0.08/0.26 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.32 Running higher-order theorem proving
% 0.23/0.34 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.gG3M5avReD/E---3.1_2468198.p
% 0.41/0.38 % Version: 3.5.1-ho
% 0.41/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.41/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.41/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho2 with 300s (1) cores
% 0.41/0.38 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.41/0.38 % Starting full_lambda_10 with 300s (1) cores
% 0.41/0.38 % Starting new_ho_8 with 300s (1) cores
% 0.41/0.38 % post_as_ho2 with pid 2468215 completed with status 0
% 0.41/0.38 % Result found by post_as_ho2
% 0.41/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.41/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.41/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho2 with 300s (1) cores
% 0.41/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.38 % No SInE strategy applied
% 0.41/0.38 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.41/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.41/0.38 % SubtermCWHack with pid 2468224 completed with status 0
% 0.41/0.38 % Result found by SubtermCWHack
% 0.41/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.41/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.41/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.41/0.38 % Starting post_as_ho2 with 300s (1) cores
% 0.41/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.38 % No SInE strategy applied
% 0.41/0.38 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.41/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.41/0.38 % Preprocessing time : 0.001 s
% 0.41/0.38
% 0.41/0.38 % Proof found!
% 0.41/0.38 % SZS status Theorem
% 0.41/0.38 % SZS output start CNFRefutation
% See solution above
% 0.41/0.38 % Parsed axioms : 6
% 0.41/0.38 % Removed by relevancy pruning/SinE : 0
% 0.41/0.38 % Initial clauses : 17
% 0.41/0.38 % Removed in clause preprocessing : 5
% 0.41/0.38 % Initial clauses in saturation : 12
% 0.41/0.38 % Processed clauses : 48
% 0.41/0.38 % ...of these trivial : 2
% 0.41/0.38 % ...subsumed : 5
% 0.41/0.38 % ...remaining for further processing : 41
% 0.41/0.38 % Other redundant clauses eliminated : 0
% 0.41/0.38 % Clauses deleted for lack of memory : 0
% 0.41/0.38 % Backward-subsumed : 8
% 0.41/0.38 % Backward-rewritten : 11
% 0.41/0.38 % Generated clauses : 72
% 0.41/0.38 % ...of the previous two non-redundant : 65
% 0.41/0.38 % ...aggressively subsumed : 0
% 0.41/0.38 % Contextual simplify-reflections : 6
% 0.41/0.38 % Paramodulations : 72
% 0.41/0.38 % Factorizations : 0
% 0.41/0.38 % NegExts : 0
% 0.41/0.38 % Equation resolutions : 0
% 0.41/0.38 % Disequality decompositions : 0
% 0.41/0.38 % Total rewrite steps : 37
% 0.41/0.38 % ...of those cached : 34
% 0.41/0.38 % Propositional unsat checks : 0
% 0.41/0.38 % Propositional check models : 0
% 0.41/0.38 % Propositional check unsatisfiable : 0
% 0.41/0.38 % Propositional clauses : 0
% 0.41/0.38 % Propositional clauses after purity: 0
% 0.41/0.38 % Propositional unsat core size : 0
% 0.41/0.38 % Propositional preprocessing time : 0.000
% 0.41/0.38 % Propositional encoding time : 0.000
% 0.41/0.38 % Propositional solver time : 0.000
% 0.41/0.38 % Success case prop preproc time : 0.000
% 0.41/0.38 % Success case prop encoding time : 0.000
% 0.41/0.38 % Success case prop solver time : 0.000
% 0.41/0.38 % Current number of processed clauses : 22
% 0.41/0.38 % Positive orientable unit clauses : 3
% 0.41/0.38 % Positive unorientable unit clauses: 0
% 0.41/0.38 % Negative unit clauses : 1
% 0.41/0.38 % Non-unit-clauses : 18
% 0.41/0.38 % Current number of unprocessed clauses: 0
% 0.41/0.38 % ...number of literals in the above : 0
% 0.41/0.38 % Current number of archived formulas : 0
% 0.41/0.38 % Current number of archived clauses : 19
% 0.41/0.38 % Clause-clause subsumption calls (NU) : 150
% 0.41/0.38 % Rec. Clause-clause subsumption calls : 69
% 0.41/0.38 % Non-unit clause-clause subsumptions : 19
% 0.41/0.38 % Unit Clause-clause subsumption calls : 2
% 0.41/0.38 % Rewrite failures with RHS unbound : 0
% 0.41/0.38 % BW rewrite match attempts : 2
% 0.41/0.38 % BW rewrite match successes : 2
% 0.41/0.38 % Condensation attempts : 0
% 0.41/0.38 % Condensation successes : 0
% 0.41/0.38 % Termbank termtop insertions : 3293
% 0.41/0.38 % Search garbage collected termcells : 369
% 0.41/0.38
% 0.41/0.38 % -------------------------------------------------
% 0.41/0.38 % User time : 0.007 s
% 0.41/0.38 % System time : 0.001 s
% 0.41/0.38 % Total time : 0.009 s
% 0.41/0.38 % Maximum resident set size: 3636 pages
% 0.41/0.38
% 0.41/0.38 % -------------------------------------------------
% 0.41/0.38 % User time : 0.008 s
% 0.41/0.38 % System time : 0.007 s
% 0.41/0.38 % Total time : 0.015 s
% 0.41/0.38 % Maximum resident set size: 4864 pages
% 0.41/0.38 % E exiting
%------------------------------------------------------------------------------