%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL636+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 : n019.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 11:59:04 AM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 12 unt; 4 def)
% Number of atoms : 520 ( 0 equ)
% Maximal formula atoms : 69 ( 13 avg)
% Number of connectives : 877 ( 396 ~; 300 |; 177 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 107 ( 0 sgn 92 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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) ) ) )
& ( ( ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X0)
& p100(X0) ) )
& ( ( ( ! [X1] :
( ~ r1(X0,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X0) )
& ( ! [X1] :
( ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X1] :
( ~ r1(X0,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X0) )
& ( ! [X1] :
( ~ r1(X0,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p101(X0)
| ~ p102(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f2,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) ) ) )
& ( ( ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X0)
& p100(X0) ) )
& ( ( ( ! [X1] :
( ~ r1(X0,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X0) )
& ( ! [X1] :
( ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X1] :
( ~ r1(X0,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X0) )
& ( ! [X1] :
( ~ r1(X0,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p101(X0)
| ~ p102(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,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) ) ) )
& ( ( ~ ! [X9] :
( ~ r1(X0,X9)
| ~ ( ~ p2(X9)
& ~ p102(X9)
& p101(X9) ) )
& ~ ! [X10] :
( ~ r1(X0,X10)
| ~ ( p2(X10)
& ~ p102(X10)
& p101(X10) ) ) )
| ~ ( ~ p101(X0)
& p100(X0) ) )
& ( ( ( ! [X11] :
( ~ r1(X0,X11)
| ~ p2(X11)
| ~ p101(X11) )
| p2(X0) )
& ( ! [X12] :
( ~ r1(X0,X12)
| p2(X12)
| ~ p101(X12) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X13] :
( ~ r1(X0,X13)
| ~ p1(X13)
| ~ p100(X13) )
| p1(X0) )
& ( ! [X14] :
( ~ r1(X0,X14)
| p1(X14)
| ~ p100(X14) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p101(X0)
| ~ p102(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ) ),
inference(rectify,[],[f2]) ).
fof(f4,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) ) ) )
& ( ( ~ ! [X9] :
( ~ r1(X0,X9)
| ~ ( ~ p2(X9)
& ~ p102(X9)
& p101(X9) ) )
& ~ ! [X10] :
( ~ r1(X0,X10)
| ~ ( p2(X10)
& ~ p102(X10)
& p101(X10) ) ) )
| ~ ( ~ p101(X0)
& p100(X0) ) )
& ( ( ( ! [X11] :
( ~ r1(X0,X11)
| ~ p2(X11)
| ~ p101(X11) )
| p2(X0) )
& ( ! [X12] :
( ~ r1(X0,X12)
| p2(X12)
| ~ p101(X12) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X13] :
( ~ r1(X0,X13)
| ~ p1(X13)
| ~ p100(X13) )
| p1(X0) )
& ( ! [X14] :
( ~ r1(X0,X14)
| p1(X14)
| ~ p100(X14) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p101(X0)
| ~ p102(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ) ),
inference(flattening,[],[f3]) ).
fof(f5,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) ) ) )
& ( ( ~ ! [X9] :
( ~ r1(X0,X9)
| ~ ( ~ p2(X9)
& p101(X9) ) )
& ~ ! [X10] :
( ~ r1(X0,X10)
| ~ ( p2(X10)
& p101(X10) ) ) )
| ~ ( ~ p101(X0)
& p100(X0) ) )
& ( ( ( ! [X11] :
( ~ r1(X0,X11)
| ~ p2(X11)
| ~ p101(X11) )
| p2(X0) )
& ( ! [X12] :
( ~ r1(X0,X12)
| p2(X12)
| ~ p101(X12) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X13] :
( ~ r1(X0,X13)
| ~ p1(X13)
| ~ p100(X13) )
| p1(X0) )
& ( ! [X14] :
( ~ r1(X0,X14)
| p1(X14)
| ~ p100(X14) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f6,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) ) ) )
& ( ( ? [X9] :
( r1(X0,X9)
& ~ p2(X9)
& p101(X9) )
& ? [X10] :
( r1(X0,X10)
& p2(X10)
& p101(X10) ) )
| p101(X0)
| ~ p100(X0) )
& ( ( ( ! [X11] :
( ~ r1(X0,X11)
| ~ p2(X11)
| ~ p101(X11) )
| p2(X0) )
& ( ! [X12] :
( ~ r1(X0,X12)
| p2(X12)
| ~ p101(X12) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X13] :
( ~ r1(X0,X13)
| ~ p1(X13)
| ~ p100(X13) )
| p1(X0) )
& ( ! [X14] :
( ~ r1(X0,X14)
| p1(X14)
| ~ p100(X14) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ),
inference(ennf_transformation,[],[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) ) ) )
& ( ( ? [X9] :
( r1(X0,X9)
& ~ p2(X9)
& p101(X9) )
& ? [X10] :
( r1(X0,X10)
& p2(X10)
& p101(X10) ) )
| p101(X0)
| ~ p100(X0) )
& ( ( ( ! [X11] :
( ~ r1(X0,X11)
| ~ p2(X11)
| ~ p101(X11) )
| p2(X0) )
& ( ! [X12] :
( ~ r1(X0,X12)
| p2(X12)
| ~ p101(X12) )
| ~ p2(X0) ) )
| ~ p101(X0) )
& ( ( ( ! [X13] :
( ~ r1(X0,X13)
| ~ p1(X13)
| ~ p100(X13) )
| p1(X0) )
& ( ! [X14] :
( ~ r1(X0,X14)
| p1(X14)
| ~ p100(X14) )
| ~ p1(X0) ) )
| ~ p100(X0) )
& ( p100(X0)
| ~ p101(X0) )
& ~ p101(X0)
& p100(X0) ),
inference(flattening,[],[f6]) ).
fof(f24,plain,
( ~ p100(sK0)
| p101(sK0)
| ~ p2(sK2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f25,plain,
( ~ p100(sK0)
| p101(sK0)
| r1(sK0,sK2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f29,plain,
! [X1] :
( p2(X1)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f31,plain,
p100(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f32,plain,
~ p101(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f33,plain,
p101(sK0),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f34,plain,
~ p100(sK0),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f36,plain,
! [X1] :
( r1(sK0,X1)
| p2(X1) ),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f40,plain,
( p100(sK0)
| ~ p101(sK0)
| ~ r1(sK0,sK2) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f41,plain,
( p100(sK0)
| ~ p101(sK0)
| ~ p2(sK2) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f66,definition,
( spl5_3
<=> p101(sK0) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f82,definition,
( spl5_7
<=> p100(sK0) ),
introduced(definition,[new_symbols(definition,[spl5_7])],[avatar_definition]) ).
fof(f96,definition,
( spl5_10
<=> p2(sK2) ),
introduced(definition,[new_symbols(definition,[spl5_10])],[avatar_definition]) ).
fof(f98,plain,
( ~ p2(sK2)
| spl5_10 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f99,plain,
( ~ spl5_10
| ~ spl5_3
| spl5_7 ),
inference(avatar_split_clause,[],[f41,f82,f66,f96]) ).
fof(f101,definition,
( spl5_11
<=> r1(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl5_11])],[avatar_definition]) ).
fof(f103,plain,
( ~ r1(sK0,sK2)
| spl5_11 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f104,plain,
( ~ spl5_11
| ~ spl5_3
| spl5_7 ),
inference(avatar_split_clause,[],[f40,f82,f66,f101]) ).
fof(f121,plain,
~ spl5_7,
inference(avatar_split_clause,[],[f34,f82]) ).
fof(f122,plain,
spl5_3,
inference(avatar_split_clause,[],[f33,f66]) ).
fof(f123,plain,
( p2(sK2)
| spl5_11 ),
inference(resolution,[],[f36,f103]) ).
fof(f125,plain,
( $false
| spl5_10
| spl5_11 ),
inference(forward_subsumption_resolution,[],[f123,f98]) ).
fof(f126,plain,
( spl5_10
| spl5_11 ),
inference(avatar_contradiction_clause,[],[f125]) ).
cnf(s6,plain,
( ~ spl5_3
| spl5_7
| ~ spl5_10 ),
inference(sat_conversion,[],[f99]) ).
cnf(s7,plain,
( ~ spl5_3
| spl5_7
| ~ spl5_11 ),
inference(sat_conversion,[],[f104]) ).
cnf(s12,plain,
~ spl5_7,
inference(sat_conversion,[],[f121]) ).
cnf(s13,plain,
spl5_3,
inference(sat_conversion,[],[f122]) ).
cnf(s14,plain,
( spl5_10
| spl5_11 ),
inference(sat_conversion,[],[f126]) ).
cnf(s18,plain,
~ spl5_11,
inference(rat,[],[s7,s12,s13]) ).
cnf(s19,plain,
spl5_10,
inference(rat,[],[s14,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s6,s19,s12,s13]) ).
fof(f127,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL636+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 : n019.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:08:03 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.45 % (3240840)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3240846)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3240846)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1184164906:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (3240846) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3240840-3240846"...
% 0.11/0.45 % (3240846)...printing done.
% 0.11/0.45 % (3240846)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3240846)------------------------------
% 0.11/0.45 % (3240846)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3240846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3240846)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3240846)Termination reason: Refutation
% 0.11/0.45 % (3240846)Time elapsed: 0.002 s
% 0.11/0.45 % (3240846)Peak memory usage: 12 MB
% 0.11/0.45 % (3240846)Instructions burned: 3 (million)
% 0.11/0.45 % (3240840)Success in time 0.031 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------