%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO170^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:46:47 AM UTC 2026
% Result : Theorem 1.23s 0.49s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 12
% Syntax : Number of formulae : 108 ( 32 unt; 0 typ; 11 def)
% Number of atoms : 896 ( 187 equ; 0 cnn)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 881 ( 134 ~; 133 |; 31 &; 563 @)
% ( 8 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 13 con; 0-3 aty)
% Number of variables : 164 ( 0 sgn 164 !; 0 ?; 164 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
cP: $i > $i > $i > $o ).
thf(func_def_8,type,
sF0: $o ).
thf(func_def_9,type,
sF1: $i > $o ).
thf(func_def_10,type,
sF2: $i > $o ).
thf(func_def_11,type,
sF3: $o ).
thf(func_def_12,type,
sF4: $i > $i > $i > $o ).
thf(func_def_13,type,
sF5: $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i,X4: $i,X1: $i,X2: $i,X3: $i,X5: $i] :
( ( ( cP @ X1 @ X2 @ X4 )
& ( cP @ X0 @ X1 @ X3 ) )
=> ( ( cP @ X0 @ X4 @ X5 )
<=> ( cP @ X3 @ X2 @ X5 ) ) )
& ! [X0: $i] : ( cP @ e @ X0 @ X0 )
& ! [X1: $i] : ( cP @ X1 @ e @ X1 )
& ! [X2: $i] : ( cP @ X2 @ X2 @ e ) )
=> ( ( cP @ a @ b @ ab )
=> ( cP @ b @ a @ ab ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM105) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i,X4: $i,X1: $i,X2: $i,X3: $i,X5: $i] :
( ( ( cP @ X1 @ X2 @ X4 )
& ( cP @ X0 @ X1 @ X3 ) )
=> ( ( cP @ X0 @ X4 @ X5 )
<=> ( cP @ X3 @ X2 @ X5 ) ) )
& ! [X0: $i] : ( cP @ e @ X0 @ X0 )
& ! [X1: $i] : ( cP @ X1 @ e @ X1 )
& ! [X2: $i] : ( cP @ X2 @ X2 @ e ) )
=> ( ( cP @ a @ b @ ab )
=> ( cP @ b @ a @ ab ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ( ( cP @ X2 @ X3 @ X1 )
& ( cP @ X0 @ X2 @ X4 ) )
=> ( ( cP @ X0 @ X1 @ X5 )
<=> ( cP @ X4 @ X3 @ X5 ) ) )
& ! [X6: $i] : ( cP @ e @ X6 @ X6 )
& ! [X7: $i] : ( cP @ X7 @ e @ X7 )
& ! [X8: $i] : ( cP @ X8 @ X8 @ e ) )
=> ( ( cP @ a @ b @ ab )
=> ( cP @ b @ a @ ab ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X4: $i,X0: $i,X3: $i,X1: $i,X2: $i,X5: $i] :
( ( ( $true
= ( cP @ X0 @ X2 @ X4 ) )
& ( ( cP @ X2 @ X3 @ X1 )
= $true ) )
=> ( ( cP @ X0 @ X1 @ X5 )
= ( cP @ X4 @ X3 @ X5 ) ) )
& ! [X6: $i] :
( $true
= ( cP @ e @ X6 @ X6 ) )
& ! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) )
& ! [X7: $i] :
( $true
= ( cP @ X7 @ e @ X7 ) ) )
=> ( ( ( cP @ a @ b @ ab )
= $true )
=> ( ( cP @ b @ a @ ab )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( cP @ b @ a @ ab )
!= $true )
& ( ( cP @ a @ b @ ab )
= $true )
& ! [X4: $i,X0: $i,X3: $i,X1: $i,X2: $i,X5: $i] :
( ( ( cP @ X0 @ X1 @ X5 )
= ( cP @ X4 @ X3 @ X5 ) )
| ( $true
!= ( cP @ X0 @ X2 @ X4 ) )
| ( ( cP @ X2 @ X3 @ X1 )
!= $true ) )
& ! [X6: $i] :
( $true
= ( cP @ e @ X6 @ X6 ) )
& ! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) )
& ! [X7: $i] :
( $true
= ( cP @ X7 @ e @ X7 ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( cP @ b @ a @ ab )
!= $true )
& ! [X7: $i] :
( $true
= ( cP @ X7 @ e @ X7 ) )
& ! [X6: $i] :
( $true
= ( cP @ e @ X6 @ X6 ) )
& ( ( cP @ a @ b @ ab )
= $true )
& ! [X5: $i,X3: $i,X1: $i,X2: $i,X4: $i,X0: $i] :
( ( ( cP @ X2 @ X3 @ X1 )
!= $true )
| ( $true
!= ( cP @ X0 @ X2 @ X4 ) )
| ( ( cP @ X0 @ X1 @ X5 )
= ( cP @ X4 @ X3 @ X5 ) ) )
& ! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( ( cP @ b @ a @ ab )
!= $true )
& ! [X0: $i] :
( ( cP @ X0 @ e @ X0 )
= $true )
& ! [X1: $i] :
( ( cP @ e @ X1 @ X1 )
= $true )
& ( ( cP @ a @ b @ ab )
= $true )
& ! [X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( ( $true
!= ( cP @ X5 @ X3 @ X4 ) )
| ( $true
!= ( cP @ X7 @ X5 @ X6 ) )
| ( ( cP @ X7 @ X4 @ X2 )
= ( cP @ X6 @ X3 @ X2 ) ) )
& ! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X2: $i,X3: $i,X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
!= ( cP @ X5 @ X3 @ X4 ) )
| ( $true
!= ( cP @ X7 @ X5 @ X6 ) )
| ( ( cP @ X7 @ X4 @ X2 )
= ( cP @ X6 @ X3 @ X2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( cP @ a @ b @ ab )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X1: $i] :
( ( cP @ e @ X1 @ X1 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
! [X0: $i] :
( ( cP @ X0 @ e @ X0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
( ( cP @ b @ a @ ab )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f16,definition,
( sF0
= ( cP @ b @ a @ ab ) ),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
thf(f17,plain,
( ( cP @ b @ a @ ab )
= sF0 ),
inference(reorient_equations,[],[f16]) ).
thf(f18,plain,
sF0 != $true,
inference(definition_folding,[],[f13,f17]) ).
thf(f19,definition,
! [X0: $i] :
( ( sF1 @ X0 )
= ( cP @ X0 @ e @ X0 ) ),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
thf(f20,plain,
! [X0: $i] :
( ( cP @ X0 @ e @ X0 )
= ( sF1 @ X0 ) ),
inference(reorient_equations,[],[f19]) ).
thf(f21,plain,
! [X0: $i] :
( $true
= ( sF1 @ X0 ) ),
inference(definition_folding,[],[f12,f20]) ).
thf(f22,definition,
! [X1: $i] :
( ( sF2 @ X1 )
= ( cP @ e @ X1 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f23,plain,
! [X1: $i] :
( ( cP @ e @ X1 @ X1 )
= ( sF2 @ X1 ) ),
inference(reorient_equations,[],[f22]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( sF2 @ X1 ) ),
inference(definition_folding,[],[f11,f23]) ).
thf(f25,definition,
( sF3
= ( cP @ a @ b @ ab ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f26,plain,
( ( cP @ a @ b @ ab )
= sF3 ),
inference(reorient_equations,[],[f25]) ).
thf(f27,plain,
$true = sF3,
inference(definition_folding,[],[f10,f26]) ).
thf(f28,definition,
! [X3: $i,X4: $i,X5: $i] :
( ( sF4 @ X4 @ X3 @ X5 )
= ( cP @ X5 @ X3 @ X4 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
!= ( sF4 @ X6 @ X5 @ X7 ) )
| ( ( sF4 @ X4 @ X3 @ X5 )
!= $true )
| ( ( sF4 @ X2 @ X3 @ X6 )
= ( sF4 @ X2 @ X4 @ X7 ) ) ),
inference(definition_folding,[],[f9,f28,f28,f28,f28]) ).
thf(f30,definition,
! [X8: $i] :
( ( sF5 @ X8 )
= ( cP @ X8 @ X8 @ e ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f31,plain,
! [X8: $i] :
( $true
= ( sF5 @ X8 ) ),
inference(definition_folding,[],[f8,f30]) ).
thf(f32,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( ( sF4 @ X4 @ X3 @ X5 )
= $true )
| ( ( cP @ X5 @ X3 @ X4 )
= $false ) ),
inference(iff_proxy_clausification,[],[f28]) ).
thf(f33,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true
= ( cP @ X5 @ X3 @ X4 ) )
| ( ( sF4 @ X4 @ X3 @ X5 )
= $false ) ),
inference(iff_proxy_clausification,[],[f28]) ).
thf(f34,plain,
( ( ( cP @ a @ b @ ab )
= $true )
| ( sF3 = $false ) ),
inference(iff_proxy_clausification,[],[f26]) ).
thf(f37,plain,
( ( ( cP @ b @ a @ ab )
= $false )
| ( sF0 = $true ) ),
inference(iff_proxy_clausification,[],[f17]) ).
thf(f39,plain,
! [X8: $i] :
( ( ( sF5 @ X8 )
= $false )
| ( $true
= ( cP @ X8 @ X8 @ e ) ) ),
inference(iff_proxy_clausification,[],[f30]) ).
thf(f40,plain,
! [X2: $i,X3: $i,X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
= ( sF4 @ X2 @ X3 @ X6 ) )
| ( ( sF4 @ X2 @ X4 @ X7 )
= $false )
| ( ( sF4 @ X4 @ X3 @ X5 )
!= $true )
| ( $true
!= ( sF4 @ X6 @ X5 @ X7 ) ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f41,plain,
! [X2: $i,X3: $i,X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
= ( sF4 @ X2 @ X4 @ X7 ) )
| ( $true
!= ( sF4 @ X6 @ X5 @ X7 ) )
| ( ( sF4 @ X4 @ X3 @ X5 )
!= $true )
| ( ( sF4 @ X2 @ X3 @ X6 )
= $false ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f42,plain,
! [X1: $i] :
( ( ( cP @ e @ X1 @ X1 )
= $true )
| ( ( sF2 @ X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f44,plain,
! [X0: $i] :
( ( $false
= ( sF1 @ X0 ) )
| ( ( cP @ X0 @ e @ X0 )
= $true ) ),
inference(iff_proxy_clausification,[],[f20]) ).
thf(f51,definition,
( spl6_2
<=> ( $true = sF3 ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
thf(f53,plain,
( ( $true = sF3 )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f56,definition,
( spl6_3
<=> ( ( cP @ a @ b @ ab )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
thf(f58,plain,
( ( ( cP @ a @ b @ ab )
= $true )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f60,definition,
( spl6_4
<=> ( sF3 = $false ) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
thf(f62,plain,
( ( sF3 = $false )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f63,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f34,f60,f56]) ).
thf(f65,definition,
( spl6_5
<=> ( sF0 = $true ) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
thf(f69,definition,
( spl6_6
<=> ( ( cP @ b @ a @ ab )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
thf(f71,plain,
( ( ( cP @ b @ a @ ab )
= $false )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f72,plain,
( spl6_5
| spl6_6 ),
inference(avatar_split_clause,[],[f37,f69,f65]) ).
thf(f82,plain,
~ spl6_5,
inference(avatar_split_clause,[],[f18,f65]) ).
thf(f83,plain,
spl6_2,
inference(avatar_split_clause,[],[f27,f51]) ).
thf(f105,plain,
! [X8: $i] :
( ( $true
= ( cP @ X8 @ X8 @ e ) )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f39,f31]) ).
thf(f106,plain,
! [X8: $i] :
( $true
= ( cP @ X8 @ X8 @ e ) ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f107,plain,
! [X1: $i] :
( ( $true = $false )
| ( ( cP @ e @ X1 @ X1 )
= $true ) ),
inference(forward_demodulation,[],[f42,f24]) ).
thf(f108,plain,
! [X1: $i] :
( ( cP @ e @ X1 @ X1 )
= $true ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f109,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( cP @ X0 @ e @ X0 )
= $true ) ),
inference(forward_demodulation,[],[f44,f21]) ).
thf(f110,plain,
! [X0: $i] :
( ( cP @ X0 @ e @ X0 )
= $true ),
inference(trivial_inequality_removal,[],[f109]) ).
thf(f111,plain,
( ( ( sF4 @ ab @ a @ b )
= $false )
| ( $true = $false )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f33,f71]) ).
thf(f113,plain,
( ( ( sF4 @ ab @ a @ b )
= $false )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f111]) ).
thf(f121,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( sF4 @ X0 @ a @ X2 ) )
| ( $false
= ( sF4 @ ab @ X0 @ X1 ) )
| ( $true = $false )
| ( $true
!= ( sF4 @ b @ X2 @ X1 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f40,f113]) ).
thf(f123,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( sF4 @ ab @ X0 @ X1 ) )
| ( $true
!= ( sF4 @ X0 @ a @ X2 ) )
| ( $true
!= ( sF4 @ b @ X2 @ X1 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f121]) ).
thf(f129,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( sF4 @ b @ X2 @ X1 ) )
| ( $true = $false )
| ( ( cP @ X1 @ X0 @ ab )
= $false )
| ( $true
!= ( sF4 @ X0 @ a @ X2 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f123,f32]) ).
thf(f139,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X1 @ X0 @ ab )
= $false )
| ( $true
!= ( sF4 @ X0 @ a @ X2 ) )
| ( $true
!= ( sF4 @ b @ X2 @ X1 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f159,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( $true
!= ( sF4 @ e @ a @ X0 ) )
| ( $true
!= ( sF4 @ b @ X0 @ ab ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f139,f110]) ).
thf(f166,plain,
( ! [X0: $i] :
( ( $true
!= ( sF4 @ e @ a @ X0 ) )
| ( $true
!= ( sF4 @ b @ X0 @ ab ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f159]) ).
thf(f175,plain,
( ! [X0: $i] :
( ( ( cP @ X0 @ a @ e )
= $false )
| ( $true
!= ( sF4 @ b @ X0 @ ab ) )
| ( $true != $true ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f166,f32]) ).
thf(f182,plain,
( ! [X0: $i] :
( ( ( cP @ X0 @ a @ e )
= $false )
| ( $true
!= ( sF4 @ b @ X0 @ ab ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f175]) ).
thf(f215,plain,
( ( $true = $false )
| ( $true
!= ( sF4 @ b @ a @ ab ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f182,f106]) ).
thf(f220,plain,
( ( $true
!= ( sF4 @ b @ a @ ab ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f215]) ).
thf(f226,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true != $true )
| ( $true
!= ( sF4 @ X0 @ X1 @ ab ) )
| ( ( sF4 @ b @ X2 @ X0 )
= $false )
| ( $true
!= ( sF4 @ a @ X2 @ X1 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f220,f41]) ).
thf(f231,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( sF4 @ b @ X2 @ X0 )
= $false )
| ( $true
!= ( sF4 @ a @ X2 @ X1 ) )
| ( $true
!= ( sF4 @ X0 @ X1 @ ab ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f226]) ).
thf(f489,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X1 @ X0 @ b )
= $false )
| ( $true = $false )
| ( $true
!= ( sF4 @ X1 @ X2 @ ab ) )
| ( $true
!= ( sF4 @ a @ X0 @ X2 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f32,f231]) ).
thf(f496,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X1 @ X0 @ b )
= $false )
| ( $true
!= ( sF4 @ a @ X0 @ X2 ) )
| ( $true
!= ( sF4 @ X1 @ X2 @ ab ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f489]) ).
thf(f554,plain,
( ! [X0: $i] :
( ( $true
!= ( sF4 @ a @ b @ X0 ) )
| ( $true
!= ( sF4 @ e @ X0 @ ab ) )
| ( $true = $false ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f108,f496]) ).
thf(f558,plain,
( ! [X0: $i] :
( ( $true
!= ( sF4 @ e @ X0 @ ab ) )
| ( $true
!= ( sF4 @ a @ b @ X0 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f554]) ).
thf(f565,plain,
( ! [X0: $i] :
( ( ( cP @ ab @ X0 @ e )
= $false )
| ( $true != $true )
| ( $true
!= ( sF4 @ a @ b @ X0 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f558,f32]) ).
thf(f569,plain,
( ! [X0: $i] :
( ( ( cP @ ab @ X0 @ e )
= $false )
| ( $true
!= ( sF4 @ a @ b @ X0 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f565]) ).
thf(f603,plain,
( ( $true = $false )
| ( $true
!= ( sF4 @ a @ b @ ab ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f106,f569]) ).
thf(f606,plain,
( ( $true
!= ( sF4 @ a @ b @ ab ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f603]) ).
thf(f615,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( sF4 @ X0 @ b @ X2 ) )
| ( $true != $true )
| ( ( sF4 @ a @ X0 @ X1 )
= $false )
| ( ( sF4 @ ab @ X2 @ X1 )
!= $true ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f606,f40]) ).
thf(f620,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( sF4 @ a @ X0 @ X1 )
= $false )
| ( ( sF4 @ ab @ X2 @ X1 )
!= $true )
| ( $true
!= ( sF4 @ X0 @ b @ X2 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f615]) ).
thf(f1096,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( ( cP @ X1 @ X0 @ a )
= $false )
| ( $true
!= ( sF4 @ X0 @ b @ X2 ) )
| ( ( sF4 @ ab @ X2 @ X1 )
!= $true ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f32,f620]) ).
thf(f1101,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X1 @ X0 @ a )
= $false )
| ( ( sF4 @ ab @ X2 @ X1 )
!= $true )
| ( $true
!= ( sF4 @ X0 @ b @ X2 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1096]) ).
thf(f1269,plain,
( ! [X0: $i] :
( ( ( sF4 @ ab @ X0 @ a )
!= $true )
| ( $true
!= ( sF4 @ e @ b @ X0 ) )
| ( $true = $false ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f1101,f110]) ).
thf(f1276,plain,
( ! [X0: $i] :
( ( $true
!= ( sF4 @ e @ b @ X0 ) )
| ( ( sF4 @ ab @ X0 @ a )
!= $true ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1269]) ).
thf(f1296,plain,
( ! [X0: $i] :
( ( $true != $true )
| ( ( cP @ X0 @ b @ e )
= $false )
| ( ( sF4 @ ab @ X0 @ a )
!= $true ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f1276,f32]) ).
thf(f1304,plain,
( ! [X0: $i] :
( ( ( cP @ X0 @ b @ e )
= $false )
| ( ( sF4 @ ab @ X0 @ a )
!= $true ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1296]) ).
thf(f1348,plain,
( ( $true
!= ( sF4 @ ab @ b @ a ) )
| ( $true = $false )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f1304,f106]) ).
thf(f1353,plain,
( ( $true
!= ( sF4 @ ab @ b @ a ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1348]) ).
thf(f1365,plain,
( ( ( cP @ a @ b @ ab )
= $false )
| ( $true != $true )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f1353,f32]) ).
thf(f1369,plain,
( ( ( cP @ a @ b @ ab )
= $false )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1365]) ).
thf(f1373,plain,
( ( $true = $false )
| ~ spl6_3
| ~ spl6_6 ),
inference(forward_demodulation,[],[f1369,f58]) ).
thf(f1374,plain,
( $false
| ~ spl6_3
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f1373]) ).
thf(f1375,plain,
( ~ spl6_3
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f1374]) ).
thf(f1376,plain,
( ( $true = $false )
| ~ spl6_2
| ~ spl6_4 ),
inference(forward_demodulation,[],[f62,f53]) ).
thf(f1377,plain,
( $false
| ~ spl6_2
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f1376]) ).
thf(f1378,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f1377]) ).
cnf(s2,plain,
( spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f63]) ).
cnf(s3,plain,
( spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f72]) ).
cnf(s5,plain,
~ spl6_5,
inference(sat_conversion,[],[f82]) ).
cnf(s6,plain,
spl6_2,
inference(sat_conversion,[],[f83]) ).
cnf(s9,plain,
( ~ spl6_3
| ~ spl6_6 ),
inference(sat_conversion,[],[f1375]) ).
cnf(s10,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f1378]) ).
cnf(s12,plain,
~ spl6_4,
inference(rat,[],[s10,s6]) ).
cnf(s14,plain,
spl6_6,
inference(rat,[],[s3,s5]) ).
cnf(s16,plain,
~ spl6_3,
inference(rat,[],[s9,s14]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s2,s12,s16]) ).
thf(f1380,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO170^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n026.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 16:39:27 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.31 Running higher-order theorem proving
% 0.24/0.32 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.23/0.49 % (836856)Detected a higher-order problem, will run a greedy HOL sequence.
% 1.23/0.49 % (836862)lrs+10_16_si=on:nwc=1.5:random_seed=1734177749:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 1.23/0.49 % (836862)Instruction limit reached!
% 1.23/0.49 % (836862)------------------------------
% 1.23/0.49 % (836862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836862)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836862)Termination reason: Instruction limit
% 1.23/0.49 % (836862)Termination phase: Saturation
% 1.23/0.49 % (836862)Time elapsed: 0.010 s
% 1.23/0.49 % (836862)Peak memory usage: 12 MB
% 1.23/0.49 % (836862)Instructions burned: 20 (million)
% 1.23/0.49 % (836867)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 1.23/0.49 % (836867)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 1.23/0.49 % (836861)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4109181647:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 1.23/0.49 % (836863)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3860486564:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 1.23/0.49 % (836865)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4028539878:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 1.23/0.49 % (836864)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1159546050:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 1.23/0.49 % (836866)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=605070589:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 1.23/0.49 % (836867)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1609035558:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 1.23/0.49 % (836863)Instruction limit reached!
% 1.23/0.49 % (836863)------------------------------
% 1.23/0.49 % (836863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836863)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836863)Termination reason: Instruction limit
% 1.23/0.49 % (836863)Termination phase: Saturation
% 1.23/0.49 % (836863)Time elapsed: 0.003 s
% 1.23/0.49 % (836863)Peak memory usage: 12 MB
% 1.23/0.49 % (836863)Instructions burned: 3 (million)
% 1.23/0.49 % (836869)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=4221208512:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 1.23/0.49 % (836869)Instruction limit reached!
% 1.23/0.49 % (836869)------------------------------
% 1.23/0.49 % (836869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836869)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836869)Termination reason: Instruction limit
% 1.23/0.49 % (836869)Termination phase: Saturation
% 1.23/0.49 % (836869)Time elapsed: 0.004 s
% 1.23/0.49 % (836869)Peak memory usage: 12 MB
% 1.23/0.49 % (836869)Instructions burned: 8 (million)
% 1.23/0.49 % (836865)Instruction limit reached!
% 1.23/0.49 % (836865)------------------------------
% 1.23/0.49 % (836865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836865)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836865)Termination reason: Instruction limit
% 1.23/0.49 % (836865)Termination phase: Saturation
% 1.23/0.49 % (836865)Time elapsed: 0.021 s
% 1.23/0.49 % (836865)Peak memory usage: 11 MB
% 1.23/0.49 % (836865)Instructions burned: 24 (million)
% 1.23/0.49 % (836878)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.23/0.49 % (836876)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4148323839:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 1.23/0.49 % (836878)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2289988749:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 1.23/0.49 % (836876)Instruction limit reached!
% 1.23/0.49 % (836876)------------------------------
% 1.23/0.49 % (836876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836876)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836876)Termination reason: Instruction limit
% 1.23/0.49 % (836876)Termination phase: Saturation
% 1.23/0.49 % (836876)Time elapsed: 0.006 s
% 1.23/0.49 % (836876)Peak memory usage: 12 MB
% 1.23/0.49 % (836876)Instructions burned: 5 (million)
% 1.23/0.49 % (836878)Instruction limit reached!
% 1.23/0.49 % (836878)------------------------------
% 1.23/0.49 % (836878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836878)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836878)Termination reason: Instruction limit
% 1.23/0.49 % (836878)Termination phase: Saturation
% 1.23/0.49 % (836878)Time elapsed: 0.005 s
% 1.23/0.49 % (836878)Peak memory usage: 12 MB
% 1.23/0.49 % (836878)Instructions burned: 8 (million)
% 1.23/0.49 % (836879)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2673696382:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 1.23/0.49 % (836879)Instruction limit reached!
% 1.23/0.49 % (836879)------------------------------
% 1.23/0.49 % (836879)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836879)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836879)Termination reason: Instruction limit
% 1.23/0.49 % (836879)Termination phase: Saturation
% 1.23/0.49 % (836879)Time elapsed: 0.012 s
% 1.23/0.49 % (836879)Peak memory usage: 12 MB
% 1.23/0.49 % (836879)Instructions burned: 12 (million)
% 1.23/0.49 % (836883)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=542884129:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 1.23/0.49 % (836866)Instruction limit reached!
% 1.23/0.49 % (836866)------------------------------
% 1.23/0.49 % (836866)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836866)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836866)Termination reason: Instruction limit
% 1.23/0.49 % (836866)Termination phase: Saturation
% 1.23/0.49 % (836866)Time elapsed: 0.066 s
% 1.23/0.49 % (836866)Peak memory usage: 12 MB
% 1.23/0.49 % (836866)Instructions burned: 76 (million)
% 1.23/0.49 % (836861)Instruction limit reached!
% 1.23/0.49 % (836861)------------------------------
% 1.23/0.49 % (836861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836861)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836861)Termination reason: Instruction limit
% 1.23/0.49 % (836861)Termination phase: Saturation
% 1.23/0.49 % (836861)Time elapsed: 0.073 s
% 1.23/0.49 % (836861)Peak memory usage: 12 MB
% 1.23/0.49 % (836861)Instructions burned: 88 (million)
% 1.23/0.49 % (836882)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 1.23/0.49 % (836882)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.23/0.49 % (836882)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=2463306568:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 1.23/0.49 % (836887)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 1.23/0.49 % (836887)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=1131333504:i=2:add=on:rtra=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.23/0.49 % (836887)Instruction limit reached!
% 1.23/0.49 % (836887)------------------------------
% 1.23/0.49 % (836887)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836887)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836887)Termination reason: Instruction limit
% 1.23/0.49 % (836887)Termination phase: Saturation
% 1.23/0.49 % (836887)Time elapsed: 0.003 s
% 1.23/0.49 % (836887)Peak memory usage: 12 MB
% 1.23/0.49 % (836887)Instructions burned: 7 (million)
% 1.23/0.49 % (836885)lrs+10_1_si=on:cs=on:random_seed=621356584:i=8:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.23/0.49 % (836888)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3727639474:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 1.23/0.49 % (836882)Instruction limit reached!
% 1.23/0.49 % (836882)------------------------------
% 1.23/0.49 % (836882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836882)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836882)Termination reason: Instruction limit
% 1.23/0.49 % (836882)Termination phase: Saturation
% 1.23/0.49 % (836882)Time elapsed: 0.026 s
% 1.23/0.49 % (836882)Peak memory usage: 12 MB
% 1.23/0.49 % (836882)Instructions burned: 29 (million)
% 1.23/0.49 % (836885)Instruction limit reached!
% 1.23/0.49 % (836885)------------------------------
% 1.23/0.49 % (836885)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836885)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836885)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836885)Termination reason: Instruction limit
% 1.23/0.49 % (836885)Termination phase: Saturation
% 1.23/0.49 % (836885)Time elapsed: 0.009 s
% 1.23/0.49 % (836885)Peak memory usage: 12 MB
% 1.23/0.49 % (836885)Instructions burned: 9 (million)
% 1.23/0.49 % (836888)Refutation not found, incomplete strategy
% 1.23/0.49 % (836888)------------------------------
% 1.23/0.49 % (836888)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836888)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836888)Termination reason: Refutation not found, incomplete strategy
% 1.23/0.49 % (836888)Time elapsed: 0.004 s
% 1.23/0.49 % (836888)Peak memory usage: 12 MB
% 1.23/0.49 % (836888)Instructions burned: 2 (million)
% 1.23/0.49 % (836888)------------------------------
% 1.23/0.49 % (836888)------------------------------
% 1.23/0.49 % (836891)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3459469513:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 1.23/0.49 % (836867) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-836856-836867"...
% 1.23/0.49 % (836867)...printing done.
% 1.23/0.49 % (836867)Refutation found. Thanks to Tanya!
% 1.23/0.49 % SZS status Theorem for theBenchmark
% 1.23/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 1.23/0.49 % (836867)------------------------------
% 1.23/0.49 % (836867)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.23/0.49 % (836867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.23/0.49 % (836867)CaDiCaL version: 2.1.3
% 1.23/0.49 % (836867)Termination reason: Refutation
% 1.23/0.49 % (836867)Time elapsed: 0.120 s
% 1.23/0.49 % (836867)Peak memory usage: 13 MB
% 1.23/0.49 % (836867)Instructions burned: 138 (million)
% 1.23/0.49 % (836856)Success in time 0.162 s
% 1.23/0.49 % Vampire exiting
%------------------------------------------------------------------------------