TSTP Solution File: SYO546^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO546^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 08:48:01 EDT 2024
% Result : Theorem 0.38s 0.56s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 51 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 704 ( 182 equ; 0 cnn)
% Maximal formula atoms : 453 ( 16 avg)
% Number of connectives : 1182 ( 274 ~; 479 |; 92 &; 325 @)
% ( 10 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 82 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 9 usr; 5 con; 0-5 aty)
% Number of variables : 55 ( 20 ^ 34 !; 1 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
case: ( $o > $o ) > $i > $i > $i > $i > $i ).
thf(decl_24,type,
f: $o > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
epred2_1: $i > $o ).
thf(decl_28,type,
epred3_1: $i > $o ).
thf(decl_29,type,
epred4_1: $i > $o ).
thf(decl_30,type,
esk2_0: $o ).
thf(caseood,axiom,
( case
= ( ^ [X3: $o > $o,X2: $i,X4: $i,X5: $i,X6: $i] :
( eps
@ ^ [X7: $i] :
( ( ( X3
= ( ^ [X8: $o] : ~ $true ) )
& ( X7 = X2 ) )
| ( ( X3 = $not )
& ( X7 = X4 ) )
| ( ( X3
= ( ^ [X8: $o] : X8 ) )
& ( X7 = X5 ) )
| ( ( X3
= ( ^ [X8: $o] : $true ) )
& ( X7 = X6 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',caseood) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(conj,conjecture,
! [X2: $i] :
( ( case @ f @ X2 @ X2 @ X2 @ X2 )
= X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_3,plain,
! [X22: $i,X23: $o,X24: $o,X25: $o] :
( ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( f = $not )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( f @ X23 )
| ~ $true
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( f = $not )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| $true
| ( f @ X23 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( f = $not )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ ( f @ X24 )
| X24
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ~ X24
| ( f @ X24 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( f @ X25 )
| $true
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ $true
| ( f @ X25 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ( X22 = esk1_0 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( epred2_1 @ X22 )
| ( epred2_1 @ X22 )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ( epred2_1 @ X22 )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred2_1 @ X22 )
| ~ ( f @ $true )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred2_1 @ X22 )
| ( f @ $true )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ( epred2_1 @ X22 )
| ( f @ $false )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ( f != $not )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred3_1 @ X22 )
| ( epred3_1 @ X22 )
| ~ ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ( epred3_1 @ X22 )
| ~ ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred3_1 @ X22 )
| ~ ( f @ $true )
| ~ ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred3_1 @ X22 )
| ( f @ $true )
| ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ( epred3_1 @ X22 )
| ( f @ $false )
| ( epred3_1 @ X22 )
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred4_1 @ X22 )
| ( epred4_1 @ X22 )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ( epred4_1 @ X22 )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred4_1 @ X22 )
| ~ ( f @ $true )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ~ ( epred4_1 @ X22 )
| ( f @ $true )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) )
& ( ( epred4_1 @ X22 )
| ( f @ $false )
| $true
| ( X22 != esk1_0 )
| ( epred1_0 @ X22 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])]) ).
thf(c_0_4,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( f != $not )
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
! [X2: $i] :
( ( f @ $true )
| ( epred1_0 @ X2 )
| ~ ( epred2_1 @ X2 )
| ~ $true
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X2: $i] :
( ( epred2_1 @ X2 )
| ( f @ ~ $true )
| ( epred1_0 @ X2 )
| ~ $true
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,plain,
( ( epred1_0 @ esk1_0 )
| ( $not != f ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( f @ $true )
| ( X2 != esk1_0 )
| ~ ( epred2_1 @ X2 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( epred2_1 @ X2 )
| ( f @ ~ $true )
| ( X2 != esk1_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( epred1_0 @ esk1_0 )
| ( ~ esk2_0
<~> ( f @ esk2_0 ) ) ),
inference(neg_ext,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( epred1_0 @ esk1_0 )
| ( f @ $true )
| ~ ( epred2_1 @ esk1_0 ) ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ( epred1_0 @ esk1_0 )
| ( epred2_1 @ esk1_0 )
| ( f @ ~ $true ) ),
inference(er,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
( case
= ( ^ [Z0: $o > $o,Z1: $i,Z2: $i,Z3: $i,Z4: $i] :
( eps
@ ^ [Z5: $i] :
( ( ( Z0
= ( ^ [Z6: $o] : ~ $true ) )
& ( Z5 = Z1 ) )
| ( ( Z0 = $not )
& ( Z5 = Z2 ) )
| ( ( Z0
= ( ^ [Z6: $o] : Z6 ) )
& ( Z5 = Z3 ) )
| ( ( Z0
= ( ^ [Z6: $o] : $true ) )
& Z5 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[caseood]) ).
thf(c_0_14,plain,
! [X16: $i > $o,X17: $i] :
( ~ ( X16 @ X17 )
| ( X16 @ ( eps @ X16 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_15,plain,
( ( epred1_0 @ esk1_0 )
| esk2_0
| ~ ( f @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_10])]) ).
thf(c_0_16,plain,
( ( f @ ~ $true )
| ( epred1_0 @ esk1_0 )
| ( f @ $true ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,plain,
( ( epred1_0 @ esk1_0 )
| ( f @ $true )
| ~ esk2_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_10])]) ).
thf(c_0_18,negated_conjecture,
~ ! [X2: $i] :
( ( eps
@ ^ [Z0: $i] :
( ( ! [X12: $o] :
( ( f @ X12 )
<=> ~ $true )
& ( Z0 = X2 ) )
| ( ( f = $not )
& ( Z0 = X2 ) )
| ( ! [X13: $o] :
( ( f @ X13 )
<=> X13 )
& ( Z0 = X2 ) )
| ( ! [X14: $o] :
( ( f @ X14 )
<=> $true )
& ( Z0 = X2 ) ) ) )
= X2 ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_13])]) ).
thf(c_0_19,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ~ ( epred3_1 @ X2 )
| ~ ( f @ $true )
| ~ ( epred3_1 @ X2 )
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,plain,
! [X2: $i] :
( ( X2 = esk1_0 )
| ( X2 = esk1_0 )
| ( X2 = esk1_0 )
| ( X2 = esk1_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_22,plain,
( ( f @ $true )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_23,negated_conjecture,
( ( eps
@ ^ [Z0: $i] :
( ( ! [X12: $o] :
( ( f @ X12 )
<=> ~ $true )
& ( Z0 = esk1_0 ) )
| ( ( f = $not )
& ( Z0 = esk1_0 ) )
| ( ! [X13: $o] :
( ( f @ X13 )
<=> X13 )
& ( Z0 = esk1_0 ) )
| ( ! [X14: $o] :
( ( f @ X14 )
<=> $true )
& ( Z0 = esk1_0 ) ) ) )
!= esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
thf(c_0_24,plain,
! [X21: $i] :
( ( epred1_0 @ X21 )
<=> ( ( ! [X18: $o] :
( ( f @ X18 )
<=> ~ $true )
& ( X21 = esk1_0 ) )
| ( ( f = $not )
& ( X21 = esk1_0 ) )
| ( ! [X19: $o] :
( ( f @ X19 )
<=> X19 )
& ( X21 = esk1_0 ) )
| ( ! [X20: $o] :
( ( f @ X20 )
<=> $true )
& ( X21 = esk1_0 ) ) ) ),
introduced(definition) ).
thf(c_0_25,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ~ ( f @ ~ $true )
| ~ ( f @ $true )
| ~ $true
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_26,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( X2 != esk1_0 )
| ~ ( epred3_1 @ X2 )
| ~ ( f @ $true ) ),
inference(cn,[status(thm)],[c_0_19]) ).
thf(c_0_27,plain,
! [X2: $i] :
( ( X2 = esk1_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(cn,[status(thm)],[c_0_20]) ).
thf(c_0_28,plain,
( ( epred1_0 @ ( eps @ epred1_0 ) )
| ( f @ $true ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_29,negated_conjecture,
( ( eps @ epred1_0 )
!= esk1_0 ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_23]),c_0_24]) ).
thf(c_0_30,plain,
! [X2: $i] :
( ( epred3_1 @ X2 )
| ( f @ ~ $true )
| ( epred3_1 @ X2 )
| ( epred1_0 @ X2 )
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_31,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( X2 != esk1_0 )
| ~ ( f @ $true )
| ~ ( f @ ~ $true ) ),
inference(cn,[status(thm)],[c_0_25]) ).
thf(c_0_32,plain,
( ( epred1_0 @ esk1_0 )
| ~ ( f @ $true )
| ~ ( epred3_1 @ esk1_0 ) ),
inference(er,[status(thm)],[c_0_26]) ).
thf(c_0_33,plain,
f @ $true,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
thf(c_0_34,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( epred3_1 @ X2 )
| ( f @ ~ $true )
| ( X2 != esk1_0 ) ),
inference(cn,[status(thm)],[c_0_30]) ).
thf(c_0_35,plain,
( ( epred1_0 @ esk1_0 )
| ~ ( f @ $true )
| ~ ( f @ ~ $true ) ),
inference(er,[status(thm)],[c_0_31]) ).
thf(c_0_36,plain,
( ( epred1_0 @ esk1_0 )
| ~ ( epred3_1 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
thf(c_0_37,plain,
( ( epred1_0 @ esk1_0 )
| ( epred3_1 @ esk1_0 )
| ( f @ ~ $true ) ),
inference(er,[status(thm)],[c_0_34]) ).
thf(c_0_38,plain,
( ( epred1_0 @ esk1_0 )
| ~ ( f @ ~ $true ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33])]) ).
thf(c_0_39,plain,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
thf(c_0_40,plain,
epred1_0 @ ( eps @ epred1_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
thf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_40]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : SYO546^1 : TPTP v8.2.0. Released v5.2.0.
% 0.13/0.17 % Command : run_E %s %d THM
% 0.14/0.39 % Computer : n002.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8042.1875MB
% 0.14/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Mon May 20 08:49:08 EDT 2024
% 0.14/0.39 % CPUTime :
% 0.36/0.54 Running higher-order theorem proving
% 0.36/0.54 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
% 0.38/0.56 # Version: 3.1.0-ho
% 0.38/0.56 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting lpo8_s with 1500s (5) cores
% 0.38/0.56 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.38/0.56 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.38/0.56 # Starting sh1 with 300s (1) cores
% 0.38/0.56 # lpo8_s with pid 4128 completed with status 0
% 0.38/0.56 # Result found by lpo8_s
% 0.38/0.56 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting lpo8_s with 1500s (5) cores
% 0.38/0.56 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.38/0.56 # Search class: HGUSF-FFMF11-SHSFFFBC
% 0.38/0.56 # partial match(3): HGUSF-FFMF33-SHSFFMBC
% 0.38/0.56 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.56 # Starting lpo8_s with 901s (1) cores
% 0.38/0.56 # Starting ehoh_best_nonlift_rwall with 151s (1) cores
% 0.38/0.56 # Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.38/0.56 # Starting sh1 with 151s (1) cores
% 0.38/0.56 # Starting sh8 with 146s (1) cores
% 0.38/0.56 # lpo8_s with pid 4134 completed with status 0
% 0.38/0.56 # Result found by lpo8_s
% 0.38/0.56 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting lpo8_s with 1500s (5) cores
% 0.38/0.56 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.38/0.56 # Search class: HGUSF-FFMF11-SHSFFFBC
% 0.38/0.56 # partial match(3): HGUSF-FFMF33-SHSFFMBC
% 0.38/0.56 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.56 # Starting lpo8_s with 901s (1) cores
% 0.38/0.56 # Preprocessing time : 0.002 s
% 0.38/0.56 # Presaturation interreduction done
% 0.38/0.56
% 0.38/0.56 # Proof found!
% 0.38/0.56 # SZS status Theorem
% 0.38/0.56 # SZS output start CNFRefutation
% See solution above
% 0.38/0.56 # Parsed axioms : 6
% 0.38/0.56 # Removed by relevancy pruning/SinE : 3
% 0.38/0.56 # Initial clauses : 75
% 0.38/0.56 # Removed in clause preprocessing : 40
% 0.38/0.56 # Initial clauses in saturation : 35
% 0.38/0.56 # Processed clauses : 77
% 0.38/0.56 # ...of these trivial : 1
% 0.38/0.56 # ...subsumed : 24
% 0.38/0.56 # ...remaining for further processing : 52
% 0.38/0.56 # Other redundant clauses eliminated : 9
% 0.38/0.56 # Clauses deleted for lack of memory : 0
% 0.38/0.56 # Backward-subsumed : 7
% 0.38/0.56 # Backward-rewritten : 13
% 0.38/0.56 # Generated clauses : 69
% 0.38/0.56 # ...of the previous two non-redundant : 37
% 0.38/0.56 # ...aggressively subsumed : 0
% 0.38/0.56 # Contextual simplify-reflections : 2
% 0.38/0.56 # Paramodulations : 17
% 0.38/0.56 # Factorizations : 0
% 0.38/0.56 # NegExts : 1
% 0.38/0.56 # Equation resolutions : 9
% 0.38/0.56 # Disequality decompositions : 0
% 0.38/0.56 # Total rewrite steps : 15
% 0.38/0.56 # ...of those cached : 12
% 0.38/0.56 # Propositional unsat checks : 0
% 0.38/0.56 # Propositional check models : 0
% 0.38/0.56 # Propositional check unsatisfiable : 0
% 0.38/0.56 # Propositional clauses : 0
% 0.38/0.56 # Propositional clauses after purity: 0
% 0.38/0.56 # Propositional unsat core size : 0
% 0.38/0.56 # Propositional preprocessing time : 0.000
% 0.38/0.56 # Propositional encoding time : 0.000
% 0.38/0.56 # Propositional solver time : 0.000
% 0.38/0.56 # Success case prop preproc time : 0.000
% 0.38/0.56 # Success case prop encoding time : 0.000
% 0.38/0.56 # Success case prop solver time : 0.000
% 0.38/0.56 # Current number of processed clauses : 8
% 0.38/0.56 # Positive orientable unit clauses : 3
% 0.38/0.56 # Positive unorientable unit clauses: 0
% 0.38/0.56 # Negative unit clauses : 1
% 0.38/0.56 # Non-unit-clauses : 4
% 0.38/0.56 # Current number of unprocessed clauses: 8
% 0.38/0.56 # ...number of literals in the above : 24
% 0.38/0.56 # Current number of archived formulas : 0
% 0.38/0.56 # Current number of archived clauses : 35
% 0.38/0.56 # Clause-clause subsumption calls (NU) : 73
% 0.38/0.56 # Rec. Clause-clause subsumption calls : 68
% 0.38/0.56 # Non-unit clause-clause subsumptions : 41
% 0.38/0.56 # Unit Clause-clause subsumption calls : 2
% 0.38/0.56 # Rewrite failures with RHS unbound : 0
% 0.38/0.56 # BW rewrite match attempts : 2
% 0.38/0.56 # BW rewrite match successes : 2
% 0.38/0.56 # Condensation attempts : 77
% 0.38/0.56 # Condensation successes : 8
% 0.38/0.56 # Termbank termtop insertions : 5035
% 0.38/0.56 # Search garbage collected termcells : 908
% 0.38/0.56
% 0.38/0.56 # -------------------------------------------------
% 0.38/0.56 # User time : 0.008 s
% 0.38/0.56 # System time : 0.004 s
% 0.38/0.56 # Total time : 0.013 s
% 0.38/0.56 # Maximum resident set size: 2184 pages
% 0.38/0.56
% 0.38/0.56 # -------------------------------------------------
% 0.38/0.56 # User time : 0.035 s
% 0.38/0.56 # System time : 0.010 s
% 0.38/0.56 # Total time : 0.044 s
% 0.38/0.56 # Maximum resident set size: 1712 pages
% 0.38/0.56 % E---3.1 exiting
% 0.38/0.56 % E exiting
%------------------------------------------------------------------------------