%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO351^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 : n003.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:46 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 14 unt; 0 typ; 3 def)
% Number of atoms : 237 ( 65 equ; 2 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 188 ( 50 ~; 46 |; 0 &; 70 @)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 14 usr; 9 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 73 ( 28 sgn 12 !; 0 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
vIMP: $o > $o > $o ).
thf(func_def_3,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_9,type,
vNOT: $o > $o ).
thf(func_def_10,type,
sK0: a > $o ).
thf(func_def_11,type,
sK1: a ).
thf(func_def_13,type,
sK3: a ).
thf(f1,conjecture,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
= ( ^ [X2: a > $o] :
( ( ^ [X1: a] : $false )
= X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE6EXT_pme) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
!= ( ^ [X2: a > $o] :
( ( ^ [X1: a] : $false )
= X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
!= ( ^ [X2: a > $o] :
( ( ^ [X3: a] : $false )
= X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( ( ^ [Y1: a] : $false )
= Y0 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( ( ^ [Y1: a] : $false )
= Y0 ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( ( ^ [Y1: a] : $false )
= Y0 ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f9,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( (=)
@ ^ [Y0: a] : $false ) ),
inference(beta-eta_normalization,[],[f6]) ).
thf(f10,plain,
( ( (=)
@ ^ [Y0: a] : $false )
!= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) ) ) ),
inference(boolean_simplification,[],[f9]) ).
thf(f11,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
!= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK0 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f12,plain,
( ( $true
= ( ( ^ [Y0: a] : $false )
= sK0 ) )
| ( $true
= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f11]) ).
thf(f13,plain,
( ( $false
= ( ( ^ [Y0: a] : $false )
= sK0 ) )
| ( $false
= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f11]) ).
thf(f14,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( $false
= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f13]) ).
thf(f15,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( $false
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK0 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f14]) ).
thf(f16,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( $false
= ( ^ [Y0: a] :
~ ( sK0 @ Y0 )
@ sK1 ) ) ),
inference(sigma_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( $false
= ( ~ ( sK0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f16]) ).
thf(f18,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( $true
= ( sK0 @ sK1 ) ) ),
inference(not_proxy_clausification,[],[f17]) ).
thf(f19,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( $true
= ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f12]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( $true
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK0 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
! [X1: a] :
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( $true
= ( ^ [Y0: a] :
~ ( sK0 @ Y0 )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f22,plain,
! [X1: a] :
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( $true
= ( ~ ( sK0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X1: a] :
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( $false
= ( sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f22]) ).
thf(f25,definition,
( spl2_1
<=> ( $true
= ( sK0 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f27,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f29,definition,
( spl2_2
<=> ( ( ^ [Y0: a] : $false )
= sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f30,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f31,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| spl2_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f32,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f18,f29,f25]) ).
thf(f34,definition,
( spl2_3
<=> ! [X1: a] :
( $false
= ( sK0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f35,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f36,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f23,f29,f34]) ).
thf(f46,plain,
( ( ( ^ [Y0: a] : $false
@ sK3 )
!= ( sK0 @ sK3 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f31]) ).
thf(f47,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f46]) ).
thf(f50,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f51,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f52,plain,
( ( $false = $true )
| spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[],[f51,f35]) ).
thf(f53,plain,
( $false
| spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f54,plain,
( spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f53]) ).
thf(f55,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_3 ),
inference(forward_demodulation,[],[f27,f35]) ).
thf(f56,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f57,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f56]) ).
thf(f58,plain,
( ! [X1: a] :
( ( sK0 @ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f30]) ).
thf(f60,plain,
( ! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true
= ( ^ [Y0: a] : $false
@ X1 ) ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f58]) ).
thf(f61,plain,
( ! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $false = $true ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f62,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f64,plain,
( spl2_3
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f62,f29,f34]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f32]) ).
cnf(s2,plain,
( spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f36]) ).
cnf(s3,plain,
( spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f54]) ).
cnf(s4,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(sat_conversion,[],[f57]) ).
cnf(s5,plain,
( ~ spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f64]) ).
cnf(s6,plain,
spl2_2,
inference(rat,[],[s2,s3]) ).
cnf(s7,plain,
spl2_3,
inference(rat,[],[s5,s6]) ).
cnf(s8,plain,
spl2_1,
inference(rat,[],[s1,s6]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s4,s7,s8]) ).
thf(f65,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO351^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n003.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:49:59 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.25 % (2741089)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (2741102)dis+10_1_sil=32000:sp=arity:random_seed=1243753496:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25 % (2741102) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2741089-2741102"...
% 0.09/0.25 % (2741102)...printing done.
% 0.09/0.25 % (2741100)% WARNING: option uhcvi not known.
% 0.09/0.25 % (2741102)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (2741102)------------------------------
% 0.09/0.25 % (2741102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (2741102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (2741102)CaDiCaL version: 2.1.3
% 0.09/0.25 % (2741102)Termination reason: Refutation
% 0.09/0.25 % (2741102)Time elapsed: 0.002 s
% 0.09/0.25 % (2741102)Peak memory usage: 12 MB
% 0.09/0.25 % (2741102)Instructions burned: 3 (million)
% 0.09/0.25 % (2741089)Success in time 0.031 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------