%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU885^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 : n008.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:20 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 105 ( 42 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 110 ( 19 ~; 10 |; 17 &; 52 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 16 !; 12 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cF: b > a ).
thf(func_def_1,type,
cV: b > $o ).
thf(func_def_2,type,
cU: b > $o ).
thf(func_def_6,type,
sK0: a ).
thf(func_def_7,type,
sK1: b ).
thf(f1,conjecture,
( ! [X0: b] :
( ( cU @ X0 )
=> ( cV @ X0 ) )
=> ! [X0: a] :
( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cU @ X1 ) )
=> ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cV @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM30A_pme) ).
thf(f2,negated_conjecture,
~ ( ! [X0: b] :
( ( cU @ X0 )
=> ( cV @ X0 ) )
=> ! [X0: a] :
( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cU @ X1 ) )
=> ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cV @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: b] :
( ( cU @ X0 )
=> ( cV @ X0 ) )
=> ! [X1: a] :
( ? [X2: b] :
( ( ( cF @ X2 )
= X1 )
& ( cU @ X2 ) )
=> ? [X3: b] :
( ( ( cF @ X3 )
= X1 )
& ( cV @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: b] :
( ( ( cU @ X0 )
= $true )
=> ( ( cV @ X0 )
= $true ) )
=> ! [X1: a] :
( ? [X2: b] :
( ( ( cF @ X2 )
= X1 )
& ( ( cU @ X2 )
= $true ) )
=> ? [X3: b] :
( ( ( cF @ X3 )
= X1 )
& ( ( cV @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X1: a] :
( ! [X3: b] :
( ( ( cF @ X3 )
!= X1 )
| ( ( cV @ X3 )
!= $true ) )
& ? [X2: b] :
( ( ( cF @ X2 )
= X1 )
& ( ( cU @ X2 )
= $true ) ) )
& ! [X0: b] :
( ( ( cV @ X0 )
= $true )
| ( ( cU @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ? [X0: a] :
( ! [X1: b] :
( ( ( cF @ X1 )
!= X0 )
| ( ( cV @ X1 )
!= $true ) )
& ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( ( cU @ X2 )
= $true ) ) )
& ! [X3: b] :
( ( ( cV @ X3 )
= $true )
| ( $true
!= ( cU @ X3 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( cV @ X1 )
!= $true ) )
& ( sK0
= ( cF @ sK1 ) )
& ( $true
= ( cU @ sK1 ) )
& ! [X3: b] :
( ( ( cV @ X3 )
= $true )
| ( $true
!= ( cU @ X3 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X2,sK1)],[f6]) ).
thf(f8,plain,
! [X3: b] :
( ( $true
!= ( cU @ X3 ) )
| ( ( cV @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( $true
= ( cU @ sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( sK0
= ( cF @ sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( cV @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f22,plain,
( ( sK0 != sK0 )
| ( $true
!= ( cV @ sK1 ) ) ),
inference(constrained_superposition,[],[f11,f10]) ).
thf(f23,plain,
( $true
!= ( cV @ sK1 ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f34,plain,
( ( $true != $true )
| ( $true
= ( cV @ sK1 ) ) ),
inference(constrained_superposition,[],[f8,f9]) ).
thf(f35,plain,
( $true
= ( cV @ sK1 ) ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f36,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU885^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.19 % Computer : n008.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:44:40 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.23 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.25 % (3254721)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (3254728)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1695134175:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.09/0.25 % (3254728) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3254721-3254728"...
% 0.09/0.25 % (3254728)...printing done.
% 0.09/0.25 % (3254728)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (3254728)------------------------------
% 0.09/0.25 % (3254728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (3254728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (3254728)CaDiCaL version: 2.1.3
% 0.09/0.25 % (3254728)Termination reason: Refutation
% 0.09/0.25 % (3254728)Time elapsed: 0.001 s
% 0.09/0.25 % (3254728)Peak memory usage: 12 MB
% 0.09/0.25 % (3254728)Instructions burned: 2 (million)
% 0.09/0.25 % (3254721)Success in time 0.015 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------