%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL614^1 : TPTP v9.3.1. Released v3.6.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 08:14:27 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 233 ( 48 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 297 ( 19 ~; 11 |; 3 &; 224 @)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 75 ( 75 >; 0 *; 0 +; 0 <<)
% Number of symbols : 39 ( 35 usr; 5 con; 0-4 aty)
% ( 17 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 108 ( 83 ^; 19 !; 6 ?; 108 :)
% 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,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_21,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_24,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_25,type,
vAND: $o > $o > $o ).
thf(func_def_26,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_27,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_28,type,
vNOT: $o > $o ).
thf(func_def_31,type,
vOR: $o > $o > $o ).
thf(func_def_32,type,
vIMP: $o > $o > $o ).
thf(func_def_33,type,
sK0: $i > $o ).
thf(func_def_34,type,
sK1: $i > $o ).
thf(func_def_35,type,
sK2: $i > $i > $o ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(f6,axiom,
( mimpl
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f16,conjecture,
! [X1: $i > $o,X0: $i > $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X1 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity) ).
thf(f17,negated_conjecture,
~ ! [X1: $i > $o,X0: $i > $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X1 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
thf(f18,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f19,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f23,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f24,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f25,plain,
~ ! [X0: $i > $o,X1: $i > $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X0 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X1 @ X0 ) @ ( mbox @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f17]) ).
thf(f26,plain,
~ ! [X2: $i > $o,X0: $i > $o,X1: $i > $i > $o] :
( ( ( mvalid @ ( mimpl @ X0 @ X2 ) )
= $true )
=> ( ( mvalid @ ( mimpl @ ( mbox @ X1 @ X0 ) @ ( mbox @ X1 @ X0 ) ) )
= $true ) ),
inference(fool_elimination,[],[f25]) ).
thf(f27,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f30,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f31,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f30]) ).
thf(f40,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f41,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f40]) ).
thf(f46,plain,
? [X2: $i > $o,X0: $i > $o,X1: $i > $i > $o] :
( ( ( mvalid @ ( mimpl @ ( mbox @ X1 @ X0 ) @ ( mbox @ X1 @ X0 ) ) )
!= $true )
& ( ( mvalid @ ( mimpl @ X0 @ X2 ) )
= $true ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f47,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $i > $o] :
( ( ( mvalid @ ( mimpl @ ( mbox @ X2 @ X1 ) @ ( mbox @ X2 @ X1 ) ) )
!= $true )
& ( $true
= ( mvalid @ ( mimpl @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f46]) ).
thf(f48,plain,
( ( ( mvalid @ ( mimpl @ ( mbox @ sK2 @ sK1 ) @ ( mbox @ sK2 @ sK1 ) ) )
!= $true )
& ( $true
= ( mvalid @ ( mimpl @ sK1 @ sK0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f47]) ).
thf(f54,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f57,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f58,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f59,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f61,plain,
( ( mvalid @ ( mimpl @ ( mbox @ sK2 @ sK1 ) @ ( mbox @ sK2 @ sK1 ) ) )
!= $true ),
inference(cnf_transformation,[],[f48]) ).
thf(f64,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f68,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f54,f64,f58]) ).
thf(f70,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ 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 ) ) )
@ sK2
@ sK1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ sK2
@ sK1 ) ) )
!= $true ),
inference(definition_unfolding,[],[f61,f57,f68,f59,f59]) ).
thf(f72,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK2 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( sK2 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f73,plain,
( ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK2 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( sK2 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) ) )
@ sK3 )
= $false ),
inference(sigma_proxy_clausification,[],[f72]) ).
thf(f74,plain,
( $false
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f73]) ).
thf(f75,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f74]) ).
thf(f76,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) )
= $false ),
inference(or_proxy_clausification,[],[f74]) ).
thf(f77,plain,
( ( ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) )
@ sK4 )
= $false ),
inference(sigma_proxy_clausification,[],[f76]) ).
thf(f78,plain,
( ( ( sK2 @ sK3 @ sK4 )
=> ( sK1 @ sK4 ) )
= $false ),
inference(beta-eta_normalization,[],[f77]) ).
thf(f79,plain,
( ( sK1 @ sK4 )
= $false ),
inference(imp_proxy_clausification,[],[f78]) ).
thf(f80,plain,
( ( sK2 @ sK3 @ sK4 )
= $true ),
inference(imp_proxy_clausification,[],[f78]) ).
thf(f81,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) )
= $true ),
inference(not_proxy_clausification,[],[f75]) ).
thf(f82,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK2 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X1: $i] :
( ( ( sK2 @ sK3 @ X1 )
=> ( sK1 @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f82]) ).
thf(f84,plain,
! [X1: $i] :
( ( ( sK2 @ sK3 @ X1 )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(imp_proxy_clausification,[],[f83]) ).
thf(f90,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f84,f80]) ).
thf(f92,plain,
( $true
= ( sK1 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f94,plain,
$true = $false,
inference(forward_demodulation,[],[f92,f79]) ).
thf(f95,plain,
$false,
inference(trivial_inequality_removal,[],[f94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL614^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n008.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 09:22:25 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.21/0.27 % (2906516)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27 % (2906525)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3463603415:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.27 % (2906527)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.27 % (2906527)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.21/0.27 % (2906521)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1728736170:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.27 % (2906522)lrs+10_16_si=on:nwc=1.5:random_seed=745598966:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.27 % (2906523)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1081822145:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.27 % (2906524)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=2278296268: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.21/0.27 % (2906525)Instruction limit reached!
% 0.21/0.27 % (2906525)------------------------------
% 0.21/0.27 % (2906525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (2906525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (2906525)CaDiCaL version: 2.1.3
% 0.21/0.27 % (2906525)Termination reason: Instruction limit
% 0.21/0.27 % (2906525)Termination phase: Saturation
% 0.21/0.27 % (2906525)Time elapsed: 0.008 s
% 0.21/0.27 % (2906525)Peak memory usage: 12 MB
% 0.21/0.27 % (2906525)Instructions burned: 24 (million)
% 0.21/0.27 % (2906526)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1906524496:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.27 % (2906527)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=3217329085:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.27 % (2906523)Instruction limit reached!
% 0.21/0.27 % (2906523)------------------------------
% 0.21/0.27 % (2906523)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (2906523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (2906523)CaDiCaL version: 2.1.3
% 0.21/0.27 % (2906523)Termination reason: Instruction limit
% 0.21/0.27 % (2906523)Termination phase: Saturation
% 0.21/0.27 % (2906523)Time elapsed: 0.002 s
% 0.21/0.27 % (2906523)Peak memory usage: 11 MB
% 0.21/0.27 % (2906523)Instructions burned: 3 (million)
% 0.21/0.27 % (2906521) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2906516-2906521"...
% 0.21/0.27 % (2906522) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2906516-2906522"...
% 0.21/0.27 % (2906526) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2906516-2906526"...
% 0.21/0.27 % (2906521)...printing done.
% 0.21/0.27 % (2906527) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2906516-2906527"...
% 0.21/0.27 % (2906522)...printing done.
% 0.21/0.27 % (2906521)Refutation found. Thanks to Tanya!
% 0.21/0.27 % SZS status Theorem for theBenchmark
% 0.21/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (2906521)------------------------------
% 0.21/0.27 % (2906521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (2906521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (2906521)CaDiCaL version: 2.1.3
% 0.21/0.27 % (2906521)Termination reason: Refutation
% 0.21/0.27 % (2906521)Time elapsed: 0.005 s
% 0.21/0.27 % (2906521)Peak memory usage: 12 MB
% 0.21/0.27 % (2906521)Instructions burned: 7 (million)
% 0.21/0.27 % (2906516)Success in time 0.039 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------