%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET066^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:34 AM UTC 2026
% Result : Theorem 0.29s 0.39s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 291 ( 114 equ; 0 cnn)
% Maximal formula atoms : 4 ( 9 avg)
% Number of connectives : 96 ( 17 ~; 49 |; 0 &; 30 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 29 usr; 5 con; 0-4 aty)
% Number of variables : 29 ( 23 ^; 4 !; 2 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_20,type,
vOR: $o > $o > $o ).
thf(func_def_21,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_23,type,
vAND: $o > $o > $o ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(func_def_25,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_26,type,
vIMP: $o > $o > $o ).
thf(func_def_27,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(f4,axiom,
( unord_pair
= ( ^ [X0: $i,X1: $i,X2: $i] :
( ( X2 = X1 )
| ( X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',unord_pair) ).
thf(f15,conjecture,
! [X0: $i,X1: $i] :
( ( unord_pair @ X0 @ X1 )
= ( unord_pair @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( unord_pair @ X0 @ X1 )
= ( unord_pair @ X1 @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f20,plain,
( unord_pair
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f39,plain,
? [X0: $i,X1: $i] :
( ( unord_pair @ X0 @ X1 )
!= ( unord_pair @ X1 @ X0 ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f40,plain,
( ( unord_pair @ sK0 @ sK1 )
!= ( unord_pair @ sK1 @ sK0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f39]) ).
thf(f44,plain,
( unord_pair
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f55,plain,
( ( unord_pair @ sK0 @ sK1 )
!= ( unord_pair @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f59,plain,
( ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y2 ) )
@ sK0
@ sK1 )
!= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y2 ) )
@ sK1
@ sK0 ) ),
inference(definition_unfolding,[],[f55,f44,f44]) ).
thf(f60,plain,
( ( ^ [Y0: $i] :
( ( sK0 = Y0 )
| ( sK1 = Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 = Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f59]) ).
thf(f61,plain,
( ( ^ [Y0: $i] :
( ( sK0 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 )
!= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 = Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f60]) ).
thf(f62,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( sK0 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 = Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f63,plain,
( ( $false
= ( ^ [Y0: $i] :
( ( sK0 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 = Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f64,plain,
( ( $false
= ( ( sK0 = sK2 )
| ( sK1 = sK2 ) ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f63]) ).
thf(f65,plain,
( ( $false
= ( sK1 = sK2 ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f64]) ).
thf(f66,plain,
( ( $false
= ( sK0 = sK2 ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f64]) ).
thf(f67,plain,
( ( sK0 != sK2 )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(equality_proxy_clausification,[],[f66]) ).
thf(f68,plain,
( ( sK0 != sK2 )
| ( $false
= ( sK0 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f67]) ).
thf(f71,plain,
( ( sK0 != sK2 )
| ( sK0 != sK2 ) ),
inference(equality_proxy_clausification,[],[f68]) ).
thf(f72,plain,
sK0 != sK2,
inference(duplicate_literal_removal,[],[f71]) ).
thf(f73,plain,
( ( sK1 != sK2 )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(equality_proxy_clausification,[],[f65]) ).
thf(f75,plain,
( ( sK1 != sK2 )
| ( $false
= ( sK1 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f73]) ).
thf(f76,plain,
( ( sK1 != sK2 )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f75]) ).
thf(f77,plain,
sK1 != sK2,
inference(duplicate_literal_removal,[],[f76]) ).
thf(f79,plain,
( ( $true
= ( ( sK0 = sK2 )
| ( sK1 = sK2 ) ) )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f80,plain,
( ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) )
| ( $true
= ( sK0 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f79]) ).
thf(f81,plain,
( ( sK1 = sK2 )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 = sK2 ) ) )
| ( $true
= ( sK0 = sK2 ) ) ),
inference(equality_proxy_clausification,[],[f80]) ).
thf(f82,plain,
( ( sK1 = sK2 )
| ( $true
= ( sK0 = sK2 ) )
| ( $true
= ( sK0 = sK2 ) )
| ( $true
= ( sK1 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f81]) ).
thf(f83,plain,
( ( sK1 = sK2 )
| ( sK0 = sK2 )
| ( sK0 = sK2 )
| ( $true
= ( sK1 = sK2 ) ) ),
inference(equality_proxy_clausification,[],[f82]) ).
thf(f84,plain,
( ( sK1 = sK2 )
| ( sK0 = sK2 )
| ( sK0 = sK2 )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f83]) ).
thf(f85,plain,
( ( sK1 = sK2 )
| ( sK0 = sK2 ) ),
inference(duplicate_literal_removal,[],[f84]) ).
thf(f87,plain,
$false,
inference(global_subsumption,[],[f85,f77,f72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET066^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.28 % Computer : n008.cluster.edu
% 0.11/0.28 % Model : x86_64 x86_64
% 0.11/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.28 % Memory : 8046.5625MB
% 0.11/0.28 % OS : Linux 6.8.0-71-generic
% 0.11/0.28 % CPULimit : 300
% 0.11/0.28 % WCLimit : 300
% 0.11/0.28 % DateTime : Tue Sep 29 13:37:09 UTC 2026
% 0.11/0.28 % CPUTime :
% 0.11/0.28 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.29/0.33 Running first-order model finding
% 0.29/0.33 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.29/0.39 % (3158097)Will run a generic schedule for satisfiability detection.
% 0.29/0.39 % (3158104)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3224324510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.29/0.39 % (3158104) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3158097-3158104"...
% 0.29/0.39 % (3158104)...printing done.
% 0.29/0.39 % (3158104)Refutation found. Thanks to Tanya!
% 0.29/0.39 % SZS status Theorem for theBenchmark
% 0.29/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.39 % (3158104)------------------------------
% 0.29/0.39 % (3158104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.39 % (3158104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.39 % (3158104)CaDiCaL version: 2.1.3
% 0.29/0.39 % (3158104)Termination reason: Refutation
% 0.29/0.39 % (3158104)Time elapsed: 0.003 s
% 0.29/0.39 % (3158104)Peak memory usage: 12 MB
% 0.29/0.39 % (3158104)Instructions burned: 4 (million)
% 0.29/0.39 % (3158097)Success in time 0.042 s
% 0.29/0.39 % Vampire exiting
%------------------------------------------------------------------------------