%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV060^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 : n007.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:38:56 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 9 unt; 0 typ; 3 def)
% Number of atoms : 185 ( 77 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 253 ( 48 ~; 41 |; 26 &; 120 @)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 52 !; 18 ?; 70 :)
% 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_3,type,
sK0: b ).
thf(func_def_4,type,
sK1: a ).
thf(func_def_5,type,
sK2: b > a > $o ).
thf(func_def_6,type,
sK3: b > a > $o ).
thf(func_def_7,type,
sK4: b ).
thf(func_def_8,type,
sK5: a ).
thf(f1,conjecture,
! [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ( ~ ( X3 @ X0 @ X1 )
& ! [X4: b,X5: a] :
( ( X3 @ X4 @ X5 )
=> ( ( ( X5 = X1 )
& ( X4 = X0 ) )
| ( X2 @ X4 @ X5 ) ) ) )
=> ! [X6: b,X7: a] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM173_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ( ~ ( X3 @ X0 @ X1 )
& ! [X4: b,X5: a] :
( ( X3 @ X4 @ X5 )
=> ( ( ( X5 = X1 )
& ( X4 = X0 ) )
| ( X2 @ X4 @ X5 ) ) ) )
=> ! [X6: b,X7: a] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ( ~ ( X3 @ X0 @ X1 )
& ! [X4: b,X5: a] :
( ( X3 @ X4 @ X5 )
=> ( ( ( X5 = X1 )
& ( X4 = X0 ) )
| ( X2 @ X4 @ X5 ) ) ) )
=> ! [X6: b,X7: a] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ( ( ( X3 @ X0 @ X1 )
!= $true )
& ! [X4: b,X5: a] :
( ( ( X3 @ X4 @ X5 )
= $true )
=> ( ( ( X1 = X5 )
& ( X0 = X4 ) )
| ( ( X2 @ X4 @ X5 )
= $true ) ) ) )
=> ! [X6: b,X7: a] :
( ( ( X3 @ X6 @ X7 )
= $true )
=> ( ( X2 @ X6 @ X7 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ( ( ( X3 @ X0 @ X1 )
!= $true )
& ! [X4: b,X5: a] :
( ( ( X3 @ X4 @ X5 )
= $true )
=> ( ( ( X1 = X5 )
& ( X0 = X4 ) )
| ( ( X2 @ X4 @ X5 )
= $true ) ) ) )
=> ! [X6: b,X7: a] :
( ( ( X3 @ X6 @ X7 )
= $true )
=> ( ( X2 @ X6 @ X7 )
= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ? [X6: b,X7: a] :
( ( ( X2 @ X6 @ X7 )
!= $true )
& ( ( X3 @ X6 @ X7 )
= $true ) )
& ( ( X3 @ X0 @ X1 )
!= $true )
& ! [X4: b,X5: a] :
( ( ( X1 = X5 )
& ( X0 = X4 ) )
| ( ( X2 @ X4 @ X5 )
= $true )
| ( ( X3 @ X4 @ X5 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ? [X6: b,X7: a] :
( ( ( X2 @ X6 @ X7 )
!= $true )
& ( ( X3 @ X6 @ X7 )
= $true ) )
& ( ( X3 @ X0 @ X1 )
!= $true )
& ! [X4: b,X5: a] :
( ( ( X1 = X5 )
& ( X0 = X4 ) )
| ( ( X2 @ X4 @ X5 )
= $true )
| ( ( X3 @ X4 @ X5 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
? [X0: b,X1: a,X2: b > a > $o,X3: b > a > $o] :
( ? [X4: b,X5: a] :
( ( ( X2 @ X4 @ X5 )
!= $true )
& ( ( X3 @ X4 @ X5 )
= $true ) )
& ( ( X3 @ X0 @ X1 )
!= $true )
& ! [X6: b,X7: a] :
( ( ( X1 = X7 )
& ( X0 = X6 ) )
| ( ( X2 @ X6 @ X7 )
= $true )
| ( ( X3 @ X6 @ X7 )
!= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( $true
!= ( sK2 @ sK4 @ sK5 ) )
& ( $true
= ( sK3 @ sK4 @ sK5 ) )
& ( $true
!= ( sK3 @ sK0 @ sK1 ) )
& ! [X6: b,X7: a] :
( ( ( sK1 = X7 )
& ( sK0 = X6 ) )
| ( $true
= ( sK2 @ X6 @ X7 ) )
| ( $true
!= ( sK3 @ X6 @ X7 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f8]) ).
thf(f10,plain,
! [X6: b,X7: a] :
( ( $true
!= ( sK3 @ X6 @ X7 ) )
| ( $true
= ( sK2 @ X6 @ X7 ) )
| ( sK0 = X6 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
! [X6: b,X7: a] :
( ( $true
!= ( sK3 @ X6 @ X7 ) )
| ( $true
= ( sK2 @ X6 @ X7 ) )
| ( sK1 = X7 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( $true
!= ( sK3 @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( $true
= ( sK3 @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( $true
!= ( sK2 @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f17,plain,
( ( $true != $true )
| ( $true
= ( sK2 @ sK4 @ sK5 ) )
| ( sK0 = sK4 ) ),
inference(constrained_superposition,[],[f10,f13]) ).
thf(f18,plain,
( ( $true
= ( sK2 @ sK4 @ sK5 ) )
| ( sK0 = sK4 ) ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f20,definition,
( spl6_1
<=> ( sK0 = sK4 ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
thf(f22,plain,
( ( sK0 = sK4 )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f24,definition,
( spl6_2
<=> ( $true
= ( sK2 @ sK4 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
thf(f26,plain,
( ( $true
= ( sK2 @ sK4 @ sK5 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f27,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f18,f24,f20]) ).
thf(f28,plain,
( ( $true != $true )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f14,f26]) ).
thf(f29,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f30,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f29]) ).
thf(f32,plain,
( ( $true
= ( sK3 @ sK0 @ sK5 ) )
| ~ spl6_1 ),
inference(constrained_superposition,[],[f13,f22]) ).
thf(f33,plain,
( ( $true != $true )
| ( $true
= ( sK2 @ sK4 @ sK5 ) )
| ( sK1 = sK5 ) ),
inference(constrained_superposition,[],[f11,f13]) ).
thf(f36,plain,
( ( $true
= ( sK2 @ sK4 @ sK5 ) )
| ( sK1 = sK5 ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f38,definition,
( spl6_3
<=> ( sK1 = sK5 ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
thf(f40,plain,
( ( sK1 = sK5 )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f46,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f36,f24,f38]) ).
thf(f47,plain,
( ( $true
= ( sK3 @ sK0 @ sK1 ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(constrained_superposition,[],[f32,f40]) ).
thf(f55,plain,
( ( $true != $true )
| ~ spl6_1
| ~ spl6_3 ),
inference(constrained_superposition,[],[f12,f47]) ).
thf(f56,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f57,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f56]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f27]) ).
cnf(s2,plain,
~ spl6_2,
inference(sat_conversion,[],[f30]) ).
cnf(s4,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f46]) ).
cnf(s5,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f57]) ).
cnf(s6,plain,
spl6_3,
inference(rat,[],[s4,s2]) ).
cnf(s7,plain,
~ spl6_1,
inference(rat,[],[s5,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s2,s7]) ).
thf(f58,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV060^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.19 % Computer : n007.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:03:56 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.19/0.28 % (3477012)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (3477032)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3987051999:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % (3477032) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3477012-3477032"...
% 0.19/0.28 % (3477027)% WARNING: option uhcvi not known.
% 0.19/0.28 % (3477032)...printing done.
% 0.19/0.28 % (3477032)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (3477032)------------------------------
% 0.19/0.28 % (3477032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (3477032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (3477032)CaDiCaL version: 2.1.3
% 0.19/0.28 % (3477032)Termination reason: Refutation
% 0.19/0.28 % (3477032)Time elapsed: 0.002 s
% 0.19/0.28 % (3477032)Peak memory usage: 13 MB
% 0.19/0.28 % (3477032)Instructions burned: 4 (million)
% 0.19/0.28 % (3477012)Success in time 0.037 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------