%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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 : Tue Sep 29 12:00:00 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 6 unt; 1 def)
% Number of atoms : 487 ( 0 equ)
% Maximal formula atoms : 37 ( 9 avg)
% Number of connectives : 789 ( 351 ~; 299 |; 138 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 140 ( 121 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( r1(X0,X1)
& r1(X1,X2) )
=> r1(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X1] :
( ~ r1(X0,X1)
| ( ( ( ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( ~ p2(X0)
& ~ p102(X0)
& p101(X0) ) )
& ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( p2(X0)
& ~ p102(X0)
& p101(X0) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X0] :
( ~ r1(X1,X0)
| ~ p2(X0)
| ~ p101(X0) )
| p2(X1) )
& ( ! [X0] :
( ~ r1(X1,X0)
| p2(X0)
| ~ p101(X0) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X0] :
( ~ r1(X1,X0)
| ~ p1(X0)
| ~ p100(X0) )
| p1(X1) )
& ( ! [X0] :
( ~ r1(X1,X0)
| p1(X0)
| ~ p100(X0) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) ) ) )
& ~ p101(X0)
& p100(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X1] :
( ~ r1(X0,X1)
| ( ( ( ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( ~ p2(X0)
& ~ p102(X0)
& p101(X0) ) )
& ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( p2(X0)
& ~ p102(X0)
& p101(X0) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X0] :
( ~ r1(X1,X0)
| ~ p2(X0)
| ~ p101(X0) )
| p2(X1) )
& ( ! [X0] :
( ~ r1(X1,X0)
| p2(X0)
| ~ p101(X0) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X0] :
( ~ r1(X1,X0)
| ~ p1(X0)
| ~ p100(X0) )
| p1(X1) )
& ( ! [X0] :
( ~ r1(X1,X0)
| p1(X0)
| ~ p100(X0) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) ) ) )
& ~ p101(X0)
& p100(X0) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ~ r1(X0,X2)
| ( ( ( ~ ! [X3] :
( ~ r1(X2,X3)
| ~ ( ~ p2(X3)
& ~ p102(X3)
& p101(X3) ) )
& ~ ! [X4] :
( ~ r1(X2,X4)
| ~ ( p2(X4)
& ~ p102(X4)
& p101(X4) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ~ r1(X0,X2)
| ( ( ( ~ ! [X3] :
( ~ r1(X2,X3)
| ~ ( ~ p2(X3)
& ~ p102(X3)
& p101(X3) ) )
& ~ ! [X4] :
( ~ r1(X2,X4)
| ~ ( p2(X4)
& ~ p102(X4)
& p101(X4) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ~ r1(X0,X2)
| ( ( ( ~ ! [X3] :
( ~ r1(X2,X3)
| ~ ( ~ p2(X3)
& p101(X3) ) )
& ~ ! [X4] :
( ~ r1(X2,X4)
| ~ ( p2(X4)
& p101(X4) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f8,plain,
! [X0,X1,X2] :
( r1(X0,X2)
| ~ r1(X0,X1)
| ~ r1(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1,X2] :
( r1(X0,X2)
| ~ r1(X0,X1)
| ~ r1(X1,X2) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
? [X0] :
( ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| ( ( ( ? [X3] :
( r1(X2,X3)
& ~ p2(X3)
& p101(X3) )
& ? [X4] :
( r1(X2,X4)
& p2(X4)
& p101(X4) ) )
| p101(X2)
| ~ p100(X2) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| ( ( ( ? [X3] :
( r1(X2,X3)
& ~ p2(X3)
& p101(X3) )
& ? [X4] :
( r1(X2,X4)
& p2(X4)
& p101(X4) ) )
| p101(X2)
| ~ p100(X2) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ),
inference(flattening,[],[f10]) ).
fof(f12,definition,
! [X2] :
( ( ? [X3] :
( r1(X2,X3)
& ~ p2(X3)
& p101(X3) )
& ? [X4] :
( r1(X2,X4)
& p2(X4)
& p101(X4) ) )
| p101(X2)
| ~ p100(X2)
| ~ sP0(X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f13,plain,
? [X0] :
( ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| ( sP0(X2)
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p2(X5)
| ~ p101(X5) )
| p2(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p2(X6)
| ~ p101(X6) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X7] :
( ~ r1(X2,X7)
| ~ p1(X7)
| ~ p100(X7) )
| p1(X2) )
& ( ! [X8] :
( ~ r1(X2,X8)
| p1(X8)
| ~ p100(X8) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ),
inference(definition_folding,[],[f11,f12]) ).
fof(f14,plain,
! [X2] :
( ( ? [X3] :
( r1(X2,X3)
& ~ p2(X3)
& p101(X3) )
& ? [X4] :
( r1(X2,X4)
& p2(X4)
& p101(X4) ) )
| p101(X2)
| ~ p100(X2)
| ~ sP0(X2) ),
inference(nnf_transformation,[],[f12]) ).
fof(f15,plain,
! [X0] :
( ( ? [X1] :
( r1(X0,X1)
& ~ p2(X1)
& p101(X1) )
& ? [X2] :
( r1(X0,X2)
& p2(X2)
& p101(X2) ) )
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0] :
( ( r1(X0,sK1(X0))
& ~ p2(sK1(X0))
& p101(sK1(X0))
& r1(X0,sK2(X0))
& p2(sK2(X0))
& p101(sK2(X0)) )
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0))],[f15]) ).
fof(f17,plain,
? [X0] :
( ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| ( sP0(X2)
& ( ( ( ! [X3] :
( ~ r1(X2,X3)
| ~ p2(X3)
| ~ p101(X3) )
| p2(X2) )
& ( ! [X4] :
( ~ r1(X2,X4)
| p2(X4)
| ~ p101(X4) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p1(X5)
| ~ p100(X5) )
| p1(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p1(X6)
| ~ p100(X6) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X0)
& p100(X0) ),
inference(rectify,[],[f13]) ).
fof(f18,plain,
( ! [X1] :
( ~ r1(sK3,X1)
| p2(X1) )
& ! [X2] :
( ~ r1(sK3,X2)
| ( sP0(X2)
& ( ( ( ! [X3] :
( ~ r1(X2,X3)
| ~ p2(X3)
| ~ p101(X3) )
| p2(X2) )
& ( ! [X4] :
( ~ r1(X2,X4)
| p2(X4)
| ~ p101(X4) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X5] :
( ~ r1(X2,X5)
| ~ p1(X5)
| ~ p100(X5) )
| p1(X2) )
& ( ! [X6] :
( ~ r1(X2,X6)
| p1(X6)
| ~ p100(X6) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(sK3)
& p100(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f17]) ).
fof(f19,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X2,X0,X1] :
( r1(X0,X1)
| ~ r1(X0,X2)
| ~ r1(X2,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
! [X0] :
( p101(sK2(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
! [X0] :
( p2(sK2(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
! [X0] :
( r1(X0,sK2(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0] :
( p101(sK1(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0] :
( ~ p2(sK1(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
! [X0] :
( r1(X0,sK1(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
p100(sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
~ p101(sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X2] :
( ~ r1(sK3,X2)
| p100(X2)
| ~ p101(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X2,X6] :
( ~ r1(sK3,X2)
| ~ r1(X2,X6)
| p1(X6)
| ~ p100(X6)
| ~ p1(X2)
| ~ p100(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X2,X5] :
( ~ r1(sK3,X2)
| ~ r1(X2,X5)
| ~ p1(X5)
| ~ p100(X5)
| p1(X2)
| ~ p100(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X4] :
( ~ r1(sK3,X2)
| ~ r1(X2,X4)
| p2(X4)
| ~ p101(X4)
| ~ p2(X2)
| ~ p101(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X2,X3] :
( ~ r1(sK3,X2)
| ~ r1(X2,X3)
| ~ p2(X3)
| ~ p101(X3)
| p2(X2)
| ~ p101(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X2] :
( ~ r1(sK3,X2)
| sP0(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X1] :
( ~ r1(sK3,X1)
| p2(X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X0] :
( r1(X0,sK1(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f37,plain,
! [X0] :
( ~ p2(sK1(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f38,plain,
! [X0] :
( ~ p101(sK1(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f39,plain,
! [X0] :
( r1(X0,sK2(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f40,plain,
! [X0] :
( p2(sK2(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f41,plain,
! [X0] :
( ~ p101(sK2(X0))
| ~ p101(X0)
| ~ p100(X0)
| sP0(X0) ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f42,plain,
! [X2] :
( ~ r1(sK3,X2)
| ~ sP0(X2) ),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f43,plain,
! [X2,X3] :
( ~ r1(sK3,X2)
| ~ r1(X2,X3)
| ~ p2(X3)
| p101(X3)
| p2(X2)
| p101(X2) ),
inference(consistent_polarity_flipping,[],[f33]) ).
fof(f44,plain,
! [X2,X4] :
( ~ r1(sK3,X2)
| ~ r1(X2,X4)
| p2(X4)
| p101(X4)
| ~ p2(X2)
| p101(X2) ),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f45,plain,
! [X2,X5] :
( ~ r1(sK3,X2)
| ~ r1(X2,X5)
| p1(X5)
| ~ p100(X5)
| ~ p1(X2)
| ~ p100(X2) ),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f46,plain,
! [X2,X6] :
( ~ r1(sK3,X2)
| ~ r1(X2,X6)
| ~ p1(X6)
| ~ p100(X6)
| p1(X2)
| ~ p100(X2) ),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f47,plain,
! [X2] :
( ~ r1(sK3,X2)
| p100(X2)
| p101(X2) ),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f48,plain,
p101(sK3),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f72,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f19,f20,f36,f37,f38,f39,f40,f41,f35,f42,f43,f44,f45,f46,f47,f48,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 16:32:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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
% 0.11/0.44 % (2564407)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (2564412)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2823333409_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.44 % TRYING [1]
% 0.11/0.44 % TRYING [2]
% 0.11/0.44 % (2564412) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2564407-2564412"...
% 0.11/0.44 % (2564412)...printing done.
% 0.11/0.44 % (2564413)% WARNING: option uhcvi not known.
% 0.11/0.44 % (2564412)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (2564412)------------------------------
% 0.11/0.44 % (2564412)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (2564412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (2564412)CaDiCaL version: 2.1.3
% 0.11/0.44 % (2564412)Termination reason: Refutation
% 0.11/0.44 % (2564412)Time elapsed: 0.002 s
% 0.11/0.44 % (2564412)Peak memory usage: 11 MB
% 0.11/0.44 % (2564412)Instructions burned: 4 (million)
% 0.11/0.44 % (2564407)Success in time 0.031 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------