%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET673^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:27 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of formulae : 75 ( 37 unt; 0 typ; 3 def)
% Number of atoms : 385 ( 84 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 396 ( 38 ~; 34 |; 36 &; 249 @)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 80 ( 80 >; 0 *; 0 +; 0 <<)
% Number of symbols : 63 ( 59 usr; 8 con; 0-4 aty)
% ( 14 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 117 ( 0 sgn 35 !; 12 ?; 117 :)
% 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,
cartesian_product: ( $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
pair_rel: $i > $i > $i > $i > $o ).
thf(func_def_17,type,
id_rel: ( $i > $o ) > $i > $i > $o ).
thf(func_def_18,type,
sub_rel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
is_rel_on: ( $i > $i > $o ) > ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_20,type,
restrict_rel_domain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_21,type,
rel_diagonal: $i > $i > $o ).
thf(func_def_22,type,
rel_composition: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_23,type,
reflexive: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
irreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
symmetric: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
transitive: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
equiv_rel: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
rel_codomain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_29,type,
rel_domain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_30,type,
rel_inverse: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_31,type,
equiv_classes: ( $i > $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_32,type,
restrict_rel_codomain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_33,type,
rel_field: ( $i > $i > $o ) > $i > $o ).
thf(func_def_34,type,
well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_35,type,
upwards_well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_36,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_37,type,
vAND: $o > $o > $o ).
thf(func_def_38,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vIFF: $o > $o > $o ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_45,type,
vNOT: $o > $o ).
thf(func_def_46,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_47,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
vOR: $o > $o > $o ).
thf(func_def_51,type,
vIMP: $o > $o > $o ).
thf(func_def_52,type,
sK0: $i > $i > $o ).
thf(func_def_53,type,
sK1: $i > $o ).
thf(func_def_54,type,
sK2: $i > $o ).
thf(func_def_55,type,
sK3: $i > $o ).
thf(f12,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subset ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',subset) ).
thf(f19,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
! [X4: $i,X3: $i] :
( ( X0 @ X3 @ X4 )
=> ( ( X2 @ X4 )
& ( X1 @ X3 ) ) ) )
= is_rel_on ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',is_rel_on) ).
thf(f32,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X0 @ X2 @ X3 )
& ( X1 @ X3 ) ) )
= restrict_rel_codomain ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',restrict_rel_codomain) ).
thf(f36,conjecture,
! [X3: $i > $o,X2: $i > $o,X1: $i > $i > $o,X0: $i > $o] :
( ( ( subset @ X3 @ X0 )
& ( is_rel_on @ X1 @ X2 @ X3 ) )
=> ( ( restrict_rel_codomain @ X1 @ X0 )
= X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f37,negated_conjecture,
~ ! [X3: $i > $o,X2: $i > $o,X1: $i > $i > $o,X0: $i > $o] :
( ( ( subset @ X3 @ X0 )
& ( is_rel_on @ X1 @ X2 @ X3 ) )
=> ( ( restrict_rel_codomain @ X1 @ X0 )
= X1 ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f50,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $i > $o,X3: $i > $o] :
( ( ( subset @ X0 @ X3 )
& ( is_rel_on @ X2 @ X1 @ X0 ) )
=> ( ( restrict_rel_codomain @ X2 @ X3 )
= X2 ) ),
inference(rectify,[],[f37]) ).
thf(f51,plain,
~ ! [X3: $i > $o,X2: $i > $i > $o,X1: $i > $o,X0: $i > $o] :
( ( ( $true
= ( subset @ X0 @ X3 ) )
& ( $true
= ( is_rel_on @ X2 @ X1 @ X0 ) ) )
=> ( ( restrict_rel_codomain @ X2 @ X3 )
= X2 ) ),
inference(fool_elimination,[],[f50]) ).
thf(f69,plain,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subset ),
inference(rectify,[],[f12]) ).
thf(f70,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f69]) ).
thf(f88,plain,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
! [X3: $i,X4: $i] :
( ( X0 @ X4 @ X3 )
=> ( ( X2 @ X3 )
& ( X1 @ X4 ) ) ) )
= is_rel_on ),
inference(rectify,[],[f19]) ).
thf(f89,plain,
( is_rel_on
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y3 @ Y4 )
=> ( ( Y1 @ Y3 )
& ( Y2 @ Y4 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f88]) ).
thf(f92,plain,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X0 @ X2 @ X3 )
& ( X1 @ X3 ) ) )
= restrict_rel_codomain ),
inference(rectify,[],[f32]) ).
thf(f93,plain,
( restrict_rel_codomain
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y1 @ Y3 )
& ( Y0 @ Y2 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f92]) ).
thf(f101,plain,
? [X3: $i > $o,X2: $i > $i > $o,X1: $i > $o,X0: $i > $o] :
( ( ( restrict_rel_codomain @ X2 @ X3 )
!= X2 )
& ( $true
= ( subset @ X0 @ X3 ) )
& ( $true
= ( is_rel_on @ X2 @ X1 @ X0 ) ) ),
inference(ennf_transformation,[],[f51]) ).
thf(f102,plain,
? [X2: $i > $i > $o,X1: $i > $o,X3: $i > $o,X0: $i > $o] :
( ( $true
= ( subset @ X0 @ X3 ) )
& ( $true
= ( is_rel_on @ X2 @ X1 @ X0 ) )
& ( ( restrict_rel_codomain @ X2 @ X3 )
!= X2 ) ),
inference(flattening,[],[f101]) ).
thf(f103,plain,
? [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( subset @ X3 @ X2 )
= $true )
& ( $true
= ( is_rel_on @ X0 @ X1 @ X3 ) )
& ( ( restrict_rel_codomain @ X0 @ X2 )
!= X0 ) ),
inference(rectify,[],[f102]) ).
thf(f104,plain,
( ( $true
= ( subset @ sK3 @ sK2 ) )
& ( $true
= ( is_rel_on @ sK0 @ sK1 @ sK3 ) )
& ( sK0
!= ( restrict_rel_codomain @ sK0 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f103]) ).
thf(f106,plain,
( sK0
!= ( restrict_rel_codomain @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f107,plain,
( $true
= ( is_rel_on @ sK0 @ sK1 @ sK3 ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f108,plain,
( $true
= ( subset @ sK3 @ sK2 ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f112,plain,
( is_rel_on
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y3 @ Y4 )
=> ( ( Y1 @ Y3 )
& ( Y2 @ Y4 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f89]) ).
thf(f121,plain,
( restrict_rel_codomain
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y1 @ Y3 )
& ( Y0 @ Y2 @ Y3 ) ) ) ),
inference(cnf_transformation,[],[f93]) ).
thf(f129,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f70]) ).
thf(f148,plain,
( $true
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) )
@ sK3
@ sK2 ) ),
inference(definition_unfolding,[],[f108,f129]) ).
thf(f149,plain,
( $true
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y3 @ Y4 )
=> ( ( Y1 @ Y3 )
& ( Y2 @ Y4 ) ) ) ) )
@ sK0
@ sK1
@ sK3 ) ),
inference(definition_unfolding,[],[f107,f112]) ).
thf(f150,plain,
( ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y1 @ Y3 )
& ( Y0 @ Y2 @ Y3 ) )
@ sK0
@ sK2 )
!= sK0 ),
inference(definition_unfolding,[],[f106,f121]) ).
thf(f151,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK2 @ Y1 )
& ( sK0 @ Y0 @ Y1 ) ) )
!= sK0 ),
inference(beta-eta_normalization,[],[f150]) ).
thf(f152,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f153,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X1: $i] :
( $true
= ( ( sK3 @ X1 )
=> ( sK2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f153]) ).
thf(f155,plain,
! [X1: $i] :
( ( $false
= ( sK3 @ X1 ) )
| ( $true
= ( sK2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f154]) ).
thf(f156,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( ( sK1 @ Y0 )
& ( sK3 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f149]) ).
thf(f157,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( ( sK1 @ Y0 )
& ( sK3 @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f156]) ).
thf(f158,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ X1 @ Y0 )
=> ( ( sK1 @ X1 )
& ( sK3 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f157]) ).
thf(f159,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( sK0 @ X1 @ Y0 )
=> ( ( sK1 @ X1 )
& ( sK3 @ Y0 ) ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f158]) ).
thf(f160,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( sK0 @ X1 @ X2 )
=> ( ( sK1 @ X1 )
& ( sK3 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f159]) ).
thf(f161,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( sK1 @ X1 )
& ( sK3 @ X2 ) ) )
| ( ( sK0 @ X1 @ X2 )
= $false ) ),
inference(imp_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X2: $i,X1: $i] :
( ( ( sK0 @ X1 @ X2 )
= $false )
| ( $true
= ( sK3 @ X2 ) ) ),
inference(and_proxy_clausification,[],[f161]) ).
thf(f164,plain,
( ( sK0 @ sK4 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK2 @ Y1 )
& ( sK0 @ Y0 @ Y1 ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f151]) ).
thf(f165,plain,
( ( sK0 @ sK4 )
!= ( ^ [Y0: $i] :
( ( sK2 @ Y0 )
& ( sK0 @ sK4 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f164]) ).
thf(f166,plain,
( ( ^ [Y0: $i] :
( ( sK2 @ Y0 )
& ( sK0 @ sK4 @ Y0 ) )
@ sK5 )
!= ( sK0 @ sK4 @ sK5 ) ),
inference(negative_extensionality,[],[f165]) ).
thf(f167,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK2 @ Y0 )
& ( sK0 @ sK4 @ Y0 ) )
@ sK5 ) ) ),
inference(xor_proxy_clausification,[],[f166]) ).
thf(f168,plain,
( ( $false
= ( ^ [Y0: $i] :
( ( sK2 @ Y0 )
& ( sK0 @ sK4 @ Y0 ) )
@ sK5 ) )
| ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(xor_proxy_clausification,[],[f166]) ).
thf(f169,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK4 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(beta-eta_normalization,[],[f168]) ).
thf(f170,plain,
( ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(and_proxy_clausification,[],[f169]) ).
thf(f171,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f170]) ).
thf(f172,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK4 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(beta-eta_normalization,[],[f167]) ).
thf(f173,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ( $true
= ( sK0 @ sK4 @ sK5 ) ) ),
inference(and_proxy_clausification,[],[f172]) ).
thf(f175,plain,
( $true
= ( sK0 @ sK4 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f173]) ).
thf(f177,definition,
( spl6_1
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
thf(f179,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f177]) ).
thf(f181,definition,
( spl6_2
<=> ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
thf(f183,plain,
( ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f181]) ).
thf(f184,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f171,f181,f177]) ).
thf(f186,definition,
( spl6_3
<=> ( $true
= ( sK0 @ sK4 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
thf(f188,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f186]) ).
thf(f194,plain,
spl6_3,
inference(avatar_split_clause,[],[f175,f186]) ).
thf(f195,plain,
( ( $true = $false )
| ~ spl6_2
| ~ spl6_3 ),
inference(forward_demodulation,[],[f188,f183]) ).
thf(f196,plain,
( $false
| ~ spl6_2
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f195]) ).
thf(f197,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f196]) ).
thf(f202,plain,
( ( $true = $false )
| ( $true
= ( sK3 @ sK5 ) )
| ~ spl6_3 ),
inference(constrained_superposition,[],[f162,f188]) ).
thf(f203,plain,
( ( $true
= ( sK3 @ sK5 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f202]) ).
thf(f208,plain,
( ( $true = $false )
| ( $true
= ( sK2 @ sK5 ) )
| ~ spl6_3 ),
inference(constrained_superposition,[],[f155,f203]) ).
thf(f210,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f208]) ).
thf(f214,plain,
( ( $true = $false )
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f210,f179]) ).
thf(f215,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f214]) ).
thf(f216,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f215]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f184]) ).
cnf(s3,plain,
spl6_3,
inference(sat_conversion,[],[f194]) ).
cnf(s4,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(sat_conversion,[],[f197]) ).
cnf(s6,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f216]) ).
cnf(s7,plain,
~ spl6_1,
inference(rat,[],[s6,s3]) ).
cnf(s8,plain,
~ spl6_2,
inference(rat,[],[s4,s3]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s7]) ).
thf(f217,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET673^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:46:36 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.30 % (1261092)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.30 % (1261114)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2359808531:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.30 % (1261116)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.30 % (1261116)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.30 % (1261110)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2434517147:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.30 % (1261111)lrs+10_16_si=on:nwc=1.5:random_seed=3031820340:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.30 % (1261112)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4215641086:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.30 % (1261113)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=344424849:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.30 % (1261115)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=887741588:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.30 % (1261116)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3058645202:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.30 % (1261114)Instruction limit reached!
% 0.20/0.30 % (1261114)------------------------------
% 0.20/0.30 % (1261114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1261114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1261114)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1261114)Termination reason: Instruction limit
% 0.20/0.30 % (1261114)Termination phase: Saturation
% 0.20/0.30 % (1261114)Time elapsed: 0.008 s
% 0.20/0.30 % (1261114)Peak memory usage: 12 MB
% 0.20/0.30 % (1261114)Instructions burned: 27 (million)
% 0.20/0.30 % (1261112)Instruction limit reached!
% 0.20/0.30 % (1261112)------------------------------
% 0.20/0.30 % (1261112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1261112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1261112)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1261112)Termination reason: Instruction limit
% 0.20/0.30 % (1261112)Termination phase: Property scanning
% 0.20/0.30 % (1261112)Time elapsed: 0.002 s
% 0.20/0.30 % (1261112)Peak memory usage: 10 MB
% 0.20/0.30 % (1261112)Instructions burned: 4 (million)
% 0.20/0.30 % (1261110) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1261092-1261110"...
% 0.20/0.30 % (1261111) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1261092-1261111"...
% 0.20/0.30 % (1261115) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1261092-1261115"...
% 0.20/0.30 % (1261116) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1261092-1261116"...
% 0.20/0.30 % (1261110)...printing done.
% 0.20/0.30 % (1261111)...printing done.
% 0.20/0.30 % (1261115)...printing done.
% 0.20/0.30 % (1261110)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (1261110)------------------------------
% 0.20/0.30 % (1261110)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1261110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1261110)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1261110)Termination reason: Refutation
% 0.20/0.30 % (1261110)Time elapsed: 0.008 s
% 0.20/0.30 % (1261110)Peak memory usage: 13 MB
% 0.20/0.30 % (1261110)Instructions burned: 13 (million)
% 0.20/0.30 % (1261092)Success in time 0.053 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------