%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL716^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:08 AM UTC 2026
% Result : Theorem 2.47s 0.60s
% Output : Refutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 10
% Syntax : Number of formulae : 101 ( 53 unt; 0 typ; 2 def)
% Number of atoms : 618 ( 153 equ; 0 cnn)
% Maximal formula atoms : 7 ( 6 avg)
% Number of connectives : 928 ( 102 ~; 115 |; 15 &; 620 @)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 136 ( 136 >; 0 *; 0 +; 0 <<)
% Number of symbols : 67 ( 62 usr; 8 con; 0-4 aty)
% ( 51 !!; 9 ??; 0 @@+; 0 @@-)
% Number of variables : 256 ( 1 sgn 83 !; 3 ?; 256 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mu: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
meq_ind: mu > mu > $i > $o ).
thf(func_def_1,type,
meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_11,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_12,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_13,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_14,type,
mtrue: $i > $o ).
thf(func_def_15,type,
mfalse: $i > $o ).
thf(func_def_16,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_18,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
mserial: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_29,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_30,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_31,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_32,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_35,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vNOT: $o > $o ).
thf(func_def_38,type,
vOR: $o > $o > $o ).
thf(func_def_39,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vIMP: $o > $o > $o ).
thf(func_def_44,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
vAND: $o > $o > $o ).
thf(func_def_46,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
sK0: $i > $i > $o ).
thf(func_def_48,type,
sK1: $i > ( $i > $o ) > $i ).
thf(func_def_49,type,
sK2: $i > ( $i > $o ) > $i ).
thf(func_def_53,type,
sK6: $i > $i ).
thf(func_def_54,type,
sK7: ( $i > $i ) > $i ).
thf(func_def_55,type,
sK8: ( $i > $i ) > $i ).
thf(func_def_56,type,
sK9: $i > $i ).
thf(func_def_57,type,
sK10: $i > $i ).
thf(func_def_58,type,
sK11: $i > $i ).
thf(func_def_59,type,
sK12: $i > $i ).
thf(func_def_60,type,
sK13: $i > $i ).
thf(func_def_61,type,
sK14: $i > $i ).
thf(func_def_62,type,
sK15: $i > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(f6,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f11,axiom,
( mforall_prop
= ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(f16,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(f25,axiom,
( mweakly_dense
= ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i,X3: $i] :
( ( X0 @ X1 @ X2 )
=> ? [X3: $i] :
( ( X0 @ X3 @ X2 )
& ( X0 @ X1 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mweakly_dense) ).
thf(f28,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,conjecture,
! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ ( mbox @ X0 @ X1 ) ) @ ( mbox @ X0 @ X1 ) ) ) )
=> ( mweakly_dense @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f33,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ ( mbox @ X0 @ X1 ) ) @ ( mbox @ X0 @ X1 ) ) ) )
=> ( mweakly_dense @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
thf(f36,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f37,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f38,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f39,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f38]) ).
thf(f41,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f47,plain,
( mforall_prop
= ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f11]) ).
thf(f48,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f54,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f55,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f71,plain,
( mweakly_dense
= ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
=> ? [X4: $i] :
( ( X0 @ X4 @ X2 )
& ( X0 @ X1 @ X4 ) ) ) ) ),
inference(rectify,[],[f25]) ).
thf(f72,plain,
( mweakly_dense
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
& ( Y0 @ Y3 @ Y1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f71]) ).
thf(f77,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f78,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f77]) ).
thf(f85,plain,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ ( mbox @ X0 @ X1 ) ) @ ( mbox @ X0 @ X1 ) ) ) )
=> ( mweakly_dense @ X0 ) ),
inference(rectify,[],[f33]) ).
thf(f86,plain,
~ ! [X0: $i > $i > $o] :
( ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ X0 @ ( mbox @ X0 @ Y0 ) ) @ ( mbox @ X0 @ Y0 ) ) ) ) )
=> ( ( mweakly_dense @ X0 )
= $true ) ),
inference(fool_elimination,[],[f85]) ).
thf(f87,plain,
? [X0: $i > $i > $o] :
( ( ( mweakly_dense @ X0 )
!= $true )
& ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ X0 @ ( mbox @ X0 @ Y0 ) ) @ ( mbox @ X0 @ Y0 ) ) ) ) ) ),
inference(ennf_transformation,[],[f86]) ).
thf(f88,plain,
( ( $true
!= ( mweakly_dense @ sK0 ) )
& ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ sK0 @ ( mbox @ sK0 @ Y0 ) ) @ ( mbox @ sK0 @ Y0 ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f87]) ).
thf(f91,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f92,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f94,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f99,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f104,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f113,plain,
( mweakly_dense
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
& ( Y0 @ Y3 @ Y1 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f72]) ).
thf(f116,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f120,plain,
( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ sK0 @ ( mbox @ sK0 @ Y0 ) ) @ ( mbox @ sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f121,plain,
( $true
!= ( mweakly_dense @ sK0 ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f125,plain,
( mimplies
= ( ^ [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,[],[f94,f92,f91]) ).
thf(f133,plain,
( $true
!= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
& ( Y0 @ Y3 @ Y1 ) ) ) ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f121,f113]) ).
thf(f134,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i > $o] :
( ^ [Y3: $i > $o,Y4: $i > $o,Y5: $i] :
( ( Y3 @ Y5 )
| ( Y4 @ Y5 ) )
@ ( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ Y1 )
@ Y2 )
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ~ ( Y1 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) )
@ sK0
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ~ ( Y1 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) )
@ sK0
@ Y0 ) )
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ~ ( Y1 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) )
@ sK0
@ Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f120,f116,f99,f125,f104,f104,f104]) ).
thf(f135,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y0 @ Y2 )
| ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y0 @ Y2 )
| ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f135]) ).
thf(f137,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ( Y0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ( Y0 @ Y1 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f137]) ).
thf(f139,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f138]) ).
thf(f140,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f139]) ).
thf(f141,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( X2 @ Y0 ) )
@ X3 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) ) ) ) ) ),
inference(pi_proxy_clausification,[],[f140]) ).
thf(f142,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( X2 @ Y0 ) )
@ X3 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f141]) ).
thf(f143,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( X2 @ Y0 ) )
@ X3 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) )
@ ( sK1 @ X1 @ X2 ) ) ) ),
inference(sigma_proxy_clausification,[],[f142]) ).
thf(f144,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ~ ( sK0 @ X1 @ X3 )
| ( X2 @ X3 ) ) )
| ( $false
= ( ~ ( sK0 @ X1 @ ( sK1 @ X1 @ X2 ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f143]) ).
thf(f145,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ~ ( sK0 @ X1 @ ( sK1 @ X1 @ X2 ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ Y0 )
| ( X2 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(or_proxy_clausification,[],[f144]) ).
thf(f146,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f147,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ~ ( sK0 @ X1 @ ( sK1 @ X1 @ X2 ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f148,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $true
= ( sK0 @ X1 @ ( sK1 @ X1 @ X2 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(not_proxy_clausification,[],[f147]) ).
thf(f149,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $true
= ( sK0 @ X1 @ ( sK1 @ X1 @ X2 ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(not_proxy_clausification,[],[f148]) ).
thf(f150,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ Y0 )
| ( X2 @ Y0 ) )
@ ( sK2 @ X1 @ X2 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(sigma_proxy_clausification,[],[f146]) ).
thf(f151,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ Y0 )
| ( X2 @ Y0 ) )
@ ( sK2 @ X1 @ X2 ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(not_proxy_clausification,[],[f150]) ).
thf(f152,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ ( sK2 @ X1 @ X2 ) )
| ( X2 @ ( sK2 @ X1 @ X2 ) ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(beta-eta_normalization,[],[f151]) ).
thf(f153,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( X2 @ ( sK2 @ X1 @ X2 ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(or_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $false
= ( ~ ( sK0 @ ( sK1 @ X1 @ X2 ) @ ( sK2 @ X1 @ X2 ) ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(or_proxy_clausification,[],[f152]) ).
thf(f155,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( X2 @ X3 ) )
| ( $true
= ( sK0 @ ( sK1 @ X1 @ X2 ) @ ( sK2 @ X1 @ X2 ) ) )
| ( $false
= ( sK0 @ X1 @ X3 ) ) ),
inference(not_proxy_clausification,[],[f154]) ).
thf(f156,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 @ Y0 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( sK0 @ Y1 @ Y2 )
& ( sK0 @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f133]) ).
thf(f157,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 @ Y0 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( sK0 @ Y1 @ Y2 )
& ( sK0 @ Y2 @ Y0 ) ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f156]) ).
thf(f158,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 @ sK3 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
& ( sK0 @ Y1 @ sK3 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f157]) ).
thf(f159,plain,
( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 @ sK3 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
& ( sK0 @ Y1 @ sK3 ) ) ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f158]) ).
thf(f160,plain,
( $false
= ( ( sK0 @ sK4 @ sK3 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK4 @ Y0 )
& ( sK0 @ Y0 @ sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f159]) ).
thf(f161,plain,
( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK4 @ Y0 )
& ( sK0 @ Y0 @ sK3 ) ) ) ),
inference(imp_proxy_clausification,[],[f160]) ).
thf(f162,plain,
( $true
= ( sK0 @ sK4 @ sK3 ) ),
inference(imp_proxy_clausification,[],[f160]) ).
thf(f163,plain,
! [X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ( sK0 @ sK4 @ Y0 )
& ( sK0 @ Y0 @ sK3 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f161]) ).
thf(f164,plain,
! [X1: $i] :
( $false
= ( ( sK0 @ sK4 @ X1 )
& ( sK0 @ X1 @ sK3 ) ) ),
inference(beta-eta_normalization,[],[f163]) ).
thf(f165,plain,
! [X1: $i] :
( ( $false
= ( sK0 @ X1 @ sK3 ) )
| ( $false
= ( sK0 @ sK4 @ X1 ) ) ),
inference(and_proxy_clausification,[],[f164]) ).
thf(f225,plain,
! [X0: $i > $o] :
( ( $true = $false )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) ) ),
inference(constrained_superposition,[],[f162,f153]) ).
thf(f258,plain,
! [X0: $i > $o] :
( ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $true
= ( X0 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f225]) ).
thf(f331,plain,
( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) ),
inference(leibniz_equality_elimination,[],[f258]) ).
thf(f748,plain,
! [X0: $i > $o] :
( ( $true = $false )
| ( $true
= ( X0 @ sK3 ) )
| ( $true
= ( sK0 @ sK4 @ ( sK1 @ sK4 @ X0 ) ) ) ),
inference(constrained_superposition,[],[f162,f149]) ).
thf(f789,plain,
! [X0: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ ( sK1 @ sK4 @ X0 ) ) )
| ( $true
= ( X0 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f748]) ).
thf(f896,plain,
! [X0: $i > $o] :
( ( $true = $false )
| ( $false
= ( sK0 @ ( sK1 @ sK4 @ X0 ) @ sK3 ) )
| ( $true
= ( X0 @ sK3 ) ) ),
inference(constrained_superposition,[],[f165,f789]) ).
thf(f925,plain,
! [X0: $i > $o] :
( ( $false
= ( sK0 @ ( sK1 @ sK4 @ X0 ) @ sK3 ) )
| ( $true
= ( X0 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f896]) ).
thf(f5906,plain,
! [X0: $i] :
( ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ X0 ) )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) ),
inference(constrained_superposition,[],[f155,f331]) ).
thf(f6374,plain,
! [X0: $i] :
( ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) )
| ( $true
= ( X0 != sK3 ) )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) ),
inference(beta-eta_normalization,[],[f5906]) ).
thf(f6375,plain,
! [X0: $i] :
( ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) )
| ( $false
= ( X0 = sK3 ) )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) ),
inference(not_proxy_clausification,[],[f6374]) ).
thf(f6376,plain,
! [X0: $i] :
( ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) )
| ( sK3 != X0 )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) ),
inference(equality_proxy_clausification,[],[f6375]) ).
thf(f6468,definition,
( spl5_9
<=> ! [X0: $i] :
( ( sK3 != X0 )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_9])],[avatar_definition]) ).
thf(f6469,plain,
( ! [X0: $i] :
( ( sK3 != X0 )
| ( $false
= ( sK0 @ sK4 @ X0 ) ) )
| ~ spl5_9 ),
inference(avatar_component_clause,[],[f6468]) ).
thf(f6476,definition,
( spl5_11
<=> ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl5_11])],[avatar_definition]) ).
thf(f6478,plain,
( ( $true
= ( sK0
@ ( sK1 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) )
@ sK3 ) )
| ~ spl5_11 ),
inference(avatar_component_clause,[],[f6476]) ).
thf(f6479,plain,
( spl5_9
| spl5_11 ),
inference(avatar_split_clause,[],[f6376,f6476,f6468]) ).
thf(f6481,plain,
( ( $false
= ( sK0 @ sK4 @ sK3 ) )
| ~ spl5_9 ),
inference(equality_resolution,[],[f6469]) ).
thf(f6485,plain,
( ( $true = $false )
| ~ spl5_9 ),
inference(constrained_superposition,[],[f6481,f162]) ).
thf(f6605,plain,
( $false
| ~ spl5_9 ),
inference(trivial_inequality_removal,[],[f6485]) ).
thf(f6606,plain,
~ spl5_9,
inference(avatar_contradiction_clause,[],[f6605]) ).
thf(f6626,plain,
( ( $true = $false )
| ( $true
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ sK3 ) )
| ~ spl5_11 ),
inference(constrained_superposition,[],[f6478,f925]) ).
thf(f6760,plain,
( ( $true
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ sK3 ) )
| ~ spl5_11 ),
inference(trivial_inequality_removal,[],[f6626]) ).
thf(f6761,plain,
( ( $true
= ( sK3 != sK3 ) )
| ~ spl5_11 ),
inference(beta-eta_normalization,[],[f6760]) ).
thf(f6762,plain,
( ( $false
= ( sK3 = sK3 ) )
| ~ spl5_11 ),
inference(not_proxy_clausification,[],[f6761]) ).
thf(f6763,plain,
( ( sK3 != sK3 )
| ~ spl5_11 ),
inference(equality_proxy_clausification,[],[f6762]) ).
thf(f6764,plain,
( $false
| ~ spl5_11 ),
inference(trivial_inequality_removal,[],[f6763]) ).
thf(f6765,plain,
~ spl5_11,
inference(avatar_contradiction_clause,[],[f6764]) ).
cnf(s18,plain,
( spl5_9
| spl5_11 ),
inference(sat_conversion,[],[f6479]) ).
cnf(s20,plain,
~ spl5_9,
inference(sat_conversion,[],[f6606]) ).
cnf(s22,plain,
~ spl5_11,
inference(sat_conversion,[],[f6765]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s18,s22,s20]) ).
thf(f6790,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL716^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n026.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 09:55:27 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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
% 2.47/0.60 % (378655)Will run a generic schedule for satisfiability detection.
% 2.47/0.60 % (378665)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2630450116:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.47/0.60 % (378660)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2915255482_2999 on theBenchmark for (2999ds/0Mi)
% 2.47/0.60 % (378662)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2802888090:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.47/0.60 % (378663)dis+10_1_sil=32000:sp=arity:random_seed=1995679143:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.47/0.60 % (378664)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=116568853:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.47/0.60 % (378666)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=53866593:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.47/0.60 % (378664)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378661)% WARNING: option uhcvi not known.
% 2.47/0.60 % (378661)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4124138310:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.47/0.60 % (378661)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % (378661)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.47/0.60 % (378673)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3902057429:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.47/0.60 % (378665)Instruction limit reached!
% 2.47/0.60 % (378665)------------------------------
% 2.47/0.60 % (378665)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378665)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378665)Termination reason: Instruction limit
% 2.47/0.60 % (378665)Termination phase: Saturation
% 2.47/0.60 % (378665)Time elapsed: 0.034 s
% 2.47/0.60 % (378665)Peak memory usage: 12 MB
% 2.47/0.60 % (378665)Instructions burned: 134 (million)
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378676)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1352147781:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.47/0.60 % (378677)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=567688686:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.47/0.60 % (378663)Instruction limit reached!
% 2.47/0.60 % (378663)------------------------------
% 2.47/0.60 % (378663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378663)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378663)Termination reason: Instruction limit
% 2.47/0.60 % (378663)Termination phase: Saturation
% 2.47/0.60 % (378663)Time elapsed: 0.049 s
% 2.47/0.60 % (378663)Peak memory usage: 12 MB
% 2.47/0.60 % (378663)Instructions burned: 103 (million)
% 2.47/0.60 % (378677)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % (378677)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.47/0.60 % (378664)Instruction limit reached!
% 2.47/0.60 % (378664)------------------------------
% 2.47/0.60 % (378664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378664)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378664)Termination reason: Instruction limit
% 2.47/0.60 % (378664)Termination phase: Saturation
% 2.47/0.60 % (378664)Time elapsed: 0.056 s
% 2.47/0.60 % (378664)Peak memory usage: 12 MB
% 2.47/0.60 % (378664)Instructions burned: 117 (million)
% 2.47/0.60 % (378680)ott-21_1_sil=16000:fs=off:random_seed=3815693016:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 2.47/0.60 % (378676)Instruction limit reached!
% 2.47/0.60 % (378676)------------------------------
% 2.47/0.60 % (378676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378676)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378676)Termination reason: Instruction limit
% 2.47/0.60 % (378676)Termination phase: Saturation
% 2.47/0.60 % (378676)Time elapsed: 0.036 s
% 2.47/0.60 % (378676)Peak memory usage: 12 MB
% 2.47/0.60 % (378676)Instructions burned: 134 (million)
% 2.47/0.60 % (378681)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1575903566:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 2.47/0.60 % (378666)Instruction limit reached!
% 2.47/0.60 % (378666)------------------------------
% 2.47/0.60 % (378666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378666)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378666)Termination reason: Instruction limit
% 2.47/0.60 % (378666)Termination phase: Saturation
% 2.47/0.60 % (378666)Time elapsed: 0.082 s
% 2.47/0.60 % (378666)Peak memory usage: 12 MB
% 2.47/0.60 % (378666)Instructions burned: 160 (million)
% 2.47/0.60 % (378683)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3369934311:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378687)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=957385308:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378685)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3190565163:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.47/0.60 % (378689)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=1362385597: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)
% 2.47/0.60 % (378689)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % (378680)Instruction limit reached!
% 2.47/0.60 % (378680)------------------------------
% 2.47/0.60 % (378680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378680)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378680)Termination reason: Instruction limit
% 2.47/0.60 % (378680)Termination phase: Saturation
% 2.47/0.60 % (378680)Time elapsed: 0.081 s
% 2.47/0.60 % (378680)Peak memory usage: 12 MB
% 2.47/0.60 % (378680)Instructions burned: 180 (million)
% 2.47/0.60 % (378692)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1876121901:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 2.47/0.60 % (378692)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % (378689)Instruction limit reached!
% 2.47/0.60 % (378689)------------------------------
% 2.47/0.60 % (378689)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378689)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378689)Termination reason: Instruction limit
% 2.47/0.60 % (378689)Termination phase: Saturation
% 2.47/0.60 % (378689)Time elapsed: 0.174 s
% 2.47/0.60 % (378689)Peak memory usage: 15 MB
% 2.47/0.60 % (378689)Instructions burned: 695 (million)
% 2.47/0.60 % (378694)fmb+10_1_sil=64000:random_seed=2480428873:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 2.47/0.60 % (378694)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378696)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=237552930:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378681)Instruction limit reached!
% 2.47/0.60 % (378681)------------------------------
% 2.47/0.60 % (378681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378681)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378681)Termination reason: Instruction limit
% 2.47/0.60 % (378681)Termination phase: Saturation
% 2.47/0.60 % (378681)Time elapsed: 0.237 s
% 2.47/0.60 % (378681)Peak memory usage: 13 MB
% 2.47/0.60 % (378681)Instructions burned: 478 (million)
% 2.47/0.60 % (378698)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1476746988:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 2.47/0.60 % Exception at run slice level
% 2.47/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.47/0.60 % (378701)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2425097363:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 2.47/0.60 % (378701)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.47/0.60 % (378701)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.47/0.60 % (378699)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=662609217:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 2.47/0.60 % (378699)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.47/0.60 % (378677) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-378655-378677"...
% 2.47/0.60 % (378677)...printing done.
% 2.47/0.60 % (378677)Refutation found. Thanks to Tanya!
% 2.47/0.60 % SZS status Theorem for theBenchmark
% 2.47/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 2.47/0.60 % (378677)------------------------------
% 2.47/0.60 % (378677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.60 % (378677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.60 % (378677)CaDiCaL version: 2.1.3
% 2.47/0.60 % (378677)Termination reason: Refutation
% 2.47/0.60 % (378677)Time elapsed: 0.304 s
% 2.47/0.60 % (378677)Peak memory usage: 15 MB
% 2.47/0.60 % (378677)Instructions burned: 657 (million)
% 2.47/0.60 % (378655)Success in time 0.377 s
% 2.47/0.60 % Vampire exiting
%------------------------------------------------------------------------------