%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU606^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:30:17 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 108 ( 37 unt; 0 typ; 16 def)
% Number of atoms : 570 ( 113 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 617 ( 108 ~; 85 |; 12 &; 333 @)
% ( 11 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 34 ( 30 usr; 23 con; 0-4 aty)
% ( 24 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 85 ( 0 sgn 49 !; 9 ?; 85 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
setminus: $i > $i > $i ).
thf(func_def_2,type,
setminusERneg: $o ).
thf(func_def_6,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
vIMP: $o > $o > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
sF3: $o ).
thf(func_def_17,type,
sF4: $o ).
thf(func_def_19,type,
sF6: $o ).
thf(func_def_20,type,
sF7: $o ).
thf(f1,axiom,
! [X0: $i,X2: $i,X1: $i] :
( ( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) )
= setminusERneg ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusERneg) ).
thf(f2,conjecture,
( setminusERneg
=> ! [X1: $i,X2: $i,X0: $i] :
( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( ~ ( in @ X2 @ X1 )
=> ~ ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusELneg) ).
thf(f3,negated_conjecture,
~ ( setminusERneg
=> ! [X1: $i,X2: $i,X0: $i] :
( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( ~ ( in @ X2 @ X1 )
=> ~ ( in @ X2 @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ( setminusERneg
=> ! [X0: $i,X1: $i,X2: $i] :
( ~ ( in @ X1 @ ( setminus @ X2 @ X0 ) )
=> ( ~ ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
~ ( ( setminusERneg = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X1 @ ( setminus @ X2 @ X0 ) )
!= $true )
=> ( ( ( in @ X1 @ X0 )
!= $true )
=> ( ( in @ X1 @ X2 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ~ ( in @ X1 @ ( setminus @ X0 @ X2 ) )
=> ( ( in @ X1 @ X0 )
=> ( in @ X1 @ X2 ) ) )
= setminusERneg ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( setminusERneg
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( ( setminusERneg = $true )
=> ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X1 @ ( setminus @ X2 @ X0 ) )
!= $true )
=> ( ( ( in @ X1 @ X0 )
!= $true )
=> ( ( in @ X1 @ X2 )
!= $true ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f9,plain,
( ? [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X1 @ X2 )
= $true )
& ( ( in @ X1 @ X0 )
!= $true )
& ( ( in @ X1 @ ( setminus @ X2 @ X0 ) )
!= $true ) )
& ( setminusERneg = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
( ? [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
= $true )
& ( ( in @ X1 @ X0 )
!= $true )
& ( ( in @ X1 @ ( setminus @ X2 @ X0 ) )
!= $true ) )
& ( setminusERneg = $true ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X0 @ X2 ) )
& ( $true
!= ( in @ X0 @ X1 ) )
& ( $true
!= ( in @ X0 @ ( setminus @ X2 @ X1 ) ) ) )
& ( setminusERneg = $true ) ),
inference(rectify,[],[f10]) ).
thf(f12,plain,
( ( $true
= ( in @ sK0 @ sK2 ) )
& ( ( in @ sK0 @ sK1 )
!= $true )
& ( $true
!= ( in @ sK0 @ ( setminus @ sK2 @ sK1 ) ) )
& ( setminusERneg = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f11]) ).
thf(f13,plain,
setminusERneg = $true,
inference(cnf_transformation,[],[f12]) ).
thf(f14,plain,
( $true
!= ( in @ sK0 @ ( setminus @ sK2 @ sK1 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
( ( in @ sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( $true
= ( in @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
( setminusERneg
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f20,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f17,f13]) ).
thf(f21,definition,
( sF3
= ( in @ sK0 @ sK2 ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f22,plain,
( ( in @ sK0 @ sK2 )
= sF3 ),
inference(reorient_equations,[],[f21]) ).
thf(f23,plain,
$true = sF3,
inference(definition_folding,[],[f16,f22]) ).
thf(f24,definition,
( sF4
= ( in @ sK0 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f25,plain,
sF4 != $true,
inference(definition_folding,[],[f15,f24]) ).
thf(f26,definition,
( sF5
= ( setminus @ sK2 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f27,definition,
( sF6
= ( in @ sK0 @ sF5 ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f28,plain,
$true != sF6,
inference(definition_folding,[],[f14,f27,f26]) ).
thf(f29,definition,
( sF7
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f30,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) )
= sF7 ),
inference(reorient_equations,[],[f29]) ).
thf(f31,plain,
$true = sF7,
inference(definition_folding,[],[f20,f30]) ).
thf(f32,plain,
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ) )
| ( $false = sF7 ) ),
inference(iff_proxy_clausification,[],[f30]) ).
thf(f45,plain,
! [X1: $i] :
( ( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ Y0 ) ) ) ) )
@ X1 )
= $true )
| ( $false = sF7 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f46,plain,
! [X1: $i] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ~ ( in @ Y0 @ ( setminus @ Y1 @ X1 ) )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ X1 ) ) ) ) )
= $true )
| ( $false = sF7 ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X2: $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ~ ( in @ Y0 @ ( setminus @ Y1 @ X1 ) )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ X1 ) ) ) )
@ X2 )
= $true )
| ( $false = sF7 ) ),
inference(pi_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X2: $i,X1: $i] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( in @ X2 @ ( setminus @ Y0 @ X1 ) )
=> ( ( in @ X2 @ Y0 )
=> ( in @ X2 @ X1 ) ) ) )
= $true )
| ( $false = sF7 ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f49,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false = sF7 )
| ( ( ^ [Y0: $i] :
( ~ ( in @ X2 @ ( setminus @ Y0 @ X1 ) )
=> ( ( in @ X2 @ Y0 )
=> ( in @ X2 @ X1 ) ) )
@ X3 )
= $true ) ),
inference(pi_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false = sF7 )
| ( $true
= ( ~ ( in @ X2 @ ( setminus @ X3 @ X1 ) )
=> ( ( in @ X2 @ X3 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f51,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X2 @ X3 )
=> ( in @ X2 @ X1 ) ) )
| ( ( ~ ( in @ X2 @ ( setminus @ X3 @ X1 ) ) )
= $false )
| ( $false = sF7 ) ),
inference(imp_proxy_clausification,[],[f50]) ).
thf(f52,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ~ ( in @ X2 @ ( setminus @ X3 @ X1 ) ) )
= $false )
| ( ( in @ X2 @ X3 )
= $false )
| ( ( in @ X2 @ X1 )
= $true )
| ( $false = sF7 ) ),
inference(imp_proxy_clausification,[],[f51]) ).
thf(f53,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ X3 )
= $false )
| ( $false = sF7 )
| ( ( in @ X2 @ ( setminus @ X3 @ X1 ) )
= $true )
| ( ( in @ X2 @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f52]) ).
thf(f54,plain,
( ( $false
= ( in @ sK0 @ sF5 ) )
| ( $true = sF6 ) ),
inference(iff_proxy_clausification,[],[f27]) ).
thf(f56,plain,
( ( $false = sF3 )
| ( $true
= ( in @ sK0 @ sK2 ) ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f58,plain,
( ( ( in @ sK0 @ sK1 )
= $false )
| ( sF4 = $true ) ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f61,definition,
( spl11_1
<=> ( $true = sF7 ) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
thf(f63,plain,
( ( $true = sF7 )
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f61]) ).
thf(f80,definition,
( spl11_5
<=> ! [X2: $i,X1: $i,X3: $i] :
( ( ( in @ X2 @ X3 )
= $false )
| ( ( in @ X2 @ X1 )
= $true )
| ( ( in @ X2 @ ( setminus @ X3 @ X1 ) )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
thf(f81,plain,
( ! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X3 @ X1 ) )
= $true )
| ( ( in @ X2 @ X3 )
= $false )
| ( ( in @ X2 @ X1 )
= $true ) )
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f83,definition,
( spl11_6
<=> ( $false = sF7 ) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
thf(f85,plain,
( ( $false = sF7 )
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f83]) ).
thf(f86,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f53,f83,f80]) ).
thf(f97,definition,
( spl11_9
<=> ( $false
= ( in @ sK0 @ sF5 ) ) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
thf(f99,plain,
( ( $false
= ( in @ sK0 @ sF5 ) )
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f97]) ).
thf(f101,definition,
( spl11_10
<=> ( $true = sF6 ) ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
thf(f104,plain,
( spl11_9
| spl11_10 ),
inference(avatar_split_clause,[],[f54,f101,f97]) ).
thf(f110,definition,
( spl11_12
<=> ( $true = sF3 ) ),
introduced(definition,[new_symbols(definition,[spl11_12])],[avatar_definition]) ).
thf(f112,plain,
( ( $true = sF3 )
| ~ spl11_12 ),
inference(avatar_component_clause,[],[f110]) ).
thf(f115,definition,
( spl11_13
<=> ( $false = sF3 ) ),
introduced(definition,[new_symbols(definition,[spl11_13])],[avatar_definition]) ).
thf(f117,plain,
( ( $false = sF3 )
| ~ spl11_13 ),
inference(avatar_component_clause,[],[f115]) ).
thf(f119,definition,
( spl11_14
<=> ( $true
= ( in @ sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl11_14])],[avatar_definition]) ).
thf(f121,plain,
( ( $true
= ( in @ sK0 @ sK2 ) )
| ~ spl11_14 ),
inference(avatar_component_clause,[],[f119]) ).
thf(f122,plain,
( spl11_13
| spl11_14 ),
inference(avatar_split_clause,[],[f56,f119,f115]) ).
thf(f124,definition,
( spl11_15
<=> ( ( in @ sK0 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl11_15])],[avatar_definition]) ).
thf(f125,plain,
( ( ( in @ sK0 @ sK1 )
!= $true )
| spl11_15 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f126,plain,
( ( ( in @ sK0 @ sK1 )
= $true )
| ~ spl11_15 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f133,definition,
( spl11_17
<=> ( sF4 = $true ) ),
introduced(definition,[new_symbols(definition,[spl11_17])],[avatar_definition]) ).
thf(f137,definition,
( spl11_18
<=> ( ( in @ sK0 @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
thf(f139,plain,
( ( ( in @ sK0 @ sK1 )
= $false )
| ~ spl11_18 ),
inference(avatar_component_clause,[],[f137]) ).
thf(f140,plain,
( spl11_17
| spl11_18 ),
inference(avatar_split_clause,[],[f58,f137,f133]) ).
thf(f141,plain,
spl11_12,
inference(avatar_split_clause,[],[f23,f110]) ).
thf(f142,plain,
~ spl11_17,
inference(avatar_split_clause,[],[f25,f133]) ).
thf(f143,plain,
spl11_1,
inference(avatar_split_clause,[],[f31,f61]) ).
thf(f144,plain,
~ spl11_10,
inference(avatar_split_clause,[],[f28,f101]) ).
thf(f155,plain,
( ( $true = $false )
| ~ spl11_12
| ~ spl11_13 ),
inference(forward_demodulation,[],[f117,f112]) ).
thf(f156,plain,
( $false
| ~ spl11_12
| ~ spl11_13 ),
inference(trivial_inequality_removal,[],[f155]) ).
thf(f157,plain,
( ~ spl11_12
| ~ spl11_13 ),
inference(avatar_contradiction_clause,[],[f156]) ).
thf(f167,plain,
( ( $true = $false )
| ~ spl11_15
| ~ spl11_18 ),
inference(forward_demodulation,[],[f139,f126]) ).
thf(f168,plain,
( $false
| ~ spl11_15
| ~ spl11_18 ),
inference(trivial_inequality_removal,[],[f167]) ).
thf(f169,plain,
( ~ spl11_15
| ~ spl11_18 ),
inference(avatar_contradiction_clause,[],[f168]) ).
thf(f176,plain,
( ! [X0: $i] :
( ( $true
= ( in @ X0 @ sF5 ) )
| ( ( in @ X0 @ sK2 )
= $false )
| ( ( in @ X0 @ sK1 )
= $true ) )
| ~ spl11_5 ),
inference(constrained_superposition,[],[f81,f26]) ).
thf(f178,plain,
( ( $false
= ( in @ sK0 @ sK2 ) )
| ( ( in @ sK0 @ sK1 )
= $true )
| ( $true = $false )
| ~ spl11_5
| ~ spl11_9 ),
inference(constrained_superposition,[],[f99,f176]) ).
thf(f180,plain,
( ( ( in @ sK0 @ sK1 )
= $true )
| ( $false
= ( in @ sK0 @ sK2 ) )
| ~ spl11_5
| ~ spl11_9 ),
inference(trivial_inequality_removal,[],[f178]) ).
thf(f182,plain,
( ( $false
= ( in @ sK0 @ sK2 ) )
| ~ spl11_5
| ~ spl11_9
| spl11_15 ),
inference(forward_subsumption_resolution,[],[f180,f125]) ).
thf(f186,plain,
( ( $true = $false )
| ~ spl11_5
| ~ spl11_9
| ~ spl11_14
| spl11_15 ),
inference(forward_demodulation,[],[f182,f121]) ).
thf(f187,plain,
( $false
| ~ spl11_5
| ~ spl11_9
| ~ spl11_14
| spl11_15 ),
inference(trivial_inequality_removal,[],[f186]) ).
thf(f188,plain,
( ~ spl11_5
| ~ spl11_9
| ~ spl11_14
| spl11_15 ),
inference(avatar_contradiction_clause,[],[f187]) ).
thf(f189,plain,
( ( $true = $false )
| ~ spl11_1
| ~ spl11_6 ),
inference(forward_demodulation,[],[f85,f63]) ).
thf(f190,plain,
( $false
| ~ spl11_1
| ~ spl11_6 ),
inference(trivial_inequality_removal,[],[f189]) ).
thf(f191,plain,
( ~ spl11_1
| ~ spl11_6 ),
inference(avatar_contradiction_clause,[],[f190]) ).
cnf(s4,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f86]) ).
cnf(s6,plain,
( spl11_9
| spl11_10 ),
inference(sat_conversion,[],[f104]) ).
cnf(s8,plain,
( spl11_13
| spl11_14 ),
inference(sat_conversion,[],[f122]) ).
cnf(s10,plain,
( spl11_17
| spl11_18 ),
inference(sat_conversion,[],[f140]) ).
cnf(s11,plain,
spl11_12,
inference(sat_conversion,[],[f141]) ).
cnf(s12,plain,
~ spl11_17,
inference(sat_conversion,[],[f142]) ).
cnf(s13,plain,
spl11_1,
inference(sat_conversion,[],[f143]) ).
cnf(s14,plain,
~ spl11_10,
inference(sat_conversion,[],[f144]) ).
cnf(s15,plain,
( ~ spl11_12
| ~ spl11_13 ),
inference(sat_conversion,[],[f157]) ).
cnf(s17,plain,
( ~ spl11_15
| ~ spl11_18 ),
inference(sat_conversion,[],[f169]) ).
cnf(s20,plain,
( ~ spl11_5
| ~ spl11_9
| ~ spl11_14
| spl11_15 ),
inference(sat_conversion,[],[f188]) ).
cnf(s21,plain,
( ~ spl11_1
| ~ spl11_6 ),
inference(sat_conversion,[],[f191]) ).
cnf(s22,plain,
~ spl11_6,
inference(rat,[],[s21,s13]) ).
cnf(s24,plain,
~ spl11_13,
inference(rat,[],[s15,s11]) ).
cnf(s25,plain,
spl11_18,
inference(rat,[],[s10,s12]) ).
cnf(s26,plain,
~ spl11_15,
inference(rat,[],[s17,s25]) ).
cnf(s27,plain,
spl11_14,
inference(rat,[],[s8,s24]) ).
cnf(s28,plain,
spl11_9,
inference(rat,[],[s6,s14]) ).
cnf(s29,plain,
~ spl11_5,
inference(rat,[],[s20,s26,s27,s28]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s4,s22,s29]) ).
thf(f192,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU606^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n019.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:57:33 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.21/0.28 % (809145)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (809156)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28 % (809156)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.21/0.28 % (809156)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=718201229:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (809154)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=636667581:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (809152)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1835131116:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (809151)lrs+10_16_si=on:nwc=1.5:random_seed=3242503883:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (809150)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4166614170:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (809153)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=61495474: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.21/0.28 % (809156) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809145-809156"...
% 0.21/0.28 % (809154) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809145-809154"...
% 0.21/0.28 % (809152)Refutation not found, incomplete strategy
% 0.21/0.28 % (809152)------------------------------
% 0.21/0.28 % (809152)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (809152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (809152)CaDiCaL version: 2.1.3
% 0.21/0.28 % (809152)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (809152)Time elapsed: 0.001 s
% 0.21/0.28 % (809152)Peak memory usage: 12 MB
% 0.21/0.28 % (809152)Instructions burned: 1 (million)
% 0.21/0.28 % (809150) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809145-809150"...
% 0.21/0.28 % (809151) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809145-809151"...
% 0.21/0.28 % (809152)------------------------------
% 0.21/0.28 % (809152)------------------------------
% 0.21/0.28 % (809153) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809145-809153"...
% 0.21/0.28 % (809156)...printing done.
% 0.21/0.28 % (809154)...printing done.
% 0.21/0.28 % (809156)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (809156)------------------------------
% 0.21/0.28 % (809156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (809156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (809156)CaDiCaL version: 2.1.3
% 0.21/0.28 % (809156)Termination reason: Refutation
% 0.21/0.28 % (809156)Time elapsed: 0.003 s
% 0.21/0.28 % (809156)Peak memory usage: 13 MB
% 0.21/0.28 % (809156)Instructions burned: 8 (million)
% 0.21/0.28 % (809145)Success in time 0.035 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------