%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU827^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:31:45 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 10
% Syntax : Number of formulae : 91 ( 33 unt; 0 typ; 6 def)
% Number of atoms : 668 ( 108 equ; 0 cnn)
% Maximal formula atoms : 13 ( 7 avg)
% Number of connectives : 551 ( 43 ~; 133 |; 37 &; 320 @)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 58 ( 58 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 24 usr; 10 con; 0-4 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 74 ( 0 sgn 2 !; 0 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
leibeq: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_2,type,
u: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
n: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
a: $i > $o ).
thf(func_def_5,type,
b: $i > $o ).
thf(func_def_6,type,
c: $i > $o ).
thf(func_def_9,type,
vOR: $o > $o > $o ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
vAND: $o > $o > $o ).
thf(func_def_15,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_16,type,
vIMP: $o > $o > $o ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(func_def_18,type,
sK0: ( $i > $o ) > $o ).
thf(f1,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq) ).
thf(f2,axiom,
( u
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u) ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f4,conjecture,
leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f5,negated_conjecture,
~ ( leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) )
!= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( u
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( u
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= n ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( n
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[],[f1]) ).
thf(f13,plain,
( leibeq
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ( leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) )
!= $true ),
inference(flattening,[],[f7]) ).
thf(f15,plain,
( u
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
( leibeq
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
( ( leibeq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f18,plain,
( n
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f21,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ a
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ b
@ c ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ a
@ b )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ a
@ c ) ) )
!= $true ),
inference(definition_unfolding,[],[f17,f16,f15,f18,f18,f15,f15]) ).
thf(f22,plain,
( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( Y0
@ ^ [Y1: $i] :
( ( ( b @ Y1 )
& ( c @ Y1 ) )
| ( a @ Y1 ) ) )
=> ( Y0
@ ^ [Y1: $i] :
( ( ( b @ Y1 )
| ( a @ Y1 ) )
& ( ( c @ Y1 )
| ( a @ Y1 ) ) ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
( $false
= ( ^ [Y0: ( $i > $o ) > $o] :
( ( Y0
@ ^ [Y1: $i] :
( ( ( b @ Y1 )
& ( c @ Y1 ) )
| ( a @ Y1 ) ) )
=> ( Y0
@ ^ [Y1: $i] :
( ( ( b @ Y1 )
| ( a @ Y1 ) )
& ( ( c @ Y1 )
| ( a @ Y1 ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( $false
= ( ( sK0
@ ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) ) )
=> ( sK0
@ ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
( $false
= ( sK0
@ ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f24]) ).
thf(f26,plain,
( $true
= ( sK0
@ ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) ) ) ),
inference(imp_proxy_clausification,[],[f24]) ).
thf(f28,plain,
( ( ( ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) ) ) )
| ( $false = $true ) ),
inference(constrained_superposition,[],[f26,f25]) ).
thf(f29,plain,
( ( ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f31,plain,
( ( ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) )
@ sK1 )
!= ( ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) )
@ sK1 ) ),
inference(negative_extensionality,[],[f29]) ).
thf(f32,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) )
@ sK1 ) )
| ( ( ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) )
@ sK1 )
= $true ) ),
inference(xor_proxy_clausification,[],[f31]) ).
thf(f33,plain,
( ( ( ^ [Y0: $i] :
( ( ( b @ Y0 )
| ( a @ Y0 ) )
& ( ( c @ Y0 )
| ( a @ Y0 ) ) )
@ sK1 )
= $false )
| ( $false
= ( ^ [Y0: $i] :
( ( ( b @ Y0 )
& ( c @ Y0 ) )
| ( a @ Y0 ) )
@ sK1 ) ) ),
inference(xor_proxy_clausification,[],[f31]) ).
thf(f34,plain,
( ( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
| ( a @ sK1 ) )
= $false )
| ( ( ( ( b @ sK1 )
| ( a @ sK1 ) )
& ( ( c @ sK1 )
| ( a @ sK1 ) ) )
= $false ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,plain,
( ( ( a @ sK1 )
= $false )
| ( ( ( ( b @ sK1 )
| ( a @ sK1 ) )
& ( ( c @ sK1 )
| ( a @ sK1 ) ) )
= $false ) ),
inference(or_proxy_clausification,[],[f34]) ).
thf(f36,plain,
( ( ( ( ( b @ sK1 )
| ( a @ sK1 ) )
& ( ( c @ sK1 )
| ( a @ sK1 ) ) )
= $false )
| ( ( ( b @ sK1 )
& ( c @ sK1 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f34]) ).
thf(f37,plain,
( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
= $false )
| ( $false
= ( ( b @ sK1 )
| ( a @ sK1 ) ) )
| ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $false ) ),
inference(and_proxy_clausification,[],[f36]) ).
thf(f38,plain,
( ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $false )
| ( ( b @ sK1 )
= $false )
| ( ( c @ sK1 )
= $false )
| ( $false
= ( ( b @ sK1 )
| ( a @ sK1 ) ) ) ),
inference(and_proxy_clausification,[],[f37]) ).
thf(f40,plain,
( ( ( b @ sK1 )
= $false )
| ( ( c @ sK1 )
= $false )
| ( ( c @ sK1 )
= $false )
| ( $false
= ( ( b @ sK1 )
| ( a @ sK1 ) ) ) ),
inference(or_proxy_clausification,[],[f38]) ).
thf(f42,plain,
( ( ( b @ sK1 )
= $false )
| ( ( c @ sK1 )
= $false )
| ( ( b @ sK1 )
= $false )
| ( ( c @ sK1 )
= $false ) ),
inference(or_proxy_clausification,[],[f40]) ).
thf(f43,plain,
( ( ( c @ sK1 )
= $false )
| ( ( b @ sK1 )
= $false ) ),
inference(duplicate_literal_removal,[],[f42]) ).
thf(f49,plain,
( ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $false )
| ( $false
= ( ( b @ sK1 )
| ( a @ sK1 ) ) )
| ( ( a @ sK1 )
= $false ) ),
inference(and_proxy_clausification,[],[f35]) ).
thf(f50,plain,
( ( $false
= ( ( b @ sK1 )
| ( a @ sK1 ) ) )
| ( ( a @ sK1 )
= $false )
| ( ( a @ sK1 )
= $false ) ),
inference(or_proxy_clausification,[],[f49]) ).
thf(f55,plain,
( ( ( a @ sK1 )
= $false )
| ( ( a @ sK1 )
= $false )
| ( ( a @ sK1 )
= $false ) ),
inference(or_proxy_clausification,[],[f50]) ).
thf(f58,plain,
( ( a @ sK1 )
= $false ),
inference(duplicate_literal_removal,[],[f55]) ).
thf(f59,plain,
( ( ( ( ( b @ sK1 )
| ( a @ sK1 ) )
& ( ( c @ sK1 )
| ( a @ sK1 ) ) )
= $true )
| ( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
| ( a @ sK1 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f60,plain,
( ( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
| ( a @ sK1 ) )
= $true )
| ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f59]) ).
thf(f61,plain,
( ( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
| ( a @ sK1 ) )
= $true )
| ( ( ( b @ sK1 )
| ( a @ sK1 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f59]) ).
thf(f62,plain,
( ( ( ( b @ sK1 )
| ( a @ sK1 ) )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( ( b @ sK1 )
& ( c @ sK1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f61]) ).
thf(f63,plain,
( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( b @ sK1 )
= $true ) ),
inference(or_proxy_clausification,[],[f62]) ).
thf(f65,plain,
( ( ( b @ sK1 )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( b @ sK1 )
= $true ) ),
inference(and_proxy_clausification,[],[f63]) ).
thf(f66,plain,
( ( ( b @ sK1 )
= $true )
| ( ( a @ sK1 )
= $true ) ),
inference(duplicate_literal_removal,[],[f65]) ).
thf(f68,plain,
( ( ( ( b @ sK1 )
& ( c @ sK1 ) )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f60]) ).
thf(f69,plain,
( ( ( ( c @ sK1 )
| ( a @ sK1 ) )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( c @ sK1 )
= $true ) ),
inference(and_proxy_clausification,[],[f68]) ).
thf(f73,plain,
( ( ( a @ sK1 )
= $true )
| ( ( a @ sK1 )
= $true )
| ( ( c @ sK1 )
= $true )
| ( ( c @ sK1 )
= $true ) ),
inference(or_proxy_clausification,[],[f69]) ).
thf(f74,plain,
( ( ( a @ sK1 )
= $true )
| ( ( c @ sK1 )
= $true ) ),
inference(duplicate_literal_removal,[],[f73]) ).
thf(f76,definition,
( spl2_1
<=> ( ( c @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f78,plain,
( ( ( c @ sK1 )
= $false )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f80,definition,
( spl2_2
<=> ( ( b @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f82,plain,
( ( ( b @ sK1 )
= $false )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f83,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f43,f80,f76]) ).
thf(f85,definition,
( spl2_3
<=> ( ( a @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f87,plain,
( ( ( a @ sK1 )
= $false )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f94,plain,
spl2_3,
inference(avatar_split_clause,[],[f58,f85]) ).
thf(f96,definition,
( spl2_4
<=> ( ( a @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f98,plain,
( ( ( a @ sK1 )
= $true )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f100,definition,
( spl2_5
<=> ( ( b @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f102,plain,
( ( ( b @ sK1 )
= $true )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f100]) ).
thf(f103,plain,
( spl2_4
| spl2_5 ),
inference(avatar_split_clause,[],[f66,f100,f96]) ).
thf(f105,definition,
( spl2_6
<=> ( ( c @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
thf(f107,plain,
( ( ( c @ sK1 )
= $true )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f105]) ).
thf(f110,plain,
( spl2_6
| spl2_4 ),
inference(avatar_split_clause,[],[f74,f96,f105]) ).
thf(f111,plain,
( ( $false = $true )
| ~ spl2_3
| ~ spl2_4 ),
inference(constrained_superposition,[],[f87,f98]) ).
thf(f115,plain,
( $false
| ~ spl2_3
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f111]) ).
thf(f116,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f115]) ).
thf(f118,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_5 ),
inference(forward_demodulation,[],[f102,f82]) ).
thf(f119,plain,
( $false
| ~ spl2_2
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f120,plain,
( ~ spl2_2
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f119]) ).
thf(f123,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_6 ),
inference(constrained_superposition,[],[f107,f78]) ).
thf(f126,plain,
( $false
| ~ spl2_1
| ~ spl2_6 ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f127,plain,
( ~ spl2_1
| ~ spl2_6 ),
inference(avatar_contradiction_clause,[],[f126]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f83]) ).
cnf(s8,plain,
spl2_3,
inference(sat_conversion,[],[f94]) ).
cnf(s9,plain,
( spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f103]) ).
cnf(s12,plain,
( spl2_4
| spl2_6 ),
inference(sat_conversion,[],[f110]) ).
cnf(s14,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f116]) ).
cnf(s15,plain,
( ~ spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f120]) ).
cnf(s17,plain,
( ~ spl2_1
| ~ spl2_6 ),
inference(sat_conversion,[],[f127]) ).
cnf(s18,plain,
~ spl2_4,
inference(rat,[],[s14,s8]) ).
cnf(s19,plain,
spl2_6,
inference(rat,[],[s12,s18]) ).
cnf(s20,plain,
spl2_5,
inference(rat,[],[s9,s18]) ).
cnf(s21,plain,
~ spl2_1,
inference(rat,[],[s17,s19]) ).
cnf(s22,plain,
~ spl2_2,
inference(rat,[],[s15,s20]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s22,s21]) ).
thf(f128,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU827^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n004.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:35:22 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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
% 0.22/0.29 % (1373809)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (1373818)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=160028128:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29 % (1373820)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29 % (1373820)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
% 0.22/0.29 % (1373815)lrs+10_16_si=on:nwc=1.5:random_seed=3917482432:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.29 % (1373816)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1638794914:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.29 % (1373814)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3636167739:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29 % (1373817)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=2129747643: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.22/0.29 % (1373819)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=755020232:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.29 % (1373820)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=2881629200:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.29 % (1373818)Instruction limit reached!
% 0.22/0.29 % (1373818)------------------------------
% 0.22/0.29 % (1373818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1373818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1373818)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1373818)Termination reason: Instruction limit
% 0.22/0.29 % (1373818)Termination phase: Saturation
% 0.22/0.29 % (1373818)Time elapsed: 0.007 s
% 0.22/0.29 % (1373818)Peak memory usage: 11 MB
% 0.22/0.29 % (1373818)Instructions burned: 26 (million)
% 0.22/0.29 % (1373816)Refutation not found, incomplete strategy
% 0.22/0.29 % (1373816)------------------------------
% 0.22/0.29 % (1373816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1373816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1373816)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1373816)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1373816)Time elapsed: 0.001 s
% 0.22/0.29 % (1373816)Peak memory usage: 12 MB
% 0.22/0.29 % (1373816)Instructions burned: 1 (million)
% 0.22/0.29 % (1373814)Refutation not found, incomplete strategy
% 0.22/0.29 % (1373814)------------------------------
% 0.22/0.29 % (1373814)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1373814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1373814)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1373814)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (1373814)Time elapsed: 0.002 s
% 0.22/0.30 % (1373814)Peak memory usage: 12 MB
% 0.22/0.30 % (1373814)Instructions burned: 2 (million)
% 0.22/0.30 % (1373816)------------------------------
% 0.22/0.30 % (1373816)------------------------------
% 0.22/0.30 % (1373814)------------------------------
% 0.22/0.30 % (1373814)------------------------------
% 0.22/0.30 % (1373815) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1373809-1373815"...
% 0.22/0.30 % (1373819) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1373809-1373819"...
% 0.22/0.30 % (1373820)Refutation not found, incomplete strategy
% 0.22/0.30 % (1373820)------------------------------
% 0.22/0.30 % (1373820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1373820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1373820)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1373820)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (1373820)Time elapsed: 0.003 s
% 0.22/0.30 % (1373820)Peak memory usage: 12 MB
% 0.22/0.30 % (1373820)Instructions burned: 3 (million)
% 0.22/0.30 % (1373820)------------------------------
% 0.22/0.30 % (1373820)------------------------------
% 0.22/0.30 % (1373817)Refutation not found, incomplete strategy
% 0.22/0.30 % (1373817)------------------------------
% 0.22/0.30 % (1373817)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1373817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1373817)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1373817)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (1373817)Time elapsed: 0.005 s
% 0.22/0.30 % (1373817)Peak memory usage: 12 MB
% 0.22/0.30 % (1373817)Instructions burned: 6 (million)
% 0.22/0.30 % (1373817)------------------------------
% 0.22/0.30 % (1373817)------------------------------
% 0.22/0.30 % (1373819)...printing done.
% 0.22/0.30 % (1373815)...printing done.
% 0.22/0.30 % (1373815)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.30 % (1373815)------------------------------
% 0.22/0.30 % (1373815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1373815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1373815)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1373815)Termination reason: Refutation
% 0.22/0.30 % (1373815)Time elapsed: 0.006 s
% 0.22/0.30 % (1373815)Peak memory usage: 13 MB
% 0.22/0.30 % (1373815)Instructions burned: 8 (million)
% 0.22/0.30 % (1373809)Success in time 0.047 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------