%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV433^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:39:30 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 54 ( 10 unt; 0 typ; 3 def)
% Number of atoms : 275 ( 112 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 181 ( 51 ~; 93 |; 4 &; 29 @)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 65 !; 3 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
f: $i > $o ).
thf(f1,axiom,
! [X0: $i,X1: $i] :
( ( ( f @ X0 )
= ( f @ X1 ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finj) ).
thf(f2,conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).
thf(f3,negated_conjecture,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X1 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X0 )
!= ( f @ X1 ) ) ),
inference(ennf_transformation,[],[f1]) ).
thf(f5,plain,
? [X0: $i,X1: $i,X2: $i] :
( ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f6,plain,
( ( sK1 != sK2 )
& ( sK0 != sK2 )
& ( sK0 != sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
thf(f7,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X0 )
!= ( f @ X1 ) ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f8,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
sK0 != sK2,
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f6]) ).
thf(f13,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X0 )
= $true )
| ( ( f @ X1 )
= $true ) ),
inference(xor_proxy_clausification,[],[f7]) ).
thf(f14,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X0 )
= $false )
| ( ( f @ X1 )
= $false ) ),
inference(xor_proxy_clausification,[],[f7]) ).
thf(f93,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( X0 = X1 )
| ( ( f @ X1 )
= $true )
| ( X0 = X2 )
| ( $false
= ( f @ X2 ) ) ),
inference(constrained_superposition,[],[f13,f14]) ).
thf(f96,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X1 )
= $true )
| ( X0 = X2 )
| ( $false
= ( f @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f93]) ).
thf(f135,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( X0 = X1 )
| ( ( f @ X1 )
= $true )
| ( X2 = X3 )
| ( $true
= ( f @ X3 ) )
| ( X0 = X2 ) ),
inference(constrained_superposition,[],[f13,f96]) ).
thf(f144,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X1 )
= $true )
| ( X2 = X3 )
| ( $true
= ( f @ X3 ) )
| ( X0 = X2 ) ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f252,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( sK0 != X0 )
| ( sK1 = X1 )
| ( ( f @ X1 )
= $true )
| ( X0 = X2 )
| ( $true
= ( f @ X2 ) ) ),
inference(constrained_superposition,[],[f8,f144]) ).
thf(f310,definition,
( spl3_8
<=> ! [X1: $i] :
( ( sK1 = X1 )
| ( ( f @ X1 )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl3_8])],[avatar_definition]) ).
thf(f311,plain,
( ! [X1: $i] :
( ( ( f @ X1 )
= $true )
| ( sK1 = X1 ) )
| ~ spl3_8 ),
inference(avatar_component_clause,[],[f310]) ).
thf(f316,definition,
( spl3_10
<=> ! [X2: $i,X0: $i] :
( ( sK0 != X0 )
| ( $true
= ( f @ X2 ) )
| ( X0 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
thf(f317,plain,
( ! [X2: $i,X0: $i] :
( ( sK0 != X0 )
| ( $true
= ( f @ X2 ) )
| ( X0 = X2 ) )
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f316]) ).
thf(f318,plain,
( spl3_8
| spl3_10 ),
inference(avatar_split_clause,[],[f252,f316,f310]) ).
thf(f339,plain,
( ! [X0: $i,X1: $i] :
( ( $true = $false )
| ( X0 = X1 )
| ( ( f @ X1 )
= $false )
| ( sK1 = X0 ) )
| ~ spl3_8 ),
inference(constrained_superposition,[],[f14,f311]) ).
thf(f346,plain,
( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X1 )
= $false )
| ( sK1 = X0 ) )
| ~ spl3_8 ),
inference(trivial_inequality_removal,[],[f339]) ).
thf(f372,plain,
( ! [X0: $i,X1: $i] :
( ( $true = $false )
| ( sK1 = X0 )
| ( X0 = X1 )
| ( sK1 = X1 ) )
| ~ spl3_8 ),
inference(constrained_superposition,[],[f311,f346]) ).
thf(f380,plain,
( ! [X0: $i,X1: $i] :
( ( sK1 = X0 )
| ( X0 = X1 )
| ( sK1 = X1 ) )
| ~ spl3_8 ),
inference(trivial_inequality_removal,[],[f372]) ).
thf(f414,plain,
( ! [X0: $i] :
( ( sK0 != X0 )
| ( sK1 = X0 )
| ( sK1 = sK2 ) )
| ~ spl3_8 ),
inference(constrained_superposition,[],[f9,f380]) ).
thf(f433,plain,
( ! [X0: $i] :
( ( sK0 != X0 )
| ( sK1 = X0 ) )
| ~ spl3_8 ),
inference(forward_subsumption_resolution,[],[f414,f10]) ).
thf(f477,plain,
( ( sK0 = sK1 )
| ~ spl3_8 ),
inference(equality_resolution,[],[f433]) ).
thf(f478,plain,
( $false
| ~ spl3_8 ),
inference(forward_subsumption_resolution,[],[f477,f8]) ).
thf(f479,plain,
~ spl3_8,
inference(avatar_contradiction_clause,[],[f478]) ).
thf(f482,plain,
( ! [X0: $i] :
( ( ( f @ X0 )
= $true )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(equality_resolution,[],[f317]) ).
thf(f488,definition,
( spl3_12
<=> ! [X0: $i] : ( sK0 = X0 ) ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
thf(f489,plain,
( ! [X0: $i] : ( sK0 = X0 )
| ~ spl3_12 ),
inference(avatar_component_clause,[],[f488]) ).
thf(f496,plain,
( ! [X0: $i,X1: $i] :
( ( $true = $false )
| ( X0 = X1 )
| ( ( f @ X1 )
= $false )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(constrained_superposition,[],[f14,f482]) ).
thf(f503,plain,
( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( f @ X1 )
= $false )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(trivial_inequality_removal,[],[f496]) ).
thf(f514,plain,
( ( sK0 != sK0 )
| ~ spl3_12 ),
inference(constrained_superposition,[],[f8,f489]) ).
thf(f519,plain,
( $false
| ~ spl3_12 ),
inference(trivial_inequality_removal,[],[f514]) ).
thf(f520,plain,
~ spl3_12,
inference(avatar_contradiction_clause,[],[f519]) ).
thf(f540,plain,
( ! [X0: $i,X1: $i] :
( ( $true = $false )
| ( sK0 = X0 )
| ( X0 = X1 )
| ( sK0 = X1 ) )
| ~ spl3_10 ),
inference(constrained_superposition,[],[f482,f503]) ).
thf(f548,plain,
( ! [X0: $i,X1: $i] :
( ( sK0 = X0 )
| ( X0 = X1 )
| ( sK0 = X1 ) )
| ~ spl3_10 ),
inference(trivial_inequality_removal,[],[f540]) ).
thf(f577,plain,
( ! [X0: $i] :
( ( sK0 != sK0 )
| ( sK1 = X0 )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(constrained_superposition,[],[f8,f548]) ).
thf(f584,plain,
( ! [X0: $i] :
( ( sK1 != X0 )
| ( sK0 = X0 )
| ( sK0 = sK2 ) )
| ~ spl3_10 ),
inference(constrained_superposition,[],[f10,f548]) ).
thf(f606,plain,
( ! [X0: $i] :
( ( sK1 = X0 )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(trivial_inequality_removal,[],[f577]) ).
thf(f607,plain,
( ! [X0: $i] :
( ( sK1 != X0 )
| ( sK0 = X0 ) )
| ~ spl3_10 ),
inference(forward_subsumption_resolution,[],[f584,f9]) ).
thf(f609,plain,
( ! [X0: $i] : ( sK0 = X0 )
| ~ spl3_10 ),
inference(global_subsumption,[],[f607,f606]) ).
thf(f611,plain,
( spl3_12
| ~ spl3_10 ),
inference(avatar_split_clause,[],[f609,f316,f488]) ).
cnf(s137,plain,
( spl3_8
| spl3_10 ),
inference(sat_conversion,[],[f318]) ).
cnf(s220,plain,
~ spl3_8,
inference(sat_conversion,[],[f479]) ).
cnf(s244,plain,
~ spl3_12,
inference(sat_conversion,[],[f520]) ).
cnf(s290,plain,
( ~ spl3_10
| spl3_12 ),
inference(sat_conversion,[],[f611]) ).
cnf(s291,plain,
~ spl3_10,
inference(rat,[],[s290,s244]) ).
cnf(s292,plain,
$false,
inference(rat,[],[s137,s291,s220]) ).
thf(f612,plain,
$false,
inference(avatar_sat_refutation,[],[s292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV433^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n011.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:47:01 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27 % (248305)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (248312)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1521366397:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (248311)% WARNING: option uhcvi not known.
% 0.20/0.27 % (248310)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1442169612_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (248311)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1597868855:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (248314)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1807220666:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (248313)dis+10_1_sil=32000:sp=arity:random_seed=846133943:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (248311)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (248314)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (248311)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (248316)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3576571396:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (248312) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-248305-248312"...
% 0.20/0.27 % (248312)...printing done.
% 0.20/0.27 % (248312)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 % (248312)------------------------------
% 0.20/0.27 % (248312)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (248312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (248312)CaDiCaL version: 2.1.3
% 0.20/0.27 % (248312)Termination reason: Refutation
% 0.20/0.27 % (248312)Time elapsed: 0.012 s
% 0.20/0.27 % (248312)Peak memory usage: 13 MB
% 0.20/0.27 % (248312)Instructions burned: 36 (million)
% 0.20/0.27 % (248305)Success in time 0.037 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------