%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU956^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 : n003.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:28 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% 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 : 95 ( 63 equ; 2 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 62 ( 15 ~; 9 |; 6 &; 16 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 53 ( 16 ^; 33 !; 4 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_9,type,
sK2: ( $i > $o ) > $i ).
thf(f1,conjecture,
( ! [X0: $i > $o,X1: $i > $o] :
( ( X0 = X1 )
=> ! [X2: $i] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) ) )
=> ! [X3: $i,X4: $i] :
( ( ( ^ [X5: $i] : ( X3 = X5 ) )
= ( ^ [X5: $i] : ( X4 = X5 ) ) )
=> ( X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM13_pme) ).
thf(f2,negated_conjecture,
~ ( ! [X0: $i > $o,X1: $i > $o] :
( ( X0 = X1 )
=> ! [X2: $i] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) ) )
=> ! [X3: $i,X4: $i] :
( ( ( ^ [X5: $i] : ( X3 = X5 ) )
= ( ^ [X5: $i] : ( X4 = X5 ) ) )
=> ( X3 = X4 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: $i > $o,X1: $i > $o] :
( ( X0 = X1 )
=> ! [X2: $i] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) ) )
=> ! [X3: $i,X4: $i] :
( ( ( ^ [X5: $i] : ( X3 = X5 ) )
= ( ^ [X6: $i] : ( X4 = X6 ) ) )
=> ( X3 = X4 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: $i > $o,X1: $i > $o] :
( ( X0 = X1 )
=> ! [X2: $i] :
( ( ( X1 @ X2 )
= $true )
=> ( ( X0 @ X2 )
= $true ) ) )
=> ! [X3: $i,X4: $i] :
( ( ( ^ [Y0: $i] : ( X3 = Y0 ) )
= ( ^ [Y0: $i] : ( X4 = Y0 ) ) )
=> ( X3 = X4 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X3: $i,X4: $i] :
( ( X3 != X4 )
& ( ( ^ [Y0: $i] : ( X3 = Y0 ) )
= ( ^ [Y0: $i] : ( X4 = Y0 ) ) ) )
& ! [X0: $i > $o,X1: $i > $o] :
( ! [X2: $i] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) )
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ? [X0: $i,X1: $i] :
( ( X0 != X1 )
& ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
= ( ^ [Y0: $i] : ( X1 = Y0 ) ) ) )
& ! [X2: $i > $o,X3: $i > $o] :
( ! [X4: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
!= ( X3 @ X4 ) ) )
| ( X2 != X3 ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( sK0 != sK1 )
& ( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) )
& ! [X2: $i > $o,X3: $i > $o] :
( ! [X4: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
!= ( X3 @ X4 ) ) )
| ( X2 != X3 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f9,plain,
( ( ^ [Y0: $i] : ( sK0 = Y0 ) )
= ( ^ [Y0: $i] : ( sK1 = Y0 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
( ( (=) @ sK0 )
= ( (=) @ sK1 ) ),
inference(beta-eta_normalization,[],[f9]) ).
thf(f31,plain,
! [X1: $i] :
( ( sK0 = X1 )
= ( sK1 = X1 ) ),
inference(argument_congruence,[],[f13]) ).
thf(f33,plain,
! [X1: $i] :
( ( $false
= ( sK0 = X1 ) )
| ( $true
= ( sK1 = X1 ) ) ),
inference(iff_proxy_clausification,[],[f31]) ).
thf(f34,plain,
! [X1: $i] :
( ( sK0 != X1 )
| ( $true
= ( sK1 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X1: $i] :
( ( sK0 != X1 )
| ( sK1 = X1 ) ),
inference(equality_proxy_clausification,[],[f34]) ).
thf(f38,plain,
sK0 = sK1,
inference(equality_resolution,[],[f35]) ).
thf(f39,plain,
$false,
inference(forward_subsumption_resolution,[],[f38,f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU956^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.11/0.20 % Computer : n003.cluster.edu
% 0.11/0.20 % Model : x86_64 x86_64
% 0.11/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20 % Memory : 8046.5625MB
% 0.11/0.20 % OS : Linux 6.8.0-71-generic
% 0.11/0.20 % CPULimit : 300
% 0.11/0.20 % WCLimit : 300
% 0.11/0.20 % DateTime : Tue Sep 29 14:52:29 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.24 Running first-order model finding
% 0.11/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.21/0.29 % (2610358)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (2610364)% WARNING: option uhcvi not known.
% 0.21/0.29 % (2610368)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=688322082:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % (2610364)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1216834094:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (2610363)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=647002098_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (2610365)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=118146637:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (2610367)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1703497802:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (2610364)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.29 % (2610366)dis+10_1_sil=32000:sp=arity:random_seed=533416957:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (2610367)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.29 % (2610364)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.29 % Exception at run slice level
% 0.21/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.29 % (2610368) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610358-2610368"...
% 0.21/0.29 % (2610364) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610358-2610364"...
% 0.21/0.29 % (2610367) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610358-2610367"...
% 0.21/0.29 % (2610365) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610358-2610365"...
% 0.21/0.29 % (2610366) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610358-2610366"...
% 0.21/0.29 % (2610368)...printing done.
% 0.21/0.29 % (2610364)...printing done.
% 0.21/0.29 % (2610367)...printing done.
% 0.21/0.29 % (2610365)...printing done.
% 0.21/0.29 % (2610366)...printing done.
% 0.21/0.29 % (2610368)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (2610368)------------------------------
% 0.21/0.29 % (2610368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (2610368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (2610368)CaDiCaL version: 2.1.3
% 0.21/0.29 % (2610368)Termination reason: Refutation
% 0.21/0.29 % (2610368)Time elapsed: 0.002 s
% 0.21/0.29 % (2610368)Peak memory usage: 12 MB
% 0.21/0.29 % (2610368)Instructions burned: 2 (million)
% 0.21/0.29 % (2610358)Success in time 0.04 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------