%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO358^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 : n006.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:49:47 AM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 192 ( 62 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 167 ( 42 ~; 32 |; 26 &; 50 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 22 ( 0 sgn 15 !; 3 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
atype: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $o ).
thf(func_def_1,type,
v: atype ).
thf(func_def_2,type,
b: $o ).
thf(func_def_3,type,
u: atype ).
thf(func_def_7,type,
sK0: atype > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_10,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( ~ a
| a ) )
=> ( ( X1 @ v )
& ( ~ b
| b ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE2LEIBEQ1_pme) ).
thf(f2,negated_conjecture,
~ ( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( ~ a
| a ) )
=> ( ( X1 @ v )
& ( ~ b
| b ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( ~ a
| a ) )
=> ( ( X1 @ v )
& ( ~ b
| b ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
= $true )
=> ( ( X0 @ v )
= $true ) )
=> ! [X1: atype > $o] :
( ( ( ( X1 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( ( X1 @ v )
= $true )
& ( ( b != $true )
| ( b = $true ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
= $true )
=> ( ( X0 @ v )
= $true ) )
=> ! [X1: atype > $o] :
( ( ( ( X1 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( ( X1 @ v )
= $true )
& ( ( b != $true )
| ( b = $true ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ? [X1: atype > $o] :
( ( ( ( X1 @ v )
!= $true )
| ( ( b = $true )
& ( b != $true ) ) )
& ( ( X1 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
& ! [X0: atype > $o] :
( ( ( X0 @ v )
= $true )
| ( ( X0 @ u )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ? [X1: atype > $o] :
( ( ( ( X1 @ v )
!= $true )
| ( ( b = $true )
& ( b != $true ) ) )
& ( ( X1 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
& ! [X0: atype > $o] :
( ( ( X0 @ v )
= $true )
| ( ( X0 @ u )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ? [X0: atype > $o] :
( ( ( ( X0 @ v )
!= $true )
| ( ( b = $true )
& ( b != $true ) ) )
& ( ( X0 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
& ! [X1: atype > $o] :
( ( ( X1 @ v )
= $true )
| ( ( X1 @ u )
!= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( ( $true
!= ( sK0 @ v ) )
| ( ( b = $true )
& ( b != $true ) ) )
& ( $true
= ( sK0 @ u ) )
& ( ( a != $true )
| ( a = $true ) )
& ! [X1: atype > $o] :
( ( ( X1 @ v )
= $true )
| ( ( X1 @ u )
!= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f8]) ).
thf(f10,plain,
! [X1: atype > $o] :
( ( ( X1 @ u )
!= $true )
| ( ( X1 @ v )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( $true
= ( sK0 @ u ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( ( $true
!= ( sK0 @ v ) )
| ( b != $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( ( $true
!= ( sK0 @ v ) )
| ( b = $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f18,definition,
( spl1_1
<=> ( b = $true ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
thf(f22,definition,
( spl1_2
<=> ( $true
= ( sK0 @ v ) ) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
thf(f24,plain,
( ( $true
!= ( sK0 @ v ) )
| spl1_2 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f25,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f13,f22,f18]) ).
thf(f26,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f14,f22,f18]) ).
thf(f32,plain,
( ( $true != $true )
| ( $true
= ( ^ [Y0: atype] :
( sK0
@ ( ^ [Y1: atype] : Y1
@ Y0 ) )
@ v ) ) ),
inference(constrained_superposition,[],[f10,f12]) ).
thf(f38,plain,
( $true
= ( ^ [Y0: atype] :
( sK0
@ ( ^ [Y1: atype] : Y1
@ Y0 ) )
@ v ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f39,plain,
( $true
= ( sK0 @ v ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f45,plain,
( $false
| spl1_2 ),
inference(forward_subsumption_resolution,[],[f39,f24]) ).
thf(f46,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f45]) ).
cnf(s1,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f25]) ).
cnf(s2,plain,
( spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s3,plain,
spl1_2,
inference(sat_conversion,[],[f46]) ).
cnf(s4,plain,
spl1_1,
inference(rat,[],[s2,s3]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s3,s4]) ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO358^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.10/0.19 % Computer : n006.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:48:24 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/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.19/0.26 % (1002926)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (1002932)% WARNING: option uhcvi not known.
% 0.19/0.26 % (1002932)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=907080295:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26 % (1002932)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.26 % (1002932)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.26 % (1002932) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1002926-1002932"...
% 0.19/0.26 % (1002932)...printing done.
% 0.19/0.26 % (1002932)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (1002932)------------------------------
% 0.19/0.26 % (1002932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (1002932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (1002932)CaDiCaL version: 2.1.3
% 0.19/0.26 % (1002932)Termination reason: Refutation
% 0.19/0.26 % (1002932)Time elapsed: 0.002 s
% 0.19/0.26 % (1002932)Peak memory usage: 12 MB
% 0.19/0.26 % (1002932)Instructions burned: 2 (million)
% 0.19/0.26 % (1002926)Success in time 0.034 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------