%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV163^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 : n009.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:37:56 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 1 def)
% Number of atoms : 22 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 75 ( 8 ~; 0 |; 2 &; 60 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-4 aty)
% Number of variables : 80 ( 30 sgn 4 !; 1 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_2,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_4,type,
sK0: ( a > a > a ) > a ).
thf(f1,conjecture,
! [X0: ( a > a > a ) > a] :
( ( X0
= ( ^ [X1: a > a > a] :
( X1
@ ( X0
@ ^ [X2: a,X3: a] : X2 )
@ ( X0
@ ^ [X2: a,X3: a] : X3 ) ) ) )
=> ( ( ^ [X1: a > a > a] :
( X1
@ ( X0
@ ^ [X2: a,X3: a] : X2 )
@ ( X0
@ ^ [X2: a,X3: a] : X3 ) ) )
= X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM187_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: ( a > a > a ) > a] :
( ( X0
= ( ^ [X1: a > a > a] :
( X1
@ ( X0
@ ^ [X2: a,X3: a] : X2 )
@ ( X0
@ ^ [X2: a,X3: a] : X3 ) ) ) )
=> ( ( ^ [X1: a > a > a] :
( X1
@ ( X0
@ ^ [X2: a,X3: a] : X2 )
@ ( X0
@ ^ [X2: a,X3: a] : X3 ) ) )
= X0 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: ( a > a > a ) > a] :
( ( X0
= ( ^ [X1: a > a > a] :
( X1
@ ( X0
@ ^ [X2: a,X3: a] : X2 )
@ ( X0
@ ^ [X4: a,X5: a] : X5 ) ) ) )
=> ( ( ^ [X6: a > a > a] :
( X6
@ ( X0
@ ^ [X7: a,X8: a] : X7 )
@ ( X0
@ ^ [X9: a,X10: a] : X10 ) ) )
= X0 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: ( a > a > a ) > a] :
( ( ( ^ [Y0: a > a > a] :
( Y0
@ ( X0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( X0
@ ^ [Y1: a,Y2: a] : Y2 ) ) )
= X0 )
=> ( ( ^ [Y0: a > a > a] :
( Y0
@ ( X0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( X0
@ ^ [Y1: a,Y2: a] : Y2 ) ) )
= X0 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: ( a > a > a ) > a] :
( ( ( ^ [Y0: a > a > a] :
( Y0
@ ( X0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( X0
@ ^ [Y1: a,Y2: a] : Y2 ) ) )
!= X0 )
& ( ( ^ [Y0: a > a > a] :
( Y0
@ ( X0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( X0
@ ^ [Y1: a,Y2: a] : Y2 ) ) )
= X0 ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( sK0
!= ( ^ [Y0: a > a > a] :
( Y0
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y2 ) ) ) )
& ( sK0
= ( ^ [Y0: a > a > a] :
( Y0
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y2 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).
thf(f7,plain,
( sK0
= ( ^ [Y0: a > a > a] :
( Y0
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y2 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
( sK0
!= ( ^ [Y0: a > a > a] :
( Y0
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y2 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,definition,
( spl1_1
<=> ( sK0
= ( ^ [Y0: a > a > a] :
( Y0
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y1 )
@ ( sK0
@ ^ [Y1: a,Y2: a] : Y2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
thf(f13,plain,
~ spl1_1,
inference(avatar_split_clause,[],[f8,f10]) ).
thf(f14,plain,
spl1_1,
inference(avatar_split_clause,[],[f7,f10]) ).
cnf(s1,plain,
~ spl1_1,
inference(sat_conversion,[],[f13]) ).
cnf(s2,plain,
spl1_1,
inference(sat_conversion,[],[f14]) ).
cnf(s3,plain,
$false,
inference(rat,[],[s1,s2]) ).
thf(f15,plain,
$false,
inference(avatar_sat_refutation,[],[s3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV163^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.10/0.17 % Computer : n009.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 15:18:15 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.22 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.10/0.26 % (4123493)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.26 % (4123501)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=1553735617: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.10/0.26 % (4123501) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4123493-4123501"...
% 0.10/0.26 % (4123501)...printing done.
% 0.10/0.26 % (4123504)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.26 % (4123504)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.10/0.26 % (4123501)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26 % (4123501)------------------------------
% 0.10/0.26 % (4123501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (4123501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (4123501)CaDiCaL version: 2.1.3
% 0.10/0.26 % (4123501)Termination reason: Refutation
% 0.10/0.26 % (4123501)Time elapsed: 0.001 s
% 0.10/0.26 % (4123501)Peak memory usage: 12 MB
% 0.10/0.26 % (4123501)Instructions burned: 1 (million)
% 0.10/0.26 % (4123493)Success in time 0.033 s
% 0.21/0.26 % Vampire exiting
%------------------------------------------------------------------------------