%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO236^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 : 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:47:15 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 55 ( 26 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 19 ~; 17 |; 1 &; 34 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
g: b > a ).
thf(func_def_1,type,
f: b > a ).
thf(func_def_5,type,
vNOT: $o > $o ).
thf(func_def_7,type,
sK1: b ).
thf(func_def_8,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ( ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) )
| ! [X0: ( b > a ) > $o] :
( ( X0 @ f )
=> ( X0 @ g ) ) )
=> ( f = g ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM504) ).
thf(f2,negated_conjecture,
~ ( ( ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) )
| ! [X0: ( b > a ) > $o] :
( ( X0 @ f )
=> ( X0 @ g ) ) )
=> ( f = g ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ! [X1: ( b > a ) > $o] :
( ( X1 @ f )
=> ( X1 @ g ) ) )
=> ( f = g ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ! [X1: ( b > a ) > $o] :
( ( ( X1 @ f )
= $true )
=> ( $true
= ( X1 @ g ) ) ) )
=> ( f = g ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ! [X1: ( b > a ) > $o] :
( ( $true
= ( X1 @ g ) )
| ( ( X1 @ f )
!= $true ) ) )
& ( f != g ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
f != g,
inference(cnf_transformation,[],[f5]) ).
thf(f7,plain,
! [X0: b,X1: ( b > a ) > $o] :
( ( ( g @ X0 )
= ( f @ X0 ) )
| ( $true
= ( X1 @ g ) )
| ( ( X1 @ f )
!= $true ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f11,definition,
( spl0_1
<=> ! [X1: ( b > a ) > $o] :
( ( $true
= ( X1 @ g ) )
| ( ( X1 @ f )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f12,plain,
( ! [X1: ( b > a ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( $true
= ( X1 @ g ) ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f11]) ).
thf(f14,definition,
( spl0_2
<=> ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f15,plain,
( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f16,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f7,f14,f11]) ).
thf(f17,plain,
( ( g @ sK1 )
!= ( f @ sK1 ) ),
inference(negative_extensionality,[],[f6]) ).
thf(f18,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f17,f15]) ).
thf(f19,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f18]) ).
thf(f20,plain,
( ( f = g )
| ~ spl0_1 ),
inference(leibniz_equality_elimination,[],[f12]) ).
thf(f34,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f20,f6]) ).
thf(f35,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f34]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f16]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f19]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f35]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
thf(f36,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO236^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 16:41:09 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.20/0.28 % (3397013)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (3397022)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3674280265:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (3397019)lrs+10_16_si=on:nwc=1.5:random_seed=357624838:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (3397018)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=957627326:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (3397020)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2284447816:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (3397021)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=3673180721: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.28 % (3397024)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.28 % (3397024)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.20/0.28 % (3397022) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3397013-3397022"...
% 0.20/0.28 % (3397018) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3397013-3397018"...
% 0.20/0.28 % (3397020) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3397013-3397020"...
% 0.20/0.28 % (3397019) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3397013-3397019"...
% 0.20/0.28 % (3397024)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=4124221013:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (3397021) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3397013-3397021"...
% 0.20/0.28 % (3397022)...printing done.
% 0.20/0.28 % (3397023)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4258531308:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.28 % (3397020)...printing done.
% 0.20/0.28 % (3397018)...printing done.
% 0.20/0.28 % (3397019)...printing done.
% 0.20/0.28 % (3397021)...printing done.
% 0.20/0.28 % (3397024)Refutation not found, incomplete strategy
% 0.20/0.28 % (3397024)------------------------------
% 0.20/0.28 % (3397024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3397024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3397024)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3397024)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (3397024)Time elapsed: 0.001 s
% 0.20/0.28 % (3397024)Peak memory usage: 12 MB
% 0.20/0.28 % (3397024)Instructions burned: 4 (million)
% 0.20/0.28 % (3397018)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 % (3397018)------------------------------
% 0.20/0.28 % (3397018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3397018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3397018)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3397018)Termination reason: Refutation
% 0.20/0.28 % (3397018)Time elapsed: 0.002 s
% 0.20/0.28 % (3397018)Peak memory usage: 13 MB
% 0.20/0.28 % (3397018)Instructions burned: 1 (million)
% 0.20/0.28 % (3397013)Success in time 0.049 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------