%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU845^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 : 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:47 AM UTC 2026
% Result : Theorem 0.23s 0.29s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 12 unt; 0 typ; 3 def)
% Number of atoms : 224 ( 64 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 248 ( 62 ~; 40 |; 33 &; 102 @)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 31 ( 0 sgn 16 !; 4 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
vNOT: $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( X0
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ~ ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM12_pme) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( X0
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ~ ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) )
=> ( X1
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ~ ( ( X0 @ X3 )
& ~ ( X1 @ X3 ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
=> ( ( X0 @ X2 )
= $true ) )
=> ( ( ^ [Y0: a] :
( ~ ( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) )
& ( X0 @ Y0 ) ) )
= X1 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X1: a > $o,X0: a > $o] :
( ( ( ^ [Y0: a] :
( ~ ( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) )
& ( X0 @ Y0 ) ) )
!= X1 )
& ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ~ ( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) )
& ( X1 @ Y0 ) ) )
!= X0 )
& ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
| ( ( X0 @ X2 )
!= $true ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ~ ( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK1 @ Y0 ) ) ) )
& ! [X2: a] :
( ( $true
= ( sK1 @ X2 ) )
| ( ( sK0 @ X2 )
!= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
! [X2: a] :
( ( ( sK0 @ X2 )
!= $true )
| ( $true
= ( sK1 @ X2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( sK0
!= ( ^ [Y0: a] :
( ~ ( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
( ( ^ [Y0: a] :
( ~ ( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK1 @ Y0 ) )
@ sK2 )
!= ( sK0 @ sK2 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f13,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( ^ [Y0: a] :
( ~ ( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f12]) ).
thf(f14,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( ^ [Y0: a] :
( ~ ( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f12]) ).
thf(f15,plain,
( ( ( ~ ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) )
& ( sK1 @ sK2 ) )
= $false )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(beta-eta_normalization,[],[f14]) ).
thf(f16,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( ( ~ ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
= $false )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(and_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false )
| ( $true
= ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ),
inference(not_proxy_clausification,[],[f16]) ).
thf(f19,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false )
| ( ( ~ ( sK0 @ sK2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f17]) ).
thf(f20,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(not_proxy_clausification,[],[f19]) ).
thf(f21,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f22,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( ~ ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) )
& ( sK1 @ sK2 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f13]) ).
thf(f23,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $true ) ),
inference(and_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( ~ ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
= $true ) ),
inference(and_proxy_clausification,[],[f22]) ).
thf(f25,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $false
= ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ),
inference(not_proxy_clausification,[],[f24]) ).
thf(f26,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( ~ ( sK0 @ sK2 ) )
= $false )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(and_proxy_clausification,[],[f25]) ).
thf(f27,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f26]) ).
thf(f28,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(duplicate_literal_removal,[],[f27]) ).
thf(f30,definition,
( spl3_1
<=> ( $false
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f31,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f33,definition,
( spl3_2
<=> ( ( sK1 @ sK2 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f34,plain,
( ( ( sK1 @ sK2 )
= $false )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f35,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f21,f33,f30]) ).
thf(f37,definition,
( spl3_3
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f38,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f39,plain,
( spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f28,f37,f33]) ).
thf(f40,plain,
( ( sK1 @ sK2 )
= $true ),
inference(forward_subsumption_resolution,[],[f23,f8]) ).
thf(f41,plain,
( ( $false = $true )
| ~ spl3_2 ),
inference(backward_demodulation,[],[f40,f34]) ).
thf(f42,plain,
( $false
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f43,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f42]) ).
thf(f44,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f38,f31]) ).
thf(f45,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f46,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f45]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f35]) ).
cnf(s2,plain,
( spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f39]) ).
cnf(s3,plain,
~ spl3_2,
inference(sat_conversion,[],[f43]) ).
cnf(s4,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(sat_conversion,[],[f46]) ).
cnf(s5,plain,
spl3_3,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
~ spl3_1,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s3,s6]) ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU845^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.19 % Computer : n004.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 14:39:52 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/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.23/0.29 % (1377081)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.29 % (1377103)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2491126607:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.29 % (1377103) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1377081-1377103"...
% 0.23/0.29 % (1377103)...printing done.
% 0.23/0.29 % (1377104)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.29 % (1377104)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.23/0.29 % (1377103)Refutation found. Thanks to Tanya!
% 0.23/0.29 % SZS status Theorem for theBenchmark
% 0.23/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.29 % (1377103)------------------------------
% 0.23/0.29 % (1377103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29 % (1377103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29 % (1377103)CaDiCaL version: 2.1.3
% 0.23/0.29 % (1377103)Termination reason: Refutation
% 0.23/0.29 % (1377103)Time elapsed: 0.002 s
% 0.23/0.29 % (1377103)Peak memory usage: 13 MB
% 0.23/0.29 % (1377103)Instructions burned: 3 (million)
% 0.23/0.29 % (1377081)Success in time 0.038 s
% 0.23/0.29 % Vampire exiting
%------------------------------------------------------------------------------