%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET591^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 : 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:23:39 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 29 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 74 ( 20 ~; 5 |; 9 &; 30 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 31 ( 10 ^; 19 !; 2 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X2: a] : $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_50_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X2: a] : $false ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X3: a] : $false ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) )
=> ( ( ^ [Y0: a] : $false )
= X0 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) )
=> ( ( ^ [Y0: a] : $false )
= X0 ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X0 )
& ! [X2: a] :
( ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) )
| ( ( X0 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
& ! [X2: a] :
( ( ( $true
!= ( sK0 @ X2 ) )
& ( $true
= ( sK1 @ X2 ) ) )
| ( $true
!= ( sK0 @ X2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f9,plain,
! [X2: a] :
( ( $true
!= ( sK0 @ X2 ) )
| ( $true
!= ( sK0 @ X2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( ^ [Y0: a] : $false )
!= sK0 ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X2: a] :
( $true
!= ( sK0 @ X2 ) ),
inference(duplicate_literal_removal,[],[f9]) ).
thf(f14,plain,
( ( ^ [Y0: a] : $false
@ sK2 )
!= ( sK0 @ sK2 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f15,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f14]) ).
thf(f18,plain,
( ( $true = $false )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(beta-eta_normalization,[],[f15]) ).
thf(f19,plain,
( $true
= ( sK0 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f20,plain,
$false,
inference(forward_subsumption_resolution,[],[f19,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET591^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n007.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:36:26 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.22 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.07/0.24 % (3364890)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (3364900)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2815404285:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.24 % (3364900) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3364890-3364900"...
% 0.07/0.24 % (3364900)...printing done.
% 0.07/0.24 % (3364900)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24 % (3364900)------------------------------
% 0.07/0.24 % (3364900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (3364900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (3364900)CaDiCaL version: 2.1.3
% 0.07/0.24 % (3364900)Termination reason: Refutation
% 0.07/0.24 % (3364900)Time elapsed: 0.001 s
% 0.07/0.24 % (3364900)Peak memory usage: 12 MB
% 0.07/0.24 % (3364900)Instructions burned: 1 (million)
% 0.07/0.24 % (3364890)Success in time 0.023 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------