%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET159^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 : n018.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:23:14 AM UTC 2026
% Result : Theorem 0.24s 0.28s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 68 ( 24 unt; 0 typ; 6 def)
% Number of atoms : 312 ( 74 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 328 ( 41 ~; 126 |; 0 &; 155 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 9 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn 12 !; 6 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vOR: $o > $o > $o ).
thf(func_def_2,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_9,type,
sK3: a ).
thf(f1,conjecture,
! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
| ( X2 @ X3 )
| ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_64_pme) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
| ( X2 @ X3 )
| ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
| ( X0 @ X3 )
| ( X2 @ X3 ) ) )
= ( ^ [X4: a] :
( ( X2 @ X4 )
| ( X0 @ X4 )
| ( X1 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X2 @ Y0 )
| ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X2 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK2 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK2 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK3 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f8]) ).
thf(f19,plain,
( ( $true
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f18]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK3 )
= $false )
| ( $false
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f18]) ).
thf(f21,plain,
( ( ( ( sK0 @ sK3 )
| ( sK2 @ sK3 )
| ( sK1 @ sK3 ) )
= $false )
| ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f20]) ).
thf(f22,plain,
( ( ( sK1 @ sK3 )
= $false )
| ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f21]) ).
thf(f23,plain,
( ( ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) )
= $false )
| ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f21]) ).
thf(f24,plain,
( ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( ( sK2 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f23]) ).
thf(f25,plain,
( ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( ( sK0 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f23]) ).
thf(f26,plain,
( ( ( sK0 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f25]) ).
thf(f30,plain,
( ( sK0 @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f26]) ).
thf(f32,plain,
( ( ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) )
= $false )
| ( ( sK2 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f24]) ).
thf(f33,plain,
( ( ( sK2 @ sK3 )
= $false )
| ( ( sK2 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f32]) ).
thf(f35,plain,
( ( sK2 @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f33]) ).
thf(f37,plain,
( ( ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) )
= $false )
| ( ( sK1 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f22]) ).
thf(f39,plain,
( ( ( sK1 @ sK3 )
= $false )
| ( ( sK1 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f37]) ).
thf(f40,plain,
( ( sK1 @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f39]) ).
thf(f41,plain,
( ( $true
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 )
| ( sK1 @ sK3 ) ) )
| ( $true
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f42,plain,
( ( ( sK1 @ sK3 )
= $true )
| ( $true
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( $true
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f41]) ).
thf(f43,plain,
( ( $true
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( ( sK0 @ sK3 )
= $true )
| ( $true
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( ( sK1 @ sK3 )
= $true ) ),
inference(or_proxy_clausification,[],[f42]) ).
thf(f44,plain,
( ( $true
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( ( sK0 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true ) ),
inference(or_proxy_clausification,[],[f43]) ).
thf(f45,plain,
( ( ( sK2 @ sK3 )
= $true )
| ( ( sK0 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true )
| ( ( sK0 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true ) ),
inference(or_proxy_clausification,[],[f44]) ).
thf(f46,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true ) ),
inference(duplicate_literal_removal,[],[f45]) ).
thf(f48,definition,
( spl4_1
<=> ( ( sK1 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f50,plain,
( ( ( sK1 @ sK3 )
= $false )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f52,definition,
( spl4_2
<=> ( ( sK0 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f54,plain,
( ( ( sK0 @ sK3 )
= $false )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f57,definition,
( spl4_3
<=> ( ( sK2 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f59,plain,
( ( ( sK2 @ sK3 )
= $false )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f57]) ).
thf(f61,plain,
spl4_2,
inference(avatar_split_clause,[],[f30,f52]) ).
thf(f63,plain,
spl4_3,
inference(avatar_split_clause,[],[f35,f57]) ).
thf(f65,plain,
spl4_1,
inference(avatar_split_clause,[],[f40,f48]) ).
thf(f69,definition,
( spl4_4
<=> ( ( sK2 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f71,plain,
( ( ( sK2 @ sK3 )
= $true )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f73,definition,
( spl4_5
<=> ( ( sK0 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f75,plain,
( ( ( sK0 @ sK3 )
= $true )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f77,definition,
( spl4_6
<=> ( ( sK1 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f79,plain,
( ( ( sK1 @ sK3 )
= $true )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f77]) ).
thf(f80,plain,
( spl4_4
| spl4_5
| spl4_6 ),
inference(avatar_split_clause,[],[f46,f77,f73,f69]) ).
thf(f83,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_5 ),
inference(forward_demodulation,[],[f54,f75]) ).
thf(f84,plain,
( $false
| ~ spl4_2
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f85,plain,
( ~ spl4_2
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f84]) ).
thf(f86,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_6 ),
inference(forward_demodulation,[],[f79,f50]) ).
thf(f87,plain,
( $false
| ~ spl4_1
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f88,plain,
( ~ spl4_1
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f87]) ).
thf(f96,plain,
( ( $true = $false )
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f59,f71]) ).
thf(f97,plain,
( $false
| ~ spl4_3
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f98,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f97]) ).
cnf(s3,plain,
spl4_2,
inference(sat_conversion,[],[f61]) ).
cnf(s5,plain,
spl4_3,
inference(sat_conversion,[],[f63]) ).
cnf(s7,plain,
spl4_1,
inference(sat_conversion,[],[f65]) ).
cnf(s10,plain,
( spl4_4
| spl4_5
| spl4_6 ),
inference(sat_conversion,[],[f80]) ).
cnf(s11,plain,
( ~ spl4_2
| ~ spl4_5 ),
inference(sat_conversion,[],[f85]) ).
cnf(s12,plain,
( ~ spl4_1
| ~ spl4_6 ),
inference(sat_conversion,[],[f88]) ).
cnf(s14,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f98]) ).
cnf(s15,plain,
~ spl4_6,
inference(rat,[],[s12,s7]) ).
cnf(s16,plain,
~ spl4_4,
inference(rat,[],[s14,s5]) ).
cnf(s17,plain,
spl4_5,
inference(rat,[],[s10,s15,s16]) ).
cnf(s18,plain,
~ spl4_2,
inference(rat,[],[s11,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s3,s18]) ).
thf(f99,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET159^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n018.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 13:39:12 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.10/0.25 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.24/0.28 % (74300)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.28 % (74317)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.28 % (74317)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.24/0.28 % (74317)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=726824085:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.24/0.28 % (74317) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-74300-74317"...
% 0.24/0.28 % (74317)...printing done.
% 0.24/0.28 % (74317)Refutation found. Thanks to Tanya!
% 0.24/0.28 % SZS status Theorem for theBenchmark
% 0.24/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.28 % (74317)------------------------------
% 0.24/0.28 % (74317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.28 % (74317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.28 % (74317)CaDiCaL version: 2.1.3
% 0.24/0.28 % (74317)Termination reason: Refutation
% 0.24/0.28 % (74317)Time elapsed: 0.002 s
% 0.24/0.28 % (74317)Peak memory usage: 13 MB
% 0.24/0.28 % (74317)Instructions burned: 4 (million)
% 0.24/0.28 % (74300)Success in time 0.019 s
% 0.24/0.28 % Vampire exiting
%------------------------------------------------------------------------------