%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET606^3 : 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 : 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:23:41 AM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 24 unt; 0 typ; 4 def)
% Number of atoms : 373 ( 73 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 302 ( 58 ~; 48 |; 40 &; 152 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 7 con; 0-4 aty)
% Number of variables : 47 ( 0 sgn 4 !; 2 ?; 47 :)
% 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(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',intersection) ).
thf(f9,axiom,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',setminus) ).
thf(f15,conjecture,
! [X0: $i > $o,X1: $i > $o] :
( ( setminus @ X0 @ ( intersection @ X0 @ X1 ) )
= ( setminus @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X1: $i > $o] :
( ( setminus @ X0 @ ( intersection @ X0 @ X1 ) )
= ( setminus @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f26,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f27,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f26]) ).
thf(f28,plain,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f29,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f39,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( setminus @ X0 @ ( intersection @ X0 @ X1 ) )
!= ( setminus @ X0 @ X1 ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f40,plain,
( ( setminus @ sK0 @ ( intersection @ sK0 @ sK1 ) )
!= ( setminus @ sK0 @ sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f39]) ).
thf(f48,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f49,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f55,plain,
( ( setminus @ sK0 @ ( intersection @ sK0 @ sK1 ) )
!= ( setminus @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f59,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) ),
inference(definition_unfolding,[],[f55,f49,f48,f49]) ).
thf(f60,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f59]) ).
thf(f68,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
@ sK2 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f60]) ).
thf(f69,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
@ sK2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f68]) ).
thf(f70,plain,
( ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
@ sK2 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f68]) ).
thf(f71,plain,
( ( $false
= ( ( sK0 @ sK2 )
& ~ ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) )
| ( $false
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f72,plain,
( ( $false
= ( ~ ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) )
| ( $false
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f73,plain,
( ( $true
= ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
| ( $false
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f72]) ).
thf(f74,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f73]) ).
thf(f79,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f74]) ).
thf(f80,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f79]) ).
thf(f81,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f80]) ).
thf(f82,plain,
( ( $true
= ( ( sK0 @ sK2 )
& ~ ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f83,plain,
( ( $true
= ( ~ ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f82]) ).
thf(f84,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f82]) ).
thf(f86,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f84]) ).
thf(f87,plain,
( $true
= ( sK0 @ sK2 ) ),
inference(duplicate_literal_removal,[],[f86]) ).
thf(f89,plain,
( ( $false
= ( ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(not_proxy_clausification,[],[f83]) ).
thf(f90,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f89]) ).
thf(f91,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $true
= ( ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f90]) ).
thf(f93,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f91]) ).
thf(f94,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f93]) ).
thf(f96,definition,
( spl3_1
<=> ( $false
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f98,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f100,definition,
( spl3_2
<=> ( $true
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f102,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f100]) ).
thf(f103,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f81,f100,f96]) ).
thf(f105,definition,
( spl3_3
<=> ( $false
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f107,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f105]) ).
thf(f109,definition,
( spl3_4
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
thf(f111,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f109]) ).
thf(f113,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f94,f105,f96]) ).
thf(f114,plain,
spl3_4,
inference(avatar_split_clause,[],[f87,f109]) ).
thf(f116,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_3 ),
inference(constrained_superposition,[],[f107,f102]) ).
thf(f120,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f116]) ).
thf(f121,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f120]) ).
thf(f126,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f111,f98]) ).
thf(f127,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f126]) ).
thf(f128,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f127]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f103]) ).
cnf(s3,plain,
( spl3_1
| spl3_3 ),
inference(sat_conversion,[],[f113]) ).
cnf(s4,plain,
spl3_4,
inference(sat_conversion,[],[f114]) ).
cnf(s6,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f121]) ).
cnf(s7,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(sat_conversion,[],[f128]) ).
cnf(s8,plain,
~ spl3_1,
inference(rat,[],[s7,s4]) ).
cnf(s9,plain,
spl3_3,
inference(rat,[],[s3,s8]) ).
cnf(s10,plain,
~ spl3_2,
inference(rat,[],[s6,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s10,s8]) ).
thf(f129,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET606^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16 % Computer : n006.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 13:38:40 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 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.10/0.23 % (721296)Will run a generic schedule for satisfiability detection.
% 0.10/0.23 % (721304)dis+10_1_sil=32000:sp=arity:random_seed=3935065821:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.23 % (721304) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721296-721304"...
% 0.10/0.23 % (721302)% WARNING: option uhcvi not known.
% 0.10/0.23 % (721304)...printing done.
% 0.10/0.23 % (721304)Refutation found. Thanks to Tanya!
% 0.10/0.23 % SZS status Theorem for theBenchmark
% 0.10/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.23 % (721304)------------------------------
% 0.10/0.23 % (721304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.23 % (721304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.23 % (721304)CaDiCaL version: 2.1.3
% 0.10/0.23 % (721304)Termination reason: Refutation
% 0.10/0.23 % (721304)Time elapsed: 0.003 s
% 0.10/0.23 % (721304)Peak memory usage: 13 MB
% 0.10/0.23 % (721304)Instructions burned: 6 (million)
% 0.10/0.23 % (721296)Success in time 0.033 s
% 0.10/0.23 % Vampire exiting
%------------------------------------------------------------------------------