%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MSC007^1.003.004 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:15:37 AM UTC 2026
% Result : Theorem 45.03s 6.68s
% Output : Refutation 45.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 25
% Syntax : Number of formulae : 235 ( 33 unt; 0 typ; 17 def)
% Number of atoms : 1107 ( 799 equ; 0 cnn)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 1453 ( 301 ~; 820 |; 8 &; 304 @)
% ( 17 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 33 ( 30 usr; 26 con; 0-4 aty)
% Number of variables : 345 ( 0 sgn 339 !; 4 ?; 345 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
hole: $tType ).
thf(type_def_6,type,
pigeon: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
hole1: hole ).
thf(func_def_1,type,
hole2: hole ).
thf(func_def_2,type,
hole3: hole ).
thf(func_def_3,type,
pigeon1: pigeon ).
thf(func_def_4,type,
pigeon2: pigeon ).
thf(func_def_5,type,
pigeon3: pigeon ).
thf(func_def_6,type,
pigeon4: pigeon ).
thf(func_def_7,type,
pigeon_hole: pigeon > hole ).
thf(func_def_11,type,
vNOT: $o > $o ).
thf(func_def_12,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,axiom,
! [X0: hole > $o] :
( ( ( X0 @ hole3 )
& ( X0 @ hole2 )
& ( X0 @ hole1 ) )
=> ! [X1: hole] : ( X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holecover) ).
thf(f2,axiom,
pigeon1 != pigeon2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon1pigeon2) ).
thf(f3,axiom,
pigeon1 != pigeon3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon1pigeon3) ).
thf(f4,axiom,
pigeon2 != pigeon3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon2pigeon3) ).
thf(f5,axiom,
pigeon1 != pigeon4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon1pigeon4) ).
thf(f6,axiom,
pigeon2 != pigeon4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon2pigeon4) ).
thf(f7,axiom,
pigeon3 != pigeon4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pigeon3pigeon4) ).
thf(f8,conjecture,
? [X0: pigeon,X1: pigeon] :
( ( X0 != X1 )
& ( ( pigeon_hole @ X0 )
= ( pigeon_hole @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sharing_a_hole) ).
thf(f9,negated_conjecture,
~ ? [X0: pigeon,X1: pigeon] :
( ( X0 != X1 )
& ( ( pigeon_hole @ X0 )
= ( pigeon_hole @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
thf(f10,plain,
! [X0: hole > $o] :
( ( ( X0 @ hole3 )
& ( X0 @ hole2 )
& ( X0 @ hole1 ) )
=> ! [X1: hole] : ( X0 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f11,plain,
! [X0: hole > $o] :
( ( ( ( X0 @ hole3 )
= $true )
& ( ( X0 @ hole2 )
= $true )
& ( ( X0 @ hole1 )
= $true ) )
=> ! [X1: hole] :
( ( X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
! [X0: hole > $o] :
( ! [X1: hole] :
( ( X0 @ X1 )
= $true )
| ( ( X0 @ hole3 )
!= $true )
| ( ( X0 @ hole2 )
!= $true )
| ( ( X0 @ hole1 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f13,plain,
! [X0: hole > $o] :
( ! [X1: hole] :
( ( X0 @ X1 )
= $true )
| ( ( X0 @ hole3 )
!= $true )
| ( ( X0 @ hole2 )
!= $true )
| ( ( X0 @ hole1 )
!= $true ) ),
inference(flattening,[],[f12]) ).
thf(f14,plain,
! [X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( ( pigeon_hole @ X0 )
!= ( pigeon_hole @ X1 ) ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f15,plain,
! [X0: hole > $o,X1: hole] :
( ( ( X0 @ hole3 )
!= $true )
| ( ( X0 @ X1 )
= $true )
| ( ( X0 @ hole2 )
!= $true )
| ( ( X0 @ hole1 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
pigeon1 != pigeon2,
inference(cnf_transformation,[],[f2]) ).
thf(f17,plain,
pigeon1 != pigeon3,
inference(cnf_transformation,[],[f3]) ).
thf(f18,plain,
pigeon2 != pigeon3,
inference(cnf_transformation,[],[f4]) ).
thf(f19,plain,
pigeon1 != pigeon4,
inference(cnf_transformation,[],[f5]) ).
thf(f20,plain,
pigeon2 != pigeon4,
inference(cnf_transformation,[],[f6]) ).
thf(f21,plain,
pigeon3 != pigeon4,
inference(cnf_transformation,[],[f7]) ).
thf(f22,plain,
! [X0: pigeon,X1: pigeon] :
( ( ( pigeon_hole @ X0 )
!= ( pigeon_hole @ X1 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f34,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( $true
!= ( ^ [Y0: hole] : ( Y0 != X0 )
@ hole2 ) )
| ( $true
!= ( ^ [Y0: hole] : ( Y0 != X0 )
@ hole1 ) ) ),
inference(leibniz_equality_elimination,[],[f15]) ).
thf(f55,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( $true
!= ( hole2 != X0 ) )
| ( $true
!= ( hole1 != X0 ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f56,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( $true
= ( hole2 = X0 ) )
| ( $true
!= ( hole1 != X0 ) ) ),
inference(not_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( hole2 = X0 )
| ( $true
!= ( hole1 != X0 ) ) ),
inference(equality_proxy_clausification,[],[f56]) ).
thf(f58,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( hole2 = X0 )
| ( $true
= ( hole1 = X0 ) ) ),
inference(not_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X0: hole] :
( ( hole3 = X0 )
| ( hole2 = X0 )
| ( hole1 = X0 ) ),
inference(equality_proxy_clausification,[],[f58]) ).
thf(f78,plain,
! [X0: pigeon,X1: pigeon] :
( ( hole3
!= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(constrained_superposition,[],[f22,f59]) ).
thf(f85,plain,
! [X0: pigeon,X1: pigeon] :
( ( hole3 != hole3 )
| ( X0 = X1 )
| ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(constrained_superposition,[],[f78,f59]) ).
thf(f86,plain,
! [X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f95,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
!= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( hole2
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(constrained_superposition,[],[f22,f86]) ).
thf(f97,plain,
! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole2 )
| ( hole2
= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) ) ),
inference(equality_factoring,[],[f86]) ).
thf(f107,definition,
( spl0_5
<=> ! [X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X0 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
thf(f108,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) ) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f107]) ).
thf(f110,definition,
( spl0_6
<=> ( hole1 = hole2 ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
thf(f112,plain,
( ( hole1 != hole2 )
| spl0_6 ),
inference(avatar_component_clause,[],[f110]) ).
thf(f114,plain,
( spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f97,f110,f107]) ).
thf(f117,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2 != hole2 )
| ( X0 = X1 )
| ( hole2
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) ),
inference(constrained_superposition,[],[f95,f86]) ).
thf(f118,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X3 ) )
| ( hole2
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X1 = X2 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f117]) ).
thf(f137,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( hole2
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole2
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( X1 = X3 )
| ( X2 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) ) ),
inference(constrained_superposition,[],[f22,f118]) ).
thf(f153,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2 != hole2 )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X1 )
| ( X0 = X2 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(equality_factoring,[],[f118]) ).
thf(f167,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( X1 != X2 )
| ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X2 )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) ) ),
inference(equality_factoring,[],[f118]) ).
thf(f184,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 != X2 ) ),
inference(duplicate_literal_removal,[],[f167]) ).
thf(f195,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2 != hole2 )
| ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X1 )
| ( X0 = X2 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(duplicate_literal_removal,[],[f153]) ).
thf(f196,plain,
! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f195]) ).
thf(f227,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( hole1 = hole2 )
| ( hole2
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X3 = X4 )
| ( X0 = X5 )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(constrained_superposition,[],[f196,f118]) ).
thf(f230,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X2 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) ) ),
inference(constrained_superposition,[],[f22,f196]) ).
thf(f274,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( hole1 = hole2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X3 = X4 )
| ( X0 = X5 )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) ),
inference(forward_subsumption_resolution,[],[f227,f137]) ).
thf(f286,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X3 = X4 )
| ( X0 = X5 )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f274,f112]) ).
thf(f369,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( hole2 != hole2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X2 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 != X5 ) ),
inference(constrained_superposition,[],[f230,f184]) ).
thf(f405,plain,
! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X2 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 != X5 ) ),
inference(trivial_inequality_removal,[],[f369]) ).
thf(f412,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X2 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole2
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f405,f286]) ).
thf(f430,definition,
( spl0_9
<=> ! [X0: pigeon,X3: pigeon,X2: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X3 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X2 = X3 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
thf(f431,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X3 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X2 = X3 ) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f430]) ).
thf(f432,plain,
( spl0_5
| spl0_9
| spl0_6 ),
inference(avatar_split_clause,[],[f412,f110,f430,f107]) ).
thf(f452,definition,
( spl0_10
<=> ! [X2: pigeon,X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
thf(f453,plain,
( ! [X2: pigeon,X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X2 ) )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f452]) ).
thf(f478,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) ) )
| ~ spl0_5 ),
inference(constrained_superposition,[],[f22,f108]) ).
thf(f607,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole2 != hole2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_5 ),
inference(constrained_superposition,[],[f478,f108]) ).
thf(f608,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f607]) ).
thf(f642,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( X1 != X2 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_5 ),
inference(equality_factoring,[],[f608]) ).
thf(f666,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_5 ),
inference(equality_factoring,[],[f608]) ).
thf(f669,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_5 ),
inference(duplicate_literal_removal,[],[f666]) ).
thf(f670,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f669]) ).
thf(f703,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X3 ) )
| ( X1 = X3 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f642,f670]) ).
thf(f707,plain,
( spl0_10
| spl0_10
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f703,f107,f452,f452]) ).
thf(f715,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 ) )
| ~ spl0_10 ),
inference(constrained_superposition,[],[f22,f453]) ).
thf(f724,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 ) )
| ~ spl0_10 ),
inference(constrained_superposition,[],[f715,f453]) ).
thf(f725,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 ) )
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f724]) ).
thf(f731,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( pigeon1 != X0 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon3 = X2 ) )
| ~ spl0_10 ),
inference(constrained_superposition,[],[f17,f725]) ).
thf(f784,definition,
( spl0_13
<=> ! [X2: pigeon,X0: pigeon] :
( ( pigeon1 != X0 )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
thf(f785,plain,
( ! [X2: pigeon,X0: pigeon] :
( ( pigeon1 != X0 )
| ( X0 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) ) )
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f784]) ).
thf(f796,definition,
( spl0_16
<=> ! [X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X1 ) )
| ( pigeon3 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
thf(f797,plain,
( ! [X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X1 ) )
| ( pigeon3 = X1 ) )
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f796]) ).
thf(f807,plain,
( spl0_16
| spl0_13
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f731,f452,f784,f796]) ).
thf(f1119,plain,
( ! [X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X0 ) )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(equality_resolution,[],[f785]) ).
thf(f1126,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(constrained_superposition,[],[f22,f1119]) ).
thf(f1148,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( pigeon3 = X0 ) )
| ~ spl0_16 ),
inference(constrained_superposition,[],[f22,f797]) ).
thf(f1216,definition,
( spl0_22
<=> ! [X1: pigeon] :
( ( pigeon2 != X1 )
| ( pigeon1 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
thf(f1217,plain,
( ! [X1: pigeon] :
( ( pigeon2 != X1 )
| ( pigeon1 = X1 ) )
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f1216]) ).
thf(f1280,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( pigeon3 = X1 )
| ( pigeon3 = X0 ) )
| ~ spl0_16 ),
inference(constrained_superposition,[],[f1148,f797]) ).
thf(f1281,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( pigeon3 = X1 )
| ( pigeon3 = X0 ) )
| ~ spl0_16 ),
inference(trivial_inequality_removal,[],[f1280]) ).
thf(f1305,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = pigeon4 )
| ( pigeon3 = X0 ) )
| ~ spl0_16 ),
inference(constrained_superposition,[],[f20,f1281]) ).
thf(f1328,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[],[f1305,f21]) ).
thf(f1340,plain,
( ( pigeon2 = pigeon3 )
| ~ spl0_16 ),
inference(equality_resolution,[],[f1328]) ).
thf(f1341,plain,
( $false
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[],[f1340,f18]) ).
thf(f1342,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f1341]) ).
thf(f1348,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(constrained_superposition,[],[f1126,f1119]) ).
thf(f1349,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(trivial_inequality_removal,[],[f1348]) ).
thf(f1359,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon1 = pigeon4 )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(constrained_superposition,[],[f20,f1349]) ).
thf(f1380,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon1 = X0 ) )
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1359,f19]) ).
thf(f1386,plain,
( spl0_22
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f1380,f784,f1216]) ).
thf(f1391,plain,
( ( pigeon1 = pigeon2 )
| ~ spl0_22 ),
inference(equality_resolution,[],[f1217]) ).
thf(f1392,plain,
( $false
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[],[f1391,f16]) ).
thf(f1393,plain,
~ spl0_22,
inference(avatar_contradiction_clause,[],[f1392]) ).
thf(f1707,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_9 ),
inference(equality_factoring,[],[f431]) ).
thf(f1726,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_9 ),
inference(duplicate_literal_removal,[],[f1707]) ).
thf(f1727,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 ) )
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f1726]) ).
thf(f1802,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( X2 = X3 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X1 = X3 )
| ( X1 = X2 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f22,f1727]) ).
thf(f1856,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( X2 = X3 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X1 = X3 )
| ( X1 = X2 )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X0 = X5 )
| ( X0 = X4 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f1802,f1727]) ).
thf(f1857,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon,X5: pigeon] :
( ( X0 = X1 )
| ( X2 = X3 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X1 = X3 )
| ( X1 = X2 )
| ( X4 = X5 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X5 ) )
| ( X0 = X5 )
| ( X0 = X4 ) )
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f1856]) ).
thf(f3787,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( pigeon1 != X0 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( pigeon2 = X4 )
| ( pigeon2 = X3 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f16,f1857]) ).
thf(f3788,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( pigeon1 != X0 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( pigeon3 = X4 )
| ( pigeon3 = X3 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f17,f1857]) ).
thf(f3790,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( pigeon1 != X0 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( pigeon4 = X4 )
| ( pigeon4 = X3 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f19,f1857]) ).
thf(f3791,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( pigeon3 != X0 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( pigeon4 = X4 )
| ( pigeon4 = X3 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f21,f1857]) ).
thf(f3792,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon,X4: pigeon] :
( ( pigeon2 != X0 )
| ( X1 = X2 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( pigeon4 = X4 )
| ( pigeon4 = X3 ) )
| ~ spl0_9 ),
inference(constrained_superposition,[],[f20,f1857]) ).
thf(f4084,definition,
( spl0_29
<=> ! [X2: pigeon,X1: pigeon] :
( ( X1 = X2 )
| ( pigeon4 = X1 )
| ( pigeon4 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
thf(f4085,plain,
( ! [X2: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( pigeon4 = X2 )
| ( pigeon4 = X1 ) )
| ~ spl0_29 ),
inference(avatar_component_clause,[],[f4084]) ).
thf(f4087,definition,
( spl0_30
<=> ! [X4: pigeon,X0: pigeon,X3: pigeon] :
( ( pigeon2 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_30])],[avatar_definition]) ).
thf(f4088,plain,
( ! [X3: pigeon,X0: pigeon,X4: pigeon] :
( ( pigeon2 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) )
| ~ spl0_30 ),
inference(avatar_component_clause,[],[f4087]) ).
thf(f4091,definition,
( spl0_31
<=> ! [X4: pigeon,X0: pigeon,X3: pigeon] :
( ( pigeon3 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
thf(f4092,plain,
( ! [X3: pigeon,X0: pigeon,X4: pigeon] :
( ( pigeon3 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) )
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f4091]) ).
thf(f4095,definition,
( spl0_32
<=> ! [X4: pigeon,X0: pigeon,X3: pigeon] :
( ( pigeon1 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_32])],[avatar_definition]) ).
thf(f4096,plain,
( ! [X3: pigeon,X0: pigeon,X4: pigeon] :
( ( pigeon1 != X0 )
| ( X0 = X3 )
| ( X0 = X4 )
| ( X3 = X4 )
| ( hole1
= ( pigeon_hole @ X4 ) )
| ( hole1
= ( pigeon_hole @ X3 ) ) )
| ~ spl0_32 ),
inference(avatar_component_clause,[],[f4095]) ).
thf(f4099,definition,
( spl0_33
<=> ! [X2: pigeon,X1: pigeon] :
( ( X1 = X2 )
| ( pigeon3 = X1 )
| ( pigeon3 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
thf(f4100,plain,
( ! [X2: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( pigeon3 = X2 )
| ( pigeon3 = X1 ) )
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f4099]) ).
thf(f4104,definition,
( spl0_34
<=> ! [X2: pigeon,X1: pigeon] :
( ( X1 = X2 )
| ( pigeon2 = X1 )
| ( pigeon2 = X2 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_34])],[avatar_definition]) ).
thf(f4105,plain,
( ! [X2: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X1 = X2 )
| ( pigeon2 = X2 )
| ( pigeon2 = X1 ) )
| ~ spl0_34 ),
inference(avatar_component_clause,[],[f4104]) ).
thf(f4107,plain,
( spl0_29
| spl0_30
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f3792,f430,f4087,f4084]) ).
thf(f4108,plain,
( spl0_29
| spl0_31
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f3791,f430,f4091,f4084]) ).
thf(f4109,plain,
( spl0_29
| spl0_32
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f3790,f430,f4095,f4084]) ).
thf(f4111,plain,
( spl0_33
| spl0_32
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f3788,f430,f4095,f4099]) ).
thf(f4112,plain,
( spl0_34
| spl0_32
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f3787,f430,f4095,f4104]) ).
thf(f4151,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( pigeon3 = X2 )
| ( pigeon3 = X1 ) )
| ~ spl0_33 ),
inference(constrained_superposition,[],[f22,f4100]) ).
thf(f4262,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( pigeon3 = X2 )
| ( pigeon3 = X1 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( X0 = X3 )
| ( pigeon2 = X0 )
| ( pigeon2 = X3 ) )
| ~ spl0_33
| ~ spl0_34 ),
inference(constrained_superposition,[],[f4151,f4105]) ).
thf(f4263,plain,
( ! [X2: pigeon,X3: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon3 = X1 )
| ( pigeon2 = X0 )
| ( X1 = X2 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( pigeon3 = X2 )
| ( pigeon2 = X3 ) )
| ~ spl0_33
| ~ spl0_34 ),
inference(trivial_inequality_removal,[],[f4262]) ).
thf(f5044,definition,
( spl0_46
<=> ! [X2: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon4 = X2 )
| ( pigeon2 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_46])],[avatar_definition]) ).
thf(f5045,plain,
( ! [X2: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon4 = X2 )
| ( pigeon2 = X2 ) )
| ~ spl0_46 ),
inference(avatar_component_clause,[],[f5044]) ).
thf(f5064,definition,
( spl0_50
<=> ! [X2: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon4 = X2 )
| ( pigeon3 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_50])],[avatar_definition]) ).
thf(f5065,plain,
( ! [X2: pigeon] :
( ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon4 = X2 )
| ( pigeon3 = X2 ) )
| ~ spl0_50 ),
inference(avatar_component_clause,[],[f5064]) ).
thf(f5073,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon2 = X0 )
| ( pigeon2 = X1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_30 ),
inference(equality_resolution,[],[f4088]) ).
thf(f5078,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon3 = X0 )
| ( pigeon3 = X1 )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_31 ),
inference(equality_resolution,[],[f4092]) ).
thf(f5083,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_32 ),
inference(equality_resolution,[],[f4096]) ).
thf(f5103,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( X1 = X2 )
| ( pigeon1 = X2 )
| ( pigeon1 = X1 ) )
| ~ spl0_32 ),
inference(constrained_superposition,[],[f22,f5083]) ).
thf(f5247,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( pigeon1 != X0 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon3 = X0 )
| ( pigeon2 = pigeon4 )
| ( X0 = X2 )
| ( pigeon4 = X1 )
| ( pigeon3 = X2 )
| ( pigeon2 = X1 ) )
| ~ spl0_33
| ~ spl0_34 ),
inference(constrained_superposition,[],[f19,f4263]) ).
thf(f5386,plain,
( ! [X2: pigeon,X0: pigeon,X1: pigeon] :
( ( pigeon1 != X0 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( hole1
= ( pigeon_hole @ X2 ) )
| ( pigeon3 = X0 )
| ( X0 = X2 )
| ( pigeon4 = X1 )
| ( pigeon3 = X2 )
| ( pigeon2 = X1 ) )
| ~ spl0_33
| ~ spl0_34 ),
inference(forward_subsumption_resolution,[],[f5247,f20]) ).
thf(f5393,definition,
( spl0_60
<=> ( hole1
= ( pigeon_hole @ pigeon3 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_60])],[avatar_definition]) ).
thf(f5394,plain,
( ( hole1
!= ( pigeon_hole @ pigeon3 ) )
| spl0_60 ),
inference(avatar_component_clause,[],[f5393]) ).
thf(f5395,plain,
( ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ~ spl0_60 ),
inference(avatar_component_clause,[],[f5393]) ).
thf(f5411,definition,
( spl0_63
<=> ! [X2: pigeon,X0: pigeon] :
( ( pigeon1 != X0 )
| ( pigeon3 = X2 )
| ( X0 = X2 )
| ( pigeon3 = X0 )
| ( hole1
= ( pigeon_hole @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_63])],[avatar_definition]) ).
thf(f5412,plain,
( ! [X2: pigeon,X0: pigeon] :
( ( pigeon1 != X0 )
| ( pigeon3 = X2 )
| ( X0 = X2 )
| ( pigeon3 = X0 )
| ( hole1
= ( pigeon_hole @ X2 ) ) )
| ~ spl0_63 ),
inference(avatar_component_clause,[],[f5411]) ).
thf(f5413,plain,
( spl0_46
| spl0_63
| ~ spl0_33
| ~ spl0_34 ),
inference(avatar_split_clause,[],[f5386,f4104,f4099,f5411,f5044]) ).
thf(f5415,plain,
( spl0_33
| ~ spl0_31 ),
inference(avatar_split_clause,[],[f5078,f4091,f4099]) ).
thf(f5423,plain,
( spl0_34
| ~ spl0_30 ),
inference(avatar_split_clause,[],[f5073,f4087,f4104]) ).
thf(f5434,plain,
( ! [X0: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( pigeon3 = X0 ) )
| ~ spl0_60 ),
inference(constrained_superposition,[],[f22,f5395]) ).
thf(f5443,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( pigeon3 = X0 )
| ( hole1
= ( pigeon_hole @ X1 ) )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(constrained_superposition,[],[f5103,f5395]) ).
thf(f5473,plain,
( ! [X0: pigeon] :
( ( hole1 != hole1 )
| ( pigeon3 = X0 )
| ( pigeon4 = X0 )
| ( pigeon2 = X0 ) )
| ~ spl0_46
| ~ spl0_60 ),
inference(constrained_superposition,[],[f5434,f5045]) ).
thf(f5474,plain,
( ! [X0: pigeon] :
( ( pigeon4 = X0 )
| ( pigeon3 = X0 )
| ( pigeon2 = X0 ) )
| ~ spl0_46
| ~ spl0_60 ),
inference(trivial_inequality_removal,[],[f5473]) ).
thf(f5480,plain,
( ! [X0: pigeon] :
( ( pigeon1 != X0 )
| ( pigeon3 = X0 )
| ( pigeon2 = X0 ) )
| ~ spl0_46
| ~ spl0_60 ),
inference(constrained_superposition,[],[f19,f5474]) ).
thf(f5485,plain,
( ( pigeon1 = pigeon3 )
| ( pigeon1 = pigeon2 )
| ~ spl0_46
| ~ spl0_60 ),
inference(equality_resolution,[],[f5480]) ).
thf(f5486,plain,
( ( pigeon1 = pigeon2 )
| ~ spl0_46
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f5485,f17]) ).
thf(f5487,plain,
( $false
| ~ spl0_46
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f5486,f16]) ).
thf(f5488,plain,
( ~ spl0_46
| ~ spl0_60 ),
inference(avatar_contradiction_clause,[],[f5487]) ).
thf(f5495,plain,
( ( hole1 != hole1 )
| ( pigeon3 = pigeon4 )
| ( pigeon2 = pigeon3 )
| ~ spl0_46
| spl0_60 ),
inference(constrained_superposition,[],[f5394,f5045]) ).
thf(f5496,plain,
( ( pigeon3 = pigeon4 )
| ( pigeon2 = pigeon3 )
| ~ spl0_46
| spl0_60 ),
inference(trivial_inequality_removal,[],[f5495]) ).
thf(f5500,plain,
( ( pigeon2 = pigeon3 )
| ~ spl0_46
| spl0_60 ),
inference(forward_subsumption_resolution,[],[f5496,f21]) ).
thf(f5501,plain,
( $false
| ~ spl0_46
| spl0_60 ),
inference(forward_subsumption_resolution,[],[f5500,f18]) ).
thf(f5502,plain,
( ~ spl0_46
| spl0_60 ),
inference(avatar_contradiction_clause,[],[f5501]) ).
thf(f6183,plain,
( ! [X0: pigeon] :
( ( pigeon3 = X0 )
| ( pigeon1 = X0 )
| ( pigeon1 = pigeon3 )
| ( hole1
= ( pigeon_hole @ X0 ) ) )
| ~ spl0_63 ),
inference(equality_resolution,[],[f5412]) ).
thf(f6184,plain,
( ! [X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X0 ) )
| ( pigeon1 = X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_63 ),
inference(forward_subsumption_resolution,[],[f6183,f17]) ).
thf(f6193,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon3 = X1 ) )
| ~ spl0_63 ),
inference(constrained_superposition,[],[f22,f6184]) ).
thf(f6218,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon3 = X1 )
| ( pigeon1 = X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_63 ),
inference(constrained_superposition,[],[f6193,f6184]) ).
thf(f6219,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon3 = X1 )
| ( pigeon3 = X0 )
| ( X0 = X1 )
| ( pigeon1 = X0 )
| ( pigeon1 = X1 ) )
| ~ spl0_63 ),
inference(trivial_inequality_removal,[],[f6218]) ).
thf(f6404,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = pigeon4 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 )
| ( pigeon1 = pigeon4 ) )
| ~ spl0_63 ),
inference(constrained_superposition,[],[f20,f6219]) ).
thf(f6431,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 )
| ( pigeon1 = pigeon4 ) )
| ~ spl0_63 ),
inference(forward_subsumption_resolution,[],[f6404,f21]) ).
thf(f6435,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 ) )
| ~ spl0_63 ),
inference(forward_subsumption_resolution,[],[f6431,f19]) ).
thf(f6449,plain,
( ( pigeon2 = pigeon3 )
| ( pigeon1 = pigeon2 )
| ~ spl0_63 ),
inference(equality_resolution,[],[f6435]) ).
thf(f6450,plain,
( ( pigeon1 = pigeon2 )
| ~ spl0_63 ),
inference(forward_subsumption_resolution,[],[f6449,f18]) ).
thf(f6451,plain,
( $false
| ~ spl0_63 ),
inference(forward_subsumption_resolution,[],[f6450,f16]) ).
thf(f6452,plain,
~ spl0_63,
inference(avatar_contradiction_clause,[],[f6451]) ).
thf(f6555,plain,
( ! [X0: pigeon] :
( ( hole1 != hole1 )
| ( hole1
= ( pigeon_hole @ X0 ) )
| ( pigeon3 = X0 )
| ( pigeon4 = X0 )
| ( pigeon3 = pigeon4 ) )
| ~ spl0_29
| spl0_60 ),
inference(constrained_superposition,[],[f5394,f4085]) ).
thf(f6562,plain,
( ! [X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X0 ) )
| ( pigeon3 = X0 )
| ( pigeon4 = X0 )
| ( pigeon3 = pigeon4 ) )
| ~ spl0_29
| spl0_60 ),
inference(trivial_inequality_removal,[],[f6555]) ).
thf(f6574,plain,
( ! [X0: pigeon] :
( ( hole1
= ( pigeon_hole @ X0 ) )
| ( pigeon3 = X0 )
| ( pigeon4 = X0 ) )
| ~ spl0_29
| spl0_60 ),
inference(forward_subsumption_resolution,[],[f6562,f21]) ).
thf(f6576,plain,
( spl0_50
| ~ spl0_29
| spl0_60 ),
inference(avatar_split_clause,[],[f6574,f5393,f4084,f5064]) ).
thf(f6590,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( X0 = X1 )
| ( pigeon4 = X1 )
| ( pigeon3 = X1 ) )
| ~ spl0_50 ),
inference(constrained_superposition,[],[f22,f5065]) ).
thf(f6615,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( X0 = X1 )
| ( pigeon4 = X1 )
| ( pigeon3 = X1 )
| ( pigeon4 = X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_50 ),
inference(constrained_superposition,[],[f6590,f5065]) ).
thf(f6616,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon4 = X1 )
| ( pigeon4 = X0 )
| ( X0 = X1 )
| ( pigeon3 = X1 )
| ( pigeon3 = X0 ) )
| ~ spl0_50 ),
inference(trivial_inequality_removal,[],[f6615]) ).
thf(f6629,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon1 != X0 )
| ( pigeon4 = X1 )
| ( X0 = X1 )
| ( pigeon3 = X1 )
| ( pigeon3 = X0 ) )
| ~ spl0_50 ),
inference(constrained_superposition,[],[f19,f6616]) ).
thf(f6706,plain,
( ! [X0: pigeon] :
( ( pigeon4 = X0 )
| ( pigeon1 = X0 )
| ( pigeon3 = X0 )
| ( pigeon1 = pigeon3 ) )
| ~ spl0_50 ),
inference(equality_resolution,[],[f6629]) ).
thf(f6707,plain,
( ! [X0: pigeon] :
( ( pigeon4 = X0 )
| ( pigeon1 = X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f6706,f17]) ).
thf(f6715,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon1 = X0 )
| ( pigeon3 = X0 ) )
| ~ spl0_50 ),
inference(constrained_superposition,[],[f20,f6707]) ).
thf(f6718,plain,
( ( pigeon1 = pigeon2 )
| ( pigeon2 = pigeon3 )
| ~ spl0_50 ),
inference(equality_resolution,[],[f6715]) ).
thf(f6719,plain,
( ( pigeon2 = pigeon3 )
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f6718,f16]) ).
thf(f6720,plain,
( $false
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f6719,f18]) ).
thf(f6721,plain,
~ spl0_50,
inference(avatar_contradiction_clause,[],[f6720]) ).
thf(f6729,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1
= ( pigeon_hole @ X1 ) )
| ( pigeon3 = X0 )
| ( X0 = X1 )
| ( pigeon1 = X1 )
| ( pigeon1 = X0 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(trivial_inequality_removal,[],[f5443]) ).
thf(f6744,plain,
( ! [X0: pigeon] :
( ( hole1
!= ( pigeon_hole @ X0 ) )
| ( pigeon3 = X0 ) )
| ~ spl0_60 ),
inference(constrained_superposition,[],[f22,f5395]) ).
thf(f6787,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( hole1 != hole1 )
| ( pigeon3 = X0 )
| ( pigeon3 = X1 )
| ( X0 = X1 )
| ( pigeon1 = X0 )
| ( pigeon1 = X1 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(constrained_superposition,[],[f6744,f6729]) ).
thf(f6801,plain,
( ! [X0: pigeon,X1: pigeon] :
( ( pigeon3 = X1 )
| ( pigeon3 = X0 )
| ( X0 = X1 )
| ( pigeon1 = X0 )
| ( pigeon1 = X1 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(trivial_inequality_removal,[],[f6787]) ).
thf(f6843,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = pigeon4 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 )
| ( pigeon1 = pigeon4 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(constrained_superposition,[],[f20,f6801]) ).
thf(f6870,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 )
| ( pigeon1 = pigeon4 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f6843,f21]) ).
thf(f6874,plain,
( ! [X0: pigeon] :
( ( pigeon2 != X0 )
| ( pigeon3 = X0 )
| ( pigeon1 = X0 ) )
| ~ spl0_32
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f6870,f19]) ).
thf(f6939,plain,
( ( pigeon2 = pigeon3 )
| ( pigeon1 = pigeon2 )
| ~ spl0_32
| ~ spl0_60 ),
inference(equality_resolution,[],[f6874]) ).
thf(f6940,plain,
( ( pigeon1 = pigeon2 )
| ~ spl0_32
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f6939,f18]) ).
thf(f6941,plain,
( $false
| ~ spl0_32
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f6940,f16]) ).
thf(f6942,plain,
( ~ spl0_32
| ~ spl0_60 ),
inference(avatar_contradiction_clause,[],[f6941]) ).
cnf(s4,plain,
( spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f114]) ).
cnf(s6,plain,
( spl0_5
| spl0_6
| spl0_9 ),
inference(sat_conversion,[],[f432]) ).
cnf(s13,plain,
( spl0_10
| ~ spl0_5
| spl0_10 ),
inference(sat_conversion,[],[f707]) ).
cnf(s14,plain,
( ~ spl0_5
| spl0_10 ),
inference(rat,[],[s13]) ).
cnf(s24,plain,
( ~ spl0_10
| spl0_13
| spl0_16 ),
inference(sat_conversion,[],[f807]) ).
cnf(s42,plain,
~ spl0_16,
inference(sat_conversion,[],[f1342]) ).
cnf(s43,plain,
( ~ spl0_13
| spl0_22 ),
inference(sat_conversion,[],[f1386]) ).
cnf(s47,plain,
~ spl0_22,
inference(sat_conversion,[],[f1393]) ).
cnf(s75,plain,
( ~ spl0_9
| spl0_29
| spl0_30 ),
inference(sat_conversion,[],[f4107]) ).
cnf(s76,plain,
( ~ spl0_9
| spl0_29
| spl0_31 ),
inference(sat_conversion,[],[f4108]) ).
cnf(s77,plain,
( ~ spl0_9
| spl0_29
| spl0_32 ),
inference(sat_conversion,[],[f4109]) ).
cnf(s79,plain,
( ~ spl0_9
| spl0_32
| spl0_33 ),
inference(sat_conversion,[],[f4111]) ).
cnf(s80,plain,
( ~ spl0_9
| spl0_32
| spl0_34 ),
inference(sat_conversion,[],[f4112]) ).
cnf(s121,plain,
( ~ spl0_33
| ~ spl0_34
| spl0_46
| spl0_63 ),
inference(sat_conversion,[],[f5413]) ).
cnf(s123,plain,
( ~ spl0_31
| spl0_33 ),
inference(sat_conversion,[],[f5415]) ).
cnf(s128,plain,
( ~ spl0_30
| spl0_34 ),
inference(sat_conversion,[],[f5423]) ).
cnf(s134,plain,
( ~ spl0_46
| ~ spl0_60 ),
inference(sat_conversion,[],[f5488]) ).
cnf(s135,plain,
( ~ spl0_46
| spl0_60 ),
inference(sat_conversion,[],[f5502]) ).
cnf(s154,plain,
~ spl0_63,
inference(sat_conversion,[],[f6452]) ).
cnf(s157,plain,
( ~ spl0_29
| spl0_50
| spl0_60 ),
inference(sat_conversion,[],[f6576]) ).
cnf(s159,plain,
~ spl0_50,
inference(sat_conversion,[],[f6721]) ).
cnf(s162,plain,
( ~ spl0_32
| ~ spl0_60 ),
inference(sat_conversion,[],[f6942]) ).
cnf(s163,plain,
( ~ spl0_29
| spl0_60 ),
inference(rat,[],[s157,s159]) ).
cnf(s171,plain,
( ~ spl0_33
| ~ spl0_34
| spl0_46 ),
inference(rat,[],[s121,s154]) ).
cnf(s184,plain,
~ spl0_13,
inference(rat,[],[s43,s47]) ).
cnf(s188,plain,
~ spl0_10,
inference(rat,[],[s24,s42,s184]) ).
cnf(s194,plain,
~ spl0_5,
inference(rat,[],[s14,s188]) ).
cnf(s196,plain,
( spl0_6
| spl0_9 ),
inference(rat,[],[s6,s194]) ).
cnf(s198,plain,
~ spl0_6,
inference(rat,[],[s4,s194]) ).
cnf(s199,plain,
spl0_9,
inference(rat,[],[s196,s198]) ).
cnf(s202,plain,
spl0_29,
inference(rat,[],[s171,s135,s128,s123,s162,s75,s76,s77,s199]) ).
cnf(s203,plain,
spl0_60,
inference(rat,[],[s163,s202]) ).
cnf(s204,plain,
~ spl0_32,
inference(rat,[],[s162,s203]) ).
cnf(s205,plain,
~ spl0_46,
inference(rat,[],[s134,s203]) ).
cnf(s206,plain,
spl0_34,
inference(rat,[],[s80,s199,s204]) ).
cnf(s207,plain,
spl0_33,
inference(rat,[],[s79,s199,s204]) ).
cnf(s208,plain,
$false,
inference(rat,[],[s171,s206,s205,s207]) ).
thf(f6943,plain,
$false,
inference(avatar_sat_refutation,[],[s208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC007^1.003.004 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n014.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 11:19:45 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.22 Running first-order model finding
% 0.09/0.22 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
% 3.88/0.98 % (2533642)Will run a generic schedule for satisfiability detection.
% 3.88/0.98 % (2533652)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2977438914:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.88/0.98 % (2533648)% WARNING: option uhcvi not known.
% 3.88/0.98 % (2533649)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3143443200:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.88/0.98 % (2533648)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=796041303:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.88/0.98 % (2533647)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4280173826_2999 on theBenchmark for (2999ds/0Mi)
% 3.88/0.98 % (2533648)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.88/0.98 % (2533650)dis+10_1_sil=32000:sp=arity:random_seed=3015146795:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.88/0.98 % (2533648)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.88/0.98 % Exception at run slice level
% 3.88/0.98 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.88/0.98 % (2533651)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1469228471:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.88/0.98 % (2533651)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.88/0.98 % (2533653)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2220435223:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.88/0.98 % (2533659)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1379566054:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.88/0.98 % Exception at run slice level
% 3.88/0.98 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.88/0.98 % (2533652)Instruction limit reached!
% 3.88/0.98 % (2533652)------------------------------
% 3.88/0.98 % (2533652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/0.98 % (2533652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/0.98 % (2533652)CaDiCaL version: 2.1.3
% 3.88/0.98 % (2533652)Termination reason: Instruction limit
% 3.88/0.98 % (2533652)Termination phase: Saturation
% 3.88/0.98 % (2533652)Time elapsed: 0.031 s
% 3.88/0.98 % (2533652)Peak memory usage: 12 MB
% 3.88/0.98 % (2533652)Instructions burned: 131 (million)
% 3.88/0.98 % (2533664)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3773805609:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.88/0.98 % (2533664)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.88/0.98 % (2533664)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.88/0.98 % (2533663)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4152407253:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.88/0.98 % (2533650)Instruction limit reached!
% 3.88/0.98 % (2533650)------------------------------
% 3.88/0.98 % (2533650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/0.98 % (2533650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/0.98 % (2533650)CaDiCaL version: 2.1.3
% 3.88/0.98 % (2533650)Termination reason: Instruction limit
% 3.88/0.98 % (2533650)Termination phase: Saturation
% 3.88/0.98 % (2533650)Time elapsed: 0.046 s
% 3.88/0.98 % (2533650)Peak memory usage: 12 MB
% 3.88/0.98 % (2533650)Instructions burned: 103 (million)
% 3.88/0.98 % (2533667)ott-21_1_sil=16000:fs=off:random_seed=273125738:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 3.88/0.98 % (2533651)Instruction limit reached!
% 3.88/0.98 % (2533651)------------------------------
% 3.88/0.98 % (2533651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/0.98 % (2533651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/0.98 % (2533651)CaDiCaL version: 2.1.3
% 3.88/0.98 % (2533651)Termination reason: Instruction limit
% 3.88/0.98 % (2533651)Termination phase: Saturation
% 3.88/0.98 % (2533651)Time elapsed: 0.097 s
% 3.88/0.98 % (2533651)Peak memory usage: 12 MB
% 3.88/0.98 % (2533651)Instructions burned: 117 (million)
% 3.88/0.98 % (2533653)Instruction limit reached!
% 17.36/2.83 % (2533653)------------------------------
% 17.36/2.83 % (2533653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.36/2.83 % (2533653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.36/2.83 % (2533653)CaDiCaL version: 2.1.3
% 17.36/2.83 % (2533653)Termination reason: Instruction limit
% 17.36/2.83 % (2533653)Termination phase: Saturation
% 17.36/2.83 % (2533653)Time elapsed: 0.117 s
% 17.36/2.83 % (2533653)Peak memory usage: 12 MB
% 17.36/2.83 % (2533653)Instructions burned: 160 (million)
% 17.36/2.83 % (2533670)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2647829748:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 17.36/2.83 % (2533663)Instruction limit reached!
% 17.36/2.83 % (2533663)------------------------------
% 17.36/2.83 % (2533663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.36/2.83 % (2533663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.36/2.83 % (2533663)CaDiCaL version: 2.1.3
% 17.36/2.83 % (2533663)Termination reason: Instruction limit
% 17.36/2.83 % (2533663)Termination phase: Saturation
% 17.36/2.83 % (2533663)Time elapsed: 0.112 s
% 17.36/2.83 % (2533663)Peak memory usage: 12 MB
% 17.36/2.83 % (2533663)Instructions burned: 131 (million)
% 17.36/2.83 % (2533672)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=83706110:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 17.36/2.83 % Exception at run slice level
% 17.36/2.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.36/2.83 % (2533664)Instruction limit reached!
% 17.36/2.83 % (2533664)------------------------------
% 17.36/2.83 % (2533664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.36/2.83 % (2533664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.36/2.83 % (2533664)CaDiCaL version: 2.1.3
% 17.36/2.83 % (2533664)Termination reason: Instruction limit
% 17.36/2.83 % (2533664)Termination phase: Saturation
% 17.36/2.83 % (2533664)Time elapsed: 0.154 s
% 17.36/2.83 % (2533664)Peak memory usage: 13 MB
% 17.36/2.83 % (2533664)Instructions burned: 688 (million)
% 17.36/2.83 % (2533677)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=4152351126:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 17.36/2.83 % (2533674)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=90573114:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 17.36/2.83 % (2533677)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.36/2.83 % (2533676)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1841977257:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 17.36/2.83 % Exception at run slice level
% 17.36/2.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.36/2.83 % (2533667)Instruction limit reached!
% 17.36/2.83 % (2533667)------------------------------
% 17.36/2.83 % (2533667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.36/2.83 % (2533667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.36/2.83 % (2533667)CaDiCaL version: 2.1.3
% 17.36/2.83 % (2533667)Termination reason: Instruction limit
% 17.36/2.83 % (2533667)Termination phase: Saturation
% 17.36/2.83 % (2533667)Time elapsed: 0.147 s
% 17.36/2.83 % (2533667)Peak memory usage: 12 MB
% 17.36/2.83 % (2533667)Instructions burned: 180 (million)
% 17.36/2.83 % (2533681)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=737775120:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 17.36/2.83 % (2533681)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.36/2.83 % (2533682)fmb+10_1_sil=64000:random_seed=3458961638:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 17.36/2.83 % (2533682)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 17.36/2.83 % Exception at run slice level
% 17.36/2.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.36/2.83 % (2533685)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1156995995:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 17.36/2.83 % Exception at run slice level
% 17.36/2.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 44.35/6.51 % (2533687)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1255239977:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 44.35/6.51 % Exception at run slice level
% 44.35/6.51 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 44.35/6.51 % (2533677)Instruction limit reached!
% 44.35/6.51 % (2533677)------------------------------
% 44.35/6.51 % (2533677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.35/6.51 % (2533677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.35/6.51 % (2533677)CaDiCaL version: 2.1.3
% 44.35/6.51 % (2533677)Termination reason: Instruction limit
% 44.35/6.51 % (2533677)Termination phase: Saturation
% 44.35/6.51 % (2533677)Time elapsed: 0.154 s
% 44.35/6.51 % (2533677)Peak memory usage: 13 MB
% 44.35/6.51 % (2533677)Instructions burned: 697 (million)
% 44.35/6.51 % (2533690)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3176376292:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 44.35/6.51 % (2533690)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 44.35/6.51 % (2533690)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 44.35/6.51 % (2533689)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1866673045:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 44.35/6.51 % (2533689)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 44.35/6.51 % (2533670)Instruction limit reached!
% 44.35/6.51 % (2533670)------------------------------
% 44.35/6.51 % (2533670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.35/6.51 % (2533670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.35/6.51 % (2533670)CaDiCaL version: 2.1.3
% 44.35/6.51 % (2533670)Termination reason: Instruction limit
% 44.35/6.51 % (2533670)Termination phase: Saturation
% 44.35/6.51 % (2533670)Time elapsed: 0.300 s
% 44.35/6.51 % (2533670)Peak memory usage: 12 MB
% 44.35/6.51 % (2533670)Instructions burned: 477 (million)
% 44.35/6.51 % (2533693)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=699404836:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 44.35/6.51 % Exception at run slice level
% 44.35/6.51 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 44.35/6.51 % (2533695)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1704989966:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 44.35/6.51 % Exception at run slice level
% 44.35/6.51 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 44.35/6.51 % (2533697)ott-2_1_sil=16000:newcnf=on:random_seed=3757160395:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 44.35/6.51 % (2533697)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 44.35/6.51 % (2533690)Instruction limit reached!
% 44.35/6.51 % (2533690)------------------------------
% 44.35/6.51 % (2533690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.35/6.51 % (2533690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.35/6.51 % (2533690)CaDiCaL version: 2.1.3
% 44.35/6.51 % (2533690)Termination reason: Instruction limit
% 44.35/6.51 % (2533690)Termination phase: Saturation
% 44.35/6.51 % (2533690)Time elapsed: 0.318 s
% 44.35/6.51 % (2533690)Peak memory usage: 13 MB
% 44.35/6.51 % (2533690)Instructions burned: 1473 (million)
% 44.35/6.51 % (2533699)ott+10_1_sil=32000:tgt=ground:random_seed=3286434170:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 44.35/6.51 % (2533681)Instruction limit reached!
% 44.35/6.51 % (2533681)------------------------------
% 44.35/6.51 % (2533681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.35/6.51 % (2533681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.35/6.51 % (2533681)CaDiCaL version: 2.1.3
% 44.35/6.51 % (2533681)Termination reason: Instruction limit
% 44.35/6.51 % (2533681)Termination phase: Saturation
% 44.35/6.51 % (2533681)Time elapsed: 0.460 s
% 44.35/6.51 % (2533681)Peak memory usage: 14 MB
% 44.35/6.51 % (2533681)Instructions burned: 880 (million)
% 44.35/6.51 % (2533701)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2529264149:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 44.35/6.51 % Exception at run slice level
% 44.35/6.51 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533703)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=3837095885:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 45.03/6.68 % (2533703)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 45.03/6.68 % (2533674)Instruction limit reached!
% 45.03/6.68 % (2533674)------------------------------
% 45.03/6.68 % (2533674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533674)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533674)Termination reason: Instruction limit
% 45.03/6.68 % (2533674)Termination phase: Saturation
% 45.03/6.68 % (2533674)Time elapsed: 0.613 s
% 45.03/6.68 % (2533674)Peak memory usage: 12 MB
% 45.03/6.68 % (2533674)Instructions burned: 1180 (million)
% 45.03/6.68 % (2533705)dis+21_1_sil=32000:sas=cadical:random_seed=178750850:i=3773:amm=off_2991 on theBenchmark for (2991ds/3773Mi)
% 45.03/6.68 % (2533697)Instruction limit reached!
% 45.03/6.68 % (2533697)------------------------------
% 45.03/6.68 % (2533697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533697)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533697)Termination reason: Instruction limit
% 45.03/6.68 % (2533697)Termination phase: Saturation
% 45.03/6.68 % (2533697)Time elapsed: 0.359 s
% 45.03/6.68 % (2533697)Peak memory usage: 13 MB
% 45.03/6.68 % (2533697)Instructions burned: 870 (million)
% 45.03/6.68 % (2533707)ott+11_1_sil=16000:gs=on:random_seed=1198066344:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2991 on theBenchmark for (2991ds/2251Mi)
% 45.03/6.68 % (2533707)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 45.03/6.68 % (2533705)Instruction limit reached!
% 45.03/6.68 % (2533705)------------------------------
% 45.03/6.68 % (2533705)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533705)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533705)Termination reason: Instruction limit
% 45.03/6.68 % (2533705)Termination phase: Saturation
% 45.03/6.68 % (2533705)Time elapsed: 0.881 s
% 45.03/6.68 % (2533705)Peak memory usage: 19 MB
% 45.03/6.68 % (2533705)Instructions burned: 3776 (million)
% 45.03/6.68 % (2533709)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=3241382882:fmbsr=1.6:i=67534_2982 on theBenchmark for (2982ds/67534Mi)
% 45.03/6.68 % Exception at run slice level
% 45.03/6.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533711)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=328875735:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2982 on theBenchmark for (2982ds/4591Mi)
% 45.03/6.68 % (2533707)Instruction limit reached!
% 45.03/6.68 % (2533707)------------------------------
% 45.03/6.68 % (2533707)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533707)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533707)Termination reason: Instruction limit
% 45.03/6.68 % (2533707)Termination phase: Saturation
% 45.03/6.68 % (2533707)Time elapsed: 0.933 s
% 45.03/6.68 % (2533707)Peak memory usage: 13 MB
% 45.03/6.68 % (2533707)Instructions burned: 2253 (million)
% 45.03/6.68 % (2533713)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=3205455161:i=29340_2981 on theBenchmark for (2981ds/29340Mi)
% 45.03/6.68 % (2533703)Instruction limit reached!
% 45.03/6.68 % (2533703)------------------------------
% 45.03/6.68 % (2533703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533703)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533703)Termination reason: Instruction limit
% 45.03/6.68 % (2533703)Termination phase: Saturation
% 45.03/6.68 % (2533703)Time elapsed: 1.801 s
% 45.03/6.68 % (2533703)Peak memory usage: 17 MB
% 45.03/6.68 % (2533703)Instructions burned: 3513 (million)
% 45.03/6.68 % (2533723)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=1198152391:i=5211_2974 on theBenchmark for (2974ds/5211Mi)
% 45.03/6.68 % (2533689)Instruction limit reached!
% 45.03/6.68 % (2533689)------------------------------
% 45.03/6.68 % (2533689)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533689)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533689)Termination reason: Instruction limit
% 45.03/6.68 % (2533689)Termination phase: Saturation
% 45.03/6.68 % (2533689)Time elapsed: 2.236 s
% 45.03/6.68 % (2533689)Peak memory usage: 16 MB
% 45.03/6.68 % (2533689)Instructions burned: 5133 (million)
% 45.03/6.68 % (2533729)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=1114610746:i=5497:nm=2_2973 on theBenchmark for (2973ds/5497Mi)
% 45.03/6.68 % Exception at run slice level
% 45.03/6.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533731)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=1502968069:fmbsr=2:i=46332_2973 on theBenchmark for (2973ds/46332Mi)
% 45.03/6.68 % Exception at run slice level
% 45.03/6.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533733)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=266157393:i=14071_2973 on theBenchmark for (2973ds/14071Mi)
% 45.03/6.68 % Exception at run slice level
% 45.03/6.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533735)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1717803969:i=22565:add=on:rawr=on_2972 on theBenchmark for (2972ds/22565Mi)
% 45.03/6.68 % (2533699)Instruction limit reached!
% 45.03/6.68 % (2533699)------------------------------
% 45.03/6.68 % (2533699)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533699)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533699)Termination reason: Instruction limit
% 45.03/6.68 % (2533699)Termination phase: Saturation
% 45.03/6.68 % (2533699)Time elapsed: 2.042 s
% 45.03/6.68 % (2533699)Peak memory usage: 13 MB
% 45.03/6.68 % (2533699)Instructions burned: 5115 (million)
% 45.03/6.68 % (2533737)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=2560096825:i=8173:av=off_2972 on theBenchmark for (2972ds/8173Mi)
% 45.03/6.68 % (2533711)Instruction limit reached!
% 45.03/6.68 % (2533711)------------------------------
% 45.03/6.68 % (2533711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533711)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533711)Termination reason: Instruction limit
% 45.03/6.68 % (2533711)Termination phase: Saturation
% 45.03/6.68 % (2533711)Time elapsed: 1.083 s
% 45.03/6.68 % (2533711)Peak memory usage: 14 MB
% 45.03/6.68 % (2533711)Instructions burned: 4592 (million)
% 45.03/6.68 % (2533739)dis+10_16:1_sil=16000:random_seed=1478006032:i=9155:fsr=off_2971 on theBenchmark for (2971ds/9155Mi)
% 45.03/6.68 % (2533739)Instruction limit reached!
% 45.03/6.68 % (2533739)------------------------------
% 45.03/6.68 % (2533739)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533739)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533739)Termination reason: Instruction limit
% 45.03/6.68 % (2533739)Termination phase: Saturation
% 45.03/6.68 % (2533739)Time elapsed: 2.103 s
% 45.03/6.68 % (2533739)Peak memory usage: 20 MB
% 45.03/6.68 % (2533739)Instructions burned: 9155 (million)
% 45.03/6.68 % (2533747)ott-3_8_sil=64000:random_seed=1863273701:i=20139:bs=on_2950 on theBenchmark for (2950ds/20139Mi)
% 45.03/6.68 % (2533723)Instruction limit reached!
% 45.03/6.68 % (2533723)------------------------------
% 45.03/6.68 % (2533723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533723)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533723)Termination reason: Instruction limit
% 45.03/6.68 % (2533723)Termination phase: Saturation
% 45.03/6.68 % (2533723)Time elapsed: 3.661 s
% 45.03/6.68 % (2533723)Peak memory usage: 17 MB
% 45.03/6.68 % (2533723)Instructions burned: 5211 (million)
% 45.03/6.68 % (2533749)fmb+10_1_sil=64000:tgt=ground:sas=cadical:bce=on:fmbss=9:random_seed=4001353380:fmbsr=2:i=32576_2937 on theBenchmark for (2937ds/32576Mi)
% 45.03/6.68 % Exception at run slice level
% 45.03/6.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 45.03/6.68 % (2533751)ott+10_8:1_sil=16000:sp=arity:gs=on:random_seed=210620900:i=11404_2937 on theBenchmark for (2937ds/11404Mi)
% 45.03/6.68 % (2533737)Instruction limit reached!
% 45.03/6.68 % (2533737)------------------------------
% 45.03/6.68 % (2533737)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533737)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533737)Termination reason: Instruction limit
% 45.03/6.68 % (2533737)Termination phase: Saturation
% 45.03/6.68 % (2533737)Time elapsed: 3.618 s
% 45.03/6.68 % (2533737)Peak memory usage: 13 MB
% 45.03/6.68 % (2533737)Instructions burned: 8173 (million)
% 45.03/6.68 % (2533747) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2533642-2533747"...
% 45.03/6.68 % (2533747)...printing done.
% 45.03/6.68 % (2533747)Refutation found. Thanks to Tanya!
% 45.03/6.68 % SZS status Theorem for theBenchmark
% 45.03/6.68 % SZS output start Proof for theBenchmark
% See solution above
% 45.03/6.68 % (2533747)------------------------------
% 45.03/6.68 % (2533747)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.03/6.68 % (2533747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.03/6.68 % (2533747)CaDiCaL version: 2.1.3
% 45.03/6.68 % (2533747)Termination reason: Refutation
% 45.03/6.68 % (2533747)Time elapsed: 1.460 s
% 45.03/6.68 % (2533747)Peak memory usage: 15 MB
% 45.03/6.68 % (2533747)Instructions burned: 5303 (million)
% 45.03/6.68 % (2533642)Success in time 6.446 s
% 45.03/6.68 % Vampire exiting
%------------------------------------------------------------------------------