%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV413^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 : n001.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:29 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 7 unt; 0 typ; 5 def)
% Number of atoms : 299 ( 62 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 245 ( 59 ~; 64 |; 13 &; 84 @)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 26 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cB: $i > $o ).
thf(func_def_1,type,
cA: $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
| ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) ) )
=> ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
& ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDUAL_EG5_pme) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
| ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) ) )
=> ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
& ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
| ! [X1: $i] :
( ( cA @ X1 )
=> ( cB @ X1 ) ) )
=> ( ! [X2: $i] :
( ( cA @ X2 )
=> ( cB @ X2 ) )
& ! [X3: $i] :
( ( cA @ X3 )
=> ( cB @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] :
( ( ( cA @ X0 )
= $true )
=> ( ( cB @ X0 )
= $true ) )
| ! [X1: $i] :
( ( ( cA @ X1 )
= $true )
=> ( ( cB @ X1 )
= $true ) ) )
=> ( ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
=> ( ( cB @ X2 )
= $true ) )
& ! [X3: $i] :
( ( ( cA @ X3 )
= $true )
=> ( ( cB @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ? [X2: $i] :
( ( ( cB @ X2 )
!= $true )
& ( ( cA @ X2 )
= $true ) )
| ? [X3: $i] :
( ( ( cB @ X3 )
!= $true )
& ( ( cA @ X3 )
= $true ) ) )
& ( ! [X0: $i] :
( ( ( cB @ X0 )
= $true )
| ( ( cA @ X0 )
!= $true ) )
| ! [X1: $i] :
( ( ( cB @ X1 )
= $true )
| ( ( cA @ X1 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ? [X0: $i] :
( ( ( cB @ X0 )
!= $true )
& ( ( cA @ X0 )
= $true ) )
| ? [X1: $i] :
( ( ( cB @ X1 )
!= $true )
& ( ( cA @ X1 )
= $true ) ) )
& ( ! [X2: $i] :
( ( ( cB @ X2 )
= $true )
| ( ( cA @ X2 )
!= $true ) )
| ! [X3: $i] :
( ( ( cB @ X3 )
= $true )
| ( ( cA @ X3 )
!= $true ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( ( ( $true
!= ( cB @ sK0 ) )
& ( $true
= ( cA @ sK0 ) ) )
| ( ( $true
!= ( cB @ sK1 ) )
& ( $true
= ( cA @ sK1 ) ) ) )
& ( ! [X2: $i] :
( ( ( cB @ X2 )
= $true )
| ( ( cA @ X2 )
!= $true ) )
| ! [X3: $i] :
( ( ( cB @ X3 )
= $true )
| ( ( cA @ X3 )
!= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
! [X2: $i,X3: $i] :
( ( ( cB @ X2 )
= $true )
| ( ( cA @ X2 )
!= $true )
| ( ( cB @ X3 )
= $true )
| ( ( cA @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( $true
= ( cA @ sK0 ) )
| ( $true
= ( cA @ sK1 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( $true
= ( cA @ sK0 ) )
| ( $true
!= ( cB @ sK1 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( $true
!= ( cB @ sK0 ) )
| ( $true
= ( cA @ sK1 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
( ( $true
!= ( cB @ sK0 ) )
| ( $true
!= ( cB @ sK1 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f16,definition,
( spl2_1
<=> ! [X3: $i] :
( ( ( cB @ X3 )
= $true )
| ( ( cA @ X3 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f17,plain,
( ! [X3: $i] :
( ( ( cA @ X3 )
!= $true )
| ( ( cB @ X3 )
= $true ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f16]) ).
thf(f18,plain,
( spl2_1
| spl2_1 ),
inference(avatar_split_clause,[],[f8,f16,f16]) ).
thf(f20,definition,
( spl2_2
<=> ( $true
= ( cA @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f22,plain,
( ( $true
= ( cA @ sK1 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f24,definition,
( spl2_3
<=> ( $true
= ( cA @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f26,plain,
( ( $true
= ( cA @ sK0 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f27,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f9,f24,f20]) ).
thf(f29,definition,
( spl2_4
<=> ( $true
= ( cB @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f31,plain,
( ( $true
!= ( cB @ sK1 ) )
| spl2_4 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f32,plain,
( ~ spl2_4
| spl2_3 ),
inference(avatar_split_clause,[],[f10,f24,f29]) ).
thf(f34,definition,
( spl2_5
<=> ( $true
= ( cB @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f36,plain,
( ( $true
!= ( cB @ sK0 ) )
| spl2_5 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f37,plain,
( spl2_2
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f11,f34,f20]) ).
thf(f38,plain,
( ~ spl2_4
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f12,f34,f29]) ).
thf(f39,plain,
( ( $true != $true )
| ( $true
= ( cB @ sK0 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(constrained_superposition,[],[f17,f26]) ).
thf(f40,plain,
( ( $true
= ( cB @ sK0 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f41,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| spl2_5 ),
inference(forward_subsumption_resolution,[],[f40,f36]) ).
thf(f42,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_5 ),
inference(avatar_contradiction_clause,[],[f41]) ).
thf(f43,plain,
( ( $true != $true )
| ( $true
= ( cB @ sK1 ) )
| ~ spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f17,f22]) ).
thf(f44,plain,
( ( $true
= ( cB @ sK1 ) )
| ~ spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f45,plain,
( $false
| ~ spl2_1
| ~ spl2_2
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f44,f31]) ).
thf(f46,plain,
( ~ spl2_1
| ~ spl2_2
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f45]) ).
cnf(s1,plain,
( spl2_1
| spl2_1 ),
inference(sat_conversion,[],[f18]) ).
cnf(s2,plain,
spl2_1,
inference(rat,[],[s1]) ).
cnf(s3,plain,
( spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f27]) ).
cnf(s4,plain,
( spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f32]) ).
cnf(s5,plain,
( spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f37]) ).
cnf(s6,plain,
( ~ spl2_4
| ~ spl2_5 ),
inference(sat_conversion,[],[f38]) ).
cnf(s7,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_5 ),
inference(sat_conversion,[],[f42]) ).
cnf(s8,plain,
( ~ spl2_1
| ~ spl2_2
| spl2_4 ),
inference(sat_conversion,[],[f46]) ).
cnf(s9,plain,
spl2_2,
inference(rat,[],[s7,s3,s5,s2]) ).
cnf(s10,plain,
spl2_4,
inference(rat,[],[s8,s2,s9]) ).
cnf(s11,plain,
~ spl2_5,
inference(rat,[],[s6,s10]) ).
cnf(s12,plain,
spl2_3,
inference(rat,[],[s4,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s7,s2,s11,s12]) ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV413^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.08/0.20 % Computer : n001.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 15:51:30 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.20/0.27 % (1407259)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1407269)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=534336833:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (1407269) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1407259-1407269"...
% 0.20/0.27 % (1407269)...printing done.
% 0.20/0.27 % (1407269)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1407269)------------------------------
% 0.20/0.27 % (1407269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1407269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1407269)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1407269)Termination reason: Refutation
% 0.20/0.27 % (1407269)Time elapsed: 0.002 s
% 0.20/0.27 % (1407269)Peak memory usage: 13 MB
% 0.20/0.27 % (1407269)Instructions burned: 2 (million)
% 0.20/0.27 % (1407259)Success in time 0.028 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------