%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU558^2 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:24:30 AM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 69 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 255 ( 64 equ; 0 cnn)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 1228 ( 72 ~; 112 |; 10 &; 977 @)
% ( 10 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 71 ( 71 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 206 ( 20 ^; 186 !; 0 ?; 206 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_25,type,
dsetconstrI: $o ).
thf(decl_26,type,
dsetconstrEL: $o ).
thf(decl_27,type,
dsetconstrER: $o ).
thf(decl_28,type,
setext: $o ).
thf(decl_29,type,
esk1_2: $i > $i > $i ).
thf(decl_30,type,
esk2_2: $i > $i > $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(decl_33,type,
epred1_0: $i > $o ).
thf(decl_34,type,
epred2_0: $i > $o ).
thf(dsetconstr__Cong,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ! [X1: $i,X5: $i] :
( ( X1 = X5 )
=> ! [X2: $i > $o,X6: $i > $o] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( X3 = X4 )
=> ( ( X2 @ X3 )
<=> ( X6 @ X4 ) ) ) ) )
=> ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) )
= ( dsetconstr @ X5
@ ^ [X3: $i] : ( X6 @ X3 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FSWlpgtAwO/E---3.1_798520.p',dsetconstr__Cong) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FSWlpgtAwO/E---3.1_798520.p',dsetconstrER) ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FSWlpgtAwO/E---3.1_798520.p',dsetconstrI) ).
thf(dsetconstrEL,axiom,
( dsetconstrEL
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( in @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FSWlpgtAwO/E---3.1_798520.p',dsetconstrEL) ).
thf(setext,axiom,
( setext
<=> ! [X1: $i,X5: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X5 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( in @ X3 @ X1 ) )
=> ( X1 = X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FSWlpgtAwO/E---3.1_798520.p',setext) ).
thf(c_0_5,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ! [X1: $i,X5: $i] :
( ( X1 = X5 )
=> ! [X2: $i > $o,X6: $i > $o] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( X3 = X4 )
=> ( ( X2 @ X3 )
<=> ( X6 @ X4 ) ) ) ) )
=> ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) )
= ( dsetconstr @ X5
@ ^ [X3: $i] : ( X6 @ X3 ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[dsetconstr__Cong]) ).
thf(c_0_6,plain,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
=> ( X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_7,plain,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_8,plain,
( dsetconstrEL
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
=> ( in @ X3 @ X1 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrEL]) ).
thf(c_0_9,negated_conjecture,
~ ( ! [X26: $i,X27: $i > $o,X28: $i] :
( ( in @ X28 @ X26 )
=> ( ( X27 @ X28 )
=> ( in @ X28
@ ( dsetconstr @ X26
@ ^ [Z0: $i] : ( X27 @ Z0 ) ) ) ) )
=> ( ! [X29: $i,X30: $i > $o,X31: $i] :
( ( in @ X31
@ ( dsetconstr @ X29
@ ^ [Z0: $i] : ( X30 @ Z0 ) ) )
=> ( in @ X31 @ X29 ) )
=> ( ! [X32: $i,X33: $i > $o,X34: $i] :
( ( in @ X34
@ ( dsetconstr @ X32
@ ^ [Z0: $i] : ( X33 @ Z0 ) ) )
=> ( X33 @ X34 ) )
=> ( ! [X35: $i,X36: $i] :
( ! [X37: $i] :
( ( in @ X37 @ X35 )
=> ( in @ X37 @ X36 ) )
=> ( ! [X38: $i] :
( ( in @ X38 @ X36 )
=> ( in @ X38 @ X35 ) )
=> ( X35 = X36 ) ) )
=> ! [X1: $i,X5: $i] :
( ( X1 = X5 )
=> ! [X2: $i > $o,X6: $i > $o] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( X3 = X4 )
=> ( ( X2 @ X3 )
<=> ( X6 @ X4 ) ) ) ) )
=> ( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) )
= ( dsetconstr @ X5
@ ^ [Z0: $i] : ( X6 @ Z0 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]),c_0_6]),c_0_7]),c_0_8]),setext]) ).
thf(c_0_10,negated_conjecture,
! [X39: $i,X40: $i > $o,X41: $i,X42: $i,X43: $i > $o,X44: $i,X45: $i,X46: $i > $o,X47: $i,X48: $i,X49: $i,X56: $i,X57: $i] :
( ( ~ ( in @ X41 @ X39 )
| ~ ( X40 @ X41 )
| ( in @ X41
@ ( dsetconstr @ X39
@ ^ [Z0: $i] : ( X40 @ Z0 ) ) ) )
& ( ~ ( in @ X44
@ ( dsetconstr @ X42
@ ^ [Z0: $i] : ( X43 @ Z0 ) ) )
| ( in @ X44 @ X42 ) )
& ( ~ ( in @ X47
@ ( dsetconstr @ X45
@ ^ [Z0: $i] : ( X46 @ Z0 ) ) )
| ( X46 @ X47 ) )
& ( ( in @ ( esk2_2 @ X48 @ X49 ) @ X49 )
| ( X48 = X49 )
| ( in @ ( esk1_2 @ X48 @ X49 ) @ X48 ) )
& ( ~ ( in @ ( esk2_2 @ X48 @ X49 ) @ X48 )
| ( X48 = X49 )
| ( in @ ( esk1_2 @ X48 @ X49 ) @ X48 ) )
& ( ( in @ ( esk2_2 @ X48 @ X49 ) @ X49 )
| ( X48 = X49 )
| ~ ( in @ ( esk1_2 @ X48 @ X49 ) @ X49 ) )
& ( ~ ( in @ ( esk2_2 @ X48 @ X49 ) @ X48 )
| ( X48 = X49 )
| ~ ( in @ ( esk1_2 @ X48 @ X49 ) @ X49 ) )
& ( esk3_0 = esk4_0 )
& ( ~ ( epred1_0 @ X56 )
| ( epred2_0 @ X57 )
| ( X56 != X57 )
| ~ ( in @ X57 @ esk4_0 )
| ~ ( in @ X56 @ esk3_0 ) )
& ( ~ ( epred2_0 @ X57 )
| ( epred1_0 @ X56 )
| ( X56 != X57 )
| ~ ( in @ X57 @ esk4_0 )
| ~ ( in @ X56 @ esk3_0 ) )
& ( ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( epred1_0 @ Z0 ) )
!= ( dsetconstr @ esk4_0
@ ^ [Z0: $i] : ( epred2_0 @ Z0 ) ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X1: $i] :
( ( X1 = X3 )
| ( in @ ( esk1_2 @ X1 @ X3 ) @ X1 )
| ~ ( in @ ( esk2_2 @ X1 @ X3 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X1: $i] :
( ( in @ ( esk2_2 @ X1 @ X3 ) @ X3 )
| ( X1 = X3 )
| ( in @ ( esk1_2 @ X1 @ X3 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X3 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ ( dsetconstr @ X1 @ X2 ) )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X3: $i] :
( ( in @ ( esk2_2 @ X1 @ X3 ) @ X3 )
| ( X1 = X3 )
| ~ ( in @ ( esk1_2 @ X1 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X1 )
| ( X2 @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X3 )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X3 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X3 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X1 )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( X2 @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X1 )
| ( X6 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X3: $i] :
( ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X1 )
| ( X3 != X1 )
| ~ ( in @ X1 @ esk4_0 )
| ~ ( in @ X3 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_24,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( in @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 )
| ~ ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X1 )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X1 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X1 ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i,X6: $i > $o,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 )
= ( dsetconstr @ X1 @ X2 ) )
| ( X2 @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 ) @ ( dsetconstr @ X1 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
thf(c_0_30,negated_conjecture,
! [X6: $i > $o,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 )
= ( dsetconstr @ X1 @ X2 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 ) @ ( dsetconstr @ X1 @ X2 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i,X3: $i] :
( ( X1 = X3 )
| ~ ( in @ ( esk2_2 @ X1 @ X3 ) @ X1 )
| ~ ( in @ ( esk1_2 @ X1 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 )
= ( dsetconstr @ X1 @ X2 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 ) @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_33,negated_conjecture,
! [X6: $i > $o,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 )
= ( dsetconstr @ esk3_0 @ X2 ) )
| ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 ) @ ( dsetconstr @ esk3_0 @ X2 ) ) )
| ~ ( epred2_0 @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 ) @ ( dsetconstr @ esk3_0 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 )
= ( dsetconstr @ X1 @ X2 ) )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 ) @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X3 )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X3 )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_36,negated_conjecture,
! [X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ X2 )
= ( dsetconstr @ esk3_0 @ epred2_0 ) )
| ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ X2 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
thf(c_0_37,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 )
= ( dsetconstr @ X1 @ X2 ) )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 ) @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ X1 @ X2 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_12]),c_0_13]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i,X2: $i > $o,X9: $i > $o,X6: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ ( dsetconstr @ X3 @ X6 ) @ X9 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( dsetconstr @ X3 @ X6 ) @ X9 ) ) @ X1 )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( dsetconstr @ X3 @ X6 ) @ X9 ) ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X3 )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
thf(c_0_40,negated_conjecture,
( ( ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 )
= ( dsetconstr @ esk3_0 @ epred2_0 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X2 )
= ( dsetconstr @ X1 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_32]) ).
thf(c_0_42,negated_conjecture,
! [X3: $i,X1: $i] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X1 )
| ( X1 != X3 )
| ~ ( in @ X3 @ esk4_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_43,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o,X9: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ ( dsetconstr @ X1 @ X6 ) @ X9 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( dsetconstr @ X1 @ X6 ) @ X9 ) ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( dsetconstr @ X1 @ X6 ) @ X9 ) ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
thf(c_0_44,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X3 )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ esk3_0 @ X6 ) )
| ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) )
| ~ ( epred2_0 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_39]) ).
thf(c_0_46,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) )
| ( X6 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
thf(c_0_47,negated_conjecture,
( ( dsetconstr @ esk3_0 @ epred1_0 )
!= ( dsetconstr @ esk4_0 @ epred2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_48,negated_conjecture,
( ( ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 )
= ( dsetconstr @ esk3_0 @ epred2_0 ) )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
thf(c_0_49,negated_conjecture,
! [X1: $i,X6: $i > $o,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 )
= ( dsetconstr @ X1 @ X2 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 ) @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
thf(c_0_50,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24])]) ).
thf(c_0_51,negated_conjecture,
! [X6: $i > $o,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 )
= ( dsetconstr @ X1 @ X6 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X6 ) @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X6 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
thf(c_0_52,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X1 @ X6 ) )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
thf(c_0_53,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ esk3_0 @ epred2_0 ) )
| ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
thf(c_0_54,negated_conjecture,
( ( dsetconstr @ esk3_0 @ epred2_0 )
!= ( dsetconstr @ esk3_0 @ epred1_0 ) ),
inference(rw,[status(thm)],[c_0_47,c_0_24]) ).
thf(c_0_55,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ~ ( in @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X1 )
| ~ ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 )
| ~ ( X2 @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_12]) ).
thf(c_0_56,negated_conjecture,
( ( dsetconstr @ ( dsetconstr @ esk3_0 @ epred2_0 ) @ epred1_0 )
= ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_12]),c_0_36]),c_0_49]) ).
thf(c_0_57,negated_conjecture,
! [X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 )
= ( dsetconstr @ esk3_0 @ X6 ) )
| ( epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X6 ) @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 ) ) )
| ~ ( epred1_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X6 ) @ ( dsetconstr @ ( dsetconstr @ esk3_0 @ X2 ) @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
thf(c_0_58,negated_conjecture,
epred1_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
thf(c_0_59,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ~ ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X3 )
| ~ ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X1 )
| ~ ( X6 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_55,c_0_12]) ).
thf(c_0_60,negated_conjecture,
in @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_56]),c_0_54]) ).
thf(c_0_61,negated_conjecture,
epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_56]),c_0_58])]),c_0_54]) ).
thf(c_0_62,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( in @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 )
| ~ ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 )
| ~ ( X2 @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
thf(c_0_63,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( X2 @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 )
| ~ ( X2 @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
thf(c_0_64,negated_conjecture,
( ~ ( in @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ esk3_0 )
| ~ ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),c_0_54]) ).
thf(c_0_65,negated_conjecture,
in @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_61]),c_0_54]),c_0_60])]) ).
thf(c_0_66,negated_conjecture,
epred2_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_60]),c_0_61])]),c_0_54]) ).
thf(c_0_67,negated_conjecture,
~ ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
thf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_65]),c_0_66])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU558^2 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n019.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 13:50:17 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 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.FSWlpgtAwO/E---3.1_798520.p
% 0.21/0.30 % Version: 3.5.1-ho
% 0.21/0.30 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.30 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.30 % Starting new_bool_9 with 300s (1) cores
% 0.21/0.30 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.21/0.30 % new_bool_2 with pid 798554 completed with status 0
% 0.21/0.30 % Result found by new_bool_2
% 0.21/0.30 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.30 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.30 % Search class: HGUSF-FFSF22-SSSFMSBN
% 0.21/0.30 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.30 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.30 % SubtermCWHack with pid 798557 completed with status 0
% 0.21/0.30 % Result found by SubtermCWHack
% 0.21/0.30 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.30 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.30 % Search class: HGUSF-FFSF22-SSSFMSBN
% 0.21/0.30 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.30 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.30 % Preprocessing time : 0.001 s
% 0.21/0.30
% 0.21/0.30 % Proof found!
% 0.21/0.30 % SZS status Theorem
% 0.21/0.30 % SZS output start CNFRefutation
% See solution above
% 0.21/0.30 % Parsed axioms : 11
% 0.21/0.30 % Removed by relevancy pruning/SinE : 6
% 0.21/0.30 % Initial clauses : 11
% 0.21/0.30 % Removed in clause preprocessing : 0
% 0.21/0.30 % Initial clauses in saturation : 11
% 0.21/0.30 % Processed clauses : 576
% 0.21/0.30 % ...of these trivial : 7
% 0.21/0.30 % ...subsumed : 352
% 0.21/0.30 % ...remaining for further processing : 216
% 0.21/0.30 % Other redundant clauses eliminated : 2
% 0.21/0.30 % Clauses deleted for lack of memory : 0
% 0.21/0.30 % Backward-subsumed : 9
% 0.21/0.30 % Backward-rewritten : 26
% 0.21/0.30 % Generated clauses : 1295
% 0.21/0.30 % ...of the previous two non-redundant : 1185
% 0.21/0.30 % ...aggressively subsumed : 0
% 0.21/0.30 % Contextual simplify-reflections : 15
% 0.21/0.30 % Paramodulations : 1293
% 0.21/0.30 % Factorizations : 0
% 0.21/0.30 % NegExts : 0
% 0.21/0.30 % Equation resolutions : 2
% 0.21/0.30 % Disequality decompositions : 0
% 0.21/0.30 % Total rewrite steps : 236
% 0.21/0.30 % ...of those cached : 221
% 0.21/0.30 % Propositional unsat checks : 0
% 0.21/0.30 % Propositional check models : 0
% 0.21/0.30 % Propositional check unsatisfiable : 0
% 0.21/0.30 % Propositional clauses : 0
% 0.21/0.30 % Propositional clauses after purity: 0
% 0.21/0.30 % Propositional unsat core size : 0
% 0.21/0.30 % Propositional preprocessing time : 0.000
% 0.21/0.30 % Propositional encoding time : 0.000
% 0.21/0.30 % Propositional solver time : 0.000
% 0.21/0.30 % Success case prop preproc time : 0.000
% 0.21/0.30 % Success case prop encoding time : 0.000
% 0.21/0.30 % Success case prop solver time : 0.000
% 0.21/0.30 % Current number of processed clauses : 179
% 0.21/0.30 % Positive orientable unit clauses : 10
% 0.21/0.30 % Positive unorientable unit clauses: 0
% 0.21/0.30 % Negative unit clauses : 2
% 0.21/0.30 % Non-unit-clauses : 167
% 0.21/0.30 % Current number of unprocessed clauses: 614
% 0.21/0.30 % ...number of literals in the above : 2056
% 0.21/0.30 % Current number of archived formulas : 0
% 0.21/0.30 % Current number of archived clauses : 35
% 0.21/0.30 % Clause-clause subsumption calls (NU) : 6146
% 0.21/0.30 % Rec. Clause-clause subsumption calls : 2656
% 0.21/0.30 % Non-unit clause-clause subsumptions : 376
% 0.21/0.30 % Unit Clause-clause subsumption calls : 221
% 0.21/0.30 % Rewrite failures with RHS unbound : 0
% 0.21/0.30 % BW rewrite match attempts : 60
% 0.21/0.30 % BW rewrite match successes : 8
% 0.21/0.30 % Condensation attempts : 0
% 0.21/0.30 % Condensation successes : 0
% 0.21/0.30 % Termbank termtop insertions : 39376
% 0.21/0.30 % Search garbage collected termcells : 537
% 0.21/0.30
% 0.21/0.30 % -------------------------------------------------
% 0.21/0.30 % User time : 0.040 s
% 0.21/0.30 % System time : 0.001 s
% 0.21/0.30 % Total time : 0.041 s
% 0.21/0.30 % Maximum resident set size: 3640 pages
% 0.21/0.30
% 0.21/0.30 % -------------------------------------------------
% 0.21/0.30 % User time : 0.041 s
% 0.21/0.30 % System time : 0.007 s
% 0.21/0.30 % Total time : 0.048 s
% 0.21/0.30 % Maximum resident set size: 4608 pages
% 0.21/0.30 % E exiting
%------------------------------------------------------------------------------