%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU891^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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.18s 0.26s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 49 ( 6 unt; 0 typ; 4 def)
% Number of atoms : 196 ( 66 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 204 ( 45 ~; 51 |; 24 &; 76 @)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 9 !; 18 ?; 27 :)
% 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,
cS: b > $o ).
thf(func_def_2,type,
cR: b > $o ).
thf(func_def_6,type,
sK0: a ).
thf(func_def_7,type,
sK1: b ).
thf(func_def_8,type,
sK2: b ).
thf(f1,conjecture,
! [X0: a] :
( ( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cS @ X1 ) )
| ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cR @ X1 ) ) )
=> ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( ( cS @ X1 )
| ( cR @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM34B_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cS @ X1 ) )
| ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cR @ X1 ) ) )
=> ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( ( cS @ X1 )
| ( cR @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ( ? [X1: b] :
( ( X0
= ( cF @ X1 ) )
& ( cS @ X1 ) )
| ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( cR @ X2 ) ) )
=> ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
| ( cR @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cS @ X1 )
= $true ) )
| ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( ( cR @ X2 )
= $true ) ) )
=> ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( ( cS @ X3 )
= $true )
| ( ( cR @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ! [X3: b] :
( ( ( cF @ X3 )
!= X0 )
| ( ( ( cS @ X3 )
!= $true )
& ( ( cR @ X3 )
!= $true ) ) )
& ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cS @ X1 )
= $true ) )
| ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( ( cR @ X2 )
= $true ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ! [X1: b] :
( ( ( cF @ X1 )
!= X0 )
| ( ( ( cS @ X1 )
!= $true )
& ( ( cR @ X1 )
!= $true ) ) )
& ( ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( $true
= ( cS @ X2 ) ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cR @ X3 )
= $true ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( ( cS @ X1 )
!= $true )
& ( ( cR @ X1 )
!= $true ) ) )
& ( ( ( sK0
= ( cF @ sK1 ) )
& ( $true
= ( cS @ sK1 ) ) )
| ( ( sK0
= ( cF @ sK2 ) )
& ( $true
= ( cR @ sK2 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X2,sK1),skolemize(X3,sK2)],[f6]) ).
thf(f8,plain,
( ( $true
= ( cS @ sK1 ) )
| ( $true
= ( cR @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( $true
= ( cS @ sK1 ) )
| ( sK0
= ( cF @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( sK0
= ( cF @ sK1 ) )
| ( $true
= ( cR @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( sK0
= ( cF @ sK1 ) )
| ( sK0
= ( cF @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( cR @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( cS @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f41,definition,
( spl3_4
<=> ( $true
= ( cR @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
thf(f42,plain,
( ( $true
!= ( cR @ sK2 ) )
| spl3_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f43,plain,
( ( $true
= ( cR @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f45,definition,
( spl3_5
<=> ( $true
= ( cS @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
thf(f47,plain,
( ( $true
= ( cS @ sK1 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f48,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f8,f45,f41]) ).
thf(f50,definition,
( spl3_6
<=> ( sK0
= ( cF @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
thf(f52,plain,
( ( sK0
= ( cF @ sK2 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f53,plain,
( spl3_6
| spl3_5 ),
inference(avatar_split_clause,[],[f9,f45,f50]) ).
thf(f55,definition,
( spl3_7
<=> ( sK0
= ( cF @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
thf(f56,plain,
( ( sK0
!= ( cF @ sK1 ) )
| spl3_7 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f57,plain,
( ( sK0
= ( cF @ sK1 ) )
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f58,plain,
( spl3_6
| spl3_7 ),
inference(avatar_split_clause,[],[f11,f55,f50]) ).
thf(f60,plain,
( ( sK0 != sK0 )
| ( $true
!= ( cR @ sK2 ) )
| ~ spl3_6 ),
inference(constrained_superposition,[],[f12,f52]) ).
thf(f61,plain,
( ( $true
!= ( cR @ sK2 ) )
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f63,plain,
( $false
| ~ spl3_4
| ~ spl3_6 ),
inference(forward_subsumption_resolution,[],[f61,f43]) ).
thf(f64,plain,
( ~ spl3_4
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f63]) ).
thf(f65,plain,
( ( sK0 != sK0 )
| ( $true
!= ( cS @ sK1 ) )
| ~ spl3_7 ),
inference(constrained_superposition,[],[f13,f57]) ).
thf(f68,plain,
( ( $true
!= ( cS @ sK1 ) )
| ~ spl3_7 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f69,plain,
( $false
| ~ spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f68,f47]) ).
thf(f70,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f69]) ).
thf(f75,plain,
( ( $true
= ( cR @ sK2 ) )
| spl3_7 ),
inference(forward_subsumption_resolution,[],[f10,f56]) ).
thf(f76,plain,
( $false
| spl3_4
| spl3_7 ),
inference(forward_subsumption_resolution,[],[f75,f42]) ).
thf(f77,plain,
( spl3_4
| spl3_7 ),
inference(avatar_contradiction_clause,[],[f76]) ).
cnf(s37,plain,
( spl3_4
| spl3_5 ),
inference(sat_conversion,[],[f48]) ).
cnf(s41,plain,
( spl3_5
| spl3_6 ),
inference(sat_conversion,[],[f53]) ).
cnf(s45,plain,
( spl3_6
| spl3_7 ),
inference(sat_conversion,[],[f58]) ).
cnf(s48,plain,
( ~ spl3_4
| ~ spl3_6 ),
inference(sat_conversion,[],[f64]) ).
cnf(s55,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(sat_conversion,[],[f70]) ).
cnf(s65,plain,
( spl3_4
| spl3_7 ),
inference(sat_conversion,[],[f77]) ).
cnf(s66,plain,
spl3_4,
inference(rat,[],[s55,s37,s65]) ).
cnf(s67,plain,
~ spl3_6,
inference(rat,[],[s48,s66]) ).
cnf(s68,plain,
spl3_7,
inference(rat,[],[s45,s67]) ).
cnf(s69,plain,
spl3_5,
inference(rat,[],[s41,s67]) ).
cnf(s70,plain,
$false,
inference(rat,[],[s55,s68,s69]) ).
thf(f78,plain,
$false,
inference(avatar_sat_refutation,[],[s70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU891^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n020.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:45:05 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.18/0.26 % (1146161)Will run a generic schedule for satisfiability detection.
% 0.18/0.26 % (1146168)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2144291786:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.26 % (1146168) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146161-1146168"...
% 0.18/0.26 % (1146168)...printing done.
% 0.18/0.26 % (1146167)% WARNING: option uhcvi not known.
% 0.18/0.26 % (1146168)Refutation found. Thanks to Tanya!
% 0.18/0.26 % SZS status Theorem for theBenchmark
% 0.18/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26 % (1146168)------------------------------
% 0.18/0.26 % (1146168)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26 % (1146168)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26 % (1146168)CaDiCaL version: 2.1.3
% 0.18/0.26 % (1146168)Termination reason: Refutation
% 0.18/0.26 % (1146168)Time elapsed: 0.002 s
% 0.18/0.26 % (1146168)Peak memory usage: 12 MB
% 0.18/0.26 % (1146168)Instructions burned: 4 (million)
% 0.18/0.26 % (1146161)Success in time 0.036 s
% 0.18/0.26 % Vampire exiting
%------------------------------------------------------------------------------