%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV222^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:39:10 AM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of formulae : 101 ( 8 unt; 0 typ; 7 def)
% Number of atoms : 605 ( 157 equ; 0 cnn)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 571 ( 136 ~; 195 |; 24 &; 196 @)
% ( 11 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 51 ( 51 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 10 con; 0-4 aty)
% Number of variables : 87 ( 0 sgn 47 !; 17 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cZ: a > $o ).
thf(func_def_1,type,
cW: ( a > $o ) > $o ).
thf(func_def_5,type,
vOR: $o > $o > $o ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
sK0: a ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_10,type,
sK2: a > $o ).
thf(func_def_11,type,
sK3: a > $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(f1,conjecture,
! [X0: a] :
( ( ( cZ @ X0 )
| ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) ) )
<=> ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( X1
= ( ^ [X3: a] :
( ( X2 @ X3 )
| ( cZ @ X3 ) ) ) )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM60_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( cZ @ X0 )
| ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) ) )
<=> ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( X1
= ( ^ [X3: a] :
( ( X2 @ X3 )
| ( cZ @ X3 ) ) ) )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ( ( cZ @ X0 )
| ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) ) )
<=> ! [X2: a > $o] :
( ? [X3: a > $o] :
( ( X2
= ( ^ [X4: a] :
( ( X3 @ X4 )
| ( cZ @ X4 ) ) ) )
& ( cW @ X3 ) )
=> ( X2 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
=> ( ( X1 @ X0 )
= $true ) ) )
<=> ! [X2: a > $o] :
( ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
= X2 )
& ( ( cW @ X3 )
= $true ) )
=> ( ( X2 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( X1 @ X0 )
= $true )
| ( ( cW @ X1 )
!= $true ) ) )
<~> ! [X2: a > $o] :
( ( ( X2 @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
!= X2 )
| ( ( cW @ X3 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ( ? [X2: a > $o] :
( ( ( X2 @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
= X2 )
& ( ( cW @ X3 )
= $true ) ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
& ( ( cW @ X1 )
= $true ) ) ) )
& ( ! [X2: a > $o] :
( ( ( X2 @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
!= X2 )
| ( ( cW @ X3 )
!= $true ) ) )
| ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( X1 @ X0 )
= $true )
| ( ( cW @ X1 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: a] :
( ( ? [X2: a > $o] :
( ( ( X2 @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
= X2 )
& ( ( cW @ X3 )
= $true ) ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
& ( ( cW @ X1 )
= $true ) ) ) )
& ( ! [X2: a > $o] :
( ( ( X2 @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X3 @ Y0 ) ) )
!= X2 )
| ( ( cW @ X3 )
!= $true ) ) )
| ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( X1 @ X0 )
= $true )
| ( ( cW @ X1 )
!= $true ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
& ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X2 @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( $true
!= ( X3 @ X0 ) )
& ( ( cW @ X3 )
= $true ) ) ) )
& ( ! [X4: a > $o] :
( ( $true
= ( X4 @ X0 ) )
| ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X5 @ Y0 ) ) )
!= X4 )
| ( $true
!= ( cW @ X5 ) ) ) )
| ( ( cZ @ X0 )
= $true )
| ! [X6: a > $o] :
( ( $true
= ( X6 @ X0 ) )
| ( $true
!= ( cW @ X6 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( ( ( $true
!= ( sK1 @ sK0 ) )
& ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
& ( $true
= ( cW @ sK2 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( $true
!= ( sK3 @ sK0 ) )
& ( $true
= ( cW @ sK3 ) ) ) )
& ( ! [X4: a > $o] :
( ( $true
= ( X4 @ sK0 ) )
| ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X5 @ Y0 ) ) )
!= X4 )
| ( $true
!= ( cW @ X5 ) ) ) )
| ( $true
= ( cZ @ sK0 ) )
| ! [X6: a > $o] :
( ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f8]) ).
thf(f10,plain,
! [X6: a > $o,X4: a > $o,X5: a > $o] :
( ( $true
= ( X4 @ sK0 ) )
| ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X5 @ Y0 ) ) )
!= X4 )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
( ( $true
= ( cW @ sK2 ) )
| ( $true
= ( cW @ sK3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( ( $true
= ( cW @ sK2 ) )
| ( $true
!= ( sK3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( ( $true
= ( cW @ sK2 ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
| ( $true
= ( cW @ sK3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f15,plain,
( ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
| ( $true
!= ( sK3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
( ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f17,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| ( $true
= ( cW @ sK3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f18,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| ( $true
!= ( sK3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f22,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( X5 @ Y0 ) )
@ sK0 ) )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ),
inference(equality_resolution,[],[f10]) ).
thf(f23,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( ( cZ @ sK0 )
| ( X5 @ sK0 ) ) )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( X5 @ sK0 ) )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(or_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( X5 @ sK0 ) )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ),
inference(duplicate_literal_removal,[],[f24]) ).
thf(f27,definition,
( spl4_1
<=> ( $true
= ( sK3 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f28,plain,
( ( $true
= ( sK3 @ sK0 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f29,plain,
( ( $true
!= ( sK3 @ sK0 ) )
| spl4_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f31,definition,
( spl4_2
<=> ( $true
= ( sK1 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f33,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f34,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f18,f31,f27]) ).
thf(f36,definition,
( spl4_3
<=> ( $true
= ( cW @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f37,plain,
( ( $true
!= ( cW @ sK2 ) )
| spl4_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f38,plain,
( ( $true
= ( cW @ sK2 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f39,plain,
( ~ spl4_1
| spl4_3 ),
inference(avatar_split_clause,[],[f12,f36,f27]) ).
thf(f41,definition,
( spl4_4
<=> ( $true
= ( cZ @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f42,plain,
( ( $true
= ( cZ @ sK0 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f43,plain,
( ( $true
!= ( cZ @ sK0 ) )
| spl4_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f44,plain,
( ~ spl4_4
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f19,f31,f41]) ).
thf(f45,plain,
( ~ spl4_4
| spl4_3 ),
inference(avatar_split_clause,[],[f13,f36,f41]) ).
thf(f47,definition,
( spl4_5
<=> ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f49,plain,
( ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f50,plain,
( ~ spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f16,f47,f41]) ).
thf(f52,definition,
( spl4_6
<=> ( $true
= ( cW @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f53,plain,
( ( $true
!= ( cW @ sK3 ) )
| spl4_6 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f54,plain,
( ( $true
= ( cW @ sK3 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f55,plain,
( spl4_6
| spl4_5 ),
inference(avatar_split_clause,[],[f14,f47,f52]) ).
thf(f114,plain,
( ! [X6: a > $o,X5: a > $o] :
( ( $true
= ( X5 @ sK0 ) )
| ( $true
!= ( cW @ X5 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) )
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f25,f43]) ).
thf(f122,definition,
( spl4_13
<=> ! [X6: a > $o] :
( ( $true
= ( X6 @ sK0 ) )
| ( $true
!= ( cW @ X6 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_13])],[avatar_definition]) ).
thf(f123,plain,
( ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( $true
= ( X6 @ sK0 ) ) )
| ~ spl4_13 ),
inference(avatar_component_clause,[],[f122]) ).
thf(f124,plain,
( spl4_13
| spl4_13
| spl4_4 ),
inference(avatar_split_clause,[],[f114,f41,f122,f122]) ).
thf(f166,plain,
( ( $true != $true )
| ( $true
= ( sK2 @ sK0 ) )
| ~ spl4_3
| ~ spl4_13 ),
inference(constrained_superposition,[],[f123,f38]) ).
thf(f167,plain,
( ( $true != $true )
| ( $true
= ( sK3 @ sK0 ) )
| ~ spl4_6
| ~ spl4_13 ),
inference(constrained_superposition,[],[f123,f54]) ).
thf(f168,plain,
( ( $true
= ( sK3 @ sK0 ) )
| ~ spl4_6
| ~ spl4_13 ),
inference(trivial_inequality_removal,[],[f167]) ).
thf(f169,plain,
( ( $true
= ( sK2 @ sK0 ) )
| ~ spl4_3
| ~ spl4_13 ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f170,plain,
( $false
| spl4_1
| ~ spl4_6
| ~ spl4_13 ),
inference(forward_subsumption_resolution,[],[f168,f29]) ).
thf(f171,plain,
( spl4_1
| ~ spl4_6
| ~ spl4_13 ),
inference(avatar_contradiction_clause,[],[f170]) ).
thf(f175,plain,
( ( sK1
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) ) ) )
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f15,f28]) ).
thf(f176,plain,
( spl4_5
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f175,f27,f47]) ).
thf(f177,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) )
@ X1 ) )
| ~ spl4_5 ),
inference(argument_congruence,[],[f49]) ).
thf(f178,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
| ( sK2 @ Y0 ) )
@ X1 ) ) )
| ~ spl4_5 ),
inference(iff_proxy_clausification,[],[f177]) ).
thf(f182,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( ( cZ @ X1 )
| ( sK2 @ X1 ) ) ) )
| ~ spl4_5 ),
inference(beta-eta_normalization,[],[f178]) ).
thf(f183,plain,
( ! [X1: a] :
( ( $false
= ( sK2 @ X1 ) )
| ( $true
= ( sK1 @ X1 ) ) )
| ~ spl4_5 ),
inference(or_proxy_clausification,[],[f182]) ).
thf(f184,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( cZ @ X1 ) ) )
| ~ spl4_5 ),
inference(or_proxy_clausification,[],[f182]) ).
thf(f185,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK0 ) )
| ~ spl4_3
| ~ spl4_5
| ~ spl4_13 ),
inference(constrained_superposition,[],[f183,f169]) ).
thf(f188,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ~ spl4_3
| ~ spl4_5
| ~ spl4_13 ),
inference(trivial_inequality_removal,[],[f185]) ).
thf(f191,plain,
( $false
| spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_13 ),
inference(forward_subsumption_resolution,[],[f188,f33]) ).
thf(f192,plain,
( spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_13 ),
inference(avatar_contradiction_clause,[],[f191]) ).
thf(f193,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| spl4_6 ),
inference(forward_subsumption_resolution,[],[f17,f53]) ).
thf(f194,plain,
( ~ spl4_2
| spl4_6 ),
inference(avatar_split_clause,[],[f193,f52,f31]) ).
thf(f195,plain,
( ( $true
= ( cW @ sK2 ) )
| spl4_6 ),
inference(forward_subsumption_resolution,[],[f11,f53]) ).
thf(f196,plain,
( $false
| spl4_3
| spl4_6 ),
inference(forward_subsumption_resolution,[],[f195,f37]) ).
thf(f197,plain,
( spl4_3
| spl4_6 ),
inference(avatar_contradiction_clause,[],[f196]) ).
thf(f201,plain,
( ( $true != $true )
| ( ( cZ @ sK0 )
= $false )
| spl4_2
| ~ spl4_5 ),
inference(constrained_superposition,[],[f33,f184]) ).
thf(f202,plain,
( ( ( cZ @ sK0 )
= $false )
| spl4_2
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f201]) ).
thf(f209,plain,
( ( $true = $false )
| spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(constrained_superposition,[],[f202,f42]) ).
thf(f213,plain,
( $false
| spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f209]) ).
thf(f214,plain,
( spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f213]) ).
cnf(s14,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f34]) ).
cnf(s17,plain,
( ~ spl4_1
| spl4_3 ),
inference(sat_conversion,[],[f39]) ).
cnf(s20,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(sat_conversion,[],[f44]) ).
cnf(s25,plain,
( spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f45]) ).
cnf(s29,plain,
( ~ spl4_4
| spl4_5 ),
inference(sat_conversion,[],[f50]) ).
cnf(s33,plain,
( spl4_5
| spl4_6 ),
inference(sat_conversion,[],[f55]) ).
cnf(s78,plain,
( spl4_13
| spl4_4
| spl4_13 ),
inference(sat_conversion,[],[f124]) ).
cnf(s79,plain,
( spl4_4
| spl4_13 ),
inference(rat,[],[s78]) ).
cnf(s98,plain,
( spl4_1
| ~ spl4_6
| ~ spl4_13 ),
inference(sat_conversion,[],[f171]) ).
cnf(s108,plain,
( ~ spl4_1
| spl4_5 ),
inference(sat_conversion,[],[f176]) ).
cnf(s119,plain,
( spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_13 ),
inference(sat_conversion,[],[f192]) ).
cnf(s127,plain,
( ~ spl4_2
| spl4_6 ),
inference(sat_conversion,[],[f194]) ).
cnf(s133,plain,
( spl4_3
| spl4_6 ),
inference(sat_conversion,[],[f197]) ).
cnf(s148,plain,
( spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(sat_conversion,[],[f214]) ).
cnf(s149,plain,
( spl4_3
| spl4_1 ),
inference(rat,[],[s79,s98,s25,s133]) ).
cnf(s150,plain,
( ~ spl4_13
| spl4_2
| spl4_1 ),
inference(rat,[],[s33,s119,s98,s149]) ).
cnf(s151,plain,
( spl4_2
| spl4_1 ),
inference(rat,[],[s148,s29,s79,s150]) ).
cnf(s152,plain,
spl4_1,
inference(rat,[],[s79,s98,s20,s127,s151]) ).
cnf(s153,plain,
spl4_5,
inference(rat,[],[s108,s152]) ).
cnf(s154,plain,
spl4_3,
inference(rat,[],[s17,s152]) ).
cnf(s155,plain,
~ spl4_2,
inference(rat,[],[s14,s152]) ).
cnf(s156,plain,
~ spl4_4,
inference(rat,[],[s148,s155,s153]) ).
cnf(s157,plain,
~ spl4_13,
inference(rat,[],[s119,s155,s154,s153]) ).
cnf(s161,plain,
$false,
inference(rat,[],[s79,s157,s156]) ).
thf(f215,plain,
$false,
inference(avatar_sat_refutation,[],[s161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV222^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n003.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 15:24:43 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.19/0.26 % (2636789)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (2636796)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1386015083:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.26 % (2636795)% WARNING: option uhcvi not known.
% 0.19/0.26 % (2636796) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2636789-2636796"...
% 0.19/0.26 % (2636794)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=469790614_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.26 % (2636795)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1886079789:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26 % (2636798)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=20199807:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.26 % (2636797)dis+10_1_sil=32000:sp=arity:random_seed=3496770758:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.26 % (2636796)...printing done.
% 0.19/0.26 % (2636795)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.26 % (2636798)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.26 % (2636795)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.26 % Exception at run slice level
% 0.19/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.26 % (2636796)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (2636796)------------------------------
% 0.19/0.27 % (2636796)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (2636796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (2636796)CaDiCaL version: 2.1.3
% 0.19/0.27 % (2636796)Termination reason: Refutation
% 0.19/0.27 % (2636796)Time elapsed: 0.006 s
% 0.19/0.27 % (2636796)Peak memory usage: 13 MB
% 0.19/0.27 % (2636796)Instructions burned: 13 (million)
% 0.19/0.27 % (2636789)Success in time 0.039 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------