%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET580^3 : TPTP v9.3.1. Released v3.6.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:38 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of formulae : 78 ( 13 unt; 0 typ; 4 def)
% Number of atoms : 692 ( 152 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 562 ( 124 ~; 139 |; 39 &; 244 @)
% ( 15 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 7 con; 0-4 aty)
% Number of variables : 45 ( 0 sgn 15 !; 6 ?; 45 :)
% 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(f7,axiom,
( excl_union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',excl_union) ).
thf(f15,conjecture,
! [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( excl_union @ X0 @ X1 @ X2 )
<=> ( ( X0 @ X2 )
<=> ~ ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( excl_union @ X0 @ X1 @ X2 )
<=> ( ( X0 @ X2 )
<=> ~ ( X1 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f24,plain,
( excl_union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f25,plain,
( excl_union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f39,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( excl_union @ X0 @ X1 @ X2 )
<=> ( ( X0 @ X2 )
<=> ~ ( X1 @ X2 ) ) ),
inference(rectify,[],[f16]) ).
thf(f40,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( excl_union @ X0 @ X1 @ X2 )
= $true )
<=> ( ( ( X0 @ X2 )
= $true )
<=> ( ( X1 @ X2 )
!= $true ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f41,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( excl_union @ X0 @ X1 @ X2 )
= $true )
<=> ( ( ( X0 @ X2 )
= $true )
<=> ( ( X1 @ X2 )
!= $true ) ) ),
inference(flattening,[],[f40]) ).
thf(f42,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( excl_union @ X0 @ X1 @ X2 )
= $true )
<~> ( ( ( X0 @ X2 )
= $true )
<=> ( ( X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f41]) ).
thf(f43,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ( ( ( ( X1 @ X2 )
= $true )
| ( ( X0 @ X2 )
!= $true ) )
& ( ( ( X1 @ X2 )
!= $true )
| ( ( X0 @ X2 )
= $true ) ) )
| ( ( excl_union @ X0 @ X1 @ X2 )
!= $true ) )
& ( ( ( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
= $true ) )
& ( ( ( X1 @ X2 )
!= $true )
| ( ( X0 @ X2 )
!= $true ) ) )
| ( ( excl_union @ X0 @ X1 @ X2 )
= $true ) ) ),
inference(nnf_transformation,[],[f42]) ).
thf(f44,plain,
( ( ( ( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) ) )
& ( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ) )
| ( $true
!= ( excl_union @ sK0 @ sK1 @ sK2 ) ) )
& ( ( ( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) ) )
& ( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) ) ) )
| ( $true
= ( excl_union @ sK0 @ sK1 @ sK2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f43]) ).
thf(f51,plain,
( excl_union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f59,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( excl_union @ sK0 @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f60,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( excl_union @ sK0 @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f61,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $true
!= ( excl_union @ sK0 @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f62,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
!= ( excl_union @ sK0 @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f66,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) )
@ sK0
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f62,f51]) ).
thf(f67,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $true
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) )
@ sK0
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f61,f51]) ).
thf(f68,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) )
@ sK0
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f60,f51]) ).
thf(f69,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
| ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) )
@ sK0
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f59,f51]) ).
thf(f70,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) )
| ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f71,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f70]) ).
thf(f73,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( ~ ( sK0 @ sK2 ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f74,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(not_proxy_clausification,[],[f73]) ).
thf(f75,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( $true
= ( ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f74]) ).
thf(f77,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f75]) ).
thf(f81,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) )
| ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f68]) ).
thf(f82,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f81]) ).
thf(f83,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f82]) ).
thf(f90,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ~ ( sK1 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f83]) ).
thf(f91,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f83]) ).
thf(f92,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f91]) ).
thf(f93,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f90]) ).
thf(f94,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f93]) ).
thf(f95,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $true
!= ( ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) )
| ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f67]) ).
thf(f96,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $false
= ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f95]) ).
thf(f100,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( ~ ( sK0 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f96]) ).
thf(f101,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f100]) ).
thf(f102,plain,
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f101]) ).
thf(f103,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
!= ( ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) )
| ( ~ ( sK0 @ sK2 )
& ( sK1 @ sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f66]) ).
thf(f105,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( ( sK0 @ sK2 )
& ~ ( sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f103]) ).
thf(f106,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( ~ ( sK1 @ sK2 ) ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f105]) ).
thf(f107,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f106]) ).
thf(f108,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
!= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f107]) ).
thf(f112,definition,
( spl3_1
<=> ( $false
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f114,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f112]) ).
thf(f116,definition,
( spl3_2
<=> ( $false
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f118,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f116]) ).
thf(f120,definition,
( spl3_3
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f121,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f120]) ).
thf(f124,definition,
( spl3_4
<=> ( $true
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
thf(f125,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f127,plain,
( spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f77,f124,f120,f116,f112]) ).
thf(f130,plain,
( spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f92,f120,f124]) ).
thf(f131,plain,
( spl3_1
| spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f94,f120,f124,f112]) ).
thf(f132,plain,
( spl3_1
| spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f102,f124,f120,f112]) ).
thf(f133,plain,
( spl3_2
| ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f108,f124,f120,f116]) ).
thf(f134,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_demodulation,[],[f121,f118]) ).
thf(f135,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f134]) ).
thf(f136,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f135]) ).
thf(f138,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f125,f114]) ).
thf(f139,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f140,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f139]) ).
cnf(s1,plain,
( spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f127]) ).
cnf(s4,plain,
( spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f130]) ).
cnf(s5,plain,
( spl3_1
| spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f131]) ).
cnf(s6,plain,
( spl3_1
| spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f132]) ).
cnf(s7,plain,
( spl3_2
| ~ spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f133]) ).
cnf(s8,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f136]) ).
cnf(s9,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(sat_conversion,[],[f140]) ).
cnf(s10,plain,
( spl3_3
| spl3_1 ),
inference(rat,[],[s5,s6]) ).
cnf(s11,plain,
( spl3_2
| spl3_1 ),
inference(rat,[],[s1,s7,s10]) ).
cnf(s12,plain,
spl3_1,
inference(rat,[],[s8,s11,s10]) ).
cnf(s13,plain,
~ spl3_4,
inference(rat,[],[s9,s12]) ).
cnf(s14,plain,
spl3_3,
inference(rat,[],[s4,s13]) ).
cnf(s15,plain,
~ spl3_2,
inference(rat,[],[s8,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s7,s13,s15,s14]) ).
thf(f141,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET580^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n007.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:35:56 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.28 % (3363205)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3363211)% WARNING: option uhcvi not known.
% 0.20/0.28 % (3363211)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2708967212:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (3363210)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1658312941_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (3363212)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3304485608:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (3363213)dis+10_1_sil=32000:sp=arity:random_seed=1883768406:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (3363214)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3156559204:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (3363211)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3363214)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3363211)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (3363214) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3363205-3363214"...
% 0.20/0.28 % (3363213) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3363205-3363213"...
% 0.20/0.28 % (3363211) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3363205-3363211"...
% 0.20/0.28 % (3363212) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3363205-3363212"...
% 0.20/0.28 % (3363215)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1756126427:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (3363216)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=875752917:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (3363214)...printing done.
% 0.20/0.28 % (3363213)...printing done.
% 0.20/0.28 % (3363211)...printing done.
% 0.20/0.28 % (3363212)...printing done.
% 0.20/0.28 % (3363214)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (3363214)------------------------------
% 0.20/0.28 % (3363214)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3363214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3363214)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3363214)Termination reason: Refutation
% 0.20/0.28 % (3363214)Time elapsed: 0.005 s
% 0.20/0.28 % (3363214)Peak memory usage: 12 MB
% 0.20/0.28 % (3363214)Instructions burned: 7 (million)
% 0.20/0.28 % (3363205)Success in time 0.043 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------