%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL623^1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:04 AM UTC 2026
% Result : Theorem 3.79s 0.83s
% Output : Refutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 10
% Syntax : Number of formulae : 114 ( 50 unt; 0 typ; 3 def)
% Number of atoms : 883 ( 191 equ; 0 cnn)
% Maximal formula atoms : 9 ( 7 avg)
% Number of connectives : 1157 ( 72 ~; 147 |; 0 &; 814 @)
% ( 3 <=>; 66 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 108 ( 108 >; 0 *; 0 +; 0 <<)
% Number of symbols : 44 ( 40 usr; 8 con; 0-4 aty)
% ( 55 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 274 ( 0 sgn 99 !; 1 ?; 274 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
individuals: $tType ).
thf(func_def_1,type,
prop_a: $i > $o ).
thf(func_def_2,type,
prop_b: $i > $o ).
thf(func_def_3,type,
prop_c: $i > $o ).
thf(func_def_4,type,
mfalse: $i > $o ).
thf(func_def_5,type,
mtrue: $i > $o ).
thf(func_def_6,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mall: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_15,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_16,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_17,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_18,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_20,type,
r: $i > $i > $o ).
thf(func_def_23,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(func_def_25,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_26,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_27,type,
vOR: $o > $o > $o ).
thf(func_def_28,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_29,type,
vAND: $o > $o > $o ).
thf(func_def_30,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_31,type,
vIMP: $o > $o > $o ).
thf(func_def_32,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_34,type,
sK0: $i > $o ).
thf(func_def_36,type,
sK2: $i > $i ).
thf(func_def_38,type,
sK4: $i > ( $i > $o ) > $i ).
thf(func_def_39,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(f6,axiom,
( mimpl
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(f8,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f16,axiom,
! [X0: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gl) ).
thf(f17,conjecture,
! [X0: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',loeb) ).
thf(f18,negated_conjecture,
~ ! [X0: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
thf(f21,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f22,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f23,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f24,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f27,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f29,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f30,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f29]) ).
thf(f37,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f38,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f37]) ).
thf(f45,plain,
! [X0: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) ),
inference(rectify,[],[f16]) ).
thf(f46,plain,
! [X0: $i > $o] :
( ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) )
= $true ),
inference(fool_elimination,[],[f45]) ).
thf(f47,plain,
~ ! [X0: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) ),
inference(rectify,[],[f18]) ).
thf(f48,plain,
~ ! [X0: $i > $o] :
( ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) )
= $true ),
inference(fool_elimination,[],[f47]) ).
thf(f49,plain,
? [X0: $i > $o] :
( ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) )
!= $true ),
inference(ennf_transformation,[],[f48]) ).
thf(f50,plain,
( $true
!= ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ sK0 ) @ sK0 ) ) @ ( mbox @ r @ sK0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f49]) ).
thf(f53,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f54,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f56,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f58,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f62,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f66,plain,
! [X0: $i > $o] :
( ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X0 ) @ X0 ) ) @ ( mbox @ r @ X0 ) ) )
= $true ),
inference(cnf_transformation,[],[f46]) ).
thf(f67,plain,
( $true
!= ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ sK0 ) @ sK0 ) ) @ ( mbox @ r @ sK0 ) ) ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f70,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f56,f54,f53]) ).
thf(f72,plain,
! [X0: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ X0 )
@ X0 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ X0 ) ) ) ),
inference(definition_unfolding,[],[f66,f62,f70,f58,f70,f58,f58]) ).
thf(f73,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ sK0 )
@ sK0 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ r
@ sK0 ) ) ) ),
inference(definition_unfolding,[],[f67,f62,f70,f58,f70,f58,f58]) ).
thf(f74,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( r @ Y1 @ Y2 )
=> ( sK0 @ Y2 ) ) )
| ( sK0 @ Y1 ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f73]) ).
thf(f75,plain,
( $false
= ( ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( r @ Y1 @ Y2 )
=> ( sK0 @ Y2 ) ) )
| ( sK0 @ Y1 ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f74]) ).
thf(f76,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) )
| ( sK0 @ Y0 ) ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( sK0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f75]) ).
thf(f77,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( sK0 @ Y0 ) ) ) ),
inference(or_proxy_clausification,[],[f76]) ).
thf(f78,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) )
| ( sK0 @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f76]) ).
thf(f79,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) )
| ( sK0 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f78]) ).
thf(f80,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( sK0 @ Y1 ) ) )
| ( sK0 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X1: $i] :
( $true
= ( ( r @ sK1 @ X1 )
=> ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( sK0 @ Y0 ) ) )
| ( sK0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f80]) ).
thf(f82,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( sK0 @ Y0 ) ) )
| ( sK0 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( sK0 @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f82]) ).
thf(f84,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( sK0 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f83]) ).
thf(f85,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( sK0 @ Y0 ) )
@ ( sK2 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f84]) ).
thf(f86,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( ( r @ X1 @ ( sK2 @ X1 ) )
=> ( sK0 @ ( sK2 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f85]) ).
thf(f87,plain,
! [X1: $i] :
( ( $false
= ( r @ sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( sK0 @ ( sK2 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f86]) ).
thf(f88,plain,
! [X1: $i] :
( ( $true
= ( r @ X1 @ ( sK2 @ X1 ) ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( r @ sK1 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f86]) ).
thf(f89,plain,
( $false
= ( ^ [Y0: $i] :
( ( r @ sK1 @ Y0 )
=> ( sK0 @ Y0 ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f77]) ).
thf(f90,plain,
( $false
= ( ( r @ sK1 @ sK3 )
=> ( sK0 @ sK3 ) ) ),
inference(beta-eta_normalization,[],[f89]) ).
thf(f91,plain,
( $false
= ( sK0 @ sK3 ) ),
inference(imp_proxy_clausification,[],[f90]) ).
thf(f92,plain,
( $true
= ( r @ sK1 @ sK3 ) ),
inference(imp_proxy_clausification,[],[f90]) ).
thf(f93,plain,
! [X0: $i > $o] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( r @ Y1 @ Y2 )
=> ( X0 @ Y2 ) ) )
| ( X0 @ Y1 ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f94,plain,
! [X0: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( r @ Y1 @ Y2 )
=> ( X0 @ Y2 ) ) )
| ( X0 @ Y1 ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f93]) ).
thf(f95,plain,
! [X0: $i > $o,X1: $i] :
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) )
| ( X0 @ Y0 ) ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( X0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f94]) ).
thf(f96,plain,
! [X0: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( X0 @ Y0 ) ) ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) )
| ( X0 @ Y0 ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f95]) ).
thf(f97,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( X0 @ Y0 ) )
@ X2 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) )
| ( X0 @ Y0 ) ) ) ) ) ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( X0 @ Y0 ) )
@ X2 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) )
| ( X0 @ Y0 ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( X0 @ Y0 ) )
@ X2 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( r @ X1 @ Y0 )
=> ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( r @ Y0 @ Y1 )
=> ( X0 @ Y1 ) ) )
| ( X0 @ Y0 ) ) )
@ ( sK4 @ X1 @ X0 ) ) ) ),
inference(sigma_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( ( r @ X1 @ X2 )
=> ( X0 @ X2 ) ) )
| ( $false
= ( ( r @ X1 @ ( sK4 @ X1 @ X0 ) )
=> ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) ) )
| ( X0 @ ( sK4 @ X1 @ X0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f99]) ).
thf(f101,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $false
= ( ( r @ X1 @ ( sK4 @ X1 @ X0 ) )
=> ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) ) )
| ( X0 @ ( sK4 @ X1 @ X0 ) ) ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) ) )
| ( X0 @ ( sK4 @ X1 @ X0 ) ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f101]) ).
thf(f103,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $true
= ( r @ X1 @ ( sK4 @ X1 @ X0 ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f101]) ).
thf(f104,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $false
= ( X0 @ ( sK4 @ X1 @ X0 ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(or_proxy_clausification,[],[f102]) ).
thf(f105,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) ) ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(or_proxy_clausification,[],[f102]) ).
thf(f106,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(not_proxy_clausification,[],[f105]) ).
thf(f107,plain,
! [X2: $i,X3: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( r @ ( sK4 @ X1 @ X0 ) @ Y0 )
=> ( X0 @ Y0 ) )
@ X3 ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(pi_proxy_clausification,[],[f106]) ).
thf(f108,plain,
! [X2: $i,X3: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( $true
= ( ( r @ ( sK4 @ X1 @ X0 ) @ X3 )
=> ( X0 @ X3 ) ) )
| ( ( X0 @ X2 )
= $true ) ),
inference(beta-eta_normalization,[],[f107]) ).
thf(f109,plain,
! [X2: $i,X3: $i,X0: $i > $o,X1: $i] :
( ( $false
= ( r @ X1 @ X2 ) )
| ( ( X0 @ X2 )
= $true )
| ( $false
= ( r @ ( sK4 @ X1 @ X0 ) @ X3 ) )
| ( $true
= ( X0 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f108]) ).
thf(f145,plain,
! [X0: $i,X1: $i] :
( ( $false = $true )
| ( $false
= ( r @ X1 @ X0 ) )
| ( $true
= ( r @ X1
@ ( sK4 @ X1
@ ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) ) ) ) )
| ( sK3 != X0 ) ),
inference(constrained_superposition,[],[f91,f103]) ).
thf(f172,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( r @ X1 @ X0 ) )
| ( $true
= ( r @ X1
@ ( sK4 @ X1
@ ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) ) ) ) )
| ( sK3 != X0 ) ),
inference(trivial_inequality_removal,[],[f145]) ).
thf(f173,plain,
! [X0: $i,X1: $i] :
( ( sK3 != X0 )
| ( $true
= ( r @ X1 @ ( sK4 @ X1 @ sK0 ) ) )
| ( $false
= ( r @ X1 @ X0 ) ) ),
inference(beta-eta_normalization,[],[f172]) ).
thf(f261,plain,
! [X0: $i,X1: $i] :
( ( $false = $true )
| ( $false
= ( r @ X1 @ X0 ) )
| ( $false
= ( ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ ( sK4 @ X1
@ ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) ) ) ) )
| ( sK3 != X0 ) ),
inference(constrained_superposition,[],[f91,f104]) ).
thf(f297,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( r @ X1 @ X0 ) )
| ( $false
= ( ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ ( sK4 @ X1
@ ^ [Y0: $i] :
( sK0
@ ( ^ [Y1: $i] : Y1
@ Y0 ) ) ) ) )
| ( sK3 != X0 ) ),
inference(trivial_inequality_removal,[],[f261]) ).
thf(f298,plain,
! [X0: $i,X1: $i] :
( ( sK3 != X0 )
| ( $false
= ( sK0 @ ( sK4 @ X1 @ sK0 ) ) )
| ( $false
= ( r @ X1 @ X0 ) ) ),
inference(beta-eta_normalization,[],[f297]) ).
thf(f386,plain,
! [X0: $i] :
( ( $false
= ( sK0 @ ( sK4 @ X0 @ sK0 ) ) )
| ( $false
= ( r @ X0 @ sK3 ) ) ),
inference(equality_resolution,[],[f298]) ).
thf(f579,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $false = $true )
| ( $true
= ( sK0 @ ( sK4 @ X0 @ X1 ) ) )
| ( $false
= ( r @ sK1 @ ( sK4 @ X0 @ X1 ) ) )
| ( $false
= ( r @ X0 @ X2 ) )
| ( ( X1 @ X2 )
= $true )
| ( $true
= ( X1 @ ( sK2 @ ( sK4 @ X0 @ X1 ) ) ) ) ),
inference(constrained_superposition,[],[f88,f109]) ).
thf(f613,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $false
= ( r @ sK1 @ ( sK4 @ X0 @ X1 ) ) )
| ( $false
= ( r @ X0 @ X2 ) )
| ( ( X1 @ X2 )
= $true )
| ( $true
= ( X1 @ ( sK2 @ ( sK4 @ X0 @ X1 ) ) ) )
| ( $true
= ( sK0 @ ( sK4 @ X0 @ X1 ) ) ) ),
inference(trivial_inequality_removal,[],[f579]) ).
thf(f1366,plain,
! [X0: $i] :
( ( $true
= ( r @ X0 @ ( sK4 @ X0 @ sK0 ) ) )
| ( $false
= ( r @ X0 @ sK3 ) ) ),
inference(equality_resolution,[],[f173]) ).
thf(f1720,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) )
| ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $false
= ( r @ sK1 @ sK3 ) ) ),
inference(constrained_superposition,[],[f87,f1366]) ).
thf(f1744,plain,
( ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) )
| ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $false
= ( r @ sK1 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f1720]) ).
thf(f1757,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) )
| ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) ) ),
inference(forward_demodulation,[],[f1744,f92]) ).
thf(f1758,plain,
( ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) )
| ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) ) ),
inference(trivial_inequality_removal,[],[f1757]) ).
thf(f1904,definition,
( spl5_5
<=> ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
thf(f1906,plain,
( ( $false
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f1904]) ).
thf(f1908,definition,
( spl5_6
<=> ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).
thf(f1910,plain,
( ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) )
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f1908]) ).
thf(f1911,plain,
( spl5_5
| spl5_6 ),
inference(avatar_split_clause,[],[f1758,f1908,f1904]) ).
thf(f8471,plain,
! [X0: $i] :
( ( $false = $true )
| ( $false
= ( r @ sK1 @ sK3 ) )
| ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f1366,f613]) ).
thf(f9032,plain,
! [X0: $i] :
( ( $false
= ( r @ sK1 @ sK3 ) )
| ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) ),
inference(trivial_inequality_removal,[],[f8471]) ).
thf(f9447,plain,
! [X0: $i] :
( ( $false = $true )
| ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) ),
inference(forward_demodulation,[],[f9032,f92]) ).
thf(f9448,plain,
! [X0: $i] :
( ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK2 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) ),
inference(trivial_inequality_removal,[],[f9447]) ).
thf(f9461,plain,
( ! [X0: $i] :
( ( $false = $true )
| ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ~ spl5_5 ),
inference(forward_demodulation,[],[f9448,f1906]) ).
thf(f9462,plain,
( ! [X0: $i] :
( ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) )
| ( $true
= ( sK0 @ ( sK4 @ sK1 @ sK0 ) ) ) )
| ~ spl5_5 ),
inference(trivial_inequality_removal,[],[f9461]) ).
thf(f9466,definition,
( spl5_12
<=> ! [X0: $i] :
( ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_12])],[avatar_definition]) ).
thf(f9467,plain,
( ! [X0: $i] :
( ( $false
= ( r @ sK1 @ X0 ) )
| ( $true
= ( sK0 @ X0 ) ) )
| ~ spl5_12 ),
inference(avatar_component_clause,[],[f9466]) ).
thf(f9468,plain,
( spl5_6
| spl5_12
| ~ spl5_5 ),
inference(avatar_split_clause,[],[f9462,f1904,f9466,f1908]) ).
thf(f9488,plain,
( ( $false = $true )
| ( $false
= ( r @ sK1 @ sK3 ) )
| ~ spl5_6 ),
inference(constrained_superposition,[],[f386,f1910]) ).
thf(f9523,plain,
( ( $false
= ( r @ sK1 @ sK3 ) )
| ~ spl5_6 ),
inference(trivial_inequality_removal,[],[f9488]) ).
thf(f9578,plain,
( ( $false = $true )
| ~ spl5_6 ),
inference(constrained_superposition,[],[f9523,f92]) ).
thf(f9657,plain,
( $false
| ~ spl5_6 ),
inference(trivial_inequality_removal,[],[f9578]) ).
thf(f9658,plain,
~ spl5_6,
inference(avatar_contradiction_clause,[],[f9657]) ).
thf(f9734,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ sK3 ) )
| ~ spl5_12 ),
inference(constrained_superposition,[],[f9467,f92]) ).
thf(f9842,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ~ spl5_12 ),
inference(trivial_inequality_removal,[],[f9734]) ).
thf(f9903,plain,
( ( $false = $true )
| ~ spl5_12 ),
inference(forward_demodulation,[],[f9842,f91]) ).
thf(f9904,plain,
( $false
| ~ spl5_12 ),
inference(trivial_inequality_removal,[],[f9903]) ).
thf(f9905,plain,
~ spl5_12,
inference(avatar_contradiction_clause,[],[f9904]) ).
cnf(s2,plain,
( spl5_5
| spl5_6 ),
inference(sat_conversion,[],[f1911]) ).
cnf(s9,plain,
( ~ spl5_5
| spl5_6
| spl5_12 ),
inference(sat_conversion,[],[f9468]) ).
cnf(s11,plain,
~ spl5_6,
inference(sat_conversion,[],[f9658]) ).
cnf(s13,plain,
~ spl5_12,
inference(sat_conversion,[],[f9905]) ).
cnf(s14,plain,
~ spl5_5,
inference(rat,[],[s9,s13,s11]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s2,s11,s14]) ).
thf(f9908,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL623^1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n001.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 09:34:20 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.79/0.83 % (1007326)Will run a generic schedule for satisfiability detection.
% 3.79/0.83 % (1007336)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2868326949:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.79/0.83 % (1007332)% WARNING: option uhcvi not known.
% 3.79/0.83 % (1007331)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3470397515_2999 on theBenchmark for (2999ds/0Mi)
% 3.79/0.83 % (1007332)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3179634608:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.79/0.83 % (1007333)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2795590342:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.79/0.83 % (1007334)dis+10_1_sil=32000:sp=arity:random_seed=3090164656:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.79/0.83 % (1007335)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3254987599:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.79/0.83 % (1007332)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % (1007335)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007332)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.79/0.83 % (1007337)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=750818421:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.79/0.83 % (1007344)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2498744055:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007336)Instruction limit reached!
% 3.79/0.83 % (1007336)------------------------------
% 3.79/0.83 % (1007336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007336)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007336)Termination reason: Instruction limit
% 3.79/0.83 % (1007336)Termination phase: Saturation
% 3.79/0.83 % (1007336)Time elapsed: 0.037 s
% 3.79/0.83 % (1007336)Peak memory usage: 13 MB
% 3.79/0.83 % (1007336)Instructions burned: 132 (million)
% 3.79/0.83 % (1007348)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=3157666958:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.79/0.83 % (1007348)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % (1007348)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.79/0.83 % (1007347)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2463088907:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.79/0.83 % (1007334)Instruction limit reached!
% 3.79/0.83 % (1007334)------------------------------
% 3.79/0.83 % (1007334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007334)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007334)Termination reason: Instruction limit
% 3.79/0.83 % (1007334)Termination phase: Saturation
% 3.79/0.83 % (1007334)Time elapsed: 0.051 s
% 3.79/0.83 % (1007334)Peak memory usage: 12 MB
% 3.79/0.83 % (1007334)Instructions burned: 103 (million)
% 3.79/0.83 % (1007335)Instruction limit reached!
% 3.79/0.83 % (1007335)------------------------------
% 3.79/0.83 % (1007335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007335)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007335)Termination reason: Instruction limit
% 3.79/0.83 % (1007335)Termination phase: Saturation
% 3.79/0.83 % (1007335)Time elapsed: 0.060 s
% 3.79/0.83 % (1007335)Peak memory usage: 12 MB
% 3.79/0.83 % (1007335)Instructions burned: 117 (million)
% 3.79/0.83 % (1007351)ott-21_1_sil=16000:fs=off:random_seed=1068656998:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 3.79/0.83 % (1007352)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4094424740:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 3.79/0.83 % (1007347)Instruction limit reached!
% 3.79/0.83 % (1007347)------------------------------
% 3.79/0.83 % (1007347)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007347)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007347)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007347)Termination reason: Instruction limit
% 3.79/0.83 % (1007347)Termination phase: Saturation
% 3.79/0.83 % (1007347)Time elapsed: 0.068 s
% 3.79/0.83 % (1007347)Peak memory usage: 12 MB
% 3.79/0.83 % (1007347)Instructions burned: 131 (million)
% 3.79/0.83 % (1007355)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4070211418:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007357)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4121240069:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 3.79/0.83 % (1007337)Instruction limit reached!
% 3.79/0.83 % (1007337)------------------------------
% 3.79/0.83 % (1007337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007337)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007337)Termination reason: Instruction limit
% 3.79/0.83 % (1007337)Termination phase: Saturation
% 3.79/0.83 % (1007337)Time elapsed: 0.140 s
% 3.79/0.83 % (1007337)Peak memory usage: 12 MB
% 3.79/0.83 % (1007337)Instructions burned: 160 (million)
% 3.79/0.83 % (1007351)Instruction limit reached!
% 3.79/0.83 % (1007351)------------------------------
% 3.79/0.83 % (1007351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007351)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007351)Termination reason: Instruction limit
% 3.79/0.83 % (1007351)Termination phase: Saturation
% 3.79/0.83 % (1007351)Time elapsed: 0.100 s
% 3.79/0.83 % (1007351)Peak memory usage: 12 MB
% 3.79/0.83 % (1007351)Instructions burned: 181 (million)
% 3.79/0.83 % (1007359)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=327237984:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007360)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=890750300: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)
% 3.79/0.83 % (1007360)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % (1007362)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=72076428:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 3.79/0.83 % (1007362)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % (1007348)Instruction limit reached!
% 3.79/0.83 % (1007348)------------------------------
% 3.79/0.83 % (1007348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007348)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007348)Termination reason: Instruction limit
% 3.79/0.83 % (1007348)Termination phase: Saturation
% 3.79/0.83 % (1007348)Time elapsed: 0.172 s
% 3.79/0.83 % (1007348)Peak memory usage: 15 MB
% 3.79/0.83 % (1007348)Instructions burned: 688 (million)
% 3.79/0.83 % (1007365)fmb+10_1_sil=64000:random_seed=3009796032:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 3.79/0.83 % (1007365)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007367)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3185041216:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007369)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2778144910:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007371)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2700927143:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 3.79/0.83 % (1007371)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.79/0.83 % (1007352)Instruction limit reached!
% 3.79/0.83 % (1007352)------------------------------
% 3.79/0.83 % (1007352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007352)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007352)Termination reason: Instruction limit
% 3.79/0.83 % (1007352)Termination phase: Saturation
% 3.79/0.83 % (1007352)Time elapsed: 0.243 s
% 3.79/0.83 % (1007352)Peak memory usage: 13 MB
% 3.79/0.83 % (1007352)Instructions burned: 478 (million)
% 3.79/0.83 % (1007373)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=913590424:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 3.79/0.83 % (1007373)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.79/0.83 % (1007373)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.79/0.83 % (1007360)Instruction limit reached!
% 3.79/0.83 % (1007360)------------------------------
% 3.79/0.83 % (1007360)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007360)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007360)Termination reason: Instruction limit
% 3.79/0.83 % (1007360)Termination phase: Saturation
% 3.79/0.83 % (1007360)Time elapsed: 0.346 s
% 3.79/0.83 % (1007360)Peak memory usage: 15 MB
% 3.79/0.83 % (1007360)Instructions burned: 692 (million)
% 3.79/0.83 % (1007375)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3038387793:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 3.79/0.83 % Exception at run slice level
% 3.79/0.83 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.79/0.83 % (1007371) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1007326-1007371"...
% 3.79/0.83 % (1007371)...printing done.
% 3.79/0.83 % (1007371)Refutation found. Thanks to Tanya!
% 3.79/0.83 % SZS status Theorem for theBenchmark
% 3.79/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 3.79/0.83 % (1007371)------------------------------
% 3.79/0.83 % (1007371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/0.83 % (1007371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/0.83 % (1007371)CaDiCaL version: 2.1.3
% 3.79/0.83 % (1007371)Termination reason: Refutation
% 3.79/0.83 % (1007371)Time elapsed: 0.315 s
% 3.79/0.83 % (1007371)Peak memory usage: 16 MB
% 3.79/0.83 % (1007371)Instructions burned: 1321 (million)
% 3.79/0.83 % (1007326)Success in time 0.613 s
% 3.79/0.83 % Vampire exiting
%------------------------------------------------------------------------------