%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET617^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 : n020.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:43 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 131 ( 30 equ; 0 cnn)
% Maximal formula atoms : 2 ( 6 avg)
% Number of connectives : 201 ( 69 ~; 32 |; 50 &; 50 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-4 aty)
% Number of variables : 33 ( 28 ^; 4 !; 1 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vOR: $o > $o > $o ).
thf(func_def_2,type,
vAND: $o > $o > $o ).
thf(func_def_3,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
vNOT: $o > $o ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
sK0: a > $o ).
thf(f1,conjecture,
! [X0: a > $o] :
( ( ( ^ [X1: a] :
( ( ~ $false
& ( X0 @ X1 ) )
| ( ~ ( X0 @ X1 )
& $false ) ) )
= X0 )
& ( ( ^ [X1: a] :
( ( ~ ( X0 @ X1 )
& $false )
| ( ~ $false
& ( X0 @ X1 ) ) ) )
= X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_92_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o] :
( ( ( ^ [X1: a] :
( ( ~ $false
& ( X0 @ X1 ) )
| ( ~ ( X0 @ X1 )
& $false ) ) )
= X0 )
& ( ( ^ [X1: a] :
( ( ~ ( X0 @ X1 )
& $false )
| ( ~ $false
& ( X0 @ X1 ) ) ) )
= X0 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o] :
( ( ( ^ [X1: a] :
( ( ~ $false
& ( X0 @ X1 ) )
| ( ~ ( X0 @ X1 )
& $false ) ) )
= X0 )
& ( ( ^ [X2: a] :
( ( ~ ( X0 @ X2 )
& $false )
| ( ~ $false
& ( X0 @ X2 ) ) ) )
= X0 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o] :
( ( ( ^ [Y0: a] :
( ( $false
& ~ ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ~ $false ) ) )
= X0 )
& ( ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( X0 @ Y0 ) ) ) )
= X0 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o] :
( ( ( ^ [Y0: a] :
( ( $false
& ~ ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ~ $false ) ) )
!= X0 )
| ( ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( X0 @ Y0 ) ) ) )
!= X0 ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( $false
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ $false ) ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).
thf(f7,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( $false
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ $false ) ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( $false
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& $true ) ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(boolean_simplification,[],[f7]) ).
thf(f11,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( $false
& ~ ( sK0 @ Y0 ) )
| ( sK0 @ Y0 ) ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(boolean_simplification,[],[f10]) ).
thf(f12,plain,
( ( sK0
!= ( ^ [Y0: a] :
( $false
| ( sK0 @ Y0 ) ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(boolean_simplification,[],[f11]) ).
thf(f13,plain,
( ( sK0
!= ( ^ [Y0: a] : ( sK0 @ Y0 ) ) )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(boolean_simplification,[],[f12]) ).
thf(f14,plain,
( ( sK0 != sK0 )
| ( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f13]) ).
thf(f15,plain,
( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| ( $false
& ~ ( sK0 @ Y0 ) ) ) ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f16,plain,
( sK0
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ $false )
| $false ) ) ),
inference(boolean_simplification,[],[f15]) ).
thf(f17,plain,
( sK0
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ $false ) ) ),
inference(boolean_simplification,[],[f16]) ).
thf(f18,plain,
( sK0
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& $true ) ) ),
inference(boolean_simplification,[],[f17]) ).
thf(f19,plain,
( sK0
!= ( ^ [Y0: a] : ( sK0 @ Y0 ) ) ),
inference(boolean_simplification,[],[f18]) ).
thf(f20,plain,
sK0 != sK0,
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET617^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 : n020.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 13:40:20 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.23 Running first-order model finding
% 0.10/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.20/0.27 % (1064076)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1064085)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2527196632:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1064085)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1064085) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1064076-1064085"...
% 0.20/0.27 % (1064085)...printing done.
% 0.20/0.27 % (1064085)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 % (1064085)------------------------------
% 0.20/0.27 % (1064085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1064085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1064085)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1064085)Termination reason: Refutation
% 0.20/0.27 % (1064085)Time elapsed: 0.001 s
% 0.20/0.27 % (1064085)Peak memory usage: 11 MB
% 0.20/0.27 % (1064085)Instructions burned: 2 (million)
% 0.20/0.27 % (1064076)Success in time 0.032 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------