%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU925^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 : n014.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:57 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 46 equ; 2 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 22 ( 10 ~; 4 |; 3 &; 2 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 30 ( 14 ^; 12 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_1,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
! [X0: $i,X1: $i] :
( ( ( ^ [X2: $i] : ( X0 = X2 ) )
= ( ^ [X3: $i] : ( X1 = X3 ) ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM7_TPS2_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( ( ^ [X2: $i] : ( X0 = X2 ) )
= ( ^ [X3: $i] : ( X1 = X3 ) ) )
=> ( X0 = X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i,X1: $i] :
( ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
= ( ^ [Y0: $i] : ( X1 = Y0 ) ) )
=> ( X0 = X1 ) ),
inference(fool_elimination,[],[f2]) ).
thf(f4,plain,
? [X1: $i,X0: $i] :
( ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
= ( ^ [Y0: $i] : ( X1 = Y0 ) ) )
& ( X0 != X1 ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
? [X0: $i,X1: $i] :
( ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
= ( ^ [Y0: $i] : ( X1 = Y0 ) ) )
& ( X0 != X1 ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
( ( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) )
& ( sK1 != sK0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).
thf(f7,plain,
sK1 != sK0,
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f11,plain,
( ( (=) @ sK1 )
= ( (=) @ sK0 ) ),
inference(beta-eta_normalization,[],[f8]) ).
thf(f12,plain,
! [X1: $i] :
( ( sK0 = X1 )
= ( sK1 = X1 ) ),
inference(argument_congruence,[],[f11]) ).
thf(f14,plain,
! [X1: $i] :
( ( $true
= ( sK1 = X1 ) )
| ( ( sK0 = X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f12]) ).
thf(f15,plain,
! [X1: $i] :
( ( sK1 = X1 )
| ( ( sK0 = X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f14]) ).
thf(f16,plain,
! [X1: $i] :
( ( sK1 = X1 )
| ( sK0 != X1 ) ),
inference(equality_proxy_clausification,[],[f15]) ).
thf(f21,plain,
! [X0: $i] :
( ( sK0 != X0 )
| ( sK0 != X0 ) ),
inference(constrained_superposition,[],[f7,f16]) ).
thf(f22,plain,
! [X0: $i] : ( sK0 != X0 ),
inference(duplicate_literal_removal,[],[f21]) ).
thf(f24,plain,
$false,
inference(equality_resolution,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU925^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.07/0.17 % Computer : n014.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 14:46:31 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.21 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.07/0.25 % (2764869)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.25 % (2764880)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.07/0.25 % (2764880)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.07/0.25 % (2764880)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=2844940227:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.07/0.25 % (2764880) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2764869-2764880"...
% 0.07/0.25 % (2764880)...printing done.
% 0.07/0.25 % (2764880)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (2764880)------------------------------
% 0.07/0.25 % (2764880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (2764880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (2764880)CaDiCaL version: 2.1.3
% 0.07/0.25 % (2764880)Termination reason: Refutation
% 0.07/0.25 % (2764880)Time elapsed: 0.001 s
% 0.07/0.25 % (2764880)Peak memory usage: 12 MB
% 0.07/0.25 % (2764880)Instructions burned: 1 (million)
% 0.07/0.25 % (2764869)Success in time 0.028 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------