%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : AGT032^1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 07:44:37 AM UTC 2026
% Result : Theorem 0.28s 0.32s
% Output : Refutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 69 unt; 0 typ; 3 def)
% Number of atoms : 466 ( 103 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 757 ( 99 ~; 44 |; 0 &; 546 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 134 ( 134 >; 0 *; 0 +; 0 <<)
% Number of symbols : 76 ( 72 usr; 12 con; 0-4 aty)
% ( 56 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 288 ( 0 sgn 53 !; 0 ?; 288 :)
% 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,
a1: $i > $i > $o ).
thf(func_def_33,type,
a2: $i > $i > $o ).
thf(func_def_34,type,
a3: $i > $i > $o ).
thf(func_def_35,type,
jan: mu ).
thf(func_def_36,type,
piotr: mu ).
thf(func_def_37,type,
cola: mu ).
thf(func_def_38,type,
pepsi: mu ).
thf(func_def_39,type,
beer: mu ).
thf(func_def_40,type,
likes: mu > mu > $i > $o ).
thf(func_def_41,type,
very_much_likes: mu > mu > $i > $o ).
thf(func_def_42,type,
possibly_likes: mu > mu > $i > $o ).
thf(func_def_43,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_44,type,
cond4s: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_47,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_49,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_50,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_51,type,
vIMP: $o > $o > $o ).
thf(func_def_52,type,
vAND: $o > $o > $o ).
thf(func_def_53,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_54,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_55,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_56,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_57,type,
vOR: $o > $o > $o ).
thf(func_def_58,type,
vNOT: $o > $o ).
thf(func_def_59,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_60,type,
sF0: $o ).
thf(func_def_61,type,
sK1: $i > $i ).
thf(func_def_62,type,
sK2: $i > $i ).
thf(func_def_63,type,
sK3: $i > $i ).
thf(func_def_64,type,
sK4: $i > $i ).
thf(func_def_65,type,
sK5: mu > $i > mu > $i ).
thf(func_def_66,type,
sK6: mu > mu > $i > $i ).
thf(func_def_67,type,
sK7: mu > mu > $i > $i ).
thf(func_def_68,type,
sK8: $i > $i ).
thf(func_def_70,type,
sK10: $i > mu ).
thf(func_def_71,type,
sK11: $i > mu ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f10,axiom,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(f12,axiom,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mexists_ind) ).
thf(f16,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) )
= mbox ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(f17,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i > $o] : ( mnot @ ( mbox @ X0 @ ( mnot @ X1 ) ) ) )
= mdia ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(f19,axiom,
( msymmetric
= ( ^ [X0: $i > $i > $o] :
! [X2: $i,X1: $i] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',msymmetric) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f37,axiom,
mvalid @ ( mbox @ a1 @ ( likes @ piotr @ cola ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a2_2) ).
thf(f43,axiom,
mvalid @ ( mdia @ a1 @ ( likes @ piotr @ beer ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a3_3) ).
thf(f50,axiom,
msymmetric @ a1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axioms_B_a1) ).
thf(f73,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X0: mu] :
( mexists_ind
@ ^ [X1: mu] : ( likes @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f74,negated_conjecture,
~ ( mvalid
@ ( mexists_ind
@ ^ [X0: mu] :
( mexists_ind
@ ^ [X1: mu] : ( likes @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f73]) ).
thf(f79,plain,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f80,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f79]) ).
thf(f91,plain,
( msymmetric
= ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
=> ( X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f19]) ).
thf(f92,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f91]) ).
thf(f95,plain,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f10]) ).
thf(f96,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f95]) ).
thf(f123,plain,
mvalid @ ( mbox @ a1 @ ( likes @ piotr @ cola ) ),
inference(rectify,[],[f37]) ).
thf(f124,plain,
( ( mvalid @ ( mbox @ a1 @ ( likes @ piotr @ cola ) ) )
= $true ),
inference(fool_elimination,[],[f123]) ).
thf(f136,plain,
mvalid @ ( mdia @ a1 @ ( likes @ piotr @ beer ) ),
inference(rectify,[],[f43]) ).
thf(f137,plain,
( ( mvalid @ ( mdia @ a1 @ ( likes @ piotr @ beer ) ) )
= $true ),
inference(fool_elimination,[],[f136]) ).
thf(f147,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f148,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f147]) ).
thf(f150,plain,
( ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) )
= mbox ),
inference(rectify,[],[f16]) ).
thf(f151,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f150]) ).
thf(f157,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f158,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f157]) ).
thf(f163,plain,
msymmetric @ a1,
inference(rectify,[],[f50]) ).
thf(f164,plain,
( ( msymmetric @ a1 )
= $true ),
inference(fool_elimination,[],[f163]) ).
thf(f184,plain,
~ ( mvalid
@ ( mexists_ind
@ ^ [X0: mu] :
( mexists_ind
@ ^ [X1: mu] : ( likes @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f74]) ).
thf(f185,plain,
( ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] :
( mexists_ind
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
!= $true ),
inference(fool_elimination,[],[f184]) ).
thf(f199,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f210,plain,
( ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] :
( mexists_ind
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
!= $true ),
inference(flattening,[],[f185]) ).
thf(f216,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f96]) ).
thf(f217,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f158]) ).
thf(f219,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f151]) ).
thf(f224,plain,
( ( mvalid @ ( mbox @ a1 @ ( likes @ piotr @ cola ) ) )
= $true ),
inference(cnf_transformation,[],[f124]) ).
thf(f230,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f80]) ).
thf(f240,plain,
( ( msymmetric @ a1 )
= $true ),
inference(cnf_transformation,[],[f164]) ).
thf(f256,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f148]) ).
thf(f257,plain,
( ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] :
( mexists_ind
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f210]) ).
thf(f261,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f272,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f199]) ).
thf(f283,plain,
( ( mvalid @ ( mdia @ a1 @ ( likes @ piotr @ beer ) ) )
= $true ),
inference(cnf_transformation,[],[f137]) ).
thf(f291,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f230,f217,f216,f217]) ).
thf(f294,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ Y0
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f272,f217,f219,f217]) ).
thf(f301,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ a1
@ ( likes @ piotr @ cola ) ) ) ),
inference(definition_unfolding,[],[f224,f256,f219]) ).
thf(f310,plain,
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) )
@ a1 )
= $true ),
inference(definition_unfolding,[],[f240,f261]) ).
thf(f320,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] : ( Y2 @ Y4 @ Y3 ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( Y1 @ Y2 ) ) ) )
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
!= $true ),
inference(definition_unfolding,[],[f257,f256,f291,f291]) ).
thf(f334,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ Y0
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) )
@ a1
@ ( likes @ piotr @ beer ) ) )
= $true ),
inference(definition_unfolding,[],[f283,f256,f294]) ).
thf(f335,definition,
( sF0
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] : ( Y2 @ Y4 @ Y3 ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( Y1 @ Y2 ) ) ) )
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
thf(f336,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] : ( Y2 @ Y4 @ Y3 ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( Y1 @ Y2 ) ) ) )
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
= sF0 ),
inference(reorient_equations,[],[f335]) ).
thf(f337,plain,
$true != sF0,
inference(definition_folding,[],[f320,f336]) ).
thf(f351,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ~ ( a1 @ Y0 @ Y1 )
| ( likes @ piotr @ cola @ Y1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f301]) ).
thf(f352,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ~ ( a1 @ Y0 @ Y1 )
| ( likes @ piotr @ cola @ Y1 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f351]) ).
thf(f353,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( a1 @ X1 @ Y0 )
| ( likes @ piotr @ cola @ Y0 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f352]) ).
thf(f354,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( a1 @ X1 @ Y0 )
| ( likes @ piotr @ cola @ Y0 ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f353]) ).
thf(f355,plain,
! [X2: $i,X1: $i] :
( $true
= ( ~ ( a1 @ X1 @ X2 )
| ( likes @ piotr @ cola @ X2 ) ) ),
inference(beta-eta_normalization,[],[f354]) ).
thf(f356,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( likes @ piotr @ cola @ X2 ) )
| ( ( ~ ( a1 @ X1 @ X2 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f355]) ).
thf(f357,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( likes @ piotr @ cola @ X2 ) )
| ( $false
= ( a1 @ X1 @ X2 ) ) ),
inference(not_proxy_clausification,[],[f356]) ).
thf(f383,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( a1 @ Y0 @ Y1 )
| ~ ( likes @ piotr @ beer @ Y1 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f334]) ).
thf(f384,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( a1 @ Y0 @ Y1 )
| ~ ( likes @ piotr @ beer @ Y1 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f383]) ).
thf(f385,plain,
! [X1: $i] :
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( a1 @ X1 @ Y0 )
| ~ ( likes @ piotr @ beer @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f384]) ).
thf(f386,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( a1 @ X1 @ Y0 )
| ~ ( likes @ piotr @ beer @ Y0 ) ) )
= $false ),
inference(not_proxy_clausification,[],[f385]) ).
thf(f387,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( a1 @ X1 @ Y0 )
| ~ ( likes @ piotr @ beer @ Y0 ) )
@ ( sK4 @ X1 ) )
= $false ),
inference(sigma_proxy_clausification,[],[f386]) ).
thf(f388,plain,
! [X1: $i] :
( ( ~ ( a1 @ X1 @ ( sK4 @ X1 ) )
| ~ ( likes @ piotr @ beer @ ( sK4 @ X1 ) ) )
= $false ),
inference(beta-eta_normalization,[],[f387]) ).
thf(f390,plain,
! [X1: $i] :
( ( ~ ( a1 @ X1 @ ( sK4 @ X1 ) ) )
= $false ),
inference(or_proxy_clausification,[],[f388]) ).
thf(f391,plain,
! [X1: $i] :
( ( a1 @ X1 @ ( sK4 @ X1 ) )
= $true ),
inference(not_proxy_clausification,[],[f390]) ).
thf(f636,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( a1 @ Y0 @ Y1 )
=> ( a1 @ Y1 @ Y0 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f310]) ).
thf(f637,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( a1 @ Y0 @ Y1 )
=> ( a1 @ Y1 @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f636]) ).
thf(f638,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( a1 @ X1 @ Y0 )
=> ( a1 @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f637]) ).
thf(f639,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( a1 @ X1 @ Y0 )
=> ( a1 @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f638]) ).
thf(f640,plain,
! [X2: $i,X1: $i] :
( ( ( a1 @ X1 @ X2 )
=> ( a1 @ X2 @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f639]) ).
thf(f641,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( a1 @ X2 @ X1 ) )
| ( $false
= ( a1 @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f640]) ).
thf(f652,plain,
( ( $true = sF0 )
| ( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] : ( Y2 @ Y4 @ Y3 ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( Y1 @ Y2 ) ) ) )
@ ^ [Y1: mu] : ( likes @ Y0 @ Y1 ) ) ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f336]) ).
thf(f653,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
~ ( !! @ mu
@ ^ [Y1: mu] :
~ ~ ( !! @ mu
@ ^ [Y2: mu] :
~ ( likes @ Y1 @ Y2 @ Y0 ) ) ) )
= $false )
| ( $true = sF0 ) ),
inference(beta-eta_normalization,[],[f652]) ).
thf(f654,plain,
( ( ( ^ [Y0: $i] :
~ ( !! @ mu
@ ^ [Y1: mu] :
~ ~ ( !! @ mu
@ ^ [Y2: mu] :
~ ( likes @ Y1 @ Y2 @ Y0 ) ) )
@ sK9 )
= $false )
| ( $true = sF0 ) ),
inference(sigma_proxy_clausification,[],[f653]) ).
thf(f655,plain,
( ( $true = sF0 )
| ( ( ~ ( !! @ mu
@ ^ [Y0: mu] :
~ ~ ( !! @ mu
@ ^ [Y1: mu] :
~ ( likes @ Y0 @ Y1 @ sK9 ) ) ) )
= $false ) ),
inference(beta-eta_normalization,[],[f654]) ).
thf(f656,plain,
( ( $true = sF0 )
| ( $true
= ( !! @ mu
@ ^ [Y0: mu] :
~ ~ ( !! @ mu
@ ^ [Y1: mu] :
~ ( likes @ Y0 @ Y1 @ sK9 ) ) ) ) ),
inference(not_proxy_clausification,[],[f655]) ).
thf(f657,plain,
! [X1: mu] :
( ( $true = sF0 )
| ( $true
= ( ^ [Y0: mu] :
~ ~ ( !! @ mu
@ ^ [Y1: mu] :
~ ( likes @ Y0 @ Y1 @ sK9 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f656]) ).
thf(f658,plain,
! [X1: mu] :
( ( ( ~ ~ ( !! @ mu
@ ^ [Y0: mu] :
~ ( likes @ X1 @ Y0 @ sK9 ) ) )
= $true )
| ( $true = sF0 ) ),
inference(beta-eta_normalization,[],[f657]) ).
thf(f659,plain,
! [X1: mu] :
( ( ( ~ ( !! @ mu
@ ^ [Y0: mu] :
~ ( likes @ X1 @ Y0 @ sK9 ) ) )
= $false )
| ( $true = sF0 ) ),
inference(not_proxy_clausification,[],[f658]) ).
thf(f660,plain,
! [X1: mu] :
( ( $true
= ( !! @ mu
@ ^ [Y0: mu] :
~ ( likes @ X1 @ Y0 @ sK9 ) ) )
| ( $true = sF0 ) ),
inference(not_proxy_clausification,[],[f659]) ).
thf(f661,plain,
! [X2: mu,X1: mu] :
( ( ( ^ [Y0: mu] :
~ ( likes @ X1 @ Y0 @ sK9 )
@ X2 )
= $true )
| ( $true = sF0 ) ),
inference(pi_proxy_clausification,[],[f660]) ).
thf(f662,plain,
! [X2: mu,X1: mu] :
( ( $true
= ( ~ ( likes @ X1 @ X2 @ sK9 ) ) )
| ( $true = sF0 ) ),
inference(beta-eta_normalization,[],[f661]) ).
thf(f663,plain,
! [X2: mu,X1: mu] :
( ( ( likes @ X1 @ X2 @ sK9 )
= $false )
| ( $true = sF0 ) ),
inference(not_proxy_clausification,[],[f662]) ).
thf(f745,definition,
( spl12_1
<=> ( $true = sF0 ) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
thf(f749,definition,
( spl12_2
<=> ! [X2: mu,X1: mu] :
( ( likes @ X1 @ X2 @ sK9 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
thf(f750,plain,
( ! [X2: mu,X1: mu] :
( ( likes @ X1 @ X2 @ sK9 )
= $false )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f749]) ).
thf(f751,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f663,f749,f745]) ).
thf(f760,plain,
~ spl12_1,
inference(avatar_split_clause,[],[f337,f745]) ).
thf(f794,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( ( a1 @ X0 @ sK9 )
= $false ) )
| ~ spl12_2 ),
inference(constrained_superposition,[],[f750,f357]) ).
thf(f795,plain,
( ! [X0: $i] :
( ( a1 @ X0 @ sK9 )
= $false )
| ~ spl12_2 ),
inference(trivial_inequality_removal,[],[f794]) ).
thf(f799,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( ( a1 @ sK9 @ X0 )
= $false ) )
| ~ spl12_2 ),
inference(constrained_superposition,[],[f641,f795]) ).
thf(f801,plain,
( ! [X0: $i] :
( ( a1 @ sK9 @ X0 )
= $false )
| ~ spl12_2 ),
inference(trivial_inequality_removal,[],[f799]) ).
thf(f809,plain,
( ( $true = $false )
| ~ spl12_2 ),
inference(constrained_superposition,[],[f391,f801]) ).
thf(f818,plain,
( $false
| ~ spl12_2 ),
inference(trivial_inequality_removal,[],[f809]) ).
thf(f819,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f818]) ).
cnf(s1,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f751]) ).
cnf(s3,plain,
~ spl12_1,
inference(sat_conversion,[],[f760]) ).
cnf(s8,plain,
~ spl12_2,
inference(sat_conversion,[],[f819]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s8,s3]) ).
thf(f821,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : AGT032^1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n008.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 17:31:15 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.28/0.32 % (3468611)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.28/0.32 % (3468620)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3439013472:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.28/0.32 % (3468622)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.28/0.32 % (3468622)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.28/0.32 % (3468618)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2509951433:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.28/0.32 % (3468616)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3490586595:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.28/0.32 % (3468621)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1047445072:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.28/0.32 % (3468617)lrs+10_16_si=on:nwc=1.5:random_seed=4253400262:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.28/0.32 % (3468619)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2252995110:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.28/0.32 % (3468622)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=4076440181:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.28/0.32 % (3468620)Instruction limit reached!
% 0.28/0.32 % (3468620)------------------------------
% 0.28/0.32 % (3468620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468620)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468620)Termination reason: Instruction limit
% 0.28/0.32 % (3468620)Termination phase: Saturation
% 0.28/0.32 % (3468620)Time elapsed: 0.008 s
% 0.28/0.32 % (3468620)Peak memory usage: 11 MB
% 0.28/0.32 % (3468620)Instructions burned: 26 (million)
% 0.28/0.32 % (3468618)Instruction limit reached!
% 0.28/0.32 % (3468618)------------------------------
% 0.28/0.32 % (3468618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468618)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468618)Termination reason: Instruction limit
% 0.28/0.32 % (3468618)Termination phase: shuffling
% 0.28/0.32 % (3468618)Time elapsed: 0.002 s
% 0.28/0.32 % (3468618)Peak memory usage: 9 MB
% 0.28/0.32 % (3468618)Instructions burned: 4 (million)
% 0.28/0.32 % (3468617)Instruction limit reached!
% 0.28/0.32 % (3468617)------------------------------
% 0.28/0.32 % (3468617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468617)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468617)Termination reason: Instruction limit
% 0.28/0.32 % (3468617)Termination phase: Property scanning
% 0.28/0.32 % (3468617)Time elapsed: 0.008 s
% 0.28/0.32 % (3468617)Peak memory usage: 10 MB
% 0.28/0.32 % (3468617)Instructions burned: 18 (million)
% 0.28/0.32 % (3468630)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=432961123:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.28/0.32 % (3468630)Instruction limit reached!
% 0.28/0.32 % (3468630)------------------------------
% 0.28/0.32 % (3468630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468630)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468630)Termination reason: Instruction limit
% 0.28/0.32 % (3468630)Termination phase: shuffling
% 0.28/0.32 % (3468630)Time elapsed: 0.001 s
% 0.28/0.32 % (3468630)Peak memory usage: 9 MB
% 0.28/0.32 % (3468630)Instructions burned: 4 (million)
% 0.28/0.32 % (3468631)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3128748859:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.28/0.32 % (3468633)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.28/0.32 % (3468631)Instruction limit reached!
% 0.28/0.32 % (3468631)------------------------------
% 0.28/0.32 % (3468631)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468631)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468631)Termination reason: Instruction limit
% 0.28/0.32 % (3468631)Termination phase: Property scanning
% 0.28/0.32 % (3468631)Time elapsed: 0.003 s
% 0.28/0.32 % (3468631)Peak memory usage: 10 MB
% 0.28/0.32 % (3468631)Instructions burned: 6 (million)
% 0.28/0.32 % (3468622) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3468611-3468622"...
% 0.28/0.32 % (3468637)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3981304305:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.28/0.32 % (3468616) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3468611-3468616"...
% 0.28/0.32 % (3468633)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2643281657:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.28/0.32 % (3468637)Instruction limit reached!
% 0.28/0.32 % (3468637)------------------------------
% 0.28/0.32 % (3468637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468637)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468637)Termination reason: Instruction limit
% 0.28/0.32 % (3468637)Termination phase: Property scanning
% 0.28/0.32 % (3468637)Time elapsed: 0.003 s
% 0.28/0.32 % (3468637)Peak memory usage: 10 MB
% 0.28/0.32 % (3468637)Instructions burned: 13 (million)
% 0.28/0.32 % (3468622)...printing done.
% 0.28/0.32 % (3468622)Refutation found. Thanks to Tanya!
% 0.28/0.32 % SZS status Theorem for theBenchmark
% 0.28/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.28/0.32 % (3468622)------------------------------
% 0.28/0.32 % (3468622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.32 % (3468622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.32 % (3468622)CaDiCaL version: 2.1.3
% 0.28/0.32 % (3468622)Termination reason: Refutation
% 0.28/0.32 % (3468622)Time elapsed: 0.027 s
% 0.28/0.32 % (3468622)Peak memory usage: 14 MB
% 0.28/0.32 % (3468622)Instructions burned: 54 (million)
% 0.28/0.32 % (3468611)Success in time 0.066 s
% 0.28/0.32 % Vampire exiting
%------------------------------------------------------------------------------