%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV227^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:39:10 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 102 ( 14 unt; 0 typ; 9 def)
% Number of atoms : 572 ( 172 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 437 ( 87 ~; 168 |; 20 &; 142 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 27 usr; 16 con; 0-4 aty)
% ( 0 !!; 11 ??; 0 @@+; 0 @@-)
% Number of variables : 55 ( 0 sgn 20 !; 3 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
y: a > $o ).
thf(func_def_1,type,
x: a > $o ).
thf(func_def_3,type,
vOR: $o > $o > $o ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_13,type,
sK0: a ).
thf(func_def_14,type,
sK1: a > $o ).
thf(func_def_16,type,
sK3: a ).
thf(func_def_17,type,
sK4: a ).
thf(func_def_18,type,
sK5: a ).
thf(func_def_19,type,
sK6: ( a > $o ) > a ).
thf(func_def_20,type,
sK7: ( a > $o ) > a ).
thf(f1,conjecture,
( ( ^ [X0: a] :
( ( y @ X0 )
| ( x @ X0 ) ) )
= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( X2 = y )
| ( X2 = x ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5200_pme) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a] :
( ( y @ X0 )
| ( x @ X0 ) ) )
!= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( X2 = y )
| ( X2 = x ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [X0: a] :
( ( y @ X0 )
| ( x @ X0 ) ) )
!= ( ^ [X1: a] :
? [X2: a > $o] :
( ( X2 @ X1 )
& ( ( X2 = y )
| ( X2 = x ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f16,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) )
@ sK0 )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ),
inference(negative_extensionality,[],[f6]) ).
thf(f17,plain,
( ( $true
= ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) )
@ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f18,plain,
( ( $false
= ( ^ [Y0: a] :
( ( x @ Y0 )
| ( y @ Y0 ) )
@ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f19,plain,
( ( $false
= ( ( x @ sK0 )
| ( y @ sK0 ) ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f18]) ).
thf(f20,plain,
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f19]) ).
thf(f21,plain,
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f19]) ).
thf(f22,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( ( ( x = X1 )
| ( y = X1 ) )
& ( X1 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(and_proxy_clausification,[],[f23]) ).
thf(f26,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( x = X1 ) ) ),
inference(or_proxy_clausification,[],[f24]) ).
thf(f27,plain,
! [X1: a > $o] :
( ( $false
= ( x @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( x != X1 ) ),
inference(equality_proxy_clausification,[],[f26]) ).
thf(f29,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f30,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( ( ( x = X1 )
| ( y = X1 ) )
& ( X1 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(and_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( y = X1 ) ) ),
inference(or_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( x = X1 ) ) ),
inference(or_proxy_clausification,[],[f31]) ).
thf(f34,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( x != X1 ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X1: a > $o] :
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( y != X1 ) ),
inference(equality_proxy_clausification,[],[f32]) ).
thf(f36,plain,
( ( $true
= ( ( x @ sK0 )
| ( y @ sK0 ) ) )
| ( $true
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f37,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) ) ) )
| ( $true
= ( x @ sK0 ) ) ),
inference(or_proxy_clausification,[],[f36]) ).
thf(f38,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( Y0 @ sK0 ) )
@ sK1 ) )
| ( $true
= ( x @ sK0 ) ) ),
inference(sigma_proxy_clausification,[],[f37]) ).
thf(f39,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ( ( x = sK1 )
| ( y = sK1 ) )
& ( sK1 @ sK0 ) ) )
| ( $true
= ( x @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( sK1 @ sK0 ) )
| ( $true
= ( x @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f39]) ).
thf(f41,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ( x = sK1 )
| ( y = sK1 ) ) )
| ( $true
= ( x @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f39]) ).
thf(f42,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( y = sK1 ) )
| ( $true
= ( x @ sK0 ) )
| ( $true
= ( x = sK1 ) ) ),
inference(or_proxy_clausification,[],[f41]) ).
thf(f43,plain,
( ( $true
= ( y @ sK0 ) )
| ( y = sK1 )
| ( $true
= ( x @ sK0 ) )
| ( $true
= ( x = sK1 ) ) ),
inference(equality_proxy_clausification,[],[f42]) ).
thf(f44,plain,
( ( $true
= ( y @ sK0 ) )
| ( y = sK1 )
| ( $true
= ( x @ sK0 ) )
| ( x = sK1 ) ),
inference(equality_proxy_clausification,[],[f43]) ).
thf(f46,definition,
( spl2_1
<=> ! [X1: a > $o] :
( ( $false
= ( X1 @ sK0 ) )
| ( x != X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f47,plain,
( ! [X1: a > $o] :
( ( x != X1 )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f49,definition,
( spl2_2
<=> ( $false
= ( x @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f50,plain,
( ( $false
!= ( x @ sK0 ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f51,plain,
( ( $false
= ( x @ sK0 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f52,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f27,f49,f46]) ).
thf(f54,definition,
( spl2_3
<=> ! [X1: a > $o] :
( ( $false
= ( X1 @ sK0 ) )
| ( y != X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f55,plain,
( ! [X1: a > $o] :
( ( y != X1 )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f58,definition,
( spl2_4
<=> ( $false
= ( y @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f59,plain,
( ( $false
!= ( y @ sK0 ) )
| spl2_4 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f60,plain,
( ( $false
= ( y @ sK0 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f61,plain,
( spl2_1
| spl2_4 ),
inference(avatar_split_clause,[],[f34,f58,f46]) ).
thf(f62,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f35,f58,f54]) ).
thf(f64,definition,
( spl2_5
<=> ( x = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f66,plain,
( ( x = sK1 )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f68,definition,
( spl2_6
<=> ( $true
= ( x @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
thf(f70,plain,
( ( $true
= ( x @ sK0 ) )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f72,definition,
( spl2_7
<=> ( y = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
thf(f74,plain,
( ( y = sK1 )
| ~ spl2_7 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f76,definition,
( spl2_8
<=> ( $true
= ( y @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
thf(f78,plain,
( ( $true
= ( y @ sK0 ) )
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f79,plain,
( spl2_5
| spl2_6
| spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f44,f76,f72,f68,f64]) ).
thf(f81,definition,
( spl2_9
<=> ( $true
= ( sK1 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
thf(f83,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f84,plain,
( spl2_6
| spl2_9
| spl2_8 ),
inference(avatar_split_clause,[],[f40,f76,f81,f68]) ).
thf(f85,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_6 ),
inference(forward_demodulation,[],[f70,f51]) ).
thf(f86,plain,
( $false
| ~ spl2_2
| ~ spl2_6 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f87,plain,
( ~ spl2_2
| ~ spl2_6 ),
inference(avatar_contradiction_clause,[],[f86]) ).
thf(f89,plain,
( ( $true = $false )
| ~ spl2_4
| ~ spl2_8 ),
inference(forward_demodulation,[],[f78,f60]) ).
thf(f90,plain,
( $false
| ~ spl2_4
| ~ spl2_8 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f91,plain,
( ~ spl2_4
| ~ spl2_8 ),
inference(avatar_contradiction_clause,[],[f90]) ).
thf(f93,plain,
( ! [X1: a] :
( ( y @ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_7 ),
inference(argument_congruence,[],[f74]) ).
thf(f94,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $true
= ( y @ X1 ) ) )
| ~ spl2_7 ),
inference(iff_proxy_clausification,[],[f93]) ).
thf(f101,plain,
( ( $true = $false )
| ( $true
= ( y @ sK0 ) )
| ~ spl2_7
| ~ spl2_9 ),
inference(constrained_superposition,[],[f94,f83]) ).
thf(f104,plain,
( ( $true
= ( y @ sK0 ) )
| ~ spl2_7
| ~ spl2_9 ),
inference(trivial_inequality_removal,[],[f101]) ).
thf(f109,plain,
( ( $true = $false )
| ~ spl2_4
| ~ spl2_7
| ~ spl2_9 ),
inference(forward_demodulation,[],[f104,f60]) ).
thf(f110,plain,
( $false
| ~ spl2_4
| ~ spl2_7
| ~ spl2_9 ),
inference(trivial_inequality_removal,[],[f109]) ).
thf(f111,plain,
( ~ spl2_4
| ~ spl2_7
| ~ spl2_9 ),
inference(avatar_contradiction_clause,[],[f110]) ).
thf(f113,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( x @ X1 ) )
| ~ spl2_5 ),
inference(argument_congruence,[],[f66]) ).
thf(f115,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $true
= ( x @ X1 ) ) )
| ~ spl2_5 ),
inference(iff_proxy_clausification,[],[f113]) ).
thf(f145,plain,
( ( $true = $false )
| ( $true
= ( x @ sK0 ) )
| ~ spl2_5
| ~ spl2_9 ),
inference(constrained_superposition,[],[f115,f83]) ).
thf(f152,plain,
( ( $true
= ( x @ sK0 ) )
| ~ spl2_5
| ~ spl2_9 ),
inference(trivial_inequality_removal,[],[f145]) ).
thf(f157,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_5
| ~ spl2_9 ),
inference(forward_demodulation,[],[f152,f51]) ).
thf(f158,plain,
( $false
| ~ spl2_2
| ~ spl2_5
| ~ spl2_9 ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f159,plain,
( ~ spl2_2
| ~ spl2_5
| ~ spl2_9 ),
inference(avatar_contradiction_clause,[],[f158]) ).
thf(f213,plain,
( ( $false
= ( x @ sK0 ) )
| ~ spl2_1 ),
inference(equality_resolution,[],[f47]) ).
thf(f219,plain,
( ( $false
= ( y @ sK0 ) )
| ~ spl2_3 ),
inference(equality_resolution,[],[f55]) ).
thf(f222,plain,
( $false
| ~ spl2_3
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f219,f59]) ).
thf(f223,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f222]) ).
thf(f226,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f213,f50]) ).
thf(f227,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f226]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f52]) ).
cnf(s3,plain,
( spl2_1
| spl2_4 ),
inference(sat_conversion,[],[f61]) ).
cnf(s4,plain,
( spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f62]) ).
cnf(s5,plain,
( spl2_5
| spl2_6
| spl2_7
| spl2_8 ),
inference(sat_conversion,[],[f79]) ).
cnf(s6,plain,
( spl2_6
| spl2_8
| spl2_9 ),
inference(sat_conversion,[],[f84]) ).
cnf(s7,plain,
( ~ spl2_2
| ~ spl2_6 ),
inference(sat_conversion,[],[f87]) ).
cnf(s8,plain,
( ~ spl2_4
| ~ spl2_8 ),
inference(sat_conversion,[],[f91]) ).
cnf(s10,plain,
( ~ spl2_4
| ~ spl2_7
| ~ spl2_9 ),
inference(sat_conversion,[],[f111]) ).
cnf(s15,plain,
( ~ spl2_2
| ~ spl2_5
| ~ spl2_9 ),
inference(sat_conversion,[],[f159]) ).
cnf(s22,plain,
( ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f223]) ).
cnf(s25,plain,
( ~ spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f227]) ).
cnf(s26,plain,
spl2_1,
inference(rat,[],[s5,s10,s15,s6,s7,s8,s1,s3]) ).
cnf(s27,plain,
spl2_2,
inference(rat,[],[s25,s26]) ).
cnf(s28,plain,
~ spl2_6,
inference(rat,[],[s7,s27]) ).
cnf(s29,plain,
~ spl2_4,
inference(rat,[],[s5,s10,s15,s6,s8,s28,s27]) ).
cnf(s30,plain,
~ spl2_3,
inference(rat,[],[s22,s29]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s4,s29,s30]) ).
thf(f228,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV227^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n008.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 15:23:54 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28 % (3295577)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3295582)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1087970032_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (3295583)% WARNING: option uhcvi not known.
% 0.20/0.28 % (3295583)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1808269829:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (3295587)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2575522722:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (3295584)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3056642881:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (3295585)dis+10_1_sil=32000:sp=arity:random_seed=1524024363:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (3295586)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1933679105:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (3295583)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3295588)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4148252278:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (3295583)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % (3295586)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3295590)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1141757439:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (3295587) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3295577-3295587"...
% 0.20/0.28 % (3295585) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3295577-3295585"...
% 0.20/0.28 % (3295583) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3295577-3295583"...
% 0.20/0.28 % (3295584) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3295577-3295584"...
% 0.20/0.28 % (3295587)...printing done.
% 0.20/0.28 % (3295586) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3295577-3295586"...
% 0.20/0.28 % (3295585)...printing done.
% 0.20/0.28 % (3295583)...printing done.
% 0.20/0.28 % (3295584)...printing done.
% 0.20/0.28 % (3295587)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (3295587)------------------------------
% 0.20/0.28 % (3295587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3295587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3295587)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3295587)Termination reason: Refutation
% 0.20/0.28 % (3295587)Time elapsed: 0.007 s
% 0.20/0.28 % (3295587)Peak memory usage: 12 MB
% 0.20/0.28 % (3295587)Instructions burned: 9 (million)
% 0.20/0.28 % (3295577)Success in time 0.045 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------