%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU874^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:34:19 AM UTC 2026
% Result : Theorem 14.00s 2.28s
% Output : Refutation 14.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 56
% Number of leaves : 4
% Syntax : Number of formulae : 130 ( 11 unt; 0 typ; 3 def)
% Number of atoms : 1397 ( 555 equ; 5 cnn)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 1877 ( 98 ~; 507 |; 57 &;1003 @)
% ( 3 <=>; 115 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 225 ( 225 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 23 usr; 9 con; 0-4 aty)
% ( 86 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 442 ( 50 sgn 125 !; 3 ?; 442 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cX: a > $o ).
thf(func_def_2,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
vIMP: $o > $o > $o ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vOR: $o > $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(func_def_16,type,
sK0: a ).
thf(func_def_17,type,
sK1: ( a > $o ) > a ).
thf(func_def_18,type,
sK2: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_19,type,
sK3: a > $o ).
thf(func_def_20,type,
sK4: ( ( a > $o ) > $o ) > a > $o ).
thf(func_def_21,type,
sK5: ( ( a > $o ) > $o ) > a ).
thf(f1,conjecture,
( cX
= ( ^ [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ! [X4: a] :
( ( X1 @ X4 )
=> ( cX @ X4 ) )
& ! [X2: ( a > $o ) > $o] :
( ( ! [X4: a > $o] :
( ( X2 @ X4 )
=> ! [X5: a] :
( ( X1 @ X5 )
=> ( X2
@ ^ [X6: a] :
( ( X5 = X6 )
| ( X4 @ X6 ) ) ) ) )
& ( X2
@ ^ [X3: a] : $false ) )
=> ( X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDOMLEMMA3_pme) ).
thf(f2,negated_conjecture,
( cX
!= ( ^ [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ! [X4: a] :
( ( X1 @ X4 )
=> ( cX @ X4 ) )
& ! [X2: ( a > $o ) > $o] :
( ( ! [X4: a > $o] :
( ( X2 @ X4 )
=> ! [X5: a] :
( ( X1 @ X5 )
=> ( X2
@ ^ [X6: a] :
( ( X5 = X6 )
| ( X4 @ X6 ) ) ) ) )
& ( X2
@ ^ [X3: a] : $false ) )
=> ( X2 @ X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( cX
!= ( ^ [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ! [X2: a] :
( ( X1 @ X2 )
=> ( cX @ X2 ) )
& ! [X3: ( a > $o ) > $o] :
( ( ! [X4: a > $o] :
( ( X3 @ X4 )
=> ! [X5: a] :
( ( X1 @ X5 )
=> ( X3
@ ^ [X6: a] :
( ( X5 = X6 )
| ( X4 @ X6 ) ) ) ) )
& ( X3
@ ^ [X7: a] : $false ) )
=> ( X3 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( cX
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( cX
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( cX
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f18,plain,
( ( cX @ sK0 )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ),
inference(negative_extensionality,[],[f6]) ).
thf(f19,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f18]) ).
thf(f20,plain,
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y2: ( a > $o ) > $o] :
( ( ( Y2
@ ^ [Y3: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y3: a > $o] :
( ( Y2 @ Y3 )
=> ( !! @ a
@ ^ [Y4: a] :
( ( Y1 @ Y4 )
=> ( Y2
@ ^ [Y5: a] :
( ( Y3 @ Y5 )
| ( Y4 = Y5 ) ) ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cX @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f18]) ).
thf(f21,plain,
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y1: ( a > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( Y1 @ Y2 )
=> ( !! @ a
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
=> ( Y1
@ ^ [Y4: a] :
( ( Y2 @ Y4 )
| ( Y3 = Y4 ) ) ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> ( cX @ Y1 ) ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f20]) ).
thf(f22,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( ^ [Y0: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y1: ( a > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( Y1 @ Y2 )
=> ( !! @ a
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
=> ( Y1
@ ^ [Y4: a] :
( ( Y2 @ Y4 )
| ( Y3 = Y4 ) ) ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> ( cX @ Y1 ) ) )
& ( Y0 @ sK0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( X1 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ X1 ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( cX @ Y0 ) ) )
& ( X1 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( X1 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ X1 ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( cX @ Y0 ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( cX @ Y0 ) ) ) )
| ( $false
= ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( X1 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(and_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( cX @ Y0 ) )
@ ( sK1 @ X1 ) ) )
| ( $false
= ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( X1 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(sigma_proxy_clausification,[],[f25]) ).
thf(f27,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( cX @ Y0 ) )
@ ( sK1 @ X1 ) ) )
| ( $false
= ( ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( X1 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ X1 ) )
@ ( sK2 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( ( X1 @ ( sK1 @ X1 ) )
=> ( cX @ ( sK1 @ X1 ) ) ) )
| ( $false
= ( ( ( sK2 @ X1
@ ^ [Y0: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) )
=> ( sK2 @ X1 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( ( ( sK2 @ X1
@ ^ [Y0: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) )
=> ( sK2 @ X1 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( ( ( sK2 @ X1
@ ^ [Y0: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) )
=> ( sK2 @ X1 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f31,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( ( sK2 @ X1
@ ^ [Y0: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f30]) ).
thf(f33,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) ) ),
inference(and_proxy_clausification,[],[f32]) ).
thf(f35,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) )
@ X2 ) ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f36,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( ( sK2 @ X1 @ X2 )
=> ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) )
@ X3 ) ) ),
inference(pi_proxy_clausification,[],[f37]) ).
thf(f39,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( ( X1 @ X3 )
=> ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f29]) ).
thf(f42,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( ( sK2 @ X1
@ ^ [Y0: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f29]) ).
thf(f43,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) ) ),
inference(and_proxy_clausification,[],[f42]) ).
thf(f45,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( sK2 @ X1 @ Y0 )
=> ( !! @ a
@ ^ [Y1: a] :
( ( X1 @ Y1 )
=> ( sK2 @ X1
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
| ( Y1 = Y2 ) ) ) ) ) )
@ X2 ) ) ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f46,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( ( sK2 @ X1 @ X2 )
=> ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X2: a > $o,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( !! @ a
@ ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
=> ( sK2 @ X1
@ ^ [Y1: a] :
( ( X2 @ Y1 )
| ( Y0 = Y1 ) ) ) )
@ X3 ) ) ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f49,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $true
= ( ( X1 @ X3 )
=> ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f50,plain,
! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false
= ( cX @ sK0 ) )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f49]) ).
thf(f51,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y1: ( a > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( Y1 @ Y2 )
=> ( !! @ a
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
=> ( Y1
@ ^ [Y4: a] :
( ( Y2 @ Y4 )
| ( Y3 = Y4 ) ) ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> ( cX @ Y1 ) ) )
& ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f52,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y1: ( a > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( Y1 @ Y2 )
=> ( !! @ a
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
=> ( Y1
@ ^ [Y4: a] :
( ( Y2 @ Y4 )
| ( Y3 = Y4 ) ) ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> ( cX @ Y1 ) ) )
& ( Y0 @ sK0 ) )
@ sK3 ) ) ),
inference(sigma_proxy_clausification,[],[f51]) ).
thf(f53,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( sK3 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ sK3 ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( cX @ Y0 ) ) )
& ( sK3 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f54,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( sK3 @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f53]) ).
thf(f55,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ( !! @ ( ( a > $o ) > $o )
@ ^ [Y0: ( a > $o ) > $o] :
( ( ( Y0
@ ^ [Y1: a] : $false )
& ( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y0 @ Y1 )
=> ( !! @ a
@ ^ [Y2: a] :
( ( sK3 @ Y2 )
=> ( Y0
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
| ( Y2 = Y3 ) ) ) ) ) ) ) )
=> ( Y0 @ sK3 ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( cX @ Y0 ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f53]) ).
thf(f56,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( cX @ Y0 ) ) ) ) ),
inference(and_proxy_clausification,[],[f55]) ).
thf(f70,plain,
! [X1: a] :
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( cX @ Y0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f56]) ).
thf(f71,plain,
! [X1: a] :
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( ( sK3 @ X1 )
=> ( cX @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f72,plain,
! [X1: a] :
( ( $true
= ( cX @ sK0 ) )
| ( $false
= ( sK3 @ X1 ) )
| ( $true
= ( cX @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f71]) ).
thf(f74,definition,
( spl6_1
<=> ( $true
= ( sK3 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
thf(f76,plain,
( ( $true
= ( sK3 @ sK0 ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f78,definition,
( spl6_2
<=> ( $true
= ( cX @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
thf(f79,plain,
( ( $true
!= ( cX @ sK0 ) )
| spl6_2 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f80,plain,
( ( $true
= ( cX @ sK0 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f81,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f54,f78,f74]) ).
thf(f82,plain,
( ! [X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X1 ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f31,f80]) ).
thf(f83,plain,
( ! [X1: a > $o] :
( ( $false
= ( sK2 @ X1 @ X1 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f97,plain,
( ! [X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X1 ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f41,f80]) ).
thf(f98,plain,
( ! [X1: a > $o] :
( ( $false
= ( sK2 @ X1 @ X1 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f107,plain,
( ! [X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f34,f80]) ).
thf(f108,plain,
( ! [X1: a > $o] :
( ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f141,definition,
( spl6_4
<=> ( sK0
= ( sK1 @ ( (=) @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
thf(f142,plain,
( ( sK0
!= ( sK1 @ ( (=) @ sK0 ) ) )
| spl6_4 ),
inference(avatar_component_clause,[],[f141]) ).
thf(f143,plain,
( ( sK0
= ( sK1 @ ( (=) @ sK0 ) ) )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f141]) ).
thf(f145,plain,
( ! [X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f44,f80]) ).
thf(f146,plain,
( ! [X1: a > $o] :
( ( $true
= ( sK2 @ X1
@ ^ [Y0: a] : $false ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f145]) ).
thf(f172,plain,
( ! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f40,f80]) ).
thf(f173,plain,
( ! [X2: a > $o,X3: a,X1: a > $o] :
( ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f172]) ).
thf(f178,plain,
( ! [X0: a > $o,X1: a] :
( ( $false = $true )
| ( $true
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) ) )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f83,f173]) ).
thf(f193,plain,
( ! [X0: a > $o,X1: a] :
( ( $false = $true )
| ( $true
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) ) )
| ~ spl6_2 ),
inference(duplicate_literal_removal,[],[f178]) ).
thf(f194,plain,
( ! [X0: a > $o,X1: a] :
( ( $true
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f193]) ).
thf(f195,plain,
( ! [X0: a > $o,X1: a] :
( ( $true
= ( ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) )
| ( X1
= ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ( $false
= ( ( X0 @ sK0 )
| ( X1 = sK0 ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f194]) ).
thf(f196,plain,
( ! [X0: a > $o,X1: a] :
( ( $true
= ( X1
= ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ( X0 @ sK0 )
| ( X1 = sK0 ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f195]) ).
thf(f197,plain,
( ! [X0: a > $o,X1: a] :
( ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( $false
= ( ( X0 @ sK0 )
| ( X1 = sK0 ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f196]) ).
thf(f198,plain,
( ! [X0: a > $o,X1: a] :
( ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( $false
= ( X1 = sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f197]) ).
thf(f204,plain,
( ! [X0: a > $o,X1: a] :
( ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f198]) ).
thf(f205,plain,
( ! [X0: a > $o,X1: a] :
( ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( X1 = X1 ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f204]) ).
thf(f207,plain,
( ! [X0: a > $o,X1: a] :
( ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( X1 != X1 )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f205]) ).
thf(f208,plain,
( ! [X0: a > $o,X1: a] :
( ( sK0 != X1 )
| ( ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) )
= X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f207]) ).
thf(f261,plain,
( ! [X2: a > $o,X3: a,X1: a > $o] :
( ( $false = $true )
| ( $false
= ( X1 @ sK0 ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) ) )
| ~ spl6_2 ),
inference(forward_demodulation,[],[f50,f80]) ).
thf(f262,plain,
( ! [X2: a > $o,X3: a,X1: a > $o] :
( ( $true
= ( sK2 @ X1
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X3 = Y0 ) ) ) )
| ( $false
= ( cX @ ( sK1 @ X1 ) ) )
| ( $false
= ( sK2 @ X1 @ X2 ) )
| ( $false
= ( X1 @ X3 ) )
| ( $false
= ( X1 @ sK0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f261]) ).
thf(f265,plain,
( ! [X0: a > $o,X1: a] :
( ( $false = $true )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) ) )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f98,f262]) ).
thf(f291,plain,
( ! [X0: a > $o,X1: a] :
( ( $false = $true )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) ) )
| ~ spl6_2 ),
inference(duplicate_literal_removal,[],[f265]) ).
thf(f292,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X1 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f291]) ).
thf(f293,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( ( X0 @ sK0 )
| ( X1 = sK0 ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f292]) ).
thf(f294,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( X1 = sK0 ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f293]) ).
thf(f300,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( ( X0 @ X1 )
| ( X1 = X1 ) ) ) )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f294]) ).
thf(f301,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( $false
= ( X1 = X1 ) ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f300]) ).
thf(f303,plain,
( ! [X0: a > $o,X1: a] :
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( sK0 != X1 )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) )
| ( X1 != X1 ) )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f301]) ).
thf(f304,plain,
( ! [X0: a > $o,X1: a] :
( ( sK0 != X1 )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) ) ) ) )
| ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 = Y0 ) )
@ X0 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f303]) ).
thf(f341,plain,
( ! [X0: a > $o] :
( ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( sK0 = Y0 ) )
@ X0 ) )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( sK0 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(equality_resolution,[],[f304]) ).
thf(f347,plain,
( ( $false = $true )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ sK0 ) )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f146,f341]) ).
thf(f448,plain,
( ( $false = $true )
| ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ sK0 ) )
| ~ spl6_2 ),
inference(duplicate_literal_removal,[],[f347]) ).
thf(f449,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ sK0 ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f448]) ).
thf(f450,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( $false
| ( sK0 = sK0 ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f449]) ).
thf(f451,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( sK0 = sK0 ) )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f450]) ).
thf(f453,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) )
| ( sK0 != sK0 )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f451]) ).
thf(f454,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f453]) ).
thf(f455,plain,
( ( $false
= ( cX
@ ( sK1
@ ^ [Y0: a] : ( sK0 = Y0 ) ) ) )
| ~ spl6_2 ),
inference(boolean_simplification,[],[f454]) ).
thf(f456,plain,
( ( $false
= ( cX @ ( sK1 @ ( (=) @ sK0 ) ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f455]) ).
thf(f564,plain,
( ( $false
= ( cX @ sK0 ) )
| ~ spl6_2
| ~ spl6_4 ),
inference(forward_demodulation,[],[f456,f143]) ).
thf(f568,plain,
( ( $false = $true )
| ~ spl6_2
| ~ spl6_4 ),
inference(constrained_superposition,[],[f80,f564]) ).
thf(f569,plain,
( $false
| ~ spl6_2
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f568]) ).
thf(f570,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f569]) ).
thf(f913,plain,
( ! [X0: a > $o] :
( ( $false
= ( sK2
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( sK0 = Y0 ) )
@ X0 ) )
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( sK0 = Y0 ) ) ) )
| ( $true
= ( X0
@ ( sK1
@ ^ [Y0: a] :
( ( X0 @ Y0 )
| ( sK0 = Y0 ) ) ) ) ) )
| ~ spl6_2 ),
inference(equality_resolution,[],[f208]) ).
thf(f916,plain,
( ( $false = $true )
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) )
| ( $true
= ( ^ [Y0: a] : $false
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $true
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ sK0 ) )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f913,f108]) ).
thf(f1155,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) )
| ( $true
= ( ^ [Y0: a] : $false
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $true
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ ( sK1
@ ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( ^ [Y1: a] : $false
@ Y0 )
| ( sK0 = Y0 ) )
@ sK0 ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f916]) ).
thf(f1156,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( $true
= ( $false
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) ) )
| ( $false
= ( $false
| ( sK0 = sK0 ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f1155]) ).
thf(f1157,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( $true
= ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) ) )
| ( $false
= ( $false
| ( sK0 = sK0 ) ) )
| ( $false = $true )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f1156]) ).
thf(f1158,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false
= ( $false
| ( sK0 = sK0 ) ) )
| ( $false = $true )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f1157]) ).
thf(f1159,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false
= ( sK0 = sK0 ) )
| ( $false = $true )
| ~ spl6_2 ),
inference(or_proxy_clausification,[],[f1158]) ).
thf(f1162,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( sK0 != sK0 )
| ( $false = $true )
| ~ spl6_2 ),
inference(equality_proxy_clausification,[],[f1159]) ).
thf(f1163,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ( $false = $true )
| ( sK0 != sK0 )
| ~ spl6_2 ),
inference(duplicate_literal_removal,[],[f1162]) ).
thf(f1164,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] :
( $false
| ( sK0 = Y0 ) ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f1163]) ).
thf(f1165,plain,
( ( sK0
= ( sK1
@ ^ [Y0: a] : ( sK0 = Y0 ) ) )
| ~ spl6_2 ),
inference(boolean_simplification,[],[f1164]) ).
thf(f1166,plain,
( ( sK0
= ( sK1 @ ( (=) @ sK0 ) ) )
| ~ spl6_2 ),
inference(beta-eta_normalization,[],[f1165]) ).
thf(f1180,plain,
( $false
| ~ spl6_2
| spl6_4 ),
inference(forward_subsumption_resolution,[],[f1166,f142]) ).
thf(f1181,plain,
( ~ spl6_2
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f1180]) ).
thf(f1188,plain,
( ! [X1: a] :
( ( $false
= ( sK3 @ X1 ) )
| ( $true
= ( cX @ X1 ) ) )
| spl6_2 ),
inference(forward_subsumption_resolution,[],[f72,f79]) ).
thf(f1191,plain,
( ( $false = $true )
| ( $true
= ( cX @ sK0 ) )
| ~ spl6_1
| spl6_2 ),
inference(constrained_superposition,[],[f1188,f76]) ).
thf(f1194,plain,
( ( $true
= ( cX @ sK0 ) )
| ~ spl6_1
| spl6_2 ),
inference(trivial_inequality_removal,[],[f1191]) ).
thf(f1198,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(forward_subsumption_resolution,[],[f1194,f79]) ).
thf(f1199,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f1198]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f81]) ).
cnf(s4,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f570]) ).
cnf(s7,plain,
( ~ spl6_2
| spl6_4 ),
inference(sat_conversion,[],[f1181]) ).
cnf(s9,plain,
( ~ spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f1199]) ).
cnf(s10,plain,
~ spl6_2,
inference(rat,[],[s4,s7]) ).
cnf(s11,plain,
~ spl6_1,
inference(rat,[],[s9,s10]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s10,s11]) ).
thf(f1200,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU874^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n019.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 14:42:14 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.88 % (874504)Will run a generic schedule for satisfiability detection.
% 3.92/0.88 % (874513)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1221509083:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.92/0.88 % (874513)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.92/0.88 % (874510)% WARNING: option uhcvi not known.
% 3.92/0.88 % (874510)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3064556789:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.92/0.88 % (874509)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1080765646_2999 on theBenchmark for (2999ds/0Mi)
% 3.92/0.88 % (874512)dis+10_1_sil=32000:sp=arity:random_seed=270988778:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.92/0.88 % (874510)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.92/0.88 % (874510)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.92/0.88 % Exception at run slice level
% 3.92/0.88 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.92/0.88 % (874511)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=885248588:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.92/0.88 % (874515)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1740407512:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.92/0.88 % (874514)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4008486135:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.92/0.88 % (874521)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=908895233:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.92/0.88 % Exception at run slice level
% 3.92/0.88 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.92/0.88 % (874513)Instruction limit reached!
% 3.92/0.88 % (874513)------------------------------
% 3.92/0.88 % (874513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.92/0.88 % (874513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.92/0.88 % (874513)CaDiCaL version: 2.1.3
% 3.92/0.88 % (874513)Termination reason: Instruction limit
% 3.92/0.88 % (874513)Termination phase: Saturation
% 3.92/0.88 % (874513)Time elapsed: 0.037 s
% 3.92/0.88 % (874513)Peak memory usage: 13 MB
% 3.92/0.88 % (874513)Instructions burned: 120 (million)
% 3.92/0.88 % (874526)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=738330121:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.92/0.88 % (874526)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.92/0.88 % (874526)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.92/0.88 % (874525)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=421281629:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.92/0.88 % (874512)Instruction limit reached!
% 3.92/0.88 % (874512)------------------------------
% 3.92/0.88 % (874512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.92/0.88 % (874512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.92/0.88 % (874512)CaDiCaL version: 2.1.3
% 3.92/0.88 % (874512)Termination reason: Instruction limit
% 3.92/0.88 % (874512)Termination phase: Saturation
% 3.92/0.88 % (874512)Time elapsed: 0.053 s
% 3.92/0.88 % (874512)Peak memory usage: 12 MB
% 3.92/0.88 % (874512)Instructions burned: 104 (million)
% 3.92/0.88 % (874529)ott-21_1_sil=16000:fs=off:random_seed=3121955181:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 3.92/0.88 % (874525)Instruction limit reached!
% 3.92/0.88 % (874525)------------------------------
% 3.92/0.88 % (874525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.92/0.88 % (874525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.92/0.88 % (874525)CaDiCaL version: 2.1.3
% 3.92/0.88 % (874525)Termination reason: Instruction limit
% 3.92/0.88 % (874525)Termination phase: Saturation
% 3.92/0.88 % (874525)Time elapsed: 0.068 s
% 3.92/0.88 % (874525)Peak memory usage: 13 MB
% 3.92/0.88 % (874525)Instructions burned: 131 (million)
% 3.92/0.88 % (874515)Instruction limit reached!
% 3.92/0.88 % (874515)------------------------------
% 14.00/2.28 % (874515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874515)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874515)Termination reason: Instruction limit
% 14.00/2.28 % (874515)Termination phase: Saturation
% 14.00/2.28 % (874515)Time elapsed: 0.113 s
% 14.00/2.28 % (874515)Peak memory usage: 13 MB
% 14.00/2.28 % (874515)Instructions burned: 160 (million)
% 14.00/2.28 % (874514)Instruction limit reached!
% 14.00/2.28 % (874514)------------------------------
% 14.00/2.28 % (874514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874514)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874514)Termination reason: Instruction limit
% 14.00/2.28 % (874514)Termination phase: Saturation
% 14.00/2.28 % (874514)Time elapsed: 0.117 s
% 14.00/2.28 % (874514)Peak memory usage: 13 MB
% 14.00/2.28 % (874514)Instructions burned: 132 (million)
% 14.00/2.28 % (874531)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2172514988:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 14.00/2.28 % (874532)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=869015921:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874529)Instruction limit reached!
% 14.00/2.28 % (874529)------------------------------
% 14.00/2.28 % (874529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874529)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874529)Termination reason: Instruction limit
% 14.00/2.28 % (874529)Termination phase: Saturation
% 14.00/2.28 % (874529)Time elapsed: 0.077 s
% 14.00/2.28 % (874529)Peak memory usage: 13 MB
% 14.00/2.28 % (874529)Instructions burned: 181 (million)
% 14.00/2.28 % (874533)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3978649533:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 14.00/2.28 % (874536)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3935355549:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874537)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=1437019163:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 14.00/2.28 % (874537)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.00/2.28 % (874541)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3207175158:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 14.00/2.28 % (874541)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.00/2.28 % (874526)Instruction limit reached!
% 14.00/2.28 % (874526)------------------------------
% 14.00/2.28 % (874526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874526)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874526)Termination reason: Instruction limit
% 14.00/2.28 % (874526)Termination phase: Saturation
% 14.00/2.28 % (874526)Time elapsed: 0.168 s
% 14.00/2.28 % (874526)Peak memory usage: 15 MB
% 14.00/2.28 % (874526)Instructions burned: 685 (million)
% 14.00/2.28 % (874543)fmb+10_1_sil=64000:random_seed=156253522:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 14.00/2.28 % (874543)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874545)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=750184787:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874547)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=957729509:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874549)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2602784192:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 14.00/2.28 % (874549)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.00/2.28 % (874531)Instruction limit reached!
% 14.00/2.28 % (874531)------------------------------
% 14.00/2.28 % (874531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874531)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874531)Termination reason: Instruction limit
% 14.00/2.28 % (874531)Termination phase: Saturation
% 14.00/2.28 % (874531)Time elapsed: 0.230 s
% 14.00/2.28 % (874531)Peak memory usage: 13 MB
% 14.00/2.28 % (874531)Instructions burned: 481 (million)
% 14.00/2.28 % (874551)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=367989410:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 14.00/2.28 % (874551)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 14.00/2.28 % (874551)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.00/2.28 % (874551)Refutation not found, incomplete strategy
% 14.00/2.28 % (874551)------------------------------
% 14.00/2.28 % (874551)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874551)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874551)Termination reason: Refutation not found, incomplete strategy
% 14.00/2.28 % (874551)Time elapsed: 0.001 s
% 14.00/2.28 % (874551)Peak memory usage: 12 MB
% 14.00/2.28 % (874551)Instructions burned: 3 (million)
% 14.00/2.28 % (874551)------------------------------
% 14.00/2.28 % (874551)------------------------------
% 14.00/2.28 % (874553)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2936471293:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874555)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=4181515268:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874557)ott-2_1_sil=16000:newcnf=on:random_seed=2557001106:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 14.00/2.28 % (874557)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.00/2.28 % (874537)Instruction limit reached!
% 14.00/2.28 % (874537)------------------------------
% 14.00/2.28 % (874537)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874537)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874537)Termination reason: Instruction limit
% 14.00/2.28 % (874537)Termination phase: Saturation
% 14.00/2.28 % (874537)Time elapsed: 0.331 s
% 14.00/2.28 % (874537)Peak memory usage: 22 MB
% 14.00/2.28 % (874537)Instructions burned: 694 (million)
% 14.00/2.28 % (874559)ott+10_1_sil=32000:tgt=ground:random_seed=1950694569:i=5114:av=off_2994 on theBenchmark for (2994ds/5114Mi)
% 14.00/2.28 % (874557)Instruction limit reached!
% 14.00/2.28 % (874557)------------------------------
% 14.00/2.28 % (874557)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874557)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874557)Termination reason: Instruction limit
% 14.00/2.28 % (874557)Termination phase: Saturation
% 14.00/2.28 % (874557)Time elapsed: 0.211 s
% 14.00/2.28 % (874557)Peak memory usage: 15 MB
% 14.00/2.28 % (874557)Instructions burned: 872 (million)
% 14.00/2.28 % (874561)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=749477681:i=54282_2993 on theBenchmark for (2993ds/54282Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874563)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=4095917117:i=3512:aac=none_2993 on theBenchmark for (2993ds/3512Mi)
% 14.00/2.28 % (874563)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.00/2.28 % (874533)Instruction limit reached!
% 14.00/2.28 % (874533)------------------------------
% 14.00/2.28 % (874533)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874533)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874533)Termination reason: Instruction limit
% 14.00/2.28 % (874533)Termination phase: Saturation
% 14.00/2.28 % (874533)Time elapsed: 0.538 s
% 14.00/2.28 % (874533)Peak memory usage: 16 MB
% 14.00/2.28 % (874533)Instructions burned: 1181 (million)
% 14.00/2.28 % (874565)dis+21_1_sil=32000:sas=cadical:random_seed=3464689762:i=3773:amm=off_2992 on theBenchmark for (2992ds/3773Mi)
% 14.00/2.28 % (874541)Instruction limit reached!
% 14.00/2.28 % (874541)------------------------------
% 14.00/2.28 % (874541)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874541)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874541)Termination reason: Instruction limit
% 14.00/2.28 % (874541)Termination phase: Saturation
% 14.00/2.28 % (874541)Time elapsed: 0.624 s
% 14.00/2.28 % (874541)Peak memory usage: 16 MB
% 14.00/2.28 % (874541)Instructions burned: 880 (million)
% 14.00/2.28 % (874567)ott+11_1_sil=16000:gs=on:random_seed=876451415:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2991 on theBenchmark for (2991ds/2251Mi)
% 14.00/2.28 % (874567)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.00/2.28 % (874563)Instruction limit reached!
% 14.00/2.28 % (874563)------------------------------
% 14.00/2.28 % (874563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874563)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874563)Termination reason: Instruction limit
% 14.00/2.28 % (874563)Termination phase: Saturation
% 14.00/2.28 % (874563)Time elapsed: 0.836 s
% 14.00/2.28 % (874563)Peak memory usage: 20 MB
% 14.00/2.28 % (874563)Instructions burned: 3514 (million)
% 14.00/2.28 % (874570)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=663695618:fmbsr=1.6:i=67534_2984 on theBenchmark for (2984ds/67534Mi)
% 14.00/2.28 % Exception at run slice level
% 14.00/2.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.00/2.28 % (874572)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=4106214832:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2984 on theBenchmark for (2984ds/4591Mi)
% 14.00/2.28 % (874567)Instruction limit reached!
% 14.00/2.28 % (874567)------------------------------
% 14.00/2.28 % (874567)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874567)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874567)Termination reason: Instruction limit
% 14.00/2.28 % (874567)Termination phase: Saturation
% 14.00/2.28 % (874567)Time elapsed: 1.140 s
% 14.00/2.28 % (874567)Peak memory usage: 19 MB
% 14.00/2.28 % (874567)Instructions burned: 2252 (million)
% 14.00/2.28 % (874574)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=313855147:i=29340_2979 on theBenchmark for (2979ds/29340Mi)
% 14.00/2.28 % (874574) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-874504-874574"...
% 14.00/2.28 % (874574)...printing done.
% 14.00/2.28 % (874574)Refutation found. Thanks to Tanya!
% 14.00/2.28 % SZS status Theorem for theBenchmark
% 14.00/2.28 % SZS output start Proof for theBenchmark
% See solution above
% 14.00/2.28 % (874574)------------------------------
% 14.00/2.28 % (874574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.00/2.28 % (874574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.00/2.28 % (874574)CaDiCaL version: 2.1.3
% 14.00/2.28 % (874574)Termination reason: Refutation
% 14.00/2.28 % (874574)Time elapsed: 0.032 s
% 14.00/2.28 % (874574)Peak memory usage: 13 MB
% 14.00/2.28 % (874574)Instructions burned: 66 (million)
% 14.00/2.28 % (874504)Success in time 2.066 s
% 14.00/2.28 % Vampire exiting
%------------------------------------------------------------------------------