%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU890^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 : n005.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:21 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 8 unt; 0 typ; 6 def)
% Number of atoms : 221 ( 86 equ; 0 cnn)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 275 ( 60 ~; 65 |; 27 &; 112 @)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 20 !; 24 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
c: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(type_def_8,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cG: c > b ).
thf(func_def_1,type,
cF: b > a ).
thf(func_def_2,type,
cS: c > $o ).
thf(func_def_6,type,
sK0: a ).
thf(func_def_7,type,
sK1: c ).
thf(func_def_8,type,
sK2: b ).
thf(func_def_9,type,
sK3: c ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) ) )
<=> ? [X1: c] :
( ( X0
= ( cF @ ( cG @ X1 ) ) )
& ( cS @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM29_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) ) )
<=> ? [X1: c] :
( ( X0
= ( cF @ ( cG @ X1 ) ) )
& ( cS @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) ) )
<=> ? [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
= X0 )
& ( cS @ X3 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ? [X2: c] :
( ( ( cG @ X2 )
= X1 )
& ( ( cS @ X2 )
= $true ) ) )
<=> ? [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
= X0 )
& ( ( cS @ X3 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ? [X2: c] :
( ( ( cG @ X2 )
= X1 )
& ( ( cS @ X2 )
= $true ) ) )
<~> ? [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
= X0 )
& ( ( cS @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ( ! [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
!= X0 )
| ( ( cS @ X3 )
!= $true ) )
| ! [X1: b] :
( ( ( cF @ X1 )
!= X0 )
| ! [X2: c] :
( ( ( cG @ X2 )
!= X1 )
| ( ( cS @ X2 )
!= $true ) ) ) )
& ( ? [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
= X0 )
& ( ( cS @ X3 )
= $true ) )
| ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ? [X2: c] :
( ( ( cG @ X2 )
= X1 )
& ( ( cS @ X2 )
= $true ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: a] :
( ( ! [X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= X0 )
| ( ( cS @ X1 )
!= $true ) )
| ! [X2: b] :
( ( ( cF @ X2 )
!= X0 )
| ! [X3: c] :
( ( ( cG @ X3 )
!= X2 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X4: c] :
( ( ( cF @ ( cG @ X4 ) )
= X0 )
& ( $true
= ( cS @ X4 ) ) )
| ? [X5: b] :
( ( ( cF @ X5 )
= X0 )
& ? [X6: c] :
( ( ( cG @ X6 )
= X5 )
& ( $true
= ( cS @ X6 ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( ! [X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= sK0 )
| ( ( cS @ X1 )
!= $true ) )
| ! [X2: b] :
( ( ( cF @ X2 )
!= sK0 )
| ! [X3: c] :
( ( ( cG @ X3 )
!= X2 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ( ( sK0
= ( cF @ ( cG @ sK1 ) ) )
& ( $true
= ( cS @ sK1 ) ) )
| ( ( sK0
= ( cF @ sK2 ) )
& ( sK2
= ( cG @ sK3 ) )
& ( $true
= ( cS @ sK3 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X4,sK1),skolemize(X5,sK2),skolemize(X6,sK3)],[f7]) ).
thf(f9,plain,
( ( $true
= ( cS @ sK1 ) )
| ( $true
= ( cS @ sK3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( ( $true
= ( cS @ sK1 ) )
| ( sK2
= ( cG @ sK3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( ( $true
= ( cS @ sK1 ) )
| ( sK0
= ( cF @ sK2 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
( ( sK0
= ( cF @ ( cG @ sK1 ) ) )
| ( $true
= ( cS @ sK3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f13,plain,
( ( sK0
= ( cF @ ( cG @ sK1 ) ) )
| ( sK2
= ( cG @ sK3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
( ( sK0
= ( cF @ ( cG @ sK1 ) ) )
| ( sK0
= ( cF @ sK2 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
! [X2: b,X3: c,X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= sK0 )
| ( ( cS @ X1 )
!= $true )
| ( ( cF @ X2 )
!= sK0 )
| ( ( cG @ X3 )
!= X2 )
| ( ( cS @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f18,plain,
! [X3: c,X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= sK0 )
| ( ( cS @ X1 )
!= $true )
| ( ( cF @ ( cG @ X3 ) )
!= sK0 )
| ( ( cS @ X3 )
!= $true ) ),
inference(equality_resolution,[],[f15]) ).
thf(f20,definition,
( spl4_1
<=> ( $true
= ( cS @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f24,definition,
( spl4_2
<=> ( $true
= ( cS @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f27,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f9,f24,f20]) ).
thf(f29,definition,
( spl4_3
<=> ( sK2
= ( cG @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f31,plain,
( ( sK2
= ( cG @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f32,plain,
( spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f10,f24,f29]) ).
thf(f34,definition,
( spl4_4
<=> ( sK0
= ( cF @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f37,plain,
( spl4_4
| spl4_2 ),
inference(avatar_split_clause,[],[f11,f24,f34]) ).
thf(f39,definition,
( spl4_5
<=> ( sK0
= ( cF @ ( cG @ sK1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f41,plain,
( ( sK0
= ( cF @ ( cG @ sK1 ) ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f42,plain,
( spl4_1
| spl4_5 ),
inference(avatar_split_clause,[],[f12,f39,f20]) ).
thf(f43,plain,
( spl4_3
| spl4_5 ),
inference(avatar_split_clause,[],[f13,f39,f29]) ).
thf(f44,plain,
( spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f14,f39,f34]) ).
thf(f46,definition,
( spl4_6
<=> ! [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
!= sK0 )
| ( ( cS @ X3 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f47,plain,
( ! [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
!= sK0 )
| ( ( cS @ X3 )
!= $true ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f48,plain,
( spl4_6
| spl4_6 ),
inference(avatar_split_clause,[],[f18,f46,f46]) ).
thf(f49,plain,
( ( sK0 != sK0 )
| ( $true
!= ( cS @ sK1 ) )
| ~ spl4_5
| ~ spl4_6 ),
inference(constrained_superposition,[],[f47,f41]) ).
thf(f50,plain,
( ( $true
!= ( cS @ sK1 ) )
| ~ spl4_5
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f51,plain,
( ~ spl4_2
| ~ spl4_5
| ~ spl4_6 ),
inference(avatar_split_clause,[],[f50,f46,f39,f24]) ).
thf(f52,plain,
( ( sK0
!= ( cF @ sK2 ) )
| ( $true
!= ( cS @ sK3 ) )
| ~ spl4_3
| ~ spl4_6 ),
inference(constrained_superposition,[],[f47,f31]) ).
thf(f53,plain,
( ~ spl4_1
| ~ spl4_4
| ~ spl4_3
| ~ spl4_6 ),
inference(avatar_split_clause,[],[f52,f46,f29,f34,f20]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f27]) ).
cnf(s2,plain,
( spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f32]) ).
cnf(s3,plain,
( spl4_2
| spl4_4 ),
inference(sat_conversion,[],[f37]) ).
cnf(s4,plain,
( spl4_1
| spl4_5 ),
inference(sat_conversion,[],[f42]) ).
cnf(s5,plain,
( spl4_3
| spl4_5 ),
inference(sat_conversion,[],[f43]) ).
cnf(s6,plain,
( spl4_4
| spl4_5 ),
inference(sat_conversion,[],[f44]) ).
cnf(s7,plain,
( spl4_6
| spl4_6 ),
inference(sat_conversion,[],[f48]) ).
cnf(s8,plain,
spl4_6,
inference(rat,[],[s7]) ).
cnf(s9,plain,
( ~ spl4_2
| ~ spl4_5
| ~ spl4_6 ),
inference(sat_conversion,[],[f51]) ).
cnf(s10,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_4
| ~ spl4_6 ),
inference(sat_conversion,[],[f53]) ).
cnf(s11,plain,
spl4_1,
inference(rat,[],[s9,s1,s4,s8]) ).
cnf(s12,plain,
spl4_2,
inference(rat,[],[s10,s2,s3,s11,s8]) ).
cnf(s13,plain,
~ spl4_5,
inference(rat,[],[s9,s8,s12]) ).
cnf(s14,plain,
spl4_4,
inference(rat,[],[s6,s13]) ).
cnf(s15,plain,
spl4_3,
inference(rat,[],[s5,s13]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s10,s8,s11,s14,s15]) ).
thf(f54,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU890^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 : n005.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 14:44:02 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.22 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 % (1758053)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1758064)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2867006128:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.09/0.25 % (1758064) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1758053-1758064"...
% 0.09/0.25 % (1758064)...printing done.
% 0.09/0.25 % (1758059)% WARNING: option uhcvi not known.
% 0.09/0.25 % (1758064)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 % (1758064)------------------------------
% 0.09/0.25 % (1758064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (1758064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (1758064)CaDiCaL version: 2.1.3
% 0.09/0.25 % (1758064)Termination reason: Refutation
% 0.09/0.25 % (1758064)Time elapsed: 0.002 s
% 0.09/0.25 % (1758064)Peak memory usage: 12 MB
% 0.09/0.25 % (1758064)Instructions burned: 3 (million)
% 0.09/0.25 % (1758053)Success in time 0.017 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------