TSTP Solution File: SYO542^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO542^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 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 09:06:09 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 66 ( 15 unt; 6 typ; 0 def)
% Number of atoms : 502 ( 261 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 496 ( 114 ~; 129 |; 140 &; 107 @)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 117 ( 117 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 116 ( 71 ^ 37 !; 6 ?; 116 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_2,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_15,type,
sK0: $i > $i ).
thf(func_def_16,type,
sK1: $i > $i ).
thf(func_def_19,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f275,plain,
$false,
inference(avatar_sat_refutation,[],[f97,f158,f162,f169,f218,f224]) ).
thf(f224,plain,
~ spl3_5,
inference(avatar_contradiction_clause,[],[f223]) ).
thf(f223,plain,
( $false
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f222]) ).
thf(f222,plain,
( ( sK1 != sK1 )
| ~ spl3_5 ),
inference(superposition,[],[f21,f87]) ).
thf(f87,plain,
( ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f85,plain,
( spl3_5
<=> ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f21,plain,
( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
!= sK1 ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) )
@ sK2
@ sK1
@ sK0 )
!= sK1 ),
inference(definition_unfolding,[],[f16,f17]) ).
thf(f17,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
( if
= ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( X0
& ( X1 = X3 ) )
| ( ( X2 = X3 )
& ~ X0 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( if
= ( ^ [X2: $o,X1: $i > $i,X3: $i > $i] :
( epsii
@ ^ [X4: $i > $i] :
( ( X2
& ( X1 = X4 ) )
| ( ( X3 = X4 )
& ~ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifd) ).
thf(f16,plain,
( ( if @ sK2 @ sK1 @ sK0 )
!= sK1 ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( if @ sK2 @ sK1 @ sK0 )
!= sK1 )
& ( sK0
!= ( if @ sK2 @ sK1 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $i > $i,X1: $i > $i,X2: $o] :
( ( ( if @ X2 @ X1 @ X0 )
!= X1 )
& ( ( if @ X2 @ X1 @ X0 )
!= X0 ) )
=> ( ( ( if @ sK2 @ sK1 @ sK0 )
!= sK1 )
& ( sK0
!= ( if @ sK2 @ sK1 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: $i > $i,X1: $i > $i,X2: $o] :
( ( ( if @ X2 @ X1 @ X0 )
!= X1 )
& ( ( if @ X2 @ X1 @ X0 )
!= X0 ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $i > $i,X1: $i > $i,X2: $o] :
( ( ( if @ X2 @ X1 @ X0 )
= X1 )
| ( ( if @ X2 @ X1 @ X0 )
= X0 ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X3: $i > $i,X1: $i > $i,X2: $o] :
( ( ( if @ X2 @ X1 @ X3 )
= X3 )
| ( ( if @ X2 @ X1 @ X3 )
= X1 ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X3: $i > $i,X1: $i > $i,X2: $o] :
( ( ( if @ X2 @ X1 @ X3 )
= X3 )
| ( ( if @ X2 @ X1 @ X3 )
= X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f218,plain,
( spl3_4
| spl3_5
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f217,f68,f85,f80]) ).
thf(f80,plain,
( spl3_4
<=> ! [X1: $i > $i] : ( sK1 != X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f68,plain,
( spl3_1
<=> ( $true = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f217,plain,
( ! [X1: $i > $i] :
( ( sK1 != X1 )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 ) )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f216]) ).
thf(f216,plain,
( ! [X1: $i > $i] :
( ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 )
| ( sK1 != X1 )
| ( $true = $false ) )
| ~ spl3_1 ),
inference(forward_demodulation,[],[f207,f70]) ).
thf(f70,plain,
( ( $true = sK2 )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f207,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( $false = sK2 )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 ) ),
inference(equality_proxy_clausification,[],[f206]) ).
thf(f206,plain,
! [X1: $i > $i] :
( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true )
| ( sK1 != X1 )
| ( $false = sK2 ) ),
inference(binary_proxy_clausification,[],[f204]) ).
thf(f204,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( $false = sK2 )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true ) ),
inference(duplicate_literal_removal,[],[f203]) ).
thf(f203,plain,
! [X1: $i > $i] :
( ( $false = sK2 )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true )
| ( $false = sK2 )
| ( sK1 != X1 ) ),
inference(not_proxy_clausification,[],[f202]) ).
thf(f202,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( $true = ~ sK2 )
| ( $false = sK2 )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true ) ),
inference(equality_proxy_clausification,[],[f201]) ).
thf(f201,plain,
! [X1: $i > $i] :
( ( $false = sK2 )
| ( ( sK1 = X1 )
= $false )
| ( $true = ~ sK2 )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f199]) ).
thf(f199,plain,
! [X1: $i > $i] :
( ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
= $true )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true )
| ( ( sK1 = X1 )
= $false )
| ( $false = sK2 ) ),
inference(binary_proxy_clausification,[],[f198]) ).
thf(f198,plain,
! [X1: $i > $i] :
( ( ( ( sK1 = X1 )
& sK2 )
= $false )
| ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true )
| ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f173]) ).
thf(f173,plain,
! [X1: $i > $i] :
( ( $true
= ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 ) ) )
| ( ( ( sK1 = X1 )
& sK2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f172]) ).
thf(f172,plain,
! [X1: $i > $i] :
( ( ( ( ~ sK2
& ( sK0 = X1 ) )
| ( ( sK1 = X1 )
& sK2 ) )
= $false )
| ( $true
= ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 ) ) ) ),
inference(beta_eta_normalization,[],[f170]) ).
thf(f170,plain,
! [X1: $i > $i] :
( ( $false
= ( ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) )
@ X1 ) )
| ( $true
= ( ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) )
@ ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f169,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f168]) ).
thf(f168,plain,
( $false
| ~ spl3_4 ),
inference(equality_resolution,[],[f81]) ).
thf(f81,plain,
( ! [X1: $i > $i] : ( sK1 != X1 )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f162,plain,
( spl3_2
| spl3_6
| spl3_5
| spl3_1 ),
inference(avatar_split_clause,[],[f116,f68,f85,f91,f72]) ).
thf(f72,plain,
( spl3_2
<=> ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f91,plain,
( spl3_6
<=> ! [X1: $i > $i] : ( sK0 != X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f116,plain,
! [X1: $i > $i] :
( ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
| ( $true = sK2 )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 )
| ( sK0 != X1 ) ),
inference(equality_proxy_clausification,[],[f115]) ).
thf(f115,plain,
! [X1: $i > $i] :
( ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) )
= sK1 )
| ( ( sK0 = X1 )
= $false )
| ( $true = sK2 )
| ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) ),
inference(equality_proxy_clausification,[],[f114]) ).
thf(f114,plain,
! [X1: $i > $i] :
( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true )
| ( $true = sK2 )
| ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
| ( ( sK0 = X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f113]) ).
thf(f113,plain,
! [X1: $i > $i] :
( ( $true
= ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( ( sK0 = X1 )
= $false )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true )
| ( $true = sK2 ) ),
inference(not_proxy_clausification,[],[f112]) ).
thf(f112,plain,
! [X1: $i > $i] :
( ( $false = ~ sK2 )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true )
| ( ( sK0 = X1 )
= $false )
| ( $true
= ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f105,plain,
! [X1: $i > $i] :
( ( $false
= ( ~ sK2
& ( sK0 = X1 ) ) )
| ( $true
= ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
! [X1: $i > $i] :
( ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
= $true )
| ( $false
= ( ~ sK2
& ( sK0 = X1 ) ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f102]) ).
thf(f102,plain,
! [X1: $i > $i] :
( ( ( ( ~ sK2
& ( sK0 = X1 ) )
| ( ( sK1 = X1 )
& sK2 ) )
= $false )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
= $true )
| ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f100]) ).
thf(f100,plain,
! [X1: $i > $i] :
( ( ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 )
= $true )
| ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
= $true )
| ( ( ( ~ sK2
& ( sK0 = X1 ) )
| ( ( sK1 = X1 )
& sK2 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f99]) ).
thf(f99,plain,
! [X1: $i > $i] :
( ( $true
= ( ( ~ sK2
& ( sK0
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( ( sK1
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) )
& sK2 ) ) )
| ( ( ( ~ sK2
& ( sK0 = X1 ) )
| ( ( sK1 = X1 )
& sK2 ) )
= $false ) ),
inference(beta_eta_normalization,[],[f98]) ).
thf(f98,plain,
! [X1: $i > $i] :
( ( $true
= ( ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) )
@ ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ) )
| ( $false
= ( ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) )
@ X1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f158,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f157]) ).
thf(f157,plain,
( $false
| ~ spl3_6 ),
inference(equality_resolution,[],[f92]) ).
thf(f92,plain,
( ! [X1: $i > $i] : ( sK0 != X1 )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f97,plain,
~ spl3_2,
inference(avatar_split_clause,[],[f22,f72]) ).
thf(f22,plain,
( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ~ sK2
& ( sK0 = Y0 ) )
| ( ( sK1 = Y0 )
& sK2 ) ) ) ),
inference(beta_eta_normalization,[],[f20]) ).
thf(f20,plain,
( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) )
@ sK2
@ sK1
@ sK0 )
!= sK0 ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f15,plain,
( sK0
!= ( if @ sK2 @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO542^1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 10:36:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TH0_THM_EQU_NAR problem
% 0.12/0.34 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35 ipcrm: permission denied for id (1662943232)
% 0.12/0.36 ipcrm: permission denied for id (1662976003)
% 0.12/0.37 ipcrm: permission denied for id (1663008782)
% 0.12/0.38 ipcrm: permission denied for id (1663139872)
% 0.12/0.40 ipcrm: permission denied for id (1663238190)
% 0.12/0.40 ipcrm: permission denied for id (1663270962)
% 0.19/0.40 ipcrm: permission denied for id (1663303737)
% 0.19/0.41 ipcrm: permission denied for id (1663369276)
% 0.19/0.41 ipcrm: permission denied for id (1663402048)
% 0.19/0.42 ipcrm: permission denied for id (1663598667)
% 0.19/0.43 ipcrm: permission denied for id (1663696981)
% 0.19/0.43 ipcrm: permission denied for id (1663729750)
% 0.19/0.45 ipcrm: permission denied for id (1663828080)
% 0.19/0.45 ipcrm: permission denied for id (1663860850)
% 0.19/0.46 ipcrm: permission denied for id (1663893619)
% 0.19/0.46 ipcrm: permission denied for id (1663926392)
% 0.19/0.48 % (11436)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.19/0.48 % (11430)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2998ds/4Mi)
% 0.19/0.48 % (11434)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2998ds/275Mi)
% 0.19/0.48 % (11431)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2998ds/27Mi)
% 0.19/0.48 % (11433)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.19/0.48 % (11435)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2998ds/18Mi)
% 0.19/0.48 % (11429)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2998ds/183Mi)
% 0.19/0.48 % (11432)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.19/0.48 % (11434)Refutation not found, incomplete strategy
% 0.19/0.48 % (11434)------------------------------
% 0.19/0.48 % (11434)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.48 % (11434)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48
% 0.19/0.48 % (11432)Instruction limit reached!
% 0.19/0.48 % (11432)------------------------------
% 0.19/0.48 % (11432)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.48 % (11432)Termination reason: Unknown
% 0.19/0.48 % (11432)Termination phase: Saturation
% 0.19/0.48
% 0.19/0.48 % (11432)Memory used [KB]: 5500
% 0.19/0.48 % (11432)Time elapsed: 0.003 s
% 0.19/0.48 % (11432)Instructions burned: 2 (million)
% 0.19/0.48 % (11432)------------------------------
% 0.19/0.48 % (11432)------------------------------
% 0.19/0.48
% 0.19/0.48 % (11434)Memory used [KB]: 5500
% 0.19/0.48 % (11433)Instruction limit reached!
% 0.19/0.48 % (11433)------------------------------
% 0.19/0.48 % (11433)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.48 % (11433)Termination reason: Unknown
% 0.19/0.48 % (11433)Termination phase: Saturation
% 0.19/0.48
% 0.19/0.48 % (11433)Memory used [KB]: 895
% 0.19/0.48 % (11433)Time elapsed: 0.003 s
% 0.19/0.48 % (11433)Instructions burned: 3 (million)
% 0.19/0.48 % (11433)------------------------------
% 0.19/0.48 % (11433)------------------------------
% 0.19/0.48 % (11434)Time elapsed: 0.003 s
% 0.19/0.48 % (11434)Instructions burned: 1 (million)
% 0.19/0.48 % (11434)------------------------------
% 0.19/0.48 % (11434)------------------------------
% 0.19/0.48 % (11436)Instruction limit reached!
% 0.19/0.48 % (11436)------------------------------
% 0.19/0.48 % (11436)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.48 % (11436)Termination reason: Unknown
% 0.19/0.48 % (11436)Termination phase: Saturation
% 0.19/0.48
% 0.19/0.48 % (11436)Memory used [KB]: 5500
% 0.19/0.48 % (11436)Time elapsed: 0.005 s
% 0.19/0.48 % (11436)Instructions burned: 3 (million)
% 0.19/0.48 % (11436)------------------------------
% 0.19/0.48 % (11436)------------------------------
% 0.19/0.49 % (11430)Instruction limit reached!
% 0.19/0.49 % (11430)------------------------------
% 0.19/0.49 % (11430)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.49 % (11430)Termination reason: Unknown
% 0.19/0.49 % (11430)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (11430)Memory used [KB]: 5500
% 0.19/0.49 % (11430)Time elapsed: 0.004 s
% 0.19/0.49 % (11430)Instructions burned: 4 (million)
% 0.19/0.49 % (11430)------------------------------
% 0.19/0.49 % (11430)------------------------------
% 0.19/0.49 % (11431)First to succeed.
% 0.19/0.49 % (11435)Instruction limit reached!
% 0.19/0.49 % (11435)------------------------------
% 0.19/0.49 % (11435)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.49 % (11435)Termination reason: Unknown
% 0.19/0.49 % (11435)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (11435)Memory used [KB]: 5628
% 0.19/0.49 % (11435)Time elapsed: 0.013 s
% 0.19/0.49 % (11435)Instructions burned: 18 (million)
% 0.19/0.49 % (11435)------------------------------
% 0.19/0.49 % (11435)------------------------------
% 0.19/0.50 % (11431)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (11431)------------------------------
% 0.19/0.50 % (11431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.50 % (11431)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (11431)Memory used [KB]: 5628
% 0.19/0.50 % (11431)Time elapsed: 0.014 s
% 0.19/0.50 % (11431)Instructions burned: 15 (million)
% 0.19/0.50 % (11431)------------------------------
% 0.19/0.50 % (11431)------------------------------
% 0.19/0.50 % (11294)Success in time 0.15 s
% 0.19/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------