%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU925^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:34:24 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 42 equ; 2 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 21 ( 10 ~; 4 |; 2 &; 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 : 26 ( 12 ^; 12 !; 2 ?; 26 :)
% 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/sandbox2/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,
? [X0: $i,X1: $i] :
( ( X0 != X1 )
& ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
= ( ^ [Y0: $i] : ( X1 = Y0 ) ) ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
( ( sK0 != sK1 )
& ( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f7,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f5]) ).
thf(f10,plain,
( ( (=) @ sK0 )
= ( (=) @ sK1 ) ),
inference(beta-eta_normalization,[],[f6]) ).
thf(f11,plain,
! [X1: $i] :
( ( sK0 = X1 )
= ( sK1 = X1 ) ),
inference(argument_congruence,[],[f10]) ).
thf(f13,plain,
! [X1: $i] :
( ( $false
= ( sK0 = X1 ) )
| ( $true
= ( sK1 = X1 ) ) ),
inference(iff_proxy_clausification,[],[f11]) ).
thf(f14,plain,
! [X1: $i] :
( ( sK0 != X1 )
| ( $true
= ( sK1 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f13]) ).
thf(f15,plain,
! [X1: $i] :
( ( sK1 = X1 )
| ( sK0 != X1 ) ),
inference(equality_proxy_clausification,[],[f14]) ).
thf(f20,plain,
! [X0: $i] :
( ( sK0 != X0 )
| ( sK0 != X0 ) ),
inference(constrained_superposition,[],[f7,f15]) ).
thf(f21,plain,
! [X0: $i] : ( sK0 != X0 ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f22,plain,
$false,
inference(equality_resolution,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU925^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n019.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 14:46:48 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.27 % (879852)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (879861)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3803314288:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (879861)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (879861) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-879852-879861"...
% 0.20/0.27 % (879861)...printing done.
% 0.20/0.27 % (879861)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (879861)------------------------------
% 0.20/0.27 % (879861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (879861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (879861)CaDiCaL version: 2.1.3
% 0.20/0.27 % (879861)Termination reason: Refutation
% 0.20/0.27 % (879861)Time elapsed: 0.001 s
% 0.20/0.27 % (879861)Peak memory usage: 12 MB
% 0.20/0.27 % (879861)Instructions burned: 1 (million)
% 0.20/0.27 % (879852)Success in time 0.027 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------