%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET612^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 : n009.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:42 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 31 unt; 0 typ; 3 def)
% Number of atoms : 580 ( 110 equ; 0 cnn)
% Maximal formula atoms : 7 ( 8 avg)
% Number of connectives : 482 ( 76 ~; 80 |; 67 &; 256 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 6 con; 0-4 aty)
% Number of variables : 68 ( 0 sgn 6 !; 3 ?; 68 :)
% 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(func_def_30,type,
sK2: $i > $o ).
thf(f6,axiom,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',union) ).
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,X2: $i > $o] :
( ( setminus @ X0 @ ( union @ X1 @ X2 ) )
= ( intersection @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( setminus @ X0 @ ( union @ X1 @ X2 ) )
= ( intersection @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f22,plain,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f23,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f22]) ).
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,X2: $i > $o] :
( ( setminus @ X0 @ ( union @ X1 @ X2 ) )
!= ( intersection @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ X2 ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f40,plain,
( ( setminus @ sK0 @ ( union @ sK1 @ sK2 ) )
!= ( intersection @ ( setminus @ sK0 @ sK1 ) @ ( setminus @ sK0 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f39]) ).
thf(f46,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
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 @ ( union @ sK1 @ sK2 ) )
!= ( intersection @ ( setminus @ sK0 @ sK1 ) @ ( setminus @ sK0 @ sK2 ) ) ),
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 ) )
@ sK1
@ sK2 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ ( ^ [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
@ sK2 ) ) ),
inference(definition_unfolding,[],[f55,f49,f46,f48,f49,f49]) ).
thf(f60,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f59]) ).
thf(f68,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f60]) ).
thf(f69,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f68]) ).
thf(f70,plain,
( ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f68]) ).
thf(f71,plain,
( ( $false
= ( ( sK0 @ sK3 )
& ~ ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f72,plain,
( ( $false
= ( ~ ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f73,plain,
( ( $true
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f72]) ).
thf(f74,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f73]) ).
thf(f75,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f74]) ).
thf(f76,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f75]) ).
thf(f77,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f76]) ).
thf(f78,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f79,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f78]) ).
thf(f80,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f79]) ).
thf(f81,plain,
( ( $true
= ( ( sK0 @ sK3 )
& ~ ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f82,plain,
( ( $true
= ( ~ ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f81]) ).
thf(f83,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f81]) ).
thf(f85,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f83]) ).
thf(f87,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f85]) ).
thf(f88,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f87]) ).
thf(f94,plain,
( ( $false
= ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(not_proxy_clausification,[],[f82]) ).
thf(f95,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f94]) ).
thf(f96,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 )
& ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f94]) ).
thf(f98,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f96]) ).
thf(f99,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f98]) ).
thf(f101,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f99]) ).
thf(f102,plain,
( $false
= ( sK1 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f101]) ).
thf(f106,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f95]) ).
thf(f111,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( ~ ( sK2 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f106]) ).
thf(f113,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f111]) ).
thf(f114,plain,
( $false
= ( sK2 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f113]) ).
thf(f116,definition,
( spl4_1
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f118,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f116]) ).
thf(f120,definition,
( spl4_2
<=> ( $false
= ( sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f122,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f120]) ).
thf(f124,definition,
( spl4_3
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f126,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f127,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f80,f124,f120,f116]) ).
thf(f130,plain,
( ( $false = $true )
| ~ spl4_2 ),
inference(constrained_superposition,[],[f88,f122]) ).
thf(f134,plain,
( $false
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f130]) ).
thf(f135,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f134]) ).
thf(f137,plain,
( ( $false = $true )
| ~ spl4_3 ),
inference(forward_demodulation,[],[f126,f114]) ).
thf(f138,plain,
( $false
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f137]) ).
thf(f139,plain,
~ spl4_3,
inference(avatar_contradiction_clause,[],[f138]) ).
thf(f140,plain,
( ( $false = $true )
| ~ spl4_1 ),
inference(forward_demodulation,[],[f118,f102]) ).
thf(f141,plain,
( $false
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f140]) ).
thf(f142,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f141]) ).
cnf(s1,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f127]) ).
cnf(s3,plain,
~ spl4_2,
inference(sat_conversion,[],[f135]) ).
cnf(s4,plain,
~ spl4_3,
inference(sat_conversion,[],[f139]) ).
cnf(s5,plain,
~ spl4_1,
inference(sat_conversion,[],[f142]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s4,s3,s5]) ).
thf(f144,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET612^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n009.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:39:15 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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 % (4000905)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (4000924)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=364630648:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (4000924) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4000905-4000924"...
% 0.20/0.27 % (4000920)% WARNING: option uhcvi not known.
% 0.20/0.27 % (4000924)...printing done.
% 0.20/0.27 % (4000924)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 % (4000924)------------------------------
% 0.20/0.27 % (4000924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (4000924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (4000924)CaDiCaL version: 2.1.3
% 0.20/0.27 % (4000924)Termination reason: Refutation
% 0.20/0.27 % (4000924)Time elapsed: 0.003 s
% 0.20/0.27 % (4000924)Peak memory usage: 13 MB
% 0.20/0.27 % (4000924)Instructions burned: 7 (million)
% 0.20/0.27 % (4000905)Success in time 0.032 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------