TSTP Solution File: SEU639^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU639^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:28:46 EDT 2024
% Result : Theorem 70.40s 9.33s
% Output : CNFRefutation 70.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 26
% Syntax : Number of formulae : 102 ( 15 unt; 17 typ; 0 def)
% Number of atoms : 294 ( 102 equ; 0 cnn)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 1409 ( 65 ~; 131 |; 17 &;1141 @)
% ( 9 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 96 ( 96 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 238 ( 20 ^ 213 !; 5 ?; 238 :)
% 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,
dsetconstrI: $o ).
thf(decl_27,type,
dsetconstrEL: $o ).
thf(decl_28,type,
dsetconstrER: $o ).
thf(decl_29,type,
setext: $o ).
thf(decl_30,type,
uniqinunit: $o ).
thf(decl_31,type,
eqinunit: $o ).
thf(decl_32,type,
singleton: $i > $o ).
thf(decl_33,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_34,type,
esk1_2: $i > $i > $i ).
thf(decl_35,type,
esk2_2: $i > $i > $i ).
thf(decl_36,type,
esk3_0: $i ).
thf(decl_37,type,
epred1_0: $i > $o ).
thf(decl_38,type,
esk4_0: $i ).
thf(ex1,axiom,
( ex1
= ( ^ [X1: $i,X2: $i > $o] :
( singleton
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X3: $i] :
( ( in @ X3 @ X1 )
& ( X1
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER) ).
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/sandbox2/benchmark/theBenchmark.p',dsetconstrEL) ).
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/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(ex1I,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X2 @ X4 )
=> ( X4 = X3 ) ) )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1I) ).
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/sandbox2/benchmark/theBenchmark.p',setext) ).
thf(uniqinunit,axiom,
( uniqinunit
<=> ! [X3: $i,X4: $i] :
( ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) )
=> ( X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(eqinunit,axiom,
( eqinunit
<=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eqinunit) ).
thf(c_0_9,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X27: $i] :
( ( in @ X27
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X27 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_10,plain,
( singleton
= ( ^ [Z0: $i] :
? [X3: $i] :
( ( in @ X3 @ Z0 )
& ( Z0
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_11,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X27: $i] :
( ( in @ X27
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X27 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,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_13,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_14,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_15,negated_conjecture,
~ ( ! [X28: $i,X29: $i > $o,X30: $i] :
( ( in @ X30 @ X28 )
=> ( ( X29 @ X30 )
=> ( in @ X30 @ ( dsetconstr @ X28 @ X29 ) ) ) )
=> ( ! [X31: $i,X32: $i > $o,X33: $i] :
( ( in @ X33 @ ( dsetconstr @ X31 @ X32 ) )
=> ( in @ X33 @ X31 ) )
=> ( ! [X34: $i,X35: $i > $o,X36: $i] :
( ( in @ X36 @ ( dsetconstr @ X34 @ X35 ) )
=> ( X35 @ X36 ) )
=> ( ! [X37: $i,X38: $i] :
( ! [X39: $i] :
( ( in @ X39 @ X37 )
=> ( in @ X39 @ X38 ) )
=> ( ! [X40: $i] :
( ( in @ X40 @ X38 )
=> ( in @ X40 @ X37 ) )
=> ( X37 = X38 ) ) )
=> ( ! [X41: $i,X42: $i] :
( ( in @ X41 @ ( setadjoin @ X42 @ emptyset ) )
=> ( X41 = X42 ) )
=> ( ! [X43: $i,X44: $i] :
( ( X43 = X44 )
=> ( in @ X43 @ ( setadjoin @ X44 @ emptyset ) ) )
=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X2 @ X4 )
=> ( X4 = X3 ) ) )
=> ? [X45: $i] :
( ( in @ X45 @ ( dsetconstr @ X1 @ X2 ) )
& ( ( dsetconstr @ X1 @ X2 )
= ( setadjoin @ X45 @ 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(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[ex1I])]),c_0_11]),setext]),c_0_12]),c_0_13]),c_0_14]),uniqinunit]),eqinunit])]) ).
thf(c_0_16,negated_conjecture,
! [X46: $i,X47: $i > $o,X48: $i,X49: $i,X50: $i > $o,X51: $i,X52: $i,X53: $i > $o,X54: $i,X55: $i,X56: $i,X59: $i,X60: $i,X61: $i,X62: $i,X66: $i,X67: $i] :
( ( ~ ( in @ X48 @ X46 )
| ~ ( X47 @ X48 )
| ( in @ X48 @ ( dsetconstr @ X46 @ X47 ) ) )
& ( ~ ( in @ X51 @ ( dsetconstr @ X49 @ X50 ) )
| ( in @ X51 @ X49 ) )
& ( ~ ( in @ X54 @ ( dsetconstr @ X52 @ X53 ) )
| ( X53 @ X54 ) )
& ( ( in @ ( esk2_2 @ X55 @ X56 ) @ X56 )
| ( X55 = X56 )
| ( in @ ( esk1_2 @ X55 @ X56 ) @ X55 ) )
& ( ~ ( in @ ( esk2_2 @ X55 @ X56 ) @ X55 )
| ( X55 = X56 )
| ( in @ ( esk1_2 @ X55 @ X56 ) @ X55 ) )
& ( ( in @ ( esk2_2 @ X55 @ X56 ) @ X56 )
| ( X55 = X56 )
| ~ ( in @ ( esk1_2 @ X55 @ X56 ) @ X56 ) )
& ( ~ ( in @ ( esk2_2 @ X55 @ X56 ) @ X55 )
| ( X55 = X56 )
| ~ ( in @ ( esk1_2 @ X55 @ X56 ) @ X56 ) )
& ( ~ ( in @ X59 @ ( setadjoin @ X60 @ emptyset ) )
| ( X59 = X60 ) )
& ( ( X61 != X62 )
| ( in @ X61 @ ( setadjoin @ X62 @ emptyset ) ) )
& ( in @ esk4_0 @ esk3_0 )
& ( epred1_0 @ esk4_0 )
& ( ~ ( in @ X66 @ esk3_0 )
| ~ ( epred1_0 @ X66 )
| ( X66 = esk4_0 ) )
& ( ~ ( in @ X67 @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ( ( dsetconstr @ esk3_0 @ epred1_0 )
!= ( setadjoin @ X67 @ emptyset ) ) ) ),
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_15])])])])])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_18,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_16]) ).
thf(c_0_19,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_16]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( X1
= ( dsetconstr @ X3 @ X2 ) )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X1 )
| ( in @ ( esk2_2 @ X1 @ ( dsetconstr @ X3 @ X2 ) ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,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_16]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= X1 )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X3: $i] :
( ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X3 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_24,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_17,c_0_21]) ).
thf(c_0_25,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_16]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X3: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ emptyset ) )
| ( X1 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_27,negated_conjecture,
! [X7: $i > $o,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X7 )
= ( dsetconstr @ X1 @ X2 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( dsetconstr @ X1 @ X2 ) @ X7 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
thf(c_0_28,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_16]) ).
thf(c_0_29,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_30,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_24,c_0_25]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] : ( in @ X1 @ ( setadjoin @ X1 @ emptyset ) ),
inference(er,[status(thm)],[c_0_26]) ).
thf(c_0_32,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_19,c_0_25]) ).
thf(c_0_33,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( ( esk2_2 @ X1 @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X2 ) )
= X3 )
| ( X1
= ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X2 ) )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X2 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i,X7: $i > $o,X2: $i > $o] :
( ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X7 ) )
= X1 )
| ( ( dsetconstr @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X7 )
= ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_36,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( setadjoin @ X1 @ emptyset ) )
| ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( X2 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_31])]) ).
thf(c_0_37,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_38,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_17,c_0_32]) ).
thf(c_0_39,negated_conjecture,
! [X2: $i > $o,X7: $i > $o,X3: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X7 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X7 ) ) @ X3 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X7 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
thf(c_0_40,negated_conjecture,
! [X2: $i > $o,X7: $i > $o,X3: $i,X1: $i] :
( ( ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) )
= X3 )
| ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i,X7: $i > $o,X2: $i > $o] :
( ( ( dsetconstr @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X7 )
= ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
thf(c_0_42,negated_conjecture,
! [X1: $i] :
( ( X1 = esk4_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_43,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
thf(c_0_44,negated_conjecture,
! [X1: $i,X2: $i > $o,X7: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X1 @ X7 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X7 ) ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X7 ) ) ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X7: $i > $o] :
( ( ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) )
= X3 )
| ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ ( setadjoin @ X3 @ emptyset ) @ X7 ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
thf(c_0_46,negated_conjecture,
! [X1: $i,X7: $i > $o,X3: $i,X2: $i > $o] :
( ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ( X7 @ X3 )
| ~ ( in @ X3 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( esk2_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) )
= esk4_0 )
| ( X1
= ( dsetconstr @ esk3_0 @ X2 ) )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) ) @ X1 )
| ~ ( epred1_0 @ ( esk2_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_42,c_0_20]) ).
thf(c_0_48,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_17,c_0_18]) ).
thf(c_0_49,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( setadjoin @ X1 @ emptyset ) )
| ~ ( X2 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_31])]) ).
thf(c_0_50,negated_conjecture,
! [X7: $i > $o,X2: $i > $o,X1: $i] :
( ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X7 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X7 ) )
| ~ ( X2 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_23]) ).
thf(c_0_51,negated_conjecture,
! [X1: $i,X2: $i > $o,X7: $i > $o,X3: $i] :
( ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ( X7 @ X3 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
thf(c_0_52,negated_conjecture,
! [X1: $i,X2: $i > $o,X7: $i > $o] :
( ( ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) )
= esk4_0 )
| ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ esk3_0 @ X7 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) ) @ X1 )
| ~ ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_47]) ).
thf(c_0_53,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X3 )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= X3 )
| ( in @ ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X3 ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_48]) ).
thf(c_0_54,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( setadjoin @ X3 @ emptyset ) )
| ~ ( X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_49]) ).
thf(c_0_55,negated_conjecture,
! [X7: $i > $o,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X7 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X7 ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ~ ( X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_50]) ).
thf(c_0_56,negated_conjecture,
! [X7: $i > $o,X2: $i > $o,X1: $i] :
( ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ( X7 @ X1 )
| ~ ( X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
thf(c_0_57,negated_conjecture,
! [X1: $i,X2: $i > $o,X7: $i > $o] :
( ( ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) )
= esk4_0 )
| ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ esk3_0 @ X7 ) )
| ~ ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ X7 ) ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
thf(c_0_58,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X7: $i > $o] :
( ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ X3 @ X7 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ X3 @ X7 ) )
| ( X7 @ ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ X3 @ X7 ) ) ) ),
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
thf(c_0_59,negated_conjecture,
! [X7: $i > $o,X2: $i > $o,X1: $i] :
( ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X7 ) )
| ( in @ X1 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) )
| ~ ( X2 @ X1 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_50]),c_0_54]),c_0_55]) ).
thf(c_0_60,negated_conjecture,
epred1_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_61,negated_conjecture,
! [X1: $i,X2: $i > $o,X7: $i > $o,X3: $i] :
( ( in @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ ( setadjoin @ ( dsetconstr @ X1 @ X2 ) @ emptyset ) @ ( in @ X3 ) ) )
| ( X7 @ ( dsetconstr @ X1 @ X2 ) )
| ~ ( in @ X3 @ X1 )
| ~ ( X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_56,c_0_25]) ).
thf(c_0_62,negated_conjecture,
in @ esk4_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_63,negated_conjecture,
! [X1: $i,X3: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ X3 )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= X3 )
| ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ X3 ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
thf(c_0_64,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( esk2_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= esk4_0 )
| ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
thf(c_0_65,negated_conjecture,
! [X2: $i > $o] :
( ( ( dsetconstr @ ( setadjoin @ esk4_0 @ emptyset ) @ epred1_0 )
= ( dsetconstr @ ( setadjoin @ esk4_0 @ emptyset ) @ X2 ) )
| ( in @ esk4_0 @ ( dsetconstr @ ( setadjoin @ esk4_0 @ emptyset ) @ epred1_0 ) ) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
thf(c_0_66,negated_conjecture,
! [X2: $i > $o] :
( ( in @ esk4_0 @ ( dsetconstr @ ( setadjoin @ esk4_0 @ emptyset ) @ epred1_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_56,c_0_60]) ).
thf(c_0_67,negated_conjecture,
! [X7: $i > $o,X2: $i > $o] :
( ( in @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ ( setadjoin @ ( dsetconstr @ esk3_0 @ X2 ) @ emptyset ) @ ( in @ esk4_0 ) ) )
| ( X7 @ ( dsetconstr @ esk3_0 @ X2 ) )
| ~ ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
thf(c_0_68,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ X2 ) )
= esk4_0 )
| ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ X2 ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ esk3_0 @ X2 ) )
| ~ ( epred1_0 @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
thf(c_0_69,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ X3 @ X2 ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ X3 @ X2 ) )
| ( X2 @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_37,c_0_63]) ).
thf(c_0_70,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( esk1_2 @ ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= X1 )
| ( ( dsetconstr @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ~ ( in @ esk4_0 @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( X2 @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_64]),c_0_23]) ).
thf(c_0_71,negated_conjecture,
( ( dsetconstr @ ( setadjoin @ esk4_0 @ emptyset ) @ epred1_0 )
= ( setadjoin @ esk4_0 @ emptyset ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_65]),c_0_66]),c_0_43]) ).
thf(c_0_72,negated_conjecture,
! [X2: $i > $o] :
( ( in @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ ( setadjoin @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ emptyset ) @ ( in @ esk4_0 ) ) )
| ( X2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
inference(spm,[status(thm)],[c_0_67,c_0_60]) ).
thf(c_0_73,negated_conjecture,
! [X1: $i] :
( ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= esk4_0 )
| ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
thf(c_0_74,negated_conjecture,
( ( ( esk1_2 @ ( setadjoin @ esk4_0 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= esk4_0 )
| ( ( setadjoin @ esk4_0 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_31]),c_0_60])]) ).
thf(c_0_75,negated_conjecture,
in @ esk4_0 @ ( dsetconstr @ esk3_0 @ epred1_0 ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_72])]) ).
thf(c_0_76,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_37,c_0_21]) ).
thf(c_0_77,negated_conjecture,
! [X1: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ~ ( in @ esk4_0 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_73]),c_0_23]) ).
thf(c_0_78,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ( ( dsetconstr @ esk3_0 @ epred1_0 )
!= ( setadjoin @ X1 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_79,negated_conjecture,
( ( ( setadjoin @ esk4_0 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ( in @ ( esk2_2 @ ( setadjoin @ esk4_0 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) ) @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_74]),c_0_75])]) ).
thf(c_0_80,negated_conjecture,
( ( ( setadjoin @ esk4_0 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ( epred1_0 @ ( esk2_2 @ ( setadjoin @ esk4_0 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_75])]) ).
thf(c_0_81,negated_conjecture,
! [X1: $i] :
( ~ ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
| ~ ( in @ esk4_0 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_77]),c_0_78]) ).
thf(c_0_82,negated_conjecture,
( ( ( esk2_2 @ ( setadjoin @ esk4_0 @ emptyset ) @ ( dsetconstr @ esk3_0 @ epred1_0 ) )
= esk4_0 )
| ( ( setadjoin @ esk4_0 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_79]),c_0_80]) ).
thf(c_0_83,negated_conjecture,
( ( setadjoin @ esk4_0 @ emptyset )
= ( dsetconstr @ esk3_0 @ epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_31]),c_0_75])]) ).
thf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_83]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SEU639^2 : TPTP v8.2.0. Released v3.7.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 16:26:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 70.40/9.33 # Version: 3.1.0-ho
% 70.40/9.33 # partial match(1): HSSSSLSSSLMNHSA
% 70.40/9.33 # Preprocessing class: HSSSSLSSMLMNHSA.
% 70.40/9.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.40/9.33 # Starting new_ho_10 with 1500s (5) cores
% 70.40/9.33 # Starting new_ho_7 with 300s (1) cores
% 70.40/9.33 # Starting lpo8_lambda_fix with 300s (1) cores
% 70.40/9.33 # Starting lpo9_lambda_fix with 300s (1) cores
% 70.40/9.33 # lpo9_lambda_fix with pid 675 completed with status 0
% 70.40/9.33 # Result found by lpo9_lambda_fix
% 70.40/9.33 # partial match(1): HSSSSLSSSLMNHSA
% 70.40/9.33 # Preprocessing class: HSSSSLSSMLMNHSA.
% 70.40/9.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.40/9.33 # Starting new_ho_10 with 1500s (5) cores
% 70.40/9.33 # Starting new_ho_7 with 300s (1) cores
% 70.40/9.33 # Starting lpo8_lambda_fix with 300s (1) cores
% 70.40/9.33 # Starting lpo9_lambda_fix with 300s (1) cores
% 70.40/9.33 # SinE strategy is gf500_gu_R04_F100_L20000
% 70.40/9.33 # Search class: HGHSF-FFSF22-SHSSMSBN
% 70.40/9.33 # partial match(2): HGHNF-FFSF22-SHSSMMBN
% 70.40/9.33 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 70.40/9.33 # Starting new_ho_10 with 163s (1) cores
% 70.40/9.33 # new_ho_10 with pid 679 completed with status 0
% 70.40/9.33 # Result found by new_ho_10
% 70.40/9.33 # partial match(1): HSSSSLSSSLMNHSA
% 70.40/9.33 # Preprocessing class: HSSSSLSSMLMNHSA.
% 70.40/9.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.40/9.33 # Starting new_ho_10 with 1500s (5) cores
% 70.40/9.33 # Starting new_ho_7 with 300s (1) cores
% 70.40/9.33 # Starting lpo8_lambda_fix with 300s (1) cores
% 70.40/9.33 # Starting lpo9_lambda_fix with 300s (1) cores
% 70.40/9.33 # SinE strategy is gf500_gu_R04_F100_L20000
% 70.40/9.33 # Search class: HGHSF-FFSF22-SHSSMSBN
% 70.40/9.33 # partial match(2): HGHNF-FFSF22-SHSSMMBN
% 70.40/9.33 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 70.40/9.33 # Starting new_ho_10 with 163s (1) cores
% 70.40/9.33 # Preprocessing time : 0.001 s
% 70.40/9.33 # Presaturation interreduction done
% 70.40/9.33
% 70.40/9.33 # Proof found!
% 70.40/9.33 # SZS status Theorem
% 70.40/9.33 # SZS output start CNFRefutation
% See solution above
% 70.40/9.33 # Parsed axioms : 21
% 70.40/9.33 # Removed by relevancy pruning/SinE : 12
% 70.40/9.33 # Initial clauses : 13
% 70.40/9.33 # Removed in clause preprocessing : 0
% 70.40/9.33 # Initial clauses in saturation : 13
% 70.40/9.33 # Processed clauses : 5630
% 70.40/9.33 # ...of these trivial : 24
% 70.40/9.33 # ...subsumed : 3827
% 70.40/9.33 # ...remaining for further processing : 1779
% 70.40/9.33 # Other redundant clauses eliminated : 24
% 70.40/9.33 # Clauses deleted for lack of memory : 0
% 70.40/9.33 # Backward-subsumed : 227
% 70.40/9.33 # Backward-rewritten : 288
% 70.40/9.33 # Generated clauses : 189169
% 70.40/9.33 # ...of the previous two non-redundant : 181154
% 70.40/9.33 # ...aggressively subsumed : 0
% 70.40/9.33 # Contextual simplify-reflections : 100
% 70.40/9.33 # Paramodulations : 189142
% 70.40/9.33 # Factorizations : 3
% 70.40/9.33 # NegExts : 0
% 70.40/9.33 # Equation resolutions : 24
% 70.40/9.33 # Disequality decompositions : 0
% 70.40/9.33 # Total rewrite steps : 15549
% 70.40/9.33 # ...of those cached : 15431
% 70.40/9.33 # Propositional unsat checks : 0
% 70.40/9.33 # Propositional check models : 0
% 70.40/9.33 # Propositional check unsatisfiable : 0
% 70.40/9.33 # Propositional clauses : 0
% 70.40/9.33 # Propositional clauses after purity: 0
% 70.40/9.33 # Propositional unsat core size : 0
% 70.40/9.33 # Propositional preprocessing time : 0.000
% 70.40/9.33 # Propositional encoding time : 0.000
% 70.40/9.33 # Propositional solver time : 0.000
% 70.40/9.33 # Success case prop preproc time : 0.000
% 70.40/9.33 # Success case prop encoding time : 0.000
% 70.40/9.33 # Success case prop solver time : 0.000
% 70.40/9.33 # Current number of processed clauses : 1250
% 70.40/9.33 # Positive orientable unit clauses : 10
% 70.40/9.33 # Positive unorientable unit clauses: 0
% 70.40/9.33 # Negative unit clauses : 1
% 70.40/9.33 # Non-unit-clauses : 1239
% 70.40/9.33 # Current number of unprocessed clauses: 174345
% 70.40/9.33 # ...number of literals in the above : 948986
% 70.40/9.33 # Current number of archived formulas : 0
% 70.40/9.33 # Current number of archived clauses : 528
% 70.40/9.33 # Clause-clause subsumption calls (NU) : 1083122
% 70.40/9.33 # Rec. Clause-clause subsumption calls : 57898
% 70.40/9.33 # Non-unit clause-clause subsumptions : 4278
% 70.40/9.33 # Unit Clause-clause subsumption calls : 2161
% 70.40/9.33 # Rewrite failures with RHS unbound : 0
% 70.40/9.33 # BW rewrite match attempts : 64
% 70.40/9.33 # BW rewrite match successes : 8
% 70.40/9.33 # Condensation attempts : 5630
% 70.40/9.33 # Condensation successes : 160
% 70.40/9.33 # Termbank termtop insertions : 7434155
% 70.40/9.33 # Search garbage collected termcells : 788
% 70.40/9.33
% 70.40/9.33 # -------------------------------------------------
% 70.40/9.33 # User time : 8.627 s
% 70.40/9.33 # System time : 0.147 s
% 70.40/9.33 # Total time : 8.774 s
% 70.40/9.33 # Maximum resident set size: 2088 pages
% 70.40/9.33
% 70.40/9.33 # -------------------------------------------------
% 70.40/9.33 # User time : 8.628 s
% 70.40/9.33 # System time : 0.149 s
% 70.40/9.33 # Total time : 8.777 s
% 70.40/9.33 # Maximum resident set size: 1728 pages
% 70.40/9.33 % E---3.1 exiting
% 70.40/9.33 % E exiting
%------------------------------------------------------------------------------