%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM765^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:18:49 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 87 ( 12 unt; 0 typ; 6 def)
% Number of atoms : 464 ( 120 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 723 ( 114 ~; 81 |; 7 &; 472 @)
% ( 6 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 96 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: frac ).
thf(func_def_1,type,
y: frac ).
thf(func_def_2,type,
z: frac ).
thf(func_def_3,type,
u: frac ).
thf(func_def_4,type,
moref: frac > frac > $o ).
thf(func_def_5,type,
eq: frac > frac > $o ).
thf(func_def_7,type,
pf: frac > frac > frac ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f4,axiom,
! [X2: frac,X1: frac,X0: frac,X3: frac] :
( ( eq @ X0 @ X1 )
=> ( ( eq @ X2 @ X3 )
=> ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56) ).
thf(f5,axiom,
! [X0: frac,X1: frac,X3: frac,X2: frac] :
( ( moref @ X0 @ X1 )
=> ( ( ~ ( moref @ X2 @ X3 )
=> ( eq @ X2 @ X3 ) )
=> ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b) ).
thf(f6,axiom,
! [X3: frac,X1: frac,X2: frac,X0: frac] :
( ( ~ ( moref @ X0 @ X1 )
=> ( eq @ X0 @ X1 ) )
=> ( ( moref @ X2 @ X3 )
=> ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).
thf(f7,conjecture,
( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz66) ).
thf(f8,negated_conjecture,
~ ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f11,plain,
( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
inference(rectify,[],[f2]) ).
thf(f12,plain,
( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f14,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X2 @ X1 )
=> ( ( eq @ X0 @ X3 )
=> ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f16,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( ( eq @ X2 @ X1 )
= $true )
=> ( ( $true
= ( eq @ X0 @ X3 ) )
=> ( ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) )
= $true ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ~ ( moref @ X3 @ X1 )
=> ( eq @ X3 @ X1 ) )
=> ( ( moref @ X2 @ X0 )
=> ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( ( moref @ X3 @ X1 )
!= $true )
=> ( ( eq @ X3 @ X1 )
= $true ) )
=> ( ( ( moref @ X2 @ X0 )
= $true )
=> ( $true
= ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X1 @ X0 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
~ ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
inference(rectify,[],[f8]) ).
thf(f20,plain,
~ ( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
=> ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f21,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X0 @ X1 )
=> ( ( ~ ( moref @ X3 @ X2 )
=> ( eq @ X3 @ X2 ) )
=> ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f22,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( ( ( moref @ X3 @ X2 )
!= $true )
=> ( ( eq @ X3 @ X2 )
= $true ) )
=> ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f24,plain,
( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(flattening,[],[f12]) ).
thf(f25,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f14]) ).
thf(f26,plain,
! [X2: frac,X0: frac,X3: frac,X1: frac] :
( ( ( ( moref @ X3 @ X1 )
!= $true )
=> ( ( eq @ X3 @ X1 )
= $true ) )
=> ( ( ( moref @ X2 @ X0 )
= $true )
=> ( $true
= ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X1 @ X0 ) ) ) ) ),
inference(flattening,[],[f18]) ).
thf(f27,plain,
~ ( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
=> ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
inference(flattening,[],[f20]) ).
thf(f28,plain,
! [X1: frac,X3: frac,X2: frac,X0: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( ( ( moref @ X3 @ X2 )
!= $true )
=> ( ( eq @ X3 @ X2 )
= $true ) )
=> ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true ) ) ),
inference(flattening,[],[f22]) ).
thf(f29,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f25]) ).
thf(f30,plain,
! [X2: frac,X0: frac,X3: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X1 @ X0 ) ) )
| ( ( moref @ X2 @ X0 )
!= $true )
| ( ( ( moref @ X3 @ X1 )
!= $true )
& ( ( eq @ X3 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f31,plain,
! [X1: frac,X3: frac,X2: frac,X0: frac] :
( ( ( moref @ X2 @ X0 )
!= $true )
| ( ( ( moref @ X3 @ X1 )
!= $true )
& ( ( eq @ X3 @ X1 )
!= $true ) )
| ( $true
= ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X1 @ X0 ) ) ) ),
inference(flattening,[],[f30]) ).
thf(f32,plain,
( ( ( eq @ z @ u )
= $true )
| ( ( moref @ z @ u )
= $true ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f33,plain,
( ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
& ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ) ),
inference(ennf_transformation,[],[f27]) ).
thf(f34,plain,
! [X1: frac,X3: frac,X2: frac,X0: frac] :
( ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( ( ( moref @ X3 @ X2 )
!= $true )
& ( ( eq @ X3 @ X2 )
!= $true ) )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f28]) ).
thf(f35,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( ( ( moref @ X3 @ X2 )
!= $true )
& ( ( eq @ X3 @ X2 )
!= $true ) ) ),
inference(flattening,[],[f34]) ).
thf(f37,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) )
= $true )
| ( $true
!= ( eq @ X0 @ X3 ) )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f38,plain,
! [X1: frac,X0: frac,X3: frac,X2: frac] :
( ( ( eq @ X2 @ X1 )
!= $true )
| ( $true
!= ( eq @ X0 @ X3 ) )
| ( ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) )
= $true ) ),
inference(flattening,[],[f37]) ).
thf(f39,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ X2 @ X3 )
!= $true )
| ( ( ( moref @ X1 @ X0 )
!= $true )
& ( ( eq @ X1 @ X0 )
!= $true ) )
| ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X0 @ X3 ) ) ) ),
inference(rectify,[],[f31]) ).
thf(f40,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ X2 @ X3 )
!= $true )
| ( ( moref @ ( pf @ X2 @ X1 ) @ ( pf @ X3 @ X0 ) )
= $true )
| ( ( ( moref @ X1 @ X0 )
!= $true )
& ( ( eq @ X1 @ X0 )
!= $true ) ) ),
inference(rectify,[],[f35]) ).
thf(f41,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ X3 @ X0 )
!= $true )
| ( ( eq @ X1 @ X2 )
!= $true )
| ( $true
= ( eq @ ( pf @ X3 @ X1 ) @ ( pf @ X0 @ X2 ) ) ) ),
inference(rectify,[],[f38]) ).
thf(f42,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X0 @ X3 ) ) )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( ( moref @ X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f43,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X0 @ X3 ) ) )
| ( ( moref @ X2 @ X3 )
!= $true )
| ( ( moref @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f44,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f45,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f33]) ).
thf(f46,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f33]) ).
thf(f47,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X2 @ X1 ) @ ( pf @ X3 @ X0 ) )
= $true )
| ( ( moref @ X2 @ X3 )
!= $true )
| ( ( eq @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f49,plain,
( ( ( moref @ z @ u )
= $true )
| ( ( eq @ z @ u )
= $true ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f50,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X3 @ X1 ) @ ( pf @ X0 @ X2 ) ) )
| ( ( eq @ X3 @ X0 )
!= $true )
| ( ( eq @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f55,definition,
( spl0_1
<=> ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f57,plain,
( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f58,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f45,f55]) ).
thf(f60,definition,
( spl0_2
<=> ( ( moref @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f64,definition,
( spl0_3
<=> ( ( eq @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f66,plain,
( ( ( eq @ x @ y )
= $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f67,plain,
( spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f44,f64,f60]) ).
thf(f69,definition,
( spl0_4
<=> ( ( moref @ z @ u )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
thf(f73,definition,
( spl0_5
<=> ( ( eq @ z @ u )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
thf(f75,plain,
( ( ( eq @ z @ u )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f76,plain,
( spl0_4
| spl0_5 ),
inference(avatar_split_clause,[],[f49,f73,f69]) ).
thf(f78,definition,
( spl0_6
<=> ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
thf(f80,plain,
( ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
| spl0_6 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f81,plain,
~ spl0_6,
inference(avatar_split_clause,[],[f46,f78]) ).
thf(f82,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( eq @ x @ y )
!= $true )
| ( $true != $true )
| spl0_1 ),
inference(superposition,[],[f57,f42]) ).
thf(f83,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( eq @ x @ y )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f89,plain,
( ( $true != $true )
| ( ( moref @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true )
| spl0_1 ),
inference(superposition,[],[f57,f43]) ).
thf(f90,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f95,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_1 ),
inference(avatar_split_clause,[],[f83,f55,f69,f64]) ).
thf(f97,plain,
( ( ( moref @ x @ y )
!= $true )
| ( $true != $true )
| ( ( eq @ z @ u )
!= $true )
| spl0_1 ),
inference(superposition,[],[f57,f47]) ).
thf(f98,plain,
( ( ( eq @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f99,plain,
( ( ( moref @ x @ y )
!= $true )
| spl0_1
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f98,f75]) ).
thf(f102,plain,
( ~ spl0_2
| spl0_1
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f99,f73,f55,f60]) ).
thf(f103,plain,
( ~ spl0_2
| ~ spl0_4
| spl0_1 ),
inference(avatar_split_clause,[],[f90,f55,f69,f60]) ).
thf(f104,plain,
( ( $true != $true )
| ( ( eq @ x @ y )
!= $true )
| ( ( eq @ z @ u )
!= $true )
| spl0_6 ),
inference(superposition,[],[f80,f50]) ).
thf(f105,plain,
( ( ( eq @ z @ u )
!= $true )
| ( ( eq @ x @ y )
!= $true )
| spl0_6 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f106,plain,
( ( ( eq @ x @ y )
!= $true )
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f105,f75]) ).
thf(f107,plain,
( $false
| ~ spl0_3
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f106,f66]) ).
thf(f108,plain,
( ~ spl0_3
| ~ spl0_5
| spl0_6 ),
inference(avatar_contradiction_clause,[],[f107]) ).
cnf(s1,plain,
~ spl0_1,
inference(sat_conversion,[],[f58]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f67]) ).
cnf(s3,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f76]) ).
cnf(s4,plain,
~ spl0_6,
inference(sat_conversion,[],[f81]) ).
cnf(s8,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f95]) ).
cnf(s11,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_5 ),
inference(sat_conversion,[],[f102]) ).
cnf(s12,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f103]) ).
cnf(s13,plain,
( ~ spl0_3
| ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f108]) ).
cnf(s14,plain,
~ spl0_3,
inference(rat,[],[s3,s8,s13,s1,s4]) ).
cnf(s15,plain,
spl0_2,
inference(rat,[],[s2,s14]) ).
cnf(s16,plain,
~ spl0_4,
inference(rat,[],[s12,s1,s15]) ).
cnf(s17,plain,
~ spl0_5,
inference(rat,[],[s11,s1,s15]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s3,s17,s16]) ).
thf(f109,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM765^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n002.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 12:56:22 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.23 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.10/0.26 % (1231029)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.26 % (1231037)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=3751163347: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.10/0.26 % (1231037) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1231029-1231037"...
% 0.10/0.26 % (1231037)...printing done.
% 0.10/0.26 % (1231037)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.27 % (1231037)------------------------------
% 0.10/0.27 % (1231037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.27 % (1231037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.27 % (1231037)CaDiCaL version: 2.1.3
% 0.10/0.27 % (1231037)Termination reason: Refutation
% 0.10/0.27 % (1231037)Time elapsed: 0.004 s
% 0.10/0.27 % (1231037)Peak memory usage: 13 MB
% 0.10/0.27 % (1231037)Instructions burned: 10 (million)
% 0.10/0.27 % (1231029)Success in time 0.027 s
% 0.10/0.27 % Vampire exiting
%------------------------------------------------------------------------------