%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV233^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 : n013.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:11 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 6 unt; 0 typ; 4 def)
% Number of atoms : 237 ( 54 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 194 ( 43 ~; 38 |; 20 &; 73 @)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 21 !; 6 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cE: $i > $o ).
thf(func_def_1,type,
cD: $i > $o ).
thf(func_def_5,type,
sK0: $i > $o ).
thf(f1,conjecture,
! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( ( cE @ X1 )
& ( cD @ X1 ) ) )
=> ( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cE @ X1 ) )
& ! [X1: $i] :
( ( X0 @ X1 )
=> ( cD @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM46_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( ( cE @ X1 )
& ( cD @ X1 ) ) )
=> ( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cE @ X1 ) )
& ! [X1: $i] :
( ( X0 @ X1 )
=> ( cD @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( ( cE @ X1 )
& ( cD @ X1 ) ) )
=> ( ! [X2: $i] :
( ( X0 @ X2 )
=> ( cE @ X2 ) )
& ! [X3: $i] :
( ( X0 @ X3 )
=> ( cD @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i > $o] :
( ! [X1: $i] :
( ( ( X0 @ X1 )
= $true )
=> ( ( ( cE @ X1 )
= $true )
& ( ( cD @ X1 )
= $true ) ) )
=> ( ! [X2: $i] :
( ( ( X0 @ X2 )
= $true )
=> ( ( cE @ X2 )
= $true ) )
& ! [X3: $i] :
( ( ( X0 @ X3 )
= $true )
=> ( ( cD @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: $i > $o] :
( ( ? [X2: $i] :
( ( ( cE @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ? [X3: $i] :
( ( ( cD @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) ) )
& ! [X1: $i] :
( ( ( ( cE @ X1 )
= $true )
& ( ( cD @ X1 )
= $true ) )
| ( ( X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: $i > $o] :
( ( ? [X1: $i] :
( ( ( cE @ X1 )
!= $true )
& ( ( X0 @ X1 )
= $true ) )
| ? [X2: $i] :
( ( $true
!= ( cD @ X2 ) )
& ( ( X0 @ X2 )
= $true ) ) )
& ! [X3: $i] :
( ( ( $true
= ( cE @ X3 ) )
& ( ( cD @ X3 )
= $true ) )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( ( ( $true
!= ( cE @ sK1 ) )
& ( $true
= ( sK0 @ sK1 ) ) )
| ( ( $true
!= ( cD @ sK2 ) )
& ( $true
= ( sK0 @ sK2 ) ) ) )
& ! [X3: $i] :
( ( ( $true
= ( cE @ X3 ) )
& ( ( cD @ X3 )
= $true ) )
| ( $true
!= ( sK0 @ X3 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
thf(f8,plain,
! [X3: $i] :
( ( $true
!= ( sK0 @ X3 ) )
| ( ( cD @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X3: $i] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( cE @ X3 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ( $true
!= ( cD @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
( ( $true
!= ( cE @ sK1 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
( ( $true
!= ( cE @ sK1 ) )
| ( $true
!= ( cD @ sK2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f17,definition,
( spl3_1
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f19,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f21,definition,
( spl3_2
<=> ( $true
= ( sK0 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f23,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f24,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f10,f21,f17]) ).
thf(f26,definition,
( spl3_3
<=> ( $true
= ( cD @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f28,plain,
( ( $true
!= ( cD @ sK2 ) )
| spl3_3 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f29,plain,
( ~ spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f11,f21,f26]) ).
thf(f31,definition,
( spl3_4
<=> ( $true
= ( cE @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
thf(f33,plain,
( ( $true
!= ( cE @ sK1 ) )
| spl3_4 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f34,plain,
( spl3_1
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f12,f31,f17]) ).
thf(f35,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f13,f31,f26]) ).
thf(f38,plain,
( ( $true != $true )
| ( $true
= ( cE @ sK1 ) )
| ~ spl3_2 ),
inference(constrained_superposition,[],[f9,f23]) ).
thf(f39,plain,
( ( $true
= ( cE @ sK1 ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f40,plain,
( $false
| ~ spl3_2
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f39,f33]) ).
thf(f41,plain,
( ~ spl3_2
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f43,plain,
( ( $true != $true )
| ( $true
= ( cD @ sK2 ) )
| ~ spl3_1 ),
inference(constrained_superposition,[],[f8,f19]) ).
thf(f44,plain,
( ( $true
= ( cD @ sK2 ) )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f46,plain,
( $false
| ~ spl3_1
| spl3_3 ),
inference(forward_subsumption_resolution,[],[f44,f28]) ).
thf(f47,plain,
( ~ spl3_1
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f46]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
( spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f29]) ).
cnf(s3,plain,
( spl3_1
| ~ spl3_4 ),
inference(sat_conversion,[],[f34]) ).
cnf(s4,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f35]) ).
cnf(s5,plain,
( ~ spl3_2
| spl3_4 ),
inference(sat_conversion,[],[f41]) ).
cnf(s6,plain,
( ~ spl3_1
| spl3_3 ),
inference(sat_conversion,[],[f47]) ).
cnf(s7,plain,
spl3_1,
inference(rat,[],[s5,s1,s3]) ).
cnf(s8,plain,
spl3_3,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
~ spl3_4,
inference(rat,[],[s4,s8]) ).
cnf(s10,plain,
spl3_2,
inference(rat,[],[s2,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s5,s9,s10]) ).
thf(f48,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV233^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n013.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.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 15:22:51 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.08/0.26 % (2246482)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (2246492)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4268390464:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26 % (2246492) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2246482-2246492"...
% 0.08/0.26 % (2246492)...printing done.
% 0.08/0.26 % (2246492)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26 % (2246492)------------------------------
% 0.08/0.26 % (2246492)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (2246492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (2246492)CaDiCaL version: 2.1.3
% 0.08/0.26 % (2246492)Termination reason: Refutation
% 0.08/0.26 % (2246492)Time elapsed: 0.001 s
% 0.08/0.26 % (2246492)Peak memory usage: 12 MB
% 0.08/0.26 % (2246492)Instructions burned: 2 (million)
% 0.08/0.26 % (2246482)Success in time 0.027 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------