TSTP Solution File: SEU558^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU558^2 : TPTP v8.2.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:10 EDT 2024
% Result : Theorem 0.67s 0.58s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 72 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 235 ( 51 equ; 0 cnn)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 1119 ( 72 ~; 116 |; 10 &; 874 @)
% ( 9 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 68 ( 68 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 180 ( 18 ^ 162 !; 0 ?; 180 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_24,type,
dsetconstrI: $o ).
thf(decl_25,type,
dsetconstrEL: $o ).
thf(decl_26,type,
dsetconstrER: $o ).
thf(decl_27,type,
setext: $o ).
thf(decl_28,type,
esk1_2: $i > $i > $i ).
thf(decl_29,type,
esk2_2: $i > $i > $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(decl_31,type,
esk4_0: $i ).
thf(decl_32,type,
epred1_0: $i > $o ).
thf(decl_33,type,
epred2_0: $i > $o ).
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/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/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
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/benchmark/theBenchmark.p',dsetconstrER) ).
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/benchmark/theBenchmark.p',dsetconstr__Cong) ).
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/benchmark/theBenchmark.p',setext) ).
thf(c_0_5,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_6,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_7,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_8,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)],[inference(assume_negation,[status(cth)],[dsetconstr__Cong])]),setext]),c_0_5]),c_0_6]),c_0_7]) ).
thf(c_0_9,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_8])])])])]) ).
thf(c_0_10,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_9]) ).
thf(c_0_11,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,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_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,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_9]) ).
thf(c_0_16,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_9]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_18,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_12,c_0_13]) ).
thf(c_0_19,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_9]) ).
thf(c_0_20,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_14,c_0_13]) ).
thf(c_0_21,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_15,c_0_16]) ).
thf(c_0_22,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_14,c_0_13]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( X1
= ( dsetconstr @ esk3_0 @ X2 ) )
| ( in @ ( esk1_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) ) @ X1 )
| ( epred1_0 @ ( esk2_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) ) )
| ~ ( epred2_0 @ ( esk2_2 @ X1 @ ( dsetconstr @ esk3_0 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11])]) ).
thf(c_0_25,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_12,c_0_20]) ).
thf(c_0_26,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_14,c_0_21]) ).
thf(c_0_27,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_12,c_0_22]) ).
thf(c_0_28,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_14,c_0_23]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( X6 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) )
| ( X2 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
thf(c_0_30,negated_conjecture,
( ( dsetconstr @ esk3_0 @ epred1_0 )
!= ( dsetconstr @ esk4_0 @ epred2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_31,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_9]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ esk3_0 @ X6 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) @ X1 )
| ( epred1_0 @ ( esk2_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_12,c_0_23]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ esk3_0 @ X2 )
= ( dsetconstr @ X1 @ X6 ) )
| ( epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) )
| ( X6 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) )
| ~ ( epred1_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_34,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_26,c_0_27]) ).
thf(c_0_35,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_28,c_0_29]) ).
thf(c_0_36,negated_conjecture,
( ( dsetconstr @ esk3_0 @ epred2_0 )
!= ( dsetconstr @ esk3_0 @ epred1_0 ) ),
inference(rw,[status(thm)],[c_0_30,c_0_11]) ).
thf(c_0_37,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_12,c_0_31]) ).
thf(c_0_38,negated_conjecture,
! [X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ esk3_0 @ X2 )
= ( dsetconstr @ esk3_0 @ X6 ) )
| ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) )
| ( epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) )
| ~ ( epred1_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) )
| ~ ( epred2_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ X2 ) @ ( dsetconstr @ esk3_0 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( ( dsetconstr @ esk3_0 @ epred1_0 )
= ( dsetconstr @ X1 @ X2 ) )
| ( epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ X1 @ X2 ) ) )
| ( X2 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ X1 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
thf(c_0_40,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_34,c_0_35]),c_0_36]) ).
thf(c_0_41,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_37,c_0_16]) ).
thf(c_0_42,negated_conjecture,
( ( epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_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_38,c_0_39]),c_0_40])]),c_0_36]) ).
thf(c_0_43,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 ) ) )
| ~ ( 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_41,c_0_42]),c_0_36]) ).
thf(c_0_44,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_14,c_0_31]) ).
thf(c_0_45,negated_conjecture,
( ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) )
| ~ ( in @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ esk3_0 )
| ~ ( epred2_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
thf(c_0_46,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_44,c_0_16]) ).
thf(c_0_47,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_12,c_0_21]) ).
thf(c_0_48,negated_conjecture,
! [X2: $i > $o,X6: $i > $o,X3: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X3 @ X6 ) )
| ( in @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X3 )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X3 @ X6 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
thf(c_0_49,negated_conjecture,
( ( epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) )
| ~ ( epred2_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_36]) ).
thf(c_0_50,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X1 @ X6 ) )
| ( X6 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) )
| ~ ( X6 @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
thf(c_0_51,negated_conjecture,
! [X1: $i,X2: $i > $o,X6: $i > $o] :
( ( ( dsetconstr @ X1 @ X2 )
= ( dsetconstr @ X1 @ X6 ) )
| ( in @ ( esk1_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) @ X1 )
| ~ ( X2 @ ( esk2_2 @ ( dsetconstr @ X1 @ X2 ) @ ( dsetconstr @ X1 @ X6 ) ) ) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
thf(c_0_52,negated_conjecture,
epred1_0 @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_36]),c_0_42]) ).
thf(c_0_53,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_9]) ).
thf(c_0_54,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_52]),c_0_36]) ).
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_53,c_0_16]) ).
thf(c_0_56,negated_conjecture,
epred2_0 @ ( esk1_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_54]),c_0_40])]) ).
thf(c_0_57,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_16]) ).
thf(c_0_58,negated_conjecture,
in @ ( esk2_2 @ ( dsetconstr @ esk3_0 @ epred1_0 ) @ ( dsetconstr @ esk3_0 @ epred2_0 ) ) @ esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_56]),c_0_54])]),c_0_36]) ).
thf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_54]),c_0_52])]),c_0_36]),c_0_58]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU558^2 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n004.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 17:28:08 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.23/0.50 Running higher-order theorem proving
% 0.23/0.50 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.67/0.58 # Version: 3.1.0-ho
% 0.67/0.58 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting new_ho_10 with 1500s (5) cores
% 0.67/0.58 # Starting new_bool_2 with 300s (1) cores
% 0.67/0.58 # Starting new_bool_9 with 300s (1) cores
% 0.67/0.58 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.67/0.58 # new_bool_2 with pid 11922 completed with status 0
% 0.67/0.58 # Result found by new_bool_2
% 0.67/0.58 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting new_ho_10 with 1500s (5) cores
% 0.67/0.58 # Starting new_bool_2 with 300s (1) cores
% 0.67/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.58 # Search class: HGUSF-FFSF22-SSSFMSBN
% 0.67/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.58 # Starting new_ho_10 with 181s (1) cores
% 0.67/0.58 # new_ho_10 with pid 11926 completed with status 0
% 0.67/0.58 # Result found by new_ho_10
% 0.67/0.58 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting new_ho_10 with 1500s (5) cores
% 0.67/0.58 # Starting new_bool_2 with 300s (1) cores
% 0.67/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.58 # Search class: HGUSF-FFSF22-SSSFMSBN
% 0.67/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.58 # Starting new_ho_10 with 181s (1) cores
% 0.67/0.58 # Preprocessing time : 0.001 s
% 0.67/0.58 # Presaturation interreduction done
% 0.67/0.58
% 0.67/0.58 # Proof found!
% 0.67/0.58 # SZS status Theorem
% 0.67/0.58 # SZS output start CNFRefutation
% See solution above
% 0.67/0.58 # Parsed axioms : 11
% 0.67/0.58 # Removed by relevancy pruning/SinE : 6
% 0.67/0.58 # Initial clauses : 11
% 0.67/0.58 # Removed in clause preprocessing : 0
% 0.67/0.58 # Initial clauses in saturation : 11
% 0.67/0.58 # Processed clauses : 359
% 0.67/0.58 # ...of these trivial : 7
% 0.67/0.58 # ...subsumed : 159
% 0.67/0.58 # ...remaining for further processing : 192
% 0.67/0.58 # Other redundant clauses eliminated : 2
% 0.67/0.58 # Clauses deleted for lack of memory : 0
% 0.67/0.58 # Backward-subsumed : 14
% 0.67/0.58 # Backward-rewritten : 8
% 0.67/0.58 # Generated clauses : 939
% 0.67/0.58 # ...of the previous two non-redundant : 864
% 0.67/0.58 # ...aggressively subsumed : 0
% 0.67/0.58 # Contextual simplify-reflections : 10
% 0.67/0.58 # Paramodulations : 937
% 0.67/0.58 # Factorizations : 0
% 0.67/0.58 # NegExts : 0
% 0.67/0.58 # Equation resolutions : 2
% 0.67/0.58 # Disequality decompositions : 0
% 0.67/0.58 # Total rewrite steps : 100
% 0.67/0.58 # ...of those cached : 90
% 0.67/0.58 # Propositional unsat checks : 0
% 0.67/0.58 # Propositional check models : 0
% 0.67/0.58 # Propositional check unsatisfiable : 0
% 0.67/0.58 # Propositional clauses : 0
% 0.67/0.58 # Propositional clauses after purity: 0
% 0.67/0.58 # Propositional unsat core size : 0
% 0.67/0.58 # Propositional preprocessing time : 0.000
% 0.67/0.58 # Propositional encoding time : 0.000
% 0.67/0.58 # Propositional solver time : 0.000
% 0.67/0.58 # Success case prop preproc time : 0.000
% 0.67/0.58 # Success case prop encoding time : 0.000
% 0.67/0.58 # Success case prop solver time : 0.000
% 0.67/0.58 # Current number of processed clauses : 157
% 0.67/0.58 # Positive orientable unit clauses : 8
% 0.67/0.58 # Positive unorientable unit clauses: 0
% 0.67/0.58 # Negative unit clauses : 1
% 0.67/0.58 # Non-unit-clauses : 148
% 0.67/0.58 # Current number of unprocessed clauses: 519
% 0.67/0.58 # ...number of literals in the above : 1799
% 0.67/0.58 # Current number of archived formulas : 0
% 0.67/0.58 # Current number of archived clauses : 33
% 0.67/0.58 # Clause-clause subsumption calls (NU) : 4902
% 0.67/0.58 # Rec. Clause-clause subsumption calls : 1441
% 0.67/0.58 # Non-unit clause-clause subsumptions : 183
% 0.67/0.58 # Unit Clause-clause subsumption calls : 239
% 0.67/0.58 # Rewrite failures with RHS unbound : 0
% 0.67/0.58 # BW rewrite match attempts : 32
% 0.67/0.58 # BW rewrite match successes : 3
% 0.67/0.58 # Condensation attempts : 359
% 0.67/0.58 # Condensation successes : 0
% 0.67/0.58 # Termbank termtop insertions : 33721
% 0.67/0.58 # Search garbage collected termcells : 538
% 0.67/0.58
% 0.67/0.58 # -------------------------------------------------
% 0.67/0.58 # User time : 0.061 s
% 0.67/0.58 # System time : 0.003 s
% 0.67/0.58 # Total time : 0.064 s
% 0.67/0.58 # Maximum resident set size: 1964 pages
% 0.67/0.58
% 0.67/0.58 # -------------------------------------------------
% 0.67/0.58 # User time : 0.062 s
% 0.67/0.58 # System time : 0.005 s
% 0.67/0.58 # Total time : 0.068 s
% 0.67/0.58 # Maximum resident set size: 1764 pages
% 0.67/0.58 % E---3.1 exiting
% 0.67/0.58 % E exiting
%------------------------------------------------------------------------------