%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO169^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 69 ( 17 unt; 0 typ; 5 def)
% Number of atoms : 621 ( 129 equ; 0 cnn)
% Maximal formula atoms : 18 ( 9 avg)
% Number of connectives : 640 ( 92 ~; 97 |; 31 &; 400 @)
% ( 8 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 15 ( 12 usr; 11 con; 0-3 aty)
% Number of variables : 144 ( 0 sgn 144 !; 0 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
cP: $i > $i > $i > $o ).
thf(func_def_4,type,
cPx: $i > $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i,X4: $i,X5: $i,X2: $i,X3: $i,X1: $i] :
( ( ( cP @ X0 @ X1 @ X3 )
& ( cP @ X1 @ X2 @ X4 ) )
=> ( ( cP @ X3 @ X2 @ X5 )
<=> ( cPx @ X4 @ 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/sandbox2/benchmark/theBenchmark.p',cGRP_COMM) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i,X4: $i,X5: $i,X2: $i,X3: $i,X1: $i] :
( ( ( cP @ X0 @ X1 @ X3 )
& ( cP @ X1 @ X2 @ X4 ) )
=> ( ( cP @ X3 @ X2 @ X5 )
<=> ( cPx @ X4 @ 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 @ X0 @ X5 @ X4 )
& ( cP @ X5 @ X3 @ X1 ) )
=> ( ( cP @ X4 @ X3 @ X2 )
<=> ( cPx @ X1 @ X2 ) ) )
& ! [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,
~ ( ( ! [X7: $i] :
( ( cP @ X7 @ e @ X7 )
= $true )
& ! [X6: $i] :
( ( cP @ e @ X6 @ X6 )
= $true )
& ! [X5: $i,X2: $i,X3: $i,X0: $i,X4: $i,X1: $i] :
( ( ( $true
= ( cP @ X0 @ X5 @ X4 ) )
& ( ( cP @ X5 @ X3 @ X1 )
= $true ) )
=> ( ( cPx @ X1 @ X2 )
= ( cP @ X4 @ X3 @ X2 ) ) )
& ! [X8: $i] :
( ( cP @ X8 @ X8 @ e )
= $true ) )
=> ( ( ( 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 )
& ! [X7: $i] :
( ( cP @ X7 @ e @ X7 )
= $true )
& ! [X6: $i] :
( ( cP @ e @ X6 @ X6 )
= $true )
& ! [X5: $i,X2: $i,X3: $i,X0: $i,X4: $i,X1: $i] :
( ( ( cPx @ X1 @ X2 )
= ( cP @ X4 @ X3 @ X2 ) )
| ( $true
!= ( cP @ X0 @ X5 @ X4 ) )
| ( ( cP @ X5 @ X3 @ X1 )
!= $true ) )
& ! [X8: $i] :
( ( cP @ X8 @ X8 @ e )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ! [X3: $i,X2: $i,X1: $i,X4: $i,X5: $i,X0: $i] :
( ( $true
!= ( cP @ X0 @ X5 @ X4 ) )
| ( ( cP @ X5 @ X3 @ X1 )
!= $true )
| ( ( cPx @ X1 @ X2 )
= ( cP @ X4 @ X3 @ X2 ) ) )
& ! [X7: $i] :
( ( cP @ X7 @ e @ X7 )
= $true )
& ! [X6: $i] :
( ( cP @ e @ X6 @ X6 )
= $true )
& ! [X8: $i] :
( ( cP @ X8 @ X8 @ e )
= $true )
& ( ( cP @ b @ a @ ab )
!= $true )
& ( ( cP @ a @ b @ ab )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ( ( cP @ X5 @ X4 @ X3 )
!= $true )
| ( ( cP @ X4 @ X0 @ X2 )
!= $true )
| ( ( cPx @ X2 @ X1 )
= ( cP @ X3 @ X0 @ X1 ) ) )
& ! [X6: $i] :
( ( cP @ X6 @ e @ X6 )
= $true )
& ! [X7: $i] :
( ( cP @ e @ X7 @ X7 )
= $true )
& ! [X8: $i] :
( ( cP @ X8 @ X8 @ e )
= $true )
& ( ( cP @ b @ a @ ab )
!= $true )
& ( ( cP @ a @ b @ ab )
= $true ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( cP @ a @ b @ ab )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( cP @ b @ a @ ab )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X8: $i] :
( ( cP @ X8 @ X8 @ e )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X7: $i] :
( ( cP @ e @ X7 @ X7 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
! [X6: $i] :
( ( cP @ X6 @ e @ X6 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i,X4: $i,X5: $i] :
( ( ( cPx @ X2 @ X1 )
= ( cP @ X3 @ X0 @ X1 ) )
| ( ( cP @ X4 @ X0 @ X2 )
!= $true )
| ( ( cP @ X5 @ X4 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i,X4: $i,X5: $i] :
( ( $false
= ( cP @ X3 @ X0 @ X1 ) )
| ( ( cP @ X5 @ X4 @ X3 )
!= $true )
| ( ( cP @ X4 @ X0 @ X2 )
!= $true )
| ( ( cPx @ X2 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f13]) ).
thf(f16,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i,X4: $i,X5: $i] :
( ( ( cP @ X3 @ X0 @ X1 )
= $true )
| ( ( cPx @ X2 @ X1 )
= $false )
| ( ( cP @ X4 @ X0 @ X2 )
!= $true )
| ( ( cP @ X5 @ X4 @ X3 )
!= $true ) ),
inference(iff_proxy_clausification,[],[f13]) ).
thf(f18,definition,
( spl0_1
<=> ( ( cP @ a @ b @ ab )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f20,plain,
( ( ( cP @ a @ b @ ab )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f21,plain,
spl0_1,
inference(avatar_split_clause,[],[f8,f18]) ).
thf(f23,definition,
( spl0_2
<=> ( ( cP @ b @ a @ ab )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f25,plain,
( ( ( cP @ b @ a @ ab )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f26,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f9,f23]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( cP @ X2 @ X0 @ X3 )
!= $true )
| ( ( cP @ X1 @ X2 @ e )
!= $true )
| ( $false = $true )
| ( ( cPx @ X3 @ X0 )
= $true ) ),
inference(superposition,[],[f15,f11]) ).
thf(f33,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X0 @ X1 @ a )
!= $true )
| ( ( cPx @ X2 @ ab )
= $true )
| ( ( cP @ X1 @ b @ X2 )
!= $true )
| ( $false = $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f20,f15]) ).
thf(f35,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( cP @ X2 @ X0 @ X3 )
!= $true )
| ( ( cP @ X1 @ X2 @ e )
!= $true )
| ( ( cPx @ X3 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f37,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X1 @ b @ X2 )
!= $true )
| ( ( cPx @ X2 @ ab )
= $true )
| ( ( cP @ X0 @ X1 @ a )
!= $true ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f46,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true != $true )
| ( ( cP @ X2 @ X1 @ b )
!= $true )
| ( ( cP @ X1 @ a @ X0 )
!= $true )
| ( ( cPx @ X0 @ ab )
= $false ) )
| spl0_2 ),
inference(superposition,[],[f25,f16]) ).
thf(f47,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X2 @ X1 @ b )
!= $true )
| ( ( cPx @ X0 @ ab )
= $false )
| ( ( cP @ X1 @ a @ X0 )
!= $true ) )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f50,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( cP @ X1 @ X0 @ e ) )
| ( $true != $true )
| ( $true
= ( cPx @ e @ X0 ) ) ),
inference(superposition,[],[f35,f10]) ).
thf(f57,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( cP @ X1 @ X0 @ e ) )
| ( $true
= ( cPx @ e @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f113,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i,X4: $i,X5: $i] :
( ( ( cPx @ X1 @ ab )
= $true )
| ( $true != $true )
| ( ( cP @ X5 @ X4 @ X0 )
!= $true )
| ( $false
= ( cPx @ X3 @ X1 ) )
| ( ( cP @ X2 @ X0 @ a )
!= $true )
| ( ( cP @ X4 @ b @ X3 )
!= $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f37,f16]) ).
thf(f118,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i,X4: $i,X5: $i] :
( ( ( cP @ X5 @ X4 @ X0 )
!= $true )
| ( ( cPx @ X1 @ ab )
= $true )
| ( $false
= ( cPx @ X3 @ X1 ) )
| ( ( cP @ X2 @ X0 @ a )
!= $true )
| ( ( cP @ X4 @ b @ X3 )
!= $true ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f124,definition,
( spl0_10
<=> ! [X0: $i] :
( ( cP @ X0 @ e @ a )
!= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
thf(f125,plain,
( ! [X0: $i] :
( ( cP @ X0 @ e @ a )
!= $true )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f138,plain,
( ! [X0: $i] :
( ( ( cPx @ X0 @ ab )
= $false )
| ( $true != $true )
| ( ( cP @ e @ a @ X0 )
!= $true ) )
| spl0_2 ),
inference(superposition,[],[f47,f12]) ).
thf(f141,plain,
( ! [X0: $i] :
( ( ( cP @ e @ a @ X0 )
!= $true )
| ( ( cPx @ X0 @ ab )
= $false ) )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f162,plain,
! [X0: $i] :
( ( $true != $true )
| ( $true
= ( cPx @ e @ X0 ) ) ),
inference(superposition,[],[f57,f10]) ).
thf(f168,plain,
! [X0: $i] :
( $true
= ( cPx @ e @ X0 ) ),
inference(trivial_inequality_removal,[],[f162]) ).
thf(f196,plain,
( ( $false
= ( cPx @ a @ ab ) )
| ( $true != $true )
| spl0_2 ),
inference(superposition,[],[f141,f11]) ).
thf(f199,plain,
( ( $false
= ( cPx @ a @ ab ) )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f196]) ).
thf(f202,definition,
( spl0_13
<=> ( $false
= ( cPx @ a @ ab ) ) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
thf(f204,plain,
( ( $false
= ( cPx @ a @ ab ) )
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f202]) ).
thf(f205,plain,
( spl0_13
| spl0_2 ),
inference(avatar_split_clause,[],[f199,f23,f202]) ).
thf(f271,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( cPx @ X1 @ ab )
= $true )
| ( $true
!= ( cP @ X3 @ e @ a ) )
| ( ( cP @ X0 @ b @ X2 )
!= $true )
| ( $true != $true )
| ( ( cPx @ X2 @ X1 )
= $false ) )
| ~ spl0_1 ),
inference(superposition,[],[f118,f10]) ).
thf(f280,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $true
!= ( cP @ X3 @ e @ a ) )
| ( ( cP @ X0 @ b @ X2 )
!= $true )
| ( ( cPx @ X1 @ ab )
= $true )
| ( ( cPx @ X2 @ X1 )
= $false ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f271]) ).
thf(f290,definition,
( spl0_20
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X0 @ b @ X2 )
!= $true )
| ( ( cPx @ X2 @ X1 )
= $false )
| ( ( cPx @ X1 @ ab )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
thf(f291,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( cP @ X0 @ b @ X2 )
!= $true )
| ( ( cPx @ X2 @ X1 )
= $false )
| ( ( cPx @ X1 @ ab )
= $true ) )
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f290]) ).
thf(f292,plain,
( spl0_10
| spl0_20
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f280,f18,f290,f124]) ).
thf(f327,plain,
( ( $true != $true )
| ~ spl0_10 ),
inference(superposition,[],[f125,f12]) ).
thf(f330,plain,
( $false
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f327]) ).
thf(f331,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f330]) ).
thf(f376,plain,
( ! [X0: $i] :
( ( ( cPx @ X0 @ ab )
= $true )
| ( $true != $true )
| ( $false
= ( cPx @ e @ X0 ) ) )
| ~ spl0_20 ),
inference(superposition,[],[f291,f10]) ).
thf(f382,plain,
( ! [X0: $i] :
( ( ( cPx @ X0 @ ab )
= $true )
| ( $false
= ( cPx @ e @ X0 ) ) )
| ~ spl0_20 ),
inference(trivial_inequality_removal,[],[f376]) ).
thf(f388,plain,
( ! [X0: $i] :
( ( ( cPx @ X0 @ ab )
= $true )
| ( $false = $true ) )
| ~ spl0_20 ),
inference(forward_demodulation,[],[f382,f168]) ).
thf(f389,plain,
( ! [X0: $i] :
( ( cPx @ X0 @ ab )
= $true )
| ~ spl0_20 ),
inference(trivial_inequality_removal,[],[f388]) ).
thf(f399,plain,
( ( $false = $true )
| ~ spl0_13
| ~ spl0_20 ),
inference(superposition,[],[f389,f204]) ).
thf(f403,plain,
( $false
| ~ spl0_13
| ~ spl0_20 ),
inference(trivial_inequality_removal,[],[f399]) ).
thf(f404,plain,
( ~ spl0_13
| ~ spl0_20 ),
inference(avatar_contradiction_clause,[],[f403]) ).
cnf(s1,plain,
spl0_1,
inference(sat_conversion,[],[f21]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f26]) ).
cnf(s9,plain,
( spl0_2
| spl0_13 ),
inference(sat_conversion,[],[f205]) ).
cnf(s13,plain,
( ~ spl0_1
| spl0_10
| spl0_20 ),
inference(sat_conversion,[],[f292]) ).
cnf(s17,plain,
~ spl0_10,
inference(sat_conversion,[],[f331]) ).
cnf(s25,plain,
( ~ spl0_13
| ~ spl0_20 ),
inference(sat_conversion,[],[f404]) ).
cnf(s27,plain,
( ~ spl0_1
| spl0_20 ),
inference(rat,[],[s13,s17]) ).
cnf(s31,plain,
spl0_13,
inference(rat,[],[s9,s2]) ).
cnf(s32,plain,
~ spl0_20,
inference(rat,[],[s25,s31]) ).
cnf(s34,plain,
~ spl0_1,
inference(rat,[],[s27,s32]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s1,s34]) ).
thf(f405,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO169^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:31:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.29 % (560802)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29 % (560810)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=2950680924: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)
% 0.20/0.29 % (560807)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=696227520:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29 % (560809)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=822590908:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.29 % (560808)lrs+10_16_si=on:nwc=1.5:random_seed=2094949409:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29 % (560809)Instruction limit reached!
% 0.20/0.29 % (560809)------------------------------
% 0.20/0.29 % (560809)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (560809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (560809)CaDiCaL version: 2.1.3
% 0.20/0.29 % (560809)Termination reason: Instruction limit
% 0.20/0.29 % (560809)Termination phase: Saturation
% 0.20/0.29 % (560809)Time elapsed: 0.003 s
% 0.20/0.29 % (560809)Peak memory usage: 12 MB
% 0.20/0.29 % (560809)Instructions burned: 3 (million)
% 0.20/0.29 % (560810) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-560802-560810"...
% 0.20/0.29 % (560810)...printing done.
% 0.20/0.29 % (560810)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (560810)------------------------------
% 0.20/0.30 % (560810)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (560810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (560810)CaDiCaL version: 2.1.3
% 0.20/0.30 % (560810)Termination reason: Refutation
% 0.20/0.30 % (560810)Time elapsed: 0.012 s
% 0.20/0.30 % (560810)Peak memory usage: 13 MB
% 0.20/0.30 % (560810)Instructions burned: 37 (million)
% 0.20/0.30 % (560802)Success in time 0.045 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------