%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET752^4 : 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 : n017.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:22:48 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 44 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 173 ( 79 equ; 0 cnn)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 363 ( 60 ~; 104 |; 16 &; 182 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 46 ( 12 ^; 29 !; 5 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
fun_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(decl_45,type,
epred1_0: $i > $o ).
thf(decl_46,type,
epred2_0: $i > $o ).
thf(decl_47,type,
esk1_0: $i > $i ).
thf(decl_48,type,
esk2_0: $i ).
thf(decl_49,type,
esk3_0: $i ).
thf(decl_50,type,
esk4_0: $i ).
thf(decl_51,type,
esk5_0: $i ).
thf(thm,conjecture,
! [X27: $i > $o,X28: $i > $o,X22: $i > $i] :
( ( fun_image @ X22 @ ( union @ X27 @ X28 ) )
= ( union @ ( fun_image @ X22 @ X27 ) @ ( fun_image @ X22 @ X28 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FJc7qfSHiJ/E---3.1_347693.p',thm) ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FJc7qfSHiJ/E---3.1_347693.p',union) ).
thf(fun_image,axiom,
( fun_image
= ( ^ [X22: $i > $i,X23: $i > $o,X3: $i] :
? [X1: $i] :
( ( X23 @ X1 )
& ( X3
= ( X22 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FJc7qfSHiJ/E---3.1_347693.p',fun_image) ).
thf(c_0_3,negated_conjecture,
~ ! [X27: $i > $o,X28: $i > $o,X22: $i > $i] :
( ( fun_image @ X22 @ ( union @ X27 @ X28 ) )
= ( union @ ( fun_image @ X22 @ X27 ) @ ( fun_image @ X22 @ X28 ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_4,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_5,plain,
( fun_image
= ( ^ [Z0: $i > $i,Z1: $i > $o,Z2: $i] :
? [X1: $i] :
( ( Z1 @ X1 )
& ( Z2
= ( Z0 @ X1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[fun_image]) ).
thf(c_0_6,negated_conjecture,
~ ! [X27: $i > $o,X28: $i > $o,X22: $i > $i,X42: $i] :
( ? [X36: $i] :
( ( ( X27 @ X36 )
| ( X28 @ X36 ) )
& ( X42
= ( X22 @ X36 ) ) )
<=> ( ? [X37: $i] :
( ( X27 @ X37 )
& ( X42
= ( X22 @ X37 ) ) )
| ? [X38: $i] :
( ( X28 @ X38 )
& ( X42
= ( X22 @ X38 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[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,
! [X50: $i,X51: $i,X52: $i] :
( ( ~ ( epred1_0 @ X51 )
| ( esk2_0
!= ( esk1_0 @ X51 ) )
| ~ ( epred1_0 @ X50 )
| ( esk2_0
!= ( esk1_0 @ X50 ) ) )
& ( ~ ( epred2_0 @ X52 )
| ( esk2_0
!= ( esk1_0 @ X52 ) )
| ~ ( epred1_0 @ X50 )
| ( esk2_0
!= ( esk1_0 @ X50 ) ) )
& ( ~ ( epred1_0 @ X51 )
| ( esk2_0
!= ( esk1_0 @ X51 ) )
| ~ ( epred2_0 @ X50 )
| ( esk2_0
!= ( esk1_0 @ X50 ) ) )
& ( ~ ( epred2_0 @ X52 )
| ( esk2_0
!= ( esk1_0 @ X52 ) )
| ~ ( epred2_0 @ X50 )
| ( esk2_0
!= ( esk1_0 @ X50 ) ) )
& ( ( epred2_0 @ esk5_0 )
| ( epred1_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) )
& ( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( epred1_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) )
& ( ( epred2_0 @ esk5_0 )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) )
& ( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) )
& ( ( epred2_0 @ esk5_0 )
| ( epred1_0 @ esk4_0 )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) )
& ( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( epred1_0 @ esk4_0 )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) )
& ( ( epred2_0 @ esk5_0 )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) )
& ( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( esk2_0
= ( esk1_0 @ 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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( epred1_0 @ X1 )
| ( esk2_0
!= ( esk1_0 @ X1 ) )
| ~ ( epred1_0 @ X3 )
| ( esk2_0
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( epred1_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( epred1_0 @ esk4_0 )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 )
| ( epred2_0 @ esk5_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk3_0 )
= esk2_0 )
| ( epred2_0 @ esk5_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( epred2_0 @ esk3_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_10]) ).
thf(c_0_16,negated_conjecture,
( ( ( esk1_0 @ esk3_0 )
= esk2_0 )
| ( epred2_0 @ esk5_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ esk3_0 )
| ( epred2_0 @ esk5_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_15]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( epred2_0 @ X1 )
| ( esk2_0
!= ( esk1_0 @ X1 ) )
| ~ ( epred2_0 @ X3 )
| ( esk2_0
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
( ( epred2_0 @ esk5_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ esk3_0 )
| ( ( esk1_0 @ esk5_0 )
!= esk2_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk3_0 )
= esk2_0 )
| ( ( esk1_0 @ esk5_0 )
!= esk2_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
thf(c_0_22,negated_conjecture,
( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( epred1_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_23,negated_conjecture,
( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_24,negated_conjecture,
( ( epred2_0 @ esk3_0 )
| ( ( esk1_0 @ esk5_0 )
!= esk2_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_25,negated_conjecture,
( ( ( esk1_0 @ esk3_0 )
= esk2_0 )
| ( ( esk1_0 @ esk5_0 )
!= esk2_0 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk5_0 )
= esk2_0 )
| ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_22]),c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk5_0 )
!= esk2_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_25]) ).
thf(c_0_28,negated_conjecture,
( ( ( esk1_0 @ esk5_0 )
= esk2_0 )
| ( epred2_0 @ esk3_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_23]) ).
thf(c_0_29,negated_conjecture,
( ( esk1_0 @ esk5_0 )
!= esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25]) ).
thf(c_0_30,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( epred2_0 @ X1 )
| ( esk2_0
!= ( esk1_0 @ X1 ) )
| ~ ( epred1_0 @ X3 )
| ( esk2_0
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk3_0 )
!= esk2_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_30]),c_0_31]) ).
thf(c_0_33,negated_conjecture,
( ( epred2_0 @ esk3_0 )
| ( ( esk1_0 @ esk3_0 )
!= esk2_0 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
thf(c_0_34,negated_conjecture,
( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( epred1_0 @ esk4_0 )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ esk3_0 )
!= esk2_0 )
| ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
thf(c_0_36,negated_conjecture,
( ( esk2_0
= ( esk1_0 @ esk5_0 ) )
| ( esk2_0
= ( esk1_0 @ esk4_0 ) )
| ( esk2_0
= ( esk1_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_37,negated_conjecture,
( ( ( esk1_0 @ esk3_0 )
= esk2_0 )
| ( epred1_0 @ esk4_0 ) ),
inference(sr,[status(thm)],[c_0_34,c_0_29]) ).
thf(c_0_38,negated_conjecture,
( ( esk1_0 @ esk3_0 )
!= esk2_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
thf(c_0_39,negated_conjecture,
( ( ( esk1_0 @ esk4_0 )
= esk2_0 )
| ( ( esk1_0 @ esk3_0 )
= esk2_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
thf(c_0_40,negated_conjecture,
epred1_0 @ esk4_0,
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_41,negated_conjecture,
( ( esk1_0 @ esk4_0 )
= esk2_0 ),
inference(sr,[status(thm)],[c_0_39,c_0_38]) ).
thf(c_0_42,negated_conjecture,
! [X1: $i] :
( ( ( esk1_0 @ X1 )
!= esk2_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_40]),c_0_41])]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET752^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n017.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 13:36:22 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/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.FJc7qfSHiJ/E---3.1_347693.p
% 0.07/0.24 % Version: 3.5.1-ho
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % Starting sh1l with 300s (1) cores
% 0.07/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.24 % post_as_ho1 with pid 347707 completed with status 0
% 0.07/0.24 % Result found by post_as_ho1
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.24 % No SInE strategy applied
% 0.07/0.24 % Search class: HGHSF-FFSM33-SHSSMFNN
% 0.07/0.24 % partial match(3): HGHNF-FFSM00-SHSSMFNN
% 0.07/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.24 % SubtermCWHack with pid 347715 completed with status 0
% 0.07/0.24 % Result found by SubtermCWHack
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.24 % No SInE strategy applied
% 0.07/0.24 % Search class: HGHSF-FFSM33-SHSSMFNN
% 0.07/0.24 % partial match(3): HGHNF-FFSM00-SHSSMFNN
% 0.07/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.24 % Preprocessing time : 0.001 s
% 0.07/0.24
% 0.07/0.24 % Proof found!
% 0.07/0.24 % SZS status Theorem
% 0.07/0.24 % SZS output start CNFRefutation
% See solution above
% 0.07/0.24 % Parsed axioms : 45
% 0.07/0.24 % Removed by relevancy pruning/SinE : 0
% 0.07/0.24 % Initial clauses : 35
% 0.07/0.24 % Removed in clause preprocessing : 22
% 0.07/0.24 % Initial clauses in saturation : 13
% 0.07/0.24 % Processed clauses : 41
% 0.07/0.24 % ...of these trivial : 0
% 0.07/0.24 % ...subsumed : 4
% 0.07/0.24 % ...remaining for further processing : 37
% 0.07/0.24 % Other redundant clauses eliminated : 0
% 0.07/0.24 % Clauses deleted for lack of memory : 0
% 0.07/0.24 % Backward-subsumed : 23
% 0.07/0.24 % Backward-rewritten : 0
% 0.07/0.24 % Generated clauses : 66
% 0.07/0.24 % ...of the previous two non-redundant : 60
% 0.07/0.24 % ...aggressively subsumed : 0
% 0.07/0.24 % Contextual simplify-reflections : 11
% 0.07/0.24 % Paramodulations : 61
% 0.07/0.24 % Factorizations : 0
% 0.07/0.24 % NegExts : 0
% 0.07/0.24 % Equation resolutions : 0
% 0.07/0.24 % Disequality decompositions : 0
% 0.07/0.24 % Total rewrite steps : 2
% 0.07/0.24 % ...of those cached : 0
% 0.07/0.24 % Propositional unsat checks : 0
% 0.07/0.24 % Propositional check models : 0
% 0.07/0.24 % Propositional check unsatisfiable : 0
% 0.07/0.24 % Propositional clauses : 0
% 0.07/0.24 % Propositional clauses after purity: 0
% 0.07/0.24 % Propositional unsat core size : 0
% 0.07/0.24 % Propositional preprocessing time : 0.000
% 0.07/0.24 % Propositional encoding time : 0.000
% 0.07/0.24 % Propositional solver time : 0.000
% 0.07/0.24 % Success case prop preproc time : 0.000
% 0.07/0.24 % Success case prop encoding time : 0.000
% 0.07/0.24 % Success case prop solver time : 0.000
% 0.07/0.24 % Current number of processed clauses : 9
% 0.07/0.24 % Positive orientable unit clauses : 4
% 0.07/0.24 % Positive unorientable unit clauses: 0
% 0.07/0.24 % Negative unit clauses : 2
% 0.07/0.24 % Non-unit-clauses : 3
% 0.07/0.24 % Current number of unprocessed clauses: 4
% 0.07/0.24 % ...number of literals in the above : 15
% 0.07/0.24 % Current number of archived formulas : 0
% 0.07/0.24 % Current number of archived clauses : 28
% 0.07/0.24 % Clause-clause subsumption calls (NU) : 83
% 0.07/0.24 % Rec. Clause-clause subsumption calls : 37
% 0.07/0.24 % Non-unit clause-clause subsumptions : 30
% 0.07/0.24 % Unit Clause-clause subsumption calls : 14
% 0.07/0.24 % Rewrite failures with RHS unbound : 0
% 0.07/0.24 % BW rewrite match attempts : 1
% 0.07/0.24 % BW rewrite match successes : 1
% 0.07/0.24 % Condensation attempts : 0
% 0.07/0.24 % Condensation successes : 0
% 0.07/0.24 % Termbank termtop insertions : 2805
% 0.07/0.24 % Search garbage collected termcells : 379
% 0.07/0.24
% 0.07/0.24 % -------------------------------------------------
% 0.07/0.24 % User time : 0.007 s
% 0.07/0.24 % System time : 0.002 s
% 0.07/0.24 % Total time : 0.009 s
% 0.07/0.24 % Maximum resident set size: 3680 pages
% 0.07/0.24
% 0.07/0.24 % -------------------------------------------------
% 0.07/0.24 % User time : 0.010 s
% 0.07/0.24 % System time : 0.006 s
% 0.07/0.24 % Total time : 0.015 s
% 0.07/0.24 % Maximum resident set size: 4608 pages
% 0.07/0.24 % E exiting
%------------------------------------------------------------------------------