%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM808^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:18:57 AM UTC 2026
% Result : Theorem 0.20s 0.31s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of formulae : 144 ( 40 unt; 0 typ; 19 def)
% Number of atoms : 757 ( 176 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 722 ( 101 ~; 155 |; 32 &; 362 @)
% ( 13 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 33 usr; 21 con; 0-4 aty)
% ( 26 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 108 ( 0 sgn 75 !; 7 ?; 108 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cS: $i > $i ).
thf(func_def_2,type,
r: $i > $i > $o ).
thf(func_def_3,type,
cIND: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
sF1: $i > $o ).
thf(func_def_15,type,
sF2: $o ).
thf(func_def_16,type,
sF3: $i > $i ).
thf(func_def_17,type,
sF4: $i > $o ).
thf(func_def_18,type,
sF5: $i > $o ).
thf(func_def_19,type,
sF6: $o ).
thf(func_def_20,type,
sK7: $i > $o ).
thf(func_def_22,type,
sK9: ( $i > $o ) > $i ).
thf(f1,axiom,
( cIND
= ( ! [X0: $i > $o] :
( ( ( X0 @ c0 )
& ! [X1: $i] :
( ( X0 @ X1 )
=> ( X0 @ ( cS @ X1 ) ) ) )
=> ! [X1: $i] : ( X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cIND_def) ).
thf(f2,conjecture,
( ( cIND
& ! [X0: $i] :
( ( r @ X0 @ X0 )
=> ( r @ ( cS @ X0 ) @ ( cS @ X0 ) ) )
& ( r @ c0 @ c0 ) )
=> ! [X0: $i] :
? [X1: $i] : ( r @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM130A) ).
thf(f3,negated_conjecture,
~ ( ( cIND
& ! [X0: $i] :
( ( r @ X0 @ X0 )
=> ( r @ ( cS @ X0 ) @ ( cS @ X0 ) ) )
& ( r @ c0 @ c0 ) )
=> ! [X0: $i] :
? [X1: $i] : ( r @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( cIND
= ( ! [X0: $i > $o] :
( ( ( X0 @ c0 )
& ! [X1: $i] :
( ( X0 @ X1 )
=> ( X0 @ ( cS @ X1 ) ) ) )
=> ! [X2: $i] : ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( cIND
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( ( cIND
& ! [X0: $i] :
( ( r @ X0 @ X0 )
=> ( r @ ( cS @ X0 ) @ ( cS @ X0 ) ) )
& ( r @ c0 @ c0 ) )
=> ! [X1: $i] :
? [X2: $i] : ( r @ X1 @ X2 ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( ( ( r @ c0 @ c0 )
= $true )
& ( cIND = $true )
& ! [X0: $i] :
( ( ( r @ X0 @ X0 )
= $true )
=> ( ( r @ ( cS @ X0 ) @ ( cS @ X0 ) )
= $true ) ) )
=> ! [X1: $i] :
? [X2: $i] :
( $true
= ( r @ X1 @ X2 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X1: $i] :
! [X2: $i] :
( $true
!= ( r @ X1 @ X2 ) )
& ( ( r @ c0 @ c0 )
= $true )
& ( cIND = $true )
& ! [X0: $i] :
( ( ( r @ ( cS @ X0 ) @ ( cS @ X0 ) )
= $true )
| ( ( r @ X0 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
( ? [X1: $i] :
! [X2: $i] :
( $true
!= ( r @ X1 @ X2 ) )
& ( ( r @ c0 @ c0 )
= $true )
& ( cIND = $true )
& ! [X0: $i] :
( ( ( r @ ( cS @ X0 ) @ ( cS @ X0 ) )
= $true )
| ( ( r @ X0 @ X0 )
!= $true ) ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
( ? [X0: $i] :
! [X1: $i] :
( ( r @ X0 @ X1 )
!= $true )
& ( ( r @ c0 @ c0 )
= $true )
& ( cIND = $true )
& ! [X2: $i] :
( ( $true
= ( r @ ( cS @ X2 ) @ ( cS @ X2 ) ) )
| ( $true
!= ( r @ X2 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f11,plain,
( ! [X1: $i] :
( $true
!= ( r @ sK0 @ X1 ) )
& ( ( r @ c0 @ c0 )
= $true )
& ( cIND = $true )
& ! [X2: $i] :
( ( $true
= ( r @ ( cS @ X2 ) @ ( cS @ X2 ) ) )
| ( $true
!= ( r @ X2 @ X2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).
thf(f12,plain,
! [X2: $i] :
( ( $true
= ( r @ ( cS @ X2 ) @ ( cS @ X2 ) ) )
| ( $true
!= ( r @ X2 @ X2 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f13,plain,
cIND = $true,
inference(cnf_transformation,[],[f11]) ).
thf(f14,plain,
( ( r @ c0 @ c0 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X1: $i] :
( $true
!= ( r @ sK0 @ X1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f16,plain,
( cIND
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f19,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f16,f13]) ).
thf(f20,definition,
! [X1: $i] :
( ( sF1 @ X1 )
= ( r @ sK0 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
thf(f21,plain,
! [X1: $i] :
( ( sF1 @ X1 )
!= $true ),
inference(definition_folding,[],[f15,f20]) ).
thf(f22,definition,
( sF2
= ( r @ c0 @ c0 ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f23,plain,
( ( r @ c0 @ c0 )
= sF2 ),
inference(reorient_equations,[],[f22]) ).
thf(f24,plain,
$true = sF2,
inference(definition_folding,[],[f14,f23]) ).
thf(f25,definition,
! [X2: $i] :
( ( sF3 @ X2 )
= ( cS @ X2 ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f26,plain,
! [X2: $i] :
( ( cS @ X2 )
= ( sF3 @ X2 ) ),
inference(reorient_equations,[],[f25]) ).
thf(f27,definition,
! [X2: $i] :
( ( sF4 @ X2 )
= ( r @ ( sF3 @ X2 ) @ ( sF3 @ X2 ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f28,definition,
! [X2: $i] :
( ( sF5 @ X2 )
= ( r @ X2 @ X2 ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f29,plain,
! [X2: $i] :
( ( $true
= ( sF4 @ X2 ) )
| ( $true
!= ( sF5 @ X2 ) ) ),
inference(definition_folding,[],[f12,f28,f27,f26,f26]) ).
thf(f30,definition,
( sF6
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f31,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) )
= sF6 ),
inference(reorient_equations,[],[f30]) ).
thf(f32,plain,
$true = sF6,
inference(definition_folding,[],[f19,f31]) ).
thf(f33,plain,
( ( sF6 = $false )
| ( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f31]) ).
thf(f45,plain,
! [X1: $i > $o] :
( ( sF6 = $false )
| ( $true
= ( ^ [Y0: $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ Y1 ) ) ) )
& ( Y0 @ c0 ) )
=> ( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f46,plain,
! [X1: $i > $o] :
( ( $true
= ( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ Y0 ) ) ) )
& ( X1 @ c0 ) )
=> ( !! @ $i @ X1 ) ) )
| ( sF6 = $false ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X1: $i > $o] :
( ( sF6 = $false )
| ( $true
= ( !! @ $i @ X1 ) )
| ( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ Y0 ) ) ) )
& ( X1 @ c0 ) )
= $false ) ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ Y0 ) ) ) )
& ( X1 @ c0 ) )
= $false )
| ( sF6 = $false ) ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f49,plain,
! [X2: $i,X1: $i > $o] :
( ( sF6 = $false )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ Y0 ) ) ) ) )
| ( ( X1 @ c0 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(and_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( ( ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ Y0 ) ) )
@ ( sK9 @ X1 ) )
= $false )
| ( sF6 = $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(sigma_proxy_clausification,[],[f49]) ).
thf(f51,plain,
! [X2: $i,X1: $i > $o] :
( ( sF6 = $false )
| ( ( X1 @ X2 )
= $true )
| ( ( ( X1 @ ( sK9 @ X1 ) )
=> ( X1 @ ( cS @ ( sK9 @ X1 ) ) ) )
= $false )
| ( ( X1 @ c0 )
= $false ) ),
inference(beta-eta_normalization,[],[f50]) ).
thf(f52,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( ( X1 @ X2 )
= $true )
| ( sF6 = $false )
| ( ( X1 @ ( cS @ ( sK9 @ X1 ) ) )
= $false ) ),
inference(imp_proxy_clausification,[],[f51]) ).
thf(f53,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( ( X1 @ X2 )
= $true )
| ( $true
= ( X1 @ ( sK9 @ X1 ) ) )
| ( sF6 = $false ) ),
inference(imp_proxy_clausification,[],[f51]) ).
thf(f55,plain,
! [X2: $i] :
( ( $true
= ( r @ ( sF3 @ X2 ) @ ( sF3 @ X2 ) ) )
| ( ( sF4 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f27]) ).
thf(f56,plain,
! [X1: $i] :
( ( ( r @ sK0 @ X1 )
= $false )
| ( ( sF1 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f20]) ).
thf(f58,plain,
! [X2: $i] :
( ( ( r @ X2 @ X2 )
= $false )
| ( $true
= ( sF5 @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f28]) ).
thf(f59,plain,
! [X2: $i] :
( ( $true
= ( r @ X2 @ X2 ) )
| ( ( sF5 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f28]) ).
thf(f60,plain,
( ( sF2 = $false )
| ( ( r @ c0 @ c0 )
= $true ) ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f66,definition,
( spl10_2
<=> ( $true = sF6 ) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
thf(f68,plain,
( ( $true = sF6 )
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f81,definition,
( spl10_5
<=> ! [X2: $i,X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( $true
= ( X1 @ ( sK9 @ X1 ) ) )
| ( ( X1 @ X2 )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
thf(f82,plain,
( ! [X2: $i,X1: $i > $o] :
( ( $true
= ( X1 @ ( sK9 @ X1 ) ) )
| ( ( X1 @ X2 )
= $true )
| ( ( X1 @ c0 )
= $false ) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f84,definition,
( spl10_6
<=> ( sF6 = $false ) ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
thf(f86,plain,
( ( sF6 = $false )
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f84]) ).
thf(f87,plain,
( spl10_5
| spl10_6 ),
inference(avatar_split_clause,[],[f53,f84,f81]) ).
thf(f89,definition,
( spl10_7
<=> ! [X2: $i,X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( ( X1 @ ( cS @ ( sK9 @ X1 ) ) )
= $false )
| ( ( X1 @ X2 )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
thf(f90,plain,
( ! [X2: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( X1 @ c0 )
= $false )
| ( ( X1 @ ( cS @ ( sK9 @ X1 ) ) )
= $false ) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f89]) ).
thf(f91,plain,
( spl10_7
| spl10_6 ),
inference(avatar_split_clause,[],[f52,f84,f89]) ).
thf(f92,plain,
spl10_2,
inference(avatar_split_clause,[],[f32,f66]) ).
thf(f94,definition,
( spl10_8
<=> ( ( r @ c0 @ c0 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
thf(f95,plain,
( ( ( r @ c0 @ c0 )
!= $false )
| spl10_8 ),
inference(avatar_component_clause,[],[f94]) ).
thf(f96,plain,
( ( ( r @ c0 @ c0 )
= $false )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f94]) ).
thf(f98,definition,
( spl10_9
<=> ( $true = sF2 ) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
thf(f100,plain,
( ( $true = sF2 )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f98]) ).
thf(f103,definition,
( spl10_10
<=> ( sF2 = $false ) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
thf(f105,plain,
( ( sF2 = $false )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f107,definition,
( spl10_11
<=> ( ( r @ c0 @ c0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
thf(f109,plain,
( ( ( r @ c0 @ c0 )
= $true )
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f107]) ).
thf(f110,plain,
( spl10_10
| spl10_11 ),
inference(avatar_split_clause,[],[f60,f107,f103]) ).
thf(f111,plain,
spl10_9,
inference(avatar_split_clause,[],[f24,f98]) ).
thf(f112,plain,
( ( $true = $false )
| ~ spl10_9
| ~ spl10_10 ),
inference(forward_demodulation,[],[f105,f100]) ).
thf(f113,plain,
( $false
| ~ spl10_9
| ~ spl10_10 ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f114,plain,
( ~ spl10_9
| ~ spl10_10 ),
inference(avatar_contradiction_clause,[],[f113]) ).
thf(f116,plain,
( ( $true = $false )
| ~ spl10_2
| ~ spl10_6 ),
inference(forward_demodulation,[],[f68,f86]) ).
thf(f117,plain,
( $false
| ~ spl10_2
| ~ spl10_6 ),
inference(trivial_inequality_removal,[],[f116]) ).
thf(f118,plain,
( ~ spl10_2
| ~ spl10_6 ),
inference(avatar_contradiction_clause,[],[f117]) ).
thf(f135,plain,
( ( $true = $false )
| ~ spl10_8
| ~ spl10_11 ),
inference(forward_demodulation,[],[f109,f96]) ).
thf(f136,plain,
( $false
| ~ spl10_8
| ~ spl10_11 ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f137,plain,
( ~ spl10_8
| ~ spl10_11 ),
inference(avatar_contradiction_clause,[],[f136]) ).
thf(f140,plain,
! [X1: $i] :
( ( r @ sK0 @ X1 )
= $false ),
inference(forward_subsumption_resolution,[],[f56,f21]) ).
thf(f146,plain,
( ( ( sF5 @ c0 )
= $true )
| ( $false != $false )
| spl10_8 ),
inference(constrained_superposition,[],[f95,f58]) ).
thf(f147,plain,
( ( ( sF5 @ c0 )
= $true )
| spl10_8 ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f153,plain,
( ( $true = $false )
| ( ( sF5 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f140,f59]) ).
thf(f156,plain,
( ( sF5 @ sK0 )
= $false ),
inference(trivial_inequality_removal,[],[f153]) ).
thf(f193,plain,
! [X0: $i] :
( ( $true
= ( sF5 @ ( sF3 @ X0 ) ) )
| ( $true = $false )
| ( ( sF4 @ X0 )
= $false ) ),
inference(constrained_superposition,[],[f55,f58]) ).
thf(f196,plain,
! [X0: $i] :
( ( $true
= ( sF5 @ ( sF3 @ X0 ) ) )
| ( ( sF4 @ X0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f193]) ).
thf(f204,plain,
( ! [X2: $i,X1: $i > $o] :
( ( $false
= ( X1 @ ( sF3 @ ( sK9 @ X1 ) ) ) )
| ( ( X1 @ X2 )
= $true )
| ( ( X1 @ c0 )
= $false ) )
| ~ spl10_7 ),
inference(forward_demodulation,[],[f90,f26]) ).
thf(f205,plain,
( ! [X0: $i] :
( ( $true
= ( sF5 @ X0 ) )
| ( ( sF5 @ c0 )
= $false )
| ( $true = $false )
| ( ( sF4 @ ( sK9 @ sF5 ) )
= $false ) )
| ~ spl10_7 ),
inference(constrained_superposition,[],[f204,f196]) ).
thf(f210,plain,
( ! [X0: $i] :
( ( ( sF4 @ X0 )
= $true )
| ( ( sF4 @ c0 )
= $false )
| ( $true = $false )
| ( $true
!= ( sF5 @ ( sF3 @ ( sK9 @ sF4 ) ) ) ) )
| ~ spl10_7 ),
inference(constrained_superposition,[],[f29,f204]) ).
thf(f213,plain,
( ! [X0: $i] :
( ( $true
!= ( sF5 @ ( sF3 @ ( sK9 @ sF4 ) ) ) )
| ( ( sF4 @ X0 )
= $true )
| ( ( sF4 @ c0 )
= $false ) )
| ~ spl10_7 ),
inference(trivial_inequality_removal,[],[f210]) ).
thf(f216,plain,
( ! [X0: $i] :
( ( $true
= ( sF5 @ X0 ) )
| ( ( sF5 @ c0 )
= $false )
| ( ( sF4 @ ( sK9 @ sF5 ) )
= $false ) )
| ~ spl10_7 ),
inference(trivial_inequality_removal,[],[f205]) ).
thf(f218,definition,
( spl10_12
<=> ( $true
= ( sF5 @ ( sF3 @ ( sK9 @ sF4 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
thf(f220,plain,
( ( $true
!= ( sF5 @ ( sF3 @ ( sK9 @ sF4 ) ) ) )
| spl10_12 ),
inference(avatar_component_clause,[],[f218]) ).
thf(f222,definition,
( spl10_13
<=> ( ( sF4 @ c0 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
thf(f224,plain,
( ( ( sF4 @ c0 )
= $false )
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f222]) ).
thf(f226,definition,
( spl10_14
<=> ! [X0: $i] :
( ( sF4 @ X0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_14])],[avatar_definition]) ).
thf(f227,plain,
( ! [X0: $i] :
( ( sF4 @ X0 )
= $true )
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f226]) ).
thf(f229,plain,
( spl10_13
| spl10_14
| ~ spl10_12
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f213,f89,f218,f226,f222]) ).
thf(f232,plain,
( ! [X0: $i] :
( ( ( sF4 @ ( sK9 @ sF5 ) )
= $false )
| ( $true = $false )
| ( $true
= ( sF5 @ X0 ) ) )
| ~ spl10_7
| spl10_8 ),
inference(forward_demodulation,[],[f216,f147]) ).
thf(f233,plain,
( ! [X0: $i] :
( ( $true
= ( sF5 @ X0 ) )
| ( ( sF4 @ ( sK9 @ sF5 ) )
= $false ) )
| ~ spl10_7
| spl10_8 ),
inference(trivial_inequality_removal,[],[f232]) ).
thf(f235,definition,
( spl10_15
<=> ( ( sF4 @ ( sK9 @ sF5 ) )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl10_15])],[avatar_definition]) ).
thf(f237,plain,
( ( ( sF4 @ ( sK9 @ sF5 ) )
= $false )
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f235]) ).
thf(f239,definition,
( spl10_16
<=> ! [X0: $i] :
( $true
= ( sF5 @ X0 ) ) ),
introduced(definition,[new_symbols(definition,[spl10_16])],[avatar_definition]) ).
thf(f240,plain,
( ! [X0: $i] :
( $true
= ( sF5 @ X0 ) )
| ~ spl10_16 ),
inference(avatar_component_clause,[],[f239]) ).
thf(f242,plain,
( spl10_16
| spl10_15
| ~ spl10_7
| spl10_8 ),
inference(avatar_split_clause,[],[f233,f94,f89,f235,f239]) ).
thf(f243,plain,
( ( $true != $true )
| ( ( sF4 @ ( sK9 @ sF4 ) )
= $false )
| spl10_12 ),
inference(constrained_superposition,[],[f220,f196]) ).
thf(f247,plain,
( ( ( sF4 @ ( sK9 @ sF4 ) )
= $false )
| spl10_12 ),
inference(trivial_inequality_removal,[],[f243]) ).
thf(f253,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( ( sF4 @ c0 )
= $false )
| ( ( sF4 @ X0 )
= $true ) )
| ~ spl10_5
| spl10_12 ),
inference(constrained_superposition,[],[f82,f247]) ).
thf(f260,plain,
( ! [X0: $i] :
( ( ( sF4 @ c0 )
= $false )
| ( ( sF4 @ X0 )
= $true ) )
| ~ spl10_5
| spl10_12 ),
inference(trivial_inequality_removal,[],[f253]) ).
thf(f264,plain,
( spl10_14
| spl10_13
| ~ spl10_5
| spl10_12 ),
inference(avatar_split_clause,[],[f260,f218,f81,f222,f226]) ).
thf(f265,plain,
( ( ( sF5 @ c0 )
!= $true )
| ( $true = $false )
| ~ spl10_13 ),
inference(constrained_superposition,[],[f224,f29]) ).
thf(f270,plain,
( ( ( sF5 @ c0 )
!= $true )
| ~ spl10_13 ),
inference(trivial_inequality_removal,[],[f265]) ).
thf(f273,plain,
( $false
| spl10_8
| ~ spl10_13 ),
inference(forward_subsumption_resolution,[],[f270,f147]) ).
thf(f274,plain,
( spl10_8
| ~ spl10_13 ),
inference(avatar_contradiction_clause,[],[f273]) ).
thf(f286,plain,
( ( $true = $false )
| ~ spl10_14
| ~ spl10_15 ),
inference(forward_demodulation,[],[f237,f227]) ).
thf(f287,plain,
( $false
| ~ spl10_14
| ~ spl10_15 ),
inference(trivial_inequality_removal,[],[f286]) ).
thf(f288,plain,
( ~ spl10_14
| ~ spl10_15 ),
inference(avatar_contradiction_clause,[],[f287]) ).
thf(f292,plain,
( ( $true = $false )
| ~ spl10_16 ),
inference(constrained_superposition,[],[f240,f156]) ).
thf(f302,plain,
( $false
| ~ spl10_16 ),
inference(trivial_inequality_removal,[],[f292]) ).
thf(f303,plain,
~ spl10_16,
inference(avatar_contradiction_clause,[],[f302]) ).
cnf(s4,plain,
( spl10_5
| spl10_6 ),
inference(sat_conversion,[],[f87]) ).
cnf(s5,plain,
( spl10_6
| spl10_7 ),
inference(sat_conversion,[],[f91]) ).
cnf(s6,plain,
spl10_2,
inference(sat_conversion,[],[f92]) ).
cnf(s8,plain,
( spl10_10
| spl10_11 ),
inference(sat_conversion,[],[f110]) ).
cnf(s9,plain,
spl10_9,
inference(sat_conversion,[],[f111]) ).
cnf(s10,plain,
( ~ spl10_9
| ~ spl10_10 ),
inference(sat_conversion,[],[f114]) ).
cnf(s11,plain,
( ~ spl10_2
| ~ spl10_6 ),
inference(sat_conversion,[],[f118]) ).
cnf(s12,plain,
( ~ spl10_8
| ~ spl10_11 ),
inference(sat_conversion,[],[f137]) ).
cnf(s14,plain,
( ~ spl10_7
| ~ spl10_12
| spl10_13
| spl10_14 ),
inference(sat_conversion,[],[f229]) ).
cnf(s16,plain,
( ~ spl10_7
| spl10_8
| spl10_15
| spl10_16 ),
inference(sat_conversion,[],[f242]) ).
cnf(s19,plain,
( ~ spl10_5
| spl10_12
| spl10_13
| spl10_14 ),
inference(sat_conversion,[],[f264]) ).
cnf(s22,plain,
( spl10_8
| ~ spl10_13 ),
inference(sat_conversion,[],[f274]) ).
cnf(s23,plain,
( ~ spl10_14
| ~ spl10_15 ),
inference(sat_conversion,[],[f288]) ).
cnf(s25,plain,
~ spl10_16,
inference(sat_conversion,[],[f303]) ).
cnf(s26,plain,
( ~ spl10_7
| spl10_8
| spl10_15 ),
inference(rat,[],[s16,s25]) ).
cnf(s28,plain,
~ spl10_10,
inference(rat,[],[s10,s9]) ).
cnf(s29,plain,
spl10_11,
inference(rat,[],[s8,s28]) ).
cnf(s30,plain,
~ spl10_8,
inference(rat,[],[s12,s29]) ).
cnf(s31,plain,
~ spl10_13,
inference(rat,[],[s22,s30]) ).
cnf(s32,plain,
~ spl10_6,
inference(rat,[],[s11,s6]) ).
cnf(s33,plain,
spl10_7,
inference(rat,[],[s5,s32]) ).
cnf(s34,plain,
spl10_15,
inference(rat,[],[s26,s30,s33]) ).
cnf(s35,plain,
~ spl10_14,
inference(rat,[],[s23,s34]) ).
cnf(s36,plain,
~ spl10_12,
inference(rat,[],[s14,s33,s31,s35]) ).
cnf(s37,plain,
~ spl10_5,
inference(rat,[],[s19,s35,s31,s36]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s4,s32,s37]) ).
thf(f304,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM808^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:01:15 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.31 % (3946413)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.31 % (3946419)lrs+10_16_si=on:nwc=1.5:random_seed=2860695257:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.31 % (3946419)Instruction limit reached!
% 0.20/0.31 % (3946419)------------------------------
% 0.20/0.31 % (3946419)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946419)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946419)Termination reason: Instruction limit
% 0.20/0.31 % (3946419)Termination phase: Saturation
% 0.20/0.31 % (3946419)Time elapsed: 0.006 s
% 0.20/0.31 % (3946419)Peak memory usage: 12 MB
% 0.20/0.31 % (3946419)Instructions burned: 19 (million)
% 0.20/0.31 % (3946418)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1165375920:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.31 % (3946420)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3560972201:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.31 % (3946421)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=933868646:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.31 % (3946423)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3349966179:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.31 % (3946422)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4044330522:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.31 % (3946420)Instruction limit reached!
% 0.20/0.31 % (3946420)------------------------------
% 0.20/0.31 % (3946420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946420)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946420)Termination reason: Instruction limit
% 0.20/0.31 % (3946420)Termination phase: Saturation
% 0.20/0.31 % (3946420)Time elapsed: 0.003 s
% 0.20/0.31 % (3946420)Peak memory usage: 12 MB
% 0.20/0.31 % (3946420)Instructions burned: 4 (million)
% 0.20/0.31 % (3946421)Refutation not found, incomplete strategy
% 0.20/0.31 % (3946421)------------------------------
% 0.20/0.31 % (3946421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946421)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946421)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.31 % (3946421)Time elapsed: 0.008 s
% 0.20/0.31 % (3946421)Peak memory usage: 12 MB
% 0.20/0.31 % (3946421)Instructions burned: 11 (million)
% 0.20/0.31 % (3946424)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.31 % (3946424)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.31 % (3946426)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=463406414:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.31 % (3946421)------------------------------
% 0.20/0.31 % (3946421)------------------------------
% 0.20/0.31 % (3946426)Instruction limit reached!
% 0.20/0.31 % (3946426)------------------------------
% 0.20/0.31 % (3946426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946426)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946426)Termination reason: Instruction limit
% 0.20/0.31 % (3946426)Termination phase: Saturation
% 0.20/0.31 % (3946426)Time elapsed: 0.001 s
% 0.20/0.31 % (3946426)Peak memory usage: 12 MB
% 0.20/0.31 % (3946426)Instructions burned: 2 (million)
% 0.20/0.31 % (3946422)Instruction limit reached!
% 0.20/0.31 % (3946422)------------------------------
% 0.20/0.31 % (3946422)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946422)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946422)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946422)Termination reason: Instruction limit
% 0.20/0.31 % (3946422)Termination phase: Saturation
% 0.20/0.31 % (3946422)Time elapsed: 0.014 s
% 0.20/0.31 % (3946422)Peak memory usage: 12 MB
% 0.20/0.31 % (3946422)Instructions burned: 24 (million)
% 0.20/0.31 % (3946424)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1214721657:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.31 % (3946435)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=468853652:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.20/0.31 % (3946432)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=246083075:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.20/0.31 % (3946434)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.20/0.31 % (3946435)Instruction limit reached!
% 0.20/0.31 % (3946435)------------------------------
% 0.20/0.31 % (3946435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946435)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946435)Termination reason: Instruction limit
% 0.20/0.31 % (3946435)Termination phase: Saturation
% 0.20/0.31 % (3946435)Time elapsed: 0.004 s
% 0.20/0.31 % (3946435)Peak memory usage: 12 MB
% 0.20/0.31 % (3946435)Instructions burned: 13 (million)
% 0.20/0.31 % (3946432)Instruction limit reached!
% 0.20/0.31 % (3946432)------------------------------
% 0.20/0.31 % (3946432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946432)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946432)Termination reason: Instruction limit
% 0.20/0.31 % (3946432)Termination phase: Saturation
% 0.20/0.31 % (3946432)Time elapsed: 0.004 s
% 0.20/0.31 % (3946432)Peak memory usage: 12 MB
% 0.20/0.31 % (3946432)Instructions burned: 6 (million)
% 0.20/0.31 % (3946424) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3946413-3946424"...
% 0.20/0.31 % (3946434)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1493571914:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.20/0.31 % (3946437)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.31 % (3946437)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.20/0.31 % (3946424)...printing done.
% 0.20/0.31 % (3946437)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1460342326:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.20/0.31 % (3946434)Instruction limit reached!
% 0.20/0.31 % (3946434)------------------------------
% 0.20/0.31 % (3946434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (3946434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (3946434)CaDiCaL version: 2.1.3
% 0.20/0.31 % (3946434)Termination reason: Instruction limit
% 0.20/0.31 % (3946434)Termination phase: Saturation
% 0.20/0.31 % (3946434)Time elapsed: 0.005 s
% 0.20/0.31 % (3946434)Peak memory usage: 12 MB
% 0.20/0.31 % (3946434)Instructions burned: 9 (million)
% 0.20/0.31 % (3946424)Refutation found. Thanks to Tanya!
% 0.20/0.31 % SZS status Theorem for theBenchmark
% 0.20/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.32 % (3946424)------------------------------
% 0.20/0.32 % (3946424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.32 % (3946424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.32 % (3946424)CaDiCaL version: 2.1.3
% 0.20/0.32 % (3946424)Termination reason: Refutation
% 0.20/0.32 % (3946424)Time elapsed: 0.017 s
% 0.20/0.32 % (3946424)Peak memory usage: 13 MB
% 0.20/0.32 % (3946424)Instructions burned: 15 (million)
% 0.20/0.32 % (3946413)Success in time 0.072 s
% 0.20/0.32 % Vampire exiting
%------------------------------------------------------------------------------