%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU969^5 : TPTP v9.3.1. Bugfixed v5.2.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:28:11 AM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 39 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 4 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 435 ( 47 ~; 58 |; 23 &; 290 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 37 ^; 38 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
c1: $i ).
thf(decl_24,type,
s: $i > $i ).
thf(decl_25,type,
cCKB6_BLACK: $i > $i > $o ).
thf(decl_26,type,
cCKB6_NUM: $i > $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(decl_30,type,
esk4_1: ( $i > $i > $o ) > $i ).
thf(decl_31,type,
epred1_0: $i > $o ).
thf(decl_32,type,
epred2_0: $i > $o ).
thf(cCKB6_L6000_pme,conjecture,
! [X6: $i,X9: $i] :
( ( cCKB6_BLACK @ X6 @ X9 )
=> ( ( cCKB6_NUM @ X6 )
& ( cCKB6_NUM @ X9 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YB0ot61rkA/E---3.1_4103190.p',cCKB6_L6000_pme) ).
thf(cCKB6_BLACK_def,axiom,
( cCKB6_BLACK
= ( ^ [X1: $i,X2: $i] :
! [X3: $i > $i > $o] :
( ( ( X3 @ c1 @ c1 )
& ! [X4: $i,X5: $i] :
( ( X3 @ X4 @ X5 )
=> ( ( X3 @ ( s @ ( s @ X4 ) ) @ X5 )
& ( X3 @ ( s @ X4 ) @ ( s @ X5 ) ) ) ) )
=> ( X3 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YB0ot61rkA/E---3.1_4103190.p',cCKB6_BLACK_def) ).
thf(cCKB6_NUM_def,axiom,
( cCKB6_NUM
= ( ^ [X6: $i] :
! [X7: $i > $o] :
( ( ( X7 @ c1 )
& ! [X8: $i] :
( ( X7 @ X8 )
=> ( X7 @ ( s @ X8 ) ) ) )
=> ( X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YB0ot61rkA/E---3.1_4103190.p',cCKB6_NUM_def) ).
thf(c_0_3,negated_conjecture,
~ ! [X6: $i,X9: $i] :
( ( cCKB6_BLACK @ X6 @ X9 )
=> ( ( cCKB6_NUM @ X6 )
& ( cCKB6_NUM @ X9 ) ) ),
inference(assume_negation,[status(cth)],[cCKB6_L6000_pme]) ).
thf(c_0_4,plain,
( cCKB6_BLACK
= ( ^ [Z0: $i,Z1: $i] :
! [X3: $i > $i > $o] :
( ( ( X3 @ c1 @ c1 )
& ! [X4: $i,X5: $i] :
( ( X3 @ X4 @ X5 )
=> ( ( X3 @ ( s @ ( s @ X4 ) ) @ X5 )
& ( X3 @ ( s @ X4 ) @ ( s @ X5 ) ) ) ) )
=> ( X3 @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[cCKB6_BLACK_def]) ).
thf(c_0_5,plain,
( cCKB6_NUM
= ( ^ [Z0: $i] :
! [X7: $i > $o] :
( ( ( X7 @ c1 )
& ! [X8: $i] :
( ( X7 @ X8 )
=> ( X7 @ ( s @ X8 ) ) ) )
=> ( X7 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[cCKB6_NUM_def]) ).
thf(c_0_6,negated_conjecture,
~ ! [X6: $i,X9: $i] :
( ! [X12: $i > $i > $o] :
( ( ( X12 @ c1 @ c1 )
& ! [X13: $i,X14: $i] :
( ( X12 @ X13 @ X14 )
=> ( ( X12 @ ( s @ ( s @ X13 ) ) @ X14 )
& ( X12 @ ( s @ X13 ) @ ( s @ X14 ) ) ) ) )
=> ( X12 @ X6 @ X9 ) )
=> ( ! [X15: $i > $o] :
( ( ( X15 @ c1 )
& ! [X16: $i] :
( ( X15 @ X16 )
=> ( X15 @ ( s @ X16 ) ) ) )
=> ( X15 @ X6 ) )
& ! [X17: $i > $o] :
( ( ( X17 @ c1 )
& ! [X18: $i] :
( ( X17 @ X18 )
=> ( X17 @ ( s @ X18 ) ) ) )
=> ( X17 @ X9 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X21: $i > $i > $o,X25: $i,X27: $i] :
( ( ( X21 @ ( esk3_1 @ X21 ) @ ( esk4_1 @ X21 ) )
| ~ ( X21 @ c1 @ c1 )
| ( X21 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X21 @ ( s @ ( s @ ( esk3_1 @ X21 ) ) ) @ ( esk4_1 @ X21 ) )
| ~ ( X21 @ ( s @ ( esk3_1 @ X21 ) ) @ ( s @ ( esk4_1 @ X21 ) ) )
| ~ ( X21 @ c1 @ c1 )
| ( X21 @ esk1_0 @ esk2_0 ) )
& ( ( epred2_0 @ c1 )
| ( epred1_0 @ c1 ) )
& ( ~ ( epred2_0 @ X27 )
| ( epred2_0 @ ( s @ X27 ) )
| ( epred1_0 @ c1 ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ( epred1_0 @ c1 ) )
& ( ( epred2_0 @ c1 )
| ~ ( epred1_0 @ X25 )
| ( epred1_0 @ ( s @ X25 ) ) )
& ( ~ ( epred2_0 @ X27 )
| ( epred2_0 @ ( s @ X27 ) )
| ~ ( epred1_0 @ X25 )
| ( epred1_0 @ ( s @ X25 ) ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ X25 )
| ( epred1_0 @ ( s @ X25 ) ) )
& ( ( epred2_0 @ c1 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ X27 )
| ( epred2_0 @ ( s @ X27 ) )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i > $i > $o] :
( ( X3 @ ( esk3_1 @ X3 ) @ ( esk4_1 @ X3 ) )
| ( X3 @ esk1_0 @ esk2_0 )
| ~ ( X3 @ c1 @ c1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ c1 )
| ( epred1_0 @ c1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ c1 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ c1 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i > $i > $o] :
( ( X3 @ esk1_0 @ esk2_0 )
| ~ ( X3 @ ( s @ ( s @ ( esk3_1 @ X3 ) ) ) @ ( esk4_1 @ X3 ) )
| ~ ( X3 @ ( s @ ( esk3_1 @ X3 ) ) @ ( s @ ( esk4_1 @ X3 ) ) )
| ~ ( X3 @ c1 @ c1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ ( s @ X1 ) )
| ( epred1_0 @ c1 )
| ~ ( epred2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) )
| ( epred1_0 @ c1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ ( s @ X1 ) )
| ~ ( epred2_0 @ X1 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_17,negated_conjecture,
( ( epred2_0
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ c1 )
| ( epred1_0 @ ( s @ X1 ) )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
epred1_0 @ c1,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]),c_0_15]),c_0_10]) ).
thf(c_0_20,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_11]),c_0_17]),c_0_12]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ ( s @ X1 ) )
| ~ ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_22,negated_conjecture,
! [X28: $i > $i > $i] :
( ( epred1_0
@ ( s
@ ( X28
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ ( s @ ( X28 @ Z0 @ Z1 ) ) ) )
@ ( esk4_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ ( s @ ( X28 @ Z0 @ Z1 ) ) ) ) ) ) )
| ( epred1_0 @ ( s @ ( X28 @ esk1_0 @ esk2_0 ) ) )
| ( epred2_0 @ c1 )
| ~ ( epred1_0 @ ( X28 @ c1 @ c1 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
thf(c_0_23,negated_conjecture,
( epred1_0
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_19]),c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X28: $i > $i > $i] :
( ( epred1_0
@ ( s
@ ( X28
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ ( s @ ( X28 @ Z0 @ Z1 ) ) ) )
@ ( esk4_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ ( s @ ( X28 @ Z0 @ Z1 ) ) ) ) ) ) )
| ( epred1_0 @ ( s @ ( X28 @ esk1_0 @ esk2_0 ) ) )
| ~ ( epred1_0 @ ( X28 @ c1 @ c1 ) )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) )
| ( epred2_0 @ c1 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,negated_conjecture,
( ( epred1_0
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
thf(c_0_27,negated_conjecture,
( ( epred2_0 @ c1 )
| ~ ( epred1_0
@ ( s
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) ) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_19])]),c_0_20]) ).
thf(c_0_28,negated_conjecture,
( ~ ( epred1_0
@ ( s
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) ) )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_19])]),c_0_20]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i,X2: $i] :
( ( epred2_0 @ ( s @ X1 ) )
| ( epred1_0 @ ( s @ X2 ) )
| ~ ( epred2_0 @ X1 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_30,negated_conjecture,
epred2_0 @ c1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_25]) ).
thf(c_0_31,negated_conjecture,
~ ( epred2_0 @ esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_26]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
( ( epred1_0
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) )
| ( epred2_0 @ ( s @ X1 ) )
| ~ ( epred2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
thf(c_0_33,negated_conjecture,
( epred2_0
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_30]),c_0_31]) ).
thf(c_0_34,negated_conjecture,
( ( epred1_0
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) )
| ( epred2_0
@ ( s
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_35,negated_conjecture,
( ( epred2_0
@ ( s
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) ) )
| ~ ( epred1_0
@ ( s
@ ( s
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] : ( epred1_0 @ Z0 ) ) ) ) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_34]),c_0_19])]),c_0_20]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i] :
( ( epred2_0
@ ( s
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) ) )
| ( epred2_0 @ ( s @ X1 ) )
| ~ ( epred2_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_35]) ).
thf(c_0_37,negated_conjecture,
( epred2_0
@ ( s
@ ( esk4_1
@ ^ [Z0: $i] : epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_33]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU969^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n009.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 14:53:39 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 Running higher-order theorem proving
% 0.19/0.26 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.YB0ot61rkA/E---3.1_4103190.p
% 0.19/0.29 % Version: 3.5.1-ho
% 0.19/0.29 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.19/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.29 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.29 % Starting post_as_ho5 with 300s (1) cores
% 0.19/0.29 % Starting sh4l with 300s (1) cores
% 0.19/0.29 % Starting ho_unfolding_2 with 300s (1) cores
% 0.19/0.29 % ho_unfolding_3 with pid 4103203 completed with status 0
% 0.19/0.29 % Result found by ho_unfolding_3
% 0.19/0.29 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.19/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.29 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.29 % No SInE strategy applied
% 0.19/0.29 % Search class: HGHNF-FFSF11-MSFFMSBN
% 0.19/0.29 % partial match(1): HGUNF-FFSF11-MSFFMSBN
% 0.19/0.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.29 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.29 % Starting ho_unfolding_3 with 151s (1) cores
% 0.19/0.29 % Starting new_ho_8 with 136s (1) cores
% 0.19/0.29 % Starting new_ho_4 with 136s (1) cores
% 0.19/0.29 % Starting post_as_ho5 with 136s (1) cores
% 0.19/0.29 % post_as_ho5 with pid 4103211 completed with status 0
% 0.19/0.29 % Result found by post_as_ho5
% 0.19/0.29 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.19/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.29 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.29 % No SInE strategy applied
% 0.19/0.29 % Search class: HGHNF-FFSF11-MSFFMSBN
% 0.19/0.29 % partial match(1): HGUNF-FFSF11-MSFFMSBN
% 0.19/0.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.29 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.29 % Starting ho_unfolding_3 with 151s (1) cores
% 0.19/0.29 % Starting new_ho_8 with 136s (1) cores
% 0.19/0.29 % Starting new_ho_4 with 136s (1) cores
% 0.19/0.29 % Starting post_as_ho5 with 136s (1) cores
% 0.19/0.29 % Preprocessing time : 0.001 s
% 0.19/0.29 % Presaturation interreduction done
% 0.19/0.29
% 0.19/0.29 % Proof found!
% 0.19/0.29 % SZS status Theorem
% 0.19/0.29 % SZS output start CNFRefutation
% See solution above
% 0.19/0.30 % Parsed axioms : 7
% 0.19/0.30 % Removed by relevancy pruning/SinE : 0
% 0.19/0.30 % Initial clauses : 15
% 0.19/0.30 % Removed in clause preprocessing : 4
% 0.19/0.30 % Initial clauses in saturation : 11
% 0.19/0.30 % Processed clauses : 181
% 0.19/0.30 % ...of these trivial : 3
% 0.19/0.30 % ...subsumed : 26
% 0.19/0.30 % ...remaining for further processing : 152
% 0.19/0.30 % Other redundant clauses eliminated : 0
% 0.19/0.30 % Clauses deleted for lack of memory : 0
% 0.19/0.30 % Backward-subsumed : 44
% 0.19/0.30 % Backward-rewritten : 52
% 0.19/0.30 % Generated clauses : 442
% 0.19/0.30 % ...of the previous two non-redundant : 399
% 0.19/0.30 % ...aggressively subsumed : 0
% 0.19/0.30 % Contextual simplify-reflections : 23
% 0.19/0.30 % Paramodulations : 417
% 0.19/0.30 % Factorizations : 0
% 0.19/0.30 % NegExts : 2
% 0.19/0.30 % Equation resolutions : 2
% 0.19/0.30 % Disequality decompositions : 0
% 0.19/0.30 % Total rewrite steps : 123
% 0.19/0.30 % ...of those cached : 104
% 0.19/0.30 % Propositional unsat checks : 0
% 0.19/0.30 % Propositional check models : 0
% 0.19/0.30 % Propositional check unsatisfiable : 0
% 0.19/0.30 % Propositional clauses : 0
% 0.19/0.30 % Propositional clauses after purity: 0
% 0.19/0.30 % Propositional unsat core size : 0
% 0.19/0.30 % Propositional preprocessing time : 0.000
% 0.19/0.30 % Propositional encoding time : 0.000
% 0.19/0.30 % Propositional solver time : 0.000
% 0.19/0.30 % Success case prop preproc time : 0.000
% 0.19/0.30 % Success case prop encoding time : 0.000
% 0.19/0.30 % Success case prop solver time : 0.000
% 0.19/0.30 % Current number of processed clauses : 45
% 0.19/0.30 % Positive orientable unit clauses : 19
% 0.19/0.30 % Positive unorientable unit clauses: 0
% 0.19/0.30 % Negative unit clauses : 2
% 0.19/0.30 % Non-unit-clauses : 24
% 0.19/0.30 % Current number of unprocessed clauses: 82
% 0.19/0.30 % ...number of literals in the above : 268
% 0.19/0.30 % Current number of archived formulas : 0
% 0.19/0.30 % Current number of archived clauses : 107
% 0.19/0.30 % Clause-clause subsumption calls (NU) : 617
% 0.19/0.30 % Rec. Clause-clause subsumption calls : 367
% 0.19/0.30 % Non-unit clause-clause subsumptions : 65
% 0.19/0.30 % Unit Clause-clause subsumption calls : 77
% 0.19/0.30 % Rewrite failures with RHS unbound : 0
% 0.19/0.30 % BW rewrite match attempts : 81
% 0.19/0.30 % BW rewrite match successes : 18
% 0.19/0.30 % Condensation attempts : 0
% 0.19/0.30 % Condensation successes : 0
% 0.19/0.30 % Termbank termtop insertions : 25512
% 0.19/0.30 % Search garbage collected termcells : 372
% 0.19/0.30
% 0.19/0.30 % -------------------------------------------------
% 0.19/0.30 % User time : 0.018 s
% 0.19/0.30 % System time : 0.001 s
% 0.19/0.30 % Total time : 0.019 s
% 0.19/0.30 % Maximum resident set size: 3640 pages
% 0.19/0.30
% 0.19/0.30 % -------------------------------------------------
% 0.19/0.30 % User time : 0.081 s
% 0.19/0.30 % System time : 0.015 s
% 0.19/0.30 % Total time : 0.096 s
% 0.19/0.30 % Maximum resident set size: 4864 pages
% 0.19/0.30 % E exiting
%------------------------------------------------------------------------------