%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV241^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 : 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:39:12 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 9 unt; 0 typ; 2 def)
% Number of atoms : 158 ( 47 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 108 ( 23 ~; 26 |; 13 &; 36 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 4 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cW: a > $o ).
thf(func_def_1,type,
cU: a > $o ).
thf(func_def_5,type,
sK0: a ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(f1,conjecture,
! [X0: a] :
( ( ( cW @ X0 )
& ( cU @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cW )
| ( X1 = cU ) )
=> ( X1 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5201A_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( cW @ X0 )
& ( cU @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cW )
| ( X1 = cU ) )
=> ( X1 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ( ( cW @ X0 )
& ( cU @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cW )
| ( X1 = cU ) )
=> ( X1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( ( cW @ X0 )
= $true )
& ( ( cU @ X0 )
= $true ) )
=> ! [X1: a > $o] :
( ( ( cW = X1 )
| ( cU = X1 ) )
=> ( ( X1 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
& ( ( cW = X1 )
| ( cU = X1 ) ) )
& ( ( cW @ X0 )
= $true )
& ( ( cU @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
& ( ( cW = X1 )
| ( cU = X1 ) ) )
& ( ( cW @ X0 )
= $true )
& ( ( cU @ X0 )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( $true
!= ( sK1 @ sK0 ) )
& ( ( cW = sK1 )
| ( cU = sK1 ) )
& ( $true
= ( cW @ sK0 ) )
& ( $true
= ( cU @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
( $true
= ( cU @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( $true
= ( cW @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( cW = sK1 )
| ( cU = sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( $true
!= ( sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,definition,
( spl2_1
<=> ( cU = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f17,plain,
( ( cU = sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f19,definition,
( spl2_2
<=> ( cW = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f21,plain,
( ( cW = sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f22,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f10,f19,f15]) ).
thf(f23,plain,
( ! [X1: a] :
( ( cU @ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f17]) ).
thf(f25,plain,
( ! [X1: a] :
( ( $false
= ( cU @ X1 ) )
| ( $true
= ( sK1 @ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f56,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK0 ) )
| ~ spl2_1 ),
inference(constrained_superposition,[],[f25,f8]) ).
thf(f63,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f66,plain,
( $false
| ~ spl2_1 ),
inference(forward_subsumption_resolution,[],[f63,f11]) ).
thf(f67,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f66]) ).
thf(f71,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( cW @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f21]) ).
thf(f72,plain,
( ! [X1: a] :
( ( $false
= ( cW @ X1 ) )
| ( $true
= ( sK1 @ X1 ) ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f71]) ).
thf(f97,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK0 ) )
| ~ spl2_2 ),
inference(constrained_superposition,[],[f72,f9]) ).
thf(f100,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f103,plain,
( $false
| ~ spl2_2 ),
inference(forward_subsumption_resolution,[],[f100,f11]) ).
thf(f104,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f103]) ).
cnf(s12,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f22]) ).
cnf(s32,plain,
~ spl2_1,
inference(sat_conversion,[],[f67]) ).
cnf(s56,plain,
~ spl2_2,
inference(sat_conversion,[],[f104]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s12,s56,s32]) ).
thf(f105,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV241^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n014.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 15:26:30 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.26 % (2801900)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2801920)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=997891942:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (2801920) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2801900-2801920"...
% 0.09/0.26 % (2801920)...printing done.
% 0.09/0.26 % (2801919)% WARNING: option uhcvi not known.
% 0.09/0.26 % (2801920)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (2801920)------------------------------
% 0.09/0.26 % (2801920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (2801920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (2801920)CaDiCaL version: 2.1.3
% 0.09/0.26 % (2801920)Termination reason: Refutation
% 0.09/0.26 % (2801920)Time elapsed: 0.002 s
% 0.09/0.26 % (2801920)Peak memory usage: 13 MB
% 0.09/0.26 % (2801920)Instructions burned: 4 (million)
% 0.09/0.26 % (2801900)Success in time 0.035 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------