TSTP Solution File: SEU643^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU643^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:48 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 26
% Syntax : Number of formulae : 57 ( 17 unt; 17 typ; 0 def)
% Number of atoms : 163 ( 49 equ; 0 cnn)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 679 ( 43 ~; 45 |; 25 &; 531 @)
% ( 5 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 9 con; 0-3 aty)
% Number of variables : 98 ( 24 ^ 61 !; 13 ?; 98 :)
% 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,
setunion: $i > $i ).
thf(decl_26,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_27,type,
setadjoinIL: $o ).
thf(decl_28,type,
iskpair: $i > $o ).
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,
setukpairinjL1: $o ).
thf(decl_33,type,
esk1_3: $i > ( $i > $o ) > $i > $i ).
thf(decl_34,type,
esk2_3: $i > ( $i > $o ) > $i > $i ).
thf(decl_35,type,
esk3_0: $i ).
thf(decl_36,type,
esk4_0: $i ).
thf(decl_37,type,
esk5_0: $i ).
thf(decl_38,type,
epred1_0: $i > $o ).
thf(ex1,axiom,
( ex1
= ( ^ [X3: $i,X4: $i > $o] :
( singleton
@ ( dsetconstr @ X3
@ ^ [X1: $i] : ( X4 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X3: $i] :
? [X1: $i] :
( ( in @ X1 @ X3 )
& ( X3
= ( setadjoin @ X1 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(ex1I,axiom,
( ex1I
<=> ! [X3: $i,X4: $i > $o,X1: $i] :
( ( in @ X1 @ X3 )
=> ( ( X4 @ X1 )
=> ( ! [X2: $i] :
( ( in @ X2 @ X3 )
=> ( ( X4 @ X2 )
=> ( X2 = X1 ) ) )
=> ( ex1 @ X3
@ ^ [X2: $i] : ( X4 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1I) ).
thf(iskpair,axiom,
( iskpair
= ( ^ [X3: $i] :
? [X1: $i] :
( ( in @ X1 @ ( setunion @ X3 ) )
& ? [X2: $i] :
( ( in @ X2 @ ( setunion @ X3 ) )
& ( X3
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iskpair) ).
thf(kfstsingleton,conjecture,
( setadjoinIL
=> ( ex1I
=> ( setukpairinjL1
=> ! [X6: $i] :
( ( iskpair @ X6 )
=> ( singleton
@ ( dsetconstr @ ( setunion @ X6 )
@ ^ [X1: $i] : ( in @ ( setadjoin @ X1 @ emptyset ) @ X6 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstsingleton) ).
thf(setukpairinjL1,axiom,
( setukpairinjL1
<=> ! [X1: $i,X2: $i,X5: $i] :
( ( in @ ( setadjoin @ X5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(c_0_7,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X17: $i] :
( ( in @ X17
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X17 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_8,plain,
( singleton
= ( ^ [Z0: $i] :
? [X1: $i] :
( ( in @ X1 @ Z0 )
& ( Z0
= ( setadjoin @ X1 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_9,plain,
( ex1I
<=> ! [X3: $i,X4: $i > $o,X1: $i] :
( ( in @ X1 @ X3 )
=> ( ( X4 @ X1 )
=> ( ! [X2: $i] :
( ( in @ X2 @ X3 )
=> ( ( X4 @ X2 )
=> ( X2 = X1 ) ) )
=> ( ex1 @ X3
@ ^ [Z0: $i] : ( X4 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1I]) ).
thf(c_0_10,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X17: $i] :
( ( in @ X17
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X17 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( ex1I
= ( ! [X3: $i,X4: $i > $o,X1: $i] :
( ( in @ X1 @ X3 )
=> ( ( X4 @ X1 )
=> ( ! [X2: $i] :
( ( in @ X2 @ X3 )
=> ( ( X4 @ X2 )
=> ( X2 = X1 ) ) )
=> ? [X18: $i] :
( ( in @ X18
@ ( dsetconstr @ X3
@ ^ [Z0: $i] : ( X4 @ Z0 ) ) )
& ( ( dsetconstr @ X3
@ ^ [Z0: $i] : ( X4 @ Z0 ) )
= ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,plain,
( iskpair
= ( ^ [Z0: $i] :
? [X1: $i] :
( ( in @ X1 @ ( setunion @ Z0 ) )
& ? [X2: $i] :
( ( in @ X2 @ ( setunion @ Z0 ) )
& ( Z0
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iskpair]) ).
thf(c_0_13,negated_conjecture,
~ ( ! [X19: $i,X20: $i] : ( in @ X19 @ ( setadjoin @ X19 @ X20 ) )
=> ( ! [X21: $i,X22: $i > $o,X23: $i] :
( ( in @ X23 @ X21 )
=> ( ( X22 @ X23 )
=> ( ! [X24: $i] :
( ( in @ X24 @ X21 )
=> ( ( X22 @ X24 )
=> ( X24 = X23 ) ) )
=> ? [X25: $i] :
( ( in @ X25 @ ( dsetconstr @ X21 @ X22 ) )
& ( ( dsetconstr @ X21 @ X22 )
= ( setadjoin @ X25 @ emptyset ) ) ) ) ) )
=> ( ! [X26: $i,X27: $i,X28: $i] :
( ( in @ ( setadjoin @ X28 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X26 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X26 @ ( setadjoin @ X27 @ emptyset ) ) @ emptyset ) ) )
=> ( X26 = X28 ) )
=> ! [X6: $i] :
( ? [X29: $i] :
( ( in @ X29 @ ( setunion @ X6 ) )
& ? [X30: $i] :
( ( in @ X30 @ ( setunion @ X6 ) )
& ( X6
= ( setadjoin @ ( setadjoin @ X29 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X29 @ ( setadjoin @ X30 @ emptyset ) ) @ emptyset ) ) ) ) )
=> ? [X31: $i] :
( ( in @ X31
@ ( dsetconstr @ ( setunion @ X6 )
@ ^ [Z0: $i] : ( in @ ( setadjoin @ Z0 @ emptyset ) @ X6 ) ) )
& ( ( dsetconstr @ ( setunion @ X6 )
@ ^ [Z0: $i] : ( in @ ( setadjoin @ Z0 @ emptyset ) @ X6 ) )
= ( setadjoin @ X31 @ 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)],[kfstsingleton])]),c_0_8]),setukpairinjL1]),c_0_11]),c_0_12]),setadjoinIL])]) ).
thf(c_0_14,negated_conjecture,
! [X32: $i,X33: $i,X34: $i,X35: $i > $o,X36: $i,X39: $i,X40: $i,X41: $i,X45: $i] :
( ( in @ X32 @ ( setadjoin @ X32 @ X33 ) )
& ( ( in @ ( esk2_3 @ X34 @ X35 @ X36 ) @ ( dsetconstr @ X34 @ X35 ) )
| ( in @ ( esk1_3 @ X34 @ X35 @ X36 ) @ X34 )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ( ( dsetconstr @ X34 @ X35 )
= ( setadjoin @ ( esk2_3 @ X34 @ X35 @ X36 ) @ emptyset ) )
| ( in @ ( esk1_3 @ X34 @ X35 @ X36 ) @ X34 )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ( in @ ( esk2_3 @ X34 @ X35 @ X36 ) @ ( dsetconstr @ X34 @ X35 ) )
| ( X35 @ ( esk1_3 @ X34 @ X35 @ X36 ) )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ( ( dsetconstr @ X34 @ X35 )
= ( setadjoin @ ( esk2_3 @ X34 @ X35 @ X36 ) @ emptyset ) )
| ( X35 @ ( esk1_3 @ X34 @ X35 @ X36 ) )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ( in @ ( esk2_3 @ X34 @ X35 @ X36 ) @ ( dsetconstr @ X34 @ X35 ) )
| ( ( esk1_3 @ X34 @ X35 @ X36 )
!= X36 )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ( ( dsetconstr @ X34 @ X35 )
= ( setadjoin @ ( esk2_3 @ X34 @ X35 @ X36 ) @ emptyset ) )
| ( ( esk1_3 @ X34 @ X35 @ X36 )
!= X36 )
| ~ ( X35 @ X36 )
| ~ ( in @ X36 @ X34 ) )
& ( ~ ( in @ ( setadjoin @ X41 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X39 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X39 @ ( setadjoin @ X40 @ emptyset ) ) @ emptyset ) ) )
| ( X39 = X41 ) )
& ( in @ esk4_0 @ ( setunion @ esk3_0 ) )
& ( in @ esk5_0 @ ( setunion @ esk3_0 ) )
& ( esk3_0
= ( setadjoin @ ( setadjoin @ esk4_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk4_0 @ ( setadjoin @ esk5_0 @ emptyset ) ) @ emptyset ) ) )
& ( ~ ( in @ X45
@ ( dsetconstr @ ( setunion @ esk3_0 )
@ ^ [Z0: $i] : ( in @ ( setadjoin @ Z0 @ emptyset ) @ esk3_0 ) ) )
| ( ( dsetconstr @ ( setunion @ esk3_0 )
@ ^ [Z0: $i] : ( in @ ( setadjoin @ Z0 @ emptyset ) @ esk3_0 ) )
!= ( setadjoin @ X45 @ 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_13])])])])])]) ).
thf(c_0_15,plain,
! [X48: $i] :
( ( ~ ( epred1_0 @ X48 )
| ( in @ ( setadjoin @ X48 @ emptyset ) @ esk3_0 ) )
& ( ~ ( in @ ( setadjoin @ X48 @ emptyset ) @ esk3_0 )
| ( epred1_0 @ X48 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
( esk3_0
= ( setadjoin @ ( setadjoin @ esk4_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk4_0 @ ( setadjoin @ esk5_0 @ emptyset ) ) @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X4: $i > $o,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X4 )
= ( setadjoin @ ( esk2_3 @ X1 @ X4 @ X2 ) @ emptyset ) )
| ( X4 @ ( esk1_3 @ X1 @ X4 @ X2 ) )
| ~ ( X4 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
in @ esk4_0 @ ( setunion @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ ( setadjoin @ X1 @ emptyset ) @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_21,negated_conjecture,
in @ ( setadjoin @ esk4_0 @ emptyset ) @ esk3_0,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X46: $i] :
( ( epred1_0 @ X46 )
<=> ( in @ ( setadjoin @ X46 @ emptyset ) @ esk3_0 ) ),
introduced(definition) ).
thf(c_0_23,negated_conjecture,
! [X4: $i > $o] :
( ( ( setadjoin @ ( esk2_3 @ ( setunion @ esk3_0 ) @ X4 @ esk4_0 ) @ emptyset )
= ( dsetconstr @ ( setunion @ esk3_0 ) @ X4 ) )
| ( X4 @ ( esk1_3 @ ( setunion @ esk3_0 ) @ X4 @ esk4_0 ) )
| ~ ( X4 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_24,plain,
epred1_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X2 = X1 )
| ~ ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( ( in @ X1 @ ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) )
!= $true )
| ( ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 )
!= ( setadjoin @ X1 @ emptyset ) ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_14]),c_0_22]),c_0_22]) ).
thf(c_0_27,plain,
( ( ( setadjoin @ ( esk2_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ) @ emptyset )
= ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) )
| ( epred1_0 @ ( esk1_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i] :
( ( X1 = esk4_0 )
| ~ ( in @ ( setadjoin @ X1 @ emptyset ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
thf(c_0_29,plain,
! [X1: $i] :
( ( in @ ( setadjoin @ X1 @ emptyset ) @ esk3_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 )
!= ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) ) ),
inference(cn,[status(thm)],[c_0_26]) ).
thf(c_0_31,negated_conjecture,
( ( in @ ( esk2_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ) @ ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) )
| ( epred1_0 @ ( esk1_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
thf(c_0_32,negated_conjecture,
! [X4: $i > $o,X2: $i,X1: $i] :
( ( in @ ( esk2_3 @ X1 @ X4 @ X2 ) @ ( dsetconstr @ X1 @ X4 ) )
| ( ( esk1_3 @ X1 @ X4 @ X2 )
!= X2 )
| ~ ( X4 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_33,plain,
! [X1: $i] :
( ( X1 = esk4_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,negated_conjecture,
epred1_0 @ ( esk1_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ ( esk2_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ X1 ) @ emptyset )
!= ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) )
| ( ( esk1_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ X1 )
!= X1 )
| ~ ( in @ X1 @ ( setunion @ esk3_0 ) )
| ~ ( epred1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
thf(c_0_36,plain,
( ( esk1_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 )
= esk4_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_37,negated_conjecture,
( ( setadjoin @ ( esk2_3 @ ( setunion @ esk3_0 ) @ epred1_0 @ esk4_0 ) @ emptyset )
!= ( dsetconstr @ ( setunion @ esk3_0 ) @ epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_19]),c_0_24])]) ).
thf(c_0_38,negated_conjecture,
! [X4: $i > $o,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1 @ X4 )
= ( setadjoin @ ( esk2_3 @ X1 @ X4 @ X2 ) @ emptyset ) )
| ( ( esk1_3 @ X1 @ X4 @ X2 )
!= X2 )
| ~ ( X4 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_36]),c_0_19]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU643^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 15:47:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.50 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.50 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.50 # lpo8_lambda_fix with pid 21781 completed with status 0
% 0.20/0.50 # Result found by lpo8_lambda_fix
% 0.20/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.50 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.50 # Search class: HGHSF-FFSS32-MHSFMSBN
% 0.20/0.50 # partial match(4): HGHSM-FSLS32-MHSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_9 with 176s (1) cores
% 0.20/0.50 # new_ho_9 with pid 21784 completed with status 0
% 0.20/0.50 # Result found by new_ho_9
% 0.20/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.50 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.50 # Search class: HGHSF-FFSS32-MHSFMSBN
% 0.20/0.50 # partial match(4): HGHSM-FSLS32-MHSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_9 with 176s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 18
% 0.20/0.50 # Removed by relevancy pruning/SinE : 11
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 14
% 0.20/0.50 # Processed clauses : 53
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 51
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 7
% 0.20/0.50 # Generated clauses : 69
% 0.20/0.50 # ...of the previous two non-redundant : 66
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 69
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 14
% 0.20/0.50 # ...of those cached : 10
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 30
% 0.20/0.50 # Positive orientable unit clauses : 7
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 22
% 0.20/0.50 # Current number of unprocessed clauses: 41
% 0.20/0.50 # ...number of literals in the above : 173
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 21
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 77
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 34
% 0.20/0.50 # Non-unit clause-clause subsumptions : 3
% 0.20/0.50 # Unit Clause-clause subsumption calls : 7
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 3
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 53
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4100
% 0.20/0.50 # Search garbage collected termcells : 557
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1892 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------