TSTP Solution File: SEU678^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU678^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:29:04 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 37
% Syntax : Number of formulae : 92 ( 21 unt; 24 typ; 0 def)
% Number of atoms : 320 ( 58 equ; 0 cnn)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 1211 ( 89 ~; 95 |; 25 &; 938 @)
% ( 10 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 90 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 24 usr; 11 con; 0-3 aty)
% Number of variables : 223 ( 64 ^ 150 !; 9 ?; 223 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_26,type,
subset: $i > $i > $o ).
thf(decl_27,type,
kpair: $i > $i > $i ).
thf(decl_28,type,
cartprod: $i > $i > $i ).
thf(decl_29,type,
singleton: $i > $o ).
thf(decl_30,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_31,type,
ex1I: $o ).
thf(decl_32,type,
breln: $i > $i > $i > $o ).
thf(decl_33,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_34,type,
dpsetconstrI: $o ).
thf(decl_35,type,
setOfPairsIsBReln: $o ).
thf(decl_36,type,
dpsetconstrERa: $o ).
thf(decl_37,type,
func: $i > $i > $i > $o ).
thf(decl_38,type,
esk1_3: $i > ( $i > $o ) > $i > $i ).
thf(decl_39,type,
esk2_3: $i > ( $i > $o ) > $i > $i ).
thf(decl_40,type,
esk3_0: $i ).
thf(decl_41,type,
esk4_0: $i ).
thf(decl_42,type,
esk5_0: $i > $i ).
thf(decl_43,type,
esk6_0: $i ).
thf(decl_44,type,
epred1_0: $i > $i > $o ).
thf(decl_45,type,
epred2_0: $i > $o ).
thf(ex1,axiom,
( ex1
= ( ^ [X1: $i,X3: $i > $o] :
( singleton
@ ( dsetconstr @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X1
= ( setadjoin @ X2 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(ex1I,axiom,
( ex1I
<=> ! [X1: $i,X3: $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X3 @ X2 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X4 )
=> ( X4 = X2 ) ) )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( X3 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1I) ).
thf(setOfPairsIsBReln,axiom,
( setOfPairsIsBReln
<=> ! [X1: $i,X5: $i,X10: $i > $i > $o] :
( breln @ X1 @ X5
@ ( dpsetconstr @ X1 @ X5
@ ^ [X2: $i,X4: $i] : ( X10 @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setOfPairsIsBReln) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X5: $i,X6: $i] : ( subset @ X6 @ ( cartprod @ X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(func,axiom,
( func
= ( ^ [X1: $i,X5: $i,X12: $i] :
( ( breln @ X1 @ X5 @ X12 )
& ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( ex1 @ X5
@ ^ [X4: $i] : ( in @ ( kpair @ X2 @ X4 ) @ X12 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',func) ).
thf(dpsetconstrI,axiom,
( dpsetconstrI
<=> ! [X1: $i,X5: $i,X7: $i > $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( X7 @ X2 @ X4 )
=> ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [X8: $i,X9: $i] : ( X7 @ X8 @ X9 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrI) ).
thf(dpsetconstrERa,axiom,
( dpsetconstrERa
<=> ! [X1: $i,X5: $i,X11: $i > $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [X8: $i,X9: $i] : ( X11 @ X8 @ X9 ) ) )
=> ( X11 @ X2 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrERa) ).
thf(lamProp,conjecture,
( ex1I
=> ( dpsetconstrI
=> ( setOfPairsIsBReln
=> ( dpsetconstrERa
=> ! [X1: $i,X5: $i,X13: $i > $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( X13 @ X2 ) @ X5 ) )
=> ( func @ X1 @ X5
@ ( dpsetconstr @ X1 @ X5
@ ^ [X2: $i,X4: $i] :
( ( X13 @ X2 )
= X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lamProp) ).
thf(c_0_9,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X35: $i] :
( ( in @ X35
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X35 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_10,plain,
( singleton
= ( ^ [Z0: $i] :
? [X2: $i] :
( ( in @ X2 @ Z0 )
& ( Z0
= ( setadjoin @ X2 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_11,plain,
( ex1I
<=> ! [X1: $i,X3: $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X3 @ X2 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X4 )
=> ( X4 = X2 ) ) )
=> ( ex1 @ X1
@ ^ [Z0: $i] : ( X3 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1I]) ).
thf(c_0_12,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X35: $i] :
( ( in @ X35
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X35 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
( setOfPairsIsBReln
<=> ! [X1: $i,X5: $i,X10: $i > $i > $o] :
( breln @ X1 @ X5
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z0: $i,Z1: $i] : ( X10 @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[setOfPairsIsBReln]) ).
thf(c_0_14,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_15,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ? [X37: $i] :
( ( in @ X37
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X37 @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[func]) ).
thf(c_0_16,plain,
( ex1I
= ( ! [X1: $i,X3: $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X3 @ X2 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X4 )
=> ( X4 = X2 ) ) )
=> ? [X36: $i] :
( ( in @ X36
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X3 @ Z0 ) ) )
& ( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X3 @ Z0 ) )
= ( setadjoin @ X36 @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,plain,
( dpsetconstrI
<=> ! [X1: $i,X5: $i,X7: $i > $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( X7 @ X2 @ X4 )
=> ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z0: $i,Z1: $i] : ( X7 @ Z0 @ Z1 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dpsetconstrI]) ).
thf(c_0_18,plain,
( setOfPairsIsBReln
= ( ! [X1: $i,X5: $i,X10: $i > $i > $o] :
( subset
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z0: $i,Z1: $i] : ( X10 @ Z0 @ Z1 ) )
@ ( cartprod @ X1 @ X5 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
( dpsetconstrERa
<=> ! [X1: $i,X5: $i,X11: $i > $i > $o,X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X5 )
=> ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z0: $i,Z1: $i] : ( X11 @ Z0 @ Z1 ) ) )
=> ( X11 @ X2 @ X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dpsetconstrERa]) ).
thf(c_0_20,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ? [X37: $i] :
( ( in @ X37
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X37 @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_12]),c_0_14]) ).
thf(c_0_21,negated_conjecture,
~ ( ! [X38: $i,X39: $i > $o,X40: $i] :
( ( in @ X40 @ X38 )
=> ( ( X39 @ X40 )
=> ( ! [X41: $i] :
( ( in @ X41 @ X38 )
=> ( ( X39 @ X41 )
=> ( X41 = X40 ) ) )
=> ? [X42: $i] :
( ( in @ X42 @ ( dsetconstr @ X38 @ X39 ) )
& ( ( dsetconstr @ X38 @ X39 )
= ( setadjoin @ X42 @ emptyset ) ) ) ) ) )
=> ( ! [X43: $i,X44: $i,X45: $i > $i > $o,X46: $i] :
( ( in @ X46 @ X43 )
=> ! [X47: $i] :
( ( in @ X47 @ X44 )
=> ( ( X45 @ X46 @ X47 )
=> ( in @ ( kpair @ X46 @ X47 ) @ ( dpsetconstr @ X43 @ X44 @ X45 ) ) ) ) )
=> ( ! [X48: $i,X49: $i,X50: $i > $i > $o] : ( subset @ ( dpsetconstr @ X48 @ X49 @ X50 ) @ ( cartprod @ X48 @ X49 ) )
=> ( ! [X51: $i,X52: $i,X53: $i > $i > $o,X54: $i] :
( ( in @ X54 @ X51 )
=> ! [X55: $i] :
( ( in @ X55 @ X52 )
=> ( ( in @ ( kpair @ X54 @ X55 ) @ ( dpsetconstr @ X51 @ X52 @ X53 ) )
=> ( X53 @ X54 @ X55 ) ) ) )
=> ! [X1: $i,X5: $i,X13: $i > $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( X13 @ X2 ) @ X5 ) )
=> ( ( subset
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z0: $i] : ( $eq @ ( X13 @ Z0 ) ) )
@ ( cartprod @ X1 @ X5 ) )
& ! [X56: $i] :
( ( in @ X56 @ X1 )
=> ? [X57: $i] :
( ( in @ X57
@ ( dsetconstr @ X5
@ ^ [Z0: $i] :
( in @ ( kpair @ X56 @ Z0 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z1: $i] : ( $eq @ ( X13 @ Z1 ) ) ) ) ) )
& ( ( dsetconstr @ X5
@ ^ [Z0: $i] :
( in @ ( kpair @ X56 @ Z0 )
@ ( dpsetconstr @ X1 @ X5
@ ^ [Z1: $i] : ( $eq @ ( X13 @ Z1 ) ) ) ) )
= ( setadjoin @ X57 @ emptyset ) ) ) ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[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)],[inference(assume_negation,[status(cth)],[lamProp])]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_22,plain,
! [X88: $i] :
( ( epred1_0 @ X88 )
= ( $eq @ ( esk5_0 @ X88 ) ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_23,negated_conjecture,
! [X58: $i,X59: $i > $o,X60: $i,X63: $i,X64: $i,X65: $i > $i > $o,X66: $i,X67: $i,X68: $i,X69: $i,X70: $i > $i > $o,X71: $i,X72: $i,X73: $i > $i > $o,X74: $i,X75: $i,X79: $i,X81: $i] :
( ( ( in @ ( esk2_3 @ X58 @ X59 @ X60 ) @ ( dsetconstr @ X58 @ X59 ) )
| ( in @ ( esk1_3 @ X58 @ X59 @ X60 ) @ X58 )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ( ( dsetconstr @ X58 @ X59 )
= ( setadjoin @ ( esk2_3 @ X58 @ X59 @ X60 ) @ emptyset ) )
| ( in @ ( esk1_3 @ X58 @ X59 @ X60 ) @ X58 )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ( in @ ( esk2_3 @ X58 @ X59 @ X60 ) @ ( dsetconstr @ X58 @ X59 ) )
| ( X59 @ ( esk1_3 @ X58 @ X59 @ X60 ) )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ( ( dsetconstr @ X58 @ X59 )
= ( setadjoin @ ( esk2_3 @ X58 @ X59 @ X60 ) @ emptyset ) )
| ( X59 @ ( esk1_3 @ X58 @ X59 @ X60 ) )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ( in @ ( esk2_3 @ X58 @ X59 @ X60 ) @ ( dsetconstr @ X58 @ X59 ) )
| ( ( esk1_3 @ X58 @ X59 @ X60 )
!= X60 )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ( ( dsetconstr @ X58 @ X59 )
= ( setadjoin @ ( esk2_3 @ X58 @ X59 @ X60 ) @ emptyset ) )
| ( ( esk1_3 @ X58 @ X59 @ X60 )
!= X60 )
| ~ ( X59 @ X60 )
| ~ ( in @ X60 @ X58 ) )
& ( ~ ( in @ X66 @ X63 )
| ~ ( in @ X67 @ X64 )
| ~ ( X65 @ X66 @ X67 )
| ( in @ ( kpair @ X66 @ X67 ) @ ( dpsetconstr @ X63 @ X64 @ X65 ) ) )
& ( subset @ ( dpsetconstr @ X68 @ X69 @ X70 ) @ ( cartprod @ X68 @ X69 ) )
& ( ~ ( in @ X74 @ X71 )
| ~ ( in @ X75 @ X72 )
| ~ ( in @ ( kpair @ X74 @ X75 ) @ ( dpsetconstr @ X71 @ X72 @ X73 ) )
| ( X73 @ X74 @ X75 ) )
& ( ~ ( in @ X79 @ esk3_0 )
| ( in @ ( esk5_0 @ X79 ) @ esk4_0 ) )
& ( ( in @ esk6_0 @ esk3_0 )
| ~ ( subset
@ ( dpsetconstr @ esk3_0 @ esk4_0
@ ^ [Z0: $i] : ( $eq @ ( esk5_0 @ Z0 ) ) )
@ ( cartprod @ esk3_0 @ esk4_0 ) ) )
& ( ~ ( in @ X81
@ ( dsetconstr @ esk4_0
@ ^ [Z0: $i] :
( in @ ( kpair @ esk6_0 @ Z0 )
@ ( dpsetconstr @ esk3_0 @ esk4_0
@ ^ [Z1: $i] : ( $eq @ ( esk5_0 @ Z1 ) ) ) ) ) )
| ( ( dsetconstr @ esk4_0
@ ^ [Z0: $i] :
( in @ ( kpair @ esk6_0 @ Z0 )
@ ( dpsetconstr @ esk3_0 @ esk4_0
@ ^ [Z1: $i] : ( $eq @ ( esk5_0 @ Z1 ) ) ) ) )
!= ( setadjoin @ X81 @ emptyset ) )
| ~ ( subset
@ ( dpsetconstr @ esk3_0 @ esk4_0
@ ^ [Z0: $i] : ( $eq @ ( esk5_0 @ Z0 ) ) )
@ ( cartprod @ esk3_0 @ esk4_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_21])])])])])]) ).
thf(c_0_24,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
= ( $eq @ ( esk5_0 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,plain,
! [X82: $i] :
( ( epred1_0 @ X82 )
= ( $eq @ ( esk5_0 @ X82 ) ) ),
introduced(definition) ).
thf(c_0_26,negated_conjecture,
! [X2: $i,X1: $i,X7: $i > $i > $o,X5: $i,X4: $i] :
( ( in @ ( kpair @ X1 @ X4 ) @ ( dpsetconstr @ X2 @ X5 @ X7 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X4 @ X5 )
| ~ ( X7 @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk5_0 @ X1 ) @ esk4_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,plain,
! [X1: $i,X90: $i] :
( ( ( esk5_0 @ X1 )
= X90 )
<=> ( epred1_0 @ X1 @ X90 ) ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_29,negated_conjecture,
( ( in @ esk6_0 @ esk3_0 )
| ( ( subset @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) @ ( cartprod @ esk3_0 @ esk4_0 ) )
!= $true ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_23]),c_0_25]) ).
thf(c_0_30,plain,
! [X89: $i] :
( ( ~ ( epred2_0 @ X89 )
| ( in @ ( kpair @ esk6_0 @ X89 ) @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) ) )
& ( ~ ( in @ ( kpair @ esk6_0 @ X89 ) @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) )
| ( epred2_0 @ X89 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i,X2: $i,X7: $i > $i > $o,X4: $i] :
( ( in @ ( kpair @ X1 @ ( esk5_0 @ X2 ) ) @ ( dpsetconstr @ X4 @ esk4_0 @ X7 ) )
| ~ ( X7 @ X1 @ ( esk5_0 @ X2 ) )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ X1 @ X4 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_32,plain,
! [X1: $i] : ( epred1_0 @ X1 @ ( esk5_0 @ X1 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_28])]) ).
thf(c_0_33,negated_conjecture,
( ( in @ esk6_0 @ esk3_0 )
| ~ ( subset @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) @ ( cartprod @ esk3_0 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[c_0_29]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i,X7: $i > $i > $o,X2: $i] : ( subset @ ( dpsetconstr @ X1 @ X2 @ X7 ) @ ( cartprod @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_35,plain,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( in @ ( kpair @ esk6_0 @ X1 ) @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,plain,
! [X1: $i,X2: $i] :
( ( in @ ( kpair @ X1 @ ( esk5_0 @ X1 ) ) @ ( dpsetconstr @ X2 @ esk4_0 @ epred1_0 ) )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_37,negated_conjecture,
in @ esk6_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_38,plain,
! [X83: $i] :
( ( epred2_0 @ X83 )
<=> ( in @ ( kpair @ esk6_0 @ X83 ) @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) ) ),
introduced(definition) ).
thf(c_0_39,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X3 )
= ( setadjoin @ ( esk2_3 @ X1 @ X3 @ X2 ) @ emptyset ) )
| ( in @ ( esk1_3 @ X1 @ X3 @ X2 ) @ X1 )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_40,plain,
epred2_0 @ ( esk5_0 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i] :
( ( ( in @ X1 @ ( dsetconstr @ esk4_0 @ epred2_0 ) )
!= $true )
| ( ( dsetconstr @ esk4_0 @ epred2_0 )
!= ( setadjoin @ X1 @ emptyset ) )
| ( ( subset @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) @ ( cartprod @ esk3_0 @ esk4_0 ) )
!= $true ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_23]),c_0_25]),c_0_38]),c_0_25]),c_0_38]),c_0_25]) ).
thf(c_0_42,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ emptyset )
= ( dsetconstr @ X1 @ epred2_0 ) )
| ( in @ ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ X1 )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_43,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X3 )
= ( setadjoin @ ( esk2_3 @ X1 @ X3 @ X2 ) @ emptyset ) )
| ( X3 @ ( esk1_3 @ X1 @ X3 @ X2 ) )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_44,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X3 )
= ( setadjoin @ ( esk2_3 @ X1 @ X3 @ X2 ) @ emptyset ) )
| ( ( esk1_3 @ X1 @ X3 @ X2 )
!= X2 )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X5: $i,X7: $i > $i > $o] :
( ( X7 @ X1 @ X4 )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X4 @ X5 )
| ~ ( in @ ( kpair @ X1 @ X4 ) @ ( dpsetconstr @ X2 @ X5 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_46,plain,
! [X1: $i] :
( ( in @ ( kpair @ esk6_0 @ X1 ) @ ( dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0 ) )
| ~ ( epred2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
!= ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ~ ( in @ X1 @ ( dsetconstr @ esk4_0 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[c_0_41]),c_0_34])]) ).
thf(c_0_48,negated_conjecture,
( ( ( setadjoin @ ( esk2_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ emptyset )
= ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ( in @ ( esk1_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_37])]) ).
thf(c_0_49,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( in @ ( esk2_3 @ X1 @ X3 @ X2 ) @ ( dsetconstr @ X1 @ X3 ) )
| ( in @ ( esk1_3 @ X1 @ X3 @ X2 ) @ X1 )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_50,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ emptyset )
= ( dsetconstr @ X1 @ epred2_0 ) )
| ( epred2_0 @ ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
thf(c_0_51,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( in @ ( esk2_3 @ X1 @ X3 @ X2 ) @ ( dsetconstr @ X1 @ X3 ) )
| ( X3 @ ( esk1_3 @ X1 @ X3 @ X2 ) )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_52,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ emptyset )
= ( dsetconstr @ X1 @ epred2_0 ) )
| ( ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) )
!= ( esk5_0 @ esk6_0 ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_40]) ).
thf(c_0_53,negated_conjecture,
! [X3: $i > $o,X2: $i,X1: $i] :
( ( in @ ( esk2_3 @ X1 @ X3 @ X2 ) @ ( dsetconstr @ X1 @ X3 ) )
| ( ( esk1_3 @ X1 @ X3 @ X2 )
!= X2 )
| ~ ( X3 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_54,plain,
! [X1: $i,X2: $i] :
( ( ( esk5_0 @ X1 )
= X2 )
| ~ ( epred1_0 @ X1 @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_28]) ).
thf(c_0_55,plain,
! [X1: $i] :
( ( epred1_0 @ esk6_0 @ X1 )
| ~ ( in @ X1 @ esk4_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_37])]) ).
thf(c_0_56,negated_conjecture,
( ( in @ ( esk1_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ esk4_0 )
| ~ ( in @ ( esk2_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ esk4_0 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
thf(c_0_57,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ X1 @ epred2_0 ) )
| ( in @ ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ X1 )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_49,c_0_40]) ).
thf(c_0_58,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) )
| ( ( dsetconstr @ X1 @ epred2_0 )
!= ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ~ ( in @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_47,c_0_50]) ).
thf(c_0_59,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ X1 @ epred2_0 ) )
| ( epred2_0 @ ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
thf(c_0_60,negated_conjecture,
! [X1: $i] :
( ( ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) )
!= ( esk5_0 @ esk6_0 ) )
| ( ( dsetconstr @ X1 @ epred2_0 )
!= ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ~ ( in @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ esk4_0 @ epred2_0 ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_47,c_0_52]) ).
thf(c_0_61,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk2_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ ( dsetconstr @ X1 @ epred2_0 ) )
| ( ( esk1_3 @ X1 @ epred2_0 @ ( esk5_0 @ esk6_0 ) )
!= ( esk5_0 @ esk6_0 ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
thf(c_0_62,plain,
! [X1: $i] :
( ( ( esk5_0 @ esk6_0 )
= X1 )
| ~ ( in @ X1 @ esk4_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
thf(c_0_63,negated_conjecture,
( ( in @ ( esk1_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) @ esk4_0 )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
thf(c_0_64,negated_conjecture,
( ( epred2_0 @ ( esk1_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
thf(c_0_65,negated_conjecture,
( ( ( esk1_3 @ esk4_0 @ epred2_0 @ ( esk5_0 @ esk6_0 ) )
!= ( esk5_0 @ esk6_0 ) )
| ~ ( in @ ( esk5_0 @ esk6_0 ) @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
thf(c_0_66,plain,
~ ( in @ ( esk5_0 @ esk6_0 ) @ esk4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]) ).
thf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_27]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU678^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 17:58:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # partial match(2): HSMSSLSSMLLCHSA
% 0.20/0.51 # Preprocessing class: HSSSSLSSMLLNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.51 # new_ho_10 with pid 14136 completed with status 0
% 0.20/0.51 # Result found by new_ho_10
% 0.20/0.51 # partial match(2): HSMSSLSSMLLCHSA
% 0.20/0.51 # Preprocessing class: HSSSSLSSMLLNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHSS-FFMF32-SHSSMMBN
% 0.20/0.51 # partial match(2): HGUNS-FFMF32-SHSSMMBN
% 0.20/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 750s (1) cores
% 0.20/0.51 # Starting sh5l with 188s (1) cores
% 0.20/0.51 # Starting ehoh_best_sine_rwall with 188s (1) cores
% 0.20/0.51 # Starting lpo1_def_fix with 188s (1) cores
% 0.20/0.51 # Starting ehoh_best8_lambda with 186s (1) cores
% 0.20/0.51 # sh5l with pid 14144 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # partial match(2): HSMSSLSSMLLCHSA
% 0.20/0.51 # Preprocessing class: HSSSSLSSMLLNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHSS-FFMF32-SHSSMMBN
% 0.20/0.51 # partial match(2): HGUNS-FFMF32-SHSSMMBN
% 0.20/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 750s (1) cores
% 0.20/0.51 # Starting sh5l with 188s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 25
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 31
% 0.20/0.51 # Removed in clause preprocessing : 16
% 0.20/0.51 # Initial clauses in saturation : 15
% 0.20/0.51 # Processed clauses : 75
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 4
% 0.20/0.51 # ...remaining for further processing : 70
% 0.20/0.51 # Other redundant clauses eliminated : 1
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 6
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 158
% 0.20/0.51 # ...of the previous two non-redundant : 155
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 2
% 0.20/0.51 # Paramodulations : 152
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 1
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 9
% 0.20/0.51 # ...of those cached : 6
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 47
% 0.20/0.51 # Positive orientable unit clauses : 5
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 41
% 0.20/0.51 # Current number of unprocessed clauses: 110
% 0.20/0.51 # ...number of literals in the above : 514
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 23
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 189
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 84
% 0.20/0.51 # Non-unit clause-clause subsumptions : 8
% 0.20/0.51 # Unit Clause-clause subsumption calls : 26
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 75
% 0.20/0.51 # Condensation successes : 1
% 0.20/0.51 # Termbank termtop insertions : 17221
% 0.20/0.51 # Search garbage collected termcells : 980
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.017 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.020 s
% 0.20/0.51 # Maximum resident set size: 2036 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.073 s
% 0.20/0.51 # System time : 0.014 s
% 0.20/0.51 # Total time : 0.087 s
% 0.20/0.51 # Maximum resident set size: 1752 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------