TSTP Solution File: SYO041^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO041^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:44:22 EDT 2024
% Result : Theorem 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 72 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 943 ( 0 equ; 0 cnn)
% Maximal formula atoms : 189 ( 14 avg)
% Number of connectives : 1196 ( 318 ~; 462 |; 121 &; 284 @)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
f: $o > $o ).
thf(decl_24,type,
g: $o > $o ).
thf(decl_25,type,
x: $o ).
thf(decl_26,type,
y: $o ).
thf(decl_27,type,
epred1_0: $o ).
thf(decl_28,type,
epred2_0: $o ).
thf(decl_29,type,
epred3_0: $o ).
thf(3,conjecture,
~ ( ( x
<~> y )
& ( ( g @ x )
<=> y )
& ( ( g @ y )
<=> x )
& ( ( f @ ( f @ ( f @ x ) ) )
<=> ( g @ ( f @ x ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',3) ).
thf(c_0_1,plain,
( epred1_0
<=> ( ( ( ( ~ x
| ~ ( f @ $true ) )
& ( x
| ~ ( f @ $false ) ) )
| ~ ( f @ $true ) )
& ( ( ( ~ x
| ( f @ $true ) )
& ( x
| ( f @ $false ) ) )
| ~ ( f @ $false ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
( epred2_0
<=> ( ( ( ( ~ x
| ~ ( f @ $true ) )
& ( x
| ~ ( f @ $false ) ) )
| ( f @ $true ) )
& ( ( ( ~ x
| ( f @ $true ) )
& ( x
| ( f @ $false ) ) )
| ( f @ $false ) ) ) ),
introduced(definition) ).
thf(c_0_3,plain,
( epred3_0
<=> ( ( ( ( ~ x
| ~ ( f @ $true ) )
& ( x
| ~ ( f @ $false ) ) )
| ( g @ $true ) )
& ( ( ( ~ x
| ( f @ $true ) )
& ( x
| ( f @ $false ) ) )
| ( g @ $false ) ) ) ),
introduced(definition) ).
thf(c_0_4,negated_conjecture,
~ ~ ( ~ ( x
<=> y )
& ( ( ( ~ x
| ( g @ $true ) )
& ( x
| ( g @ $false ) ) )
<=> y )
& ( ( ( ~ y
| ( g @ $true ) )
& ( y
| ( g @ $false ) ) )
<=> x )
& ( ( ( epred1_0
| ( f @ $true ) )
& ( epred2_0
| ( f @ $false ) ) )
<=> epred3_0 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[3])])]),c_0_1]),c_0_2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ~ x
| ~ y )
& ( x
| y )
& ( ~ x
| x
| y )
& ( ~ ( g @ $false )
| x
| y )
& ( ~ x
| ~ ( g @ $true )
| y )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| y )
& ( ~ x
| ( g @ $true )
| ~ y )
& ( x
| ( g @ $false )
| ~ y )
& ( ~ y
| y
| x )
& ( ~ ( g @ $false )
| y
| x )
& ( ~ y
| ~ ( g @ $true )
| x )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| x )
& ( ~ y
| ( g @ $true )
| ~ x )
& ( y
| ( g @ $false )
| ~ x )
& ( ~ epred2_0
| ~ epred1_0
| epred3_0 )
& ( ~ ( f @ $false )
| ~ epred1_0
| epred3_0 )
& ( ~ epred2_0
| ~ ( f @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| epred3_0 )
& ( epred1_0
| ( f @ $true )
| ~ epred3_0 )
& ( epred2_0
| ( f @ $false )
| ~ epred3_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_6,plain,
( ( ~ x
| ~ ( f @ $true )
| ( g @ $true )
| ~ epred3_0 )
& ( x
| ~ ( f @ $false )
| ( g @ $true )
| ~ epred3_0 )
& ( ~ x
| ( f @ $true )
| ( g @ $false )
| ~ epred3_0 )
& ( x
| ( f @ $false )
| ( g @ $false )
| ~ epred3_0 )
& ( ~ x
| x
| ~ x
| x
| epred3_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| x
| epred3_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| x
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| x
| epred3_0 )
& ( ~ ( g @ $false )
| ~ x
| x
| epred3_0 )
& ( ~ x
| x
| ( f @ $false )
| x
| epred3_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| x
| epred3_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred3_0 )
& ( ~ ( g @ $false )
| ( f @ $false )
| x
| epred3_0 )
& ( ~ x
| x
| ~ x
| ( f @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| ( f @ $true )
| epred3_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred3_0 )
& ( ~ ( g @ $false )
| ~ x
| ( f @ $true )
| epred3_0 )
& ( ~ x
| x
| ( f @ $false )
| ( f @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| ( f @ $true )
| epred3_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred3_0 )
& ( ~ ( g @ $false )
| ( f @ $false )
| ( f @ $true )
| epred3_0 )
& ( ~ x
| x
| ~ ( g @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| x
| ~ ( g @ $true )
| epred3_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ ( g @ $true )
| epred3_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ ( g @ $true )
| epred3_0 )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| epred3_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_7,negated_conjecture,
( x
| ( g @ ~ $true )
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( x
| y ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( f @ ~ $true )
| x
| epred3_0
| ~ ( g @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( g @ ~ $true )
| x ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( ( ~ x
| ~ ( f @ $true )
| ~ ( f @ $true )
| ~ epred1_0 )
& ( x
| ~ ( f @ $false )
| ~ ( f @ $true )
| ~ epred1_0 )
& ( ~ x
| ( f @ $true )
| ~ ( f @ $false )
| ~ epred1_0 )
& ( x
| ( f @ $false )
| ~ ( f @ $false )
| ~ epred1_0 )
& ( ~ x
| x
| ~ x
| x
| epred1_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| x
| epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| x
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| x
| epred1_0 )
& ( ( f @ $false )
| ~ x
| x
| epred1_0 )
& ( ~ x
| x
| ( f @ $false )
| x
| epred1_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| x
| epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred1_0 )
& ( ( f @ $false )
| ( f @ $false )
| x
| epred1_0 )
& ( ~ x
| x
| ~ x
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| ( f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred1_0 )
& ( ( f @ $false )
| ~ x
| ( f @ $true )
| epred1_0 )
& ( ~ x
| x
| ( f @ $false )
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| ( f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred1_0 )
& ( ( f @ $false )
| ( f @ $false )
| ( f @ $true )
| epred1_0 )
& ( ~ x
| x
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $true )
| epred1_0 )
& ( ( f @ $false )
| ( f @ $true )
| epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_12,negated_conjecture,
( epred3_0
| ~ ( f @ ~ $true )
| ~ ( f @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,plain,
( ( f @ ~ $true )
| epred3_0
| x ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,plain,
( x
| ( f @ $true )
| epred1_0
| ~ ( f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
( ( f @ ~ $true )
| ( f @ $true )
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
( epred3_0
| ~ ( f @ ~ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_17,plain,
( ( ~ x
| ~ ( f @ $true )
| ( f @ $true )
| ~ epred2_0 )
& ( x
| ~ ( f @ $false )
| ( f @ $true )
| ~ epred2_0 )
& ( ~ x
| ( f @ $true )
| ( f @ $false )
| ~ epred2_0 )
& ( x
| ( f @ $false )
| ( f @ $false )
| ~ epred2_0 )
& ( ~ x
| x
| ~ x
| x
| epred2_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| x
| epred2_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| x
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| x
| epred2_0 )
& ( ~ ( f @ $false )
| ~ x
| x
| epred2_0 )
& ( ~ x
| x
| ( f @ $false )
| x
| epred2_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| x
| epred2_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| x
| epred2_0 )
& ( ~ ( f @ $false )
| ( f @ $false )
| x
| epred2_0 )
& ( ~ x
| x
| ~ x
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| x
| ~ x
| ( f @ $true )
| epred2_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ x
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ~ x
| ( f @ $true )
| epred2_0 )
& ( ~ x
| x
| ( f @ $false )
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| x
| ( f @ $false )
| ( f @ $true )
| epred2_0 )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ( f @ $false )
| ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ( f @ $false )
| ( f @ $true )
| epred2_0 )
& ( ~ x
| x
| ~ ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| x
| ~ ( f @ $true )
| epred2_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ ( f @ $true )
| epred2_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| epred2_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_18,negated_conjecture,
( x
| ~ y
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_19,negated_conjecture,
( x
| epred3_0
| ~ ( f @ $true ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_20,plain,
( ( f @ $true )
| epred1_0
| x ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_21,negated_conjecture,
( x
| epred3_0
| ~ epred1_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
thf(c_0_22,plain,
( x
| ( f @ ~ $true )
| ( f @ ~ $true )
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,plain,
( x
| ( g @ $true )
| ~ ( f @ ~ $true )
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_24,negated_conjecture,
( x
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_18,c_0_8]) ).
thf(c_0_25,negated_conjecture,
( epred2_0
| ( f @ ~ $true )
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_26,plain,
( epred3_0
| x ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
thf(c_0_27,plain,
( x
| ( f @ ~ $true )
| ~ epred2_0 ),
inference(cn,[status(thm)],[c_0_22]) ).
thf(c_0_28,plain,
( x
| ~ ( f @ ~ $true )
| ~ epred3_0 ),
inference(csr,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_29,negated_conjecture,
( ( f @ ~ $true )
| x ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
thf(c_0_30,negated_conjecture,
( y
| ( g @ ~ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_31,negated_conjecture,
( ~ x
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_32,plain,
x,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]) ).
thf(c_0_33,plain,
( epred2_0
| ~ x
| ~ ( f @ $true )
| ~ ( f @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_34,negated_conjecture,
( ( g @ ~ $true )
| y ),
inference(csr,[status(thm)],[c_0_30,c_0_10]) ).
thf(c_0_35,negated_conjecture,
~ y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
thf(c_0_36,plain,
( epred2_0
| ~ x
| ~ ( f @ $true ) ),
inference(cn,[status(thm)],[c_0_33]) ).
thf(c_0_37,plain,
( ( f @ $true )
| epred3_0
| ~ ( g @ ~ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_38,negated_conjecture,
g @ ~ $true,
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_39,plain,
( ~ x
| ~ ( f @ $true )
| ~ ( f @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_40,negated_conjecture,
( y
| ~ x
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_41,plain,
( epred2_0
| ~ ( f @ $true ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_32])]) ).
thf(c_0_42,plain,
( ( f @ $true )
| epred3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_32])]),c_0_38])]) ).
thf(c_0_43,plain,
( x
| ~ ( f @ ~ $true )
| ~ ( f @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_44,plain,
( ~ x
| ~ epred1_0
| ~ ( f @ $true ) ),
inference(cn,[status(thm)],[c_0_39]) ).
thf(c_0_45,negated_conjecture,
( y
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_40,c_0_24]) ).
thf(c_0_46,plain,
( ( g @ $true )
| ~ x
| ~ ( f @ $true )
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_47,negated_conjecture,
( epred3_0
| ~ epred2_0
| ~ ( f @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_48,plain,
( epred3_0
| epred2_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_49,plain,
( ( f @ $true )
| ~ x
| ~ ( f @ ~ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_50,plain,
( ~ ( f @ $true )
| ~ ( f @ ~ $true )
| ~ epred1_0 ),
inference(csr,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_51,negated_conjecture,
( y
| ~ ( f @ $true )
| ~ epred3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_8]) ).
thf(c_0_52,negated_conjecture,
epred3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_48]) ).
thf(c_0_53,plain,
( ~ ( f @ ~ $true )
| ~ x
| ~ epred1_0 ),
inference(csr,[status(thm)],[c_0_49,c_0_50]) ).
thf(c_0_54,negated_conjecture,
( epred1_0
| ( f @ $true )
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_55,negated_conjecture,
~ ( f @ $true ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),c_0_35]) ).
thf(c_0_56,plain,
( x
| ( f @ $true )
| ~ ( f @ ~ $true )
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_57,plain,
( ~ ( f @ ~ $true )
| ~ epred1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_32])]) ).
thf(c_0_58,negated_conjecture,
epred1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_52])]),c_0_55]) ).
thf(c_0_59,plain,
( ( f @ $true )
| ( f @ ~ $true )
| ~ x
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_60,plain,
( ( f @ $true )
| x
| ~ epred2_0 ),
inference(csr,[status(thm)],[c_0_56,c_0_27]) ).
thf(c_0_61,plain,
~ ( f @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
thf(c_0_62,plain,
( ( f @ ~ $true )
| ( f @ $true )
| ~ epred2_0 ),
inference(csr,[status(thm)],[c_0_59,c_0_60]) ).
thf(c_0_63,negated_conjecture,
epred2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_52])]),c_0_61]) ).
thf(c_0_64,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),c_0_61]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYO041^2 : TPTP v8.2.0. Released v4.1.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 09:45:07 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running higher-order theorem proving
% 0.23/0.52 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.23/0.54 # Version: 3.1.0-ho
% 0.23/0.54 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.54 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.23/0.54 # Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.54 # Starting sh4l with 300s (1) cores
% 0.23/0.54 # new_ho_10 with pid 17603 completed with status 0
% 0.23/0.54 # Result found by new_ho_10
% 0.23/0.54 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: HGHNF-FFMS00-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting new_ho_10 with 901s (1) cores
% 0.23/0.54 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.23/0.54 # Starting ho_unfolding_6 with 151s (1) cores
% 0.23/0.54 # Starting sh4l with 151s (1) cores
% 0.23/0.54 # Starting ehoh_best_nonlift_rwall with 146s (1) cores
% 0.23/0.54 # ho_unfolding_6 with pid 17612 completed with status 0
% 0.23/0.54 # Result found by ho_unfolding_6
% 0.23/0.54 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: HGHNF-FFMS00-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting new_ho_10 with 901s (1) cores
% 0.23/0.54 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.23/0.54 # Starting ho_unfolding_6 with 151s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Theorem
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 6
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 112
% 0.23/0.54 # Removed in clause preprocessing : 67
% 0.23/0.54 # Initial clauses in saturation : 45
% 0.23/0.54 # Processed clauses : 75
% 0.23/0.54 # ...of these trivial : 1
% 0.23/0.54 # ...subsumed : 16
% 0.23/0.54 # ...remaining for further processing : 58
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 16
% 0.23/0.54 # Backward-rewritten : 31
% 0.23/0.54 # Generated clauses : 216
% 0.23/0.54 # ...of the previous two non-redundant : 52
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 23
% 0.23/0.54 # Paramodulations : 62
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Disequality decompositions : 0
% 0.23/0.54 # Total rewrite steps : 33
% 0.23/0.54 # ...of those cached : 28
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 9
% 0.23/0.54 # Positive orientable unit clauses : 5
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 3
% 0.23/0.54 # Non-unit-clauses : 1
% 0.23/0.54 # Current number of unprocessed clauses: 15
% 0.23/0.54 # ...number of literals in the above : 46
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 49
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 167
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 117
% 0.23/0.54 # Non-unit clause-clause subsumptions : 52
% 0.23/0.54 # Unit Clause-clause subsumption calls : 20
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 5
% 0.23/0.54 # BW rewrite match successes : 5
% 0.23/0.54 # Condensation attempts : 75
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 4589
% 0.23/0.54 # Search garbage collected termcells : 697
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.012 s
% 0.23/0.54 # System time : 0.001 s
% 0.23/0.54 # Total time : 0.013 s
% 0.23/0.54 # Maximum resident set size: 1880 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.033 s
% 0.23/0.54 # System time : 0.005 s
% 0.23/0.54 # Total time : 0.038 s
% 0.23/0.54 # Maximum resident set size: 1684 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------