%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU220+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:52:27 PM UTC 2026
% Result : Theorem 1.04s 0.57s
% Output : Refutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 79 ( 17 unt; 5 def)
% Number of atoms : 289 ( 67 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 355 ( 145 ~; 147 |; 40 &)
% ( 8 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 60 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( relation(function_inverse(X0))
& function(function_inverse(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(f32,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X0,relation_dom(X1))
=> apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(f34,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( one_to_one(X0)
=> ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( X1 = function_inverse(X0)
<=> ( relation_dom(X1) = relation_rng(X0)
& ! [X2,X3] :
( ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
=> ( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) ) )
& ( ( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) )
=> ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_funct_1) ).
fof(f35,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( one_to_one(X0)
=> ( relation_rng(X0) = relation_dom(function_inverse(X0))
& relation_dom(X0) = relation_rng(function_inverse(X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
fof(f36,conjecture,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ( one_to_one(X1)
& in(X0,relation_rng(X1)) )
=> ( X0 = apply(X1,apply(function_inverse(X1),X0))
& X0 = apply(relation_composition(function_inverse(X1),X1),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_funct_1) ).
fof(f37,negated_conjecture,
~ ! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ( one_to_one(X1)
& in(X0,relation_rng(X1)) )
=> ( X0 = apply(X1,apply(function_inverse(X1),X0))
& X0 = apply(relation_composition(function_inverse(X1),X1),X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f48,plain,
! [X0] :
( ( relation(function_inverse(X0))
& function(function_inverse(X0)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f49,plain,
! [X0] :
( ( relation(function_inverse(X0))
& function(function_inverse(X0)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f48]) ).
fof(f65,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f65]) ).
fof(f69,plain,
! [X0] :
( ! [X1] :
( ( X1 = function_inverse(X0)
<=> ( relation_dom(X1) = relation_rng(X0)
& ! [X2,X3] :
( ( ( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) )
| ~ in(X2,relation_rng(X0))
| apply(X1,X2) != X3 )
& ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
| ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 ) ) ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f70,plain,
! [X0] :
( ! [X1] :
( ( X1 = function_inverse(X0)
<=> ( relation_dom(X1) = relation_rng(X0)
& ! [X2,X3] :
( ( ( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) )
| ~ in(X2,relation_rng(X0))
| apply(X1,X2) != X3 )
& ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
| ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 ) ) ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0] :
( ( relation_rng(X0) = relation_dom(function_inverse(X0))
& relation_dom(X0) = relation_rng(function_inverse(X0)) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f72,plain,
! [X0] :
( ( relation_rng(X0) = relation_dom(function_inverse(X0))
& relation_dom(X0) = relation_rng(function_inverse(X0)) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
? [X0,X1] :
( ( apply(X1,apply(function_inverse(X1),X0)) != X0
| apply(relation_composition(function_inverse(X1),X1),X0) != X0 )
& one_to_one(X1)
& in(X0,relation_rng(X1))
& relation(X1)
& function(X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f74,plain,
? [X0,X1] :
( ( apply(X1,apply(function_inverse(X1),X0)) != X0
| apply(relation_composition(function_inverse(X1),X1),X0) != X0 )
& one_to_one(X1)
& in(X0,relation_rng(X1))
& relation(X1)
& function(X1) ),
inference(flattening,[],[f73]) ).
fof(f82,plain,
! [X0] :
( function(function_inverse(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f83,plain,
! [X0] :
( relation(function_inverse(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f119,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(X1))
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f121,plain,
! [X2,X3,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| ~ function(X1)
| ~ relation(X1)
| apply(X1,X2) != X3
| ~ in(X2,relation_rng(X0))
| apply(X0,X3) = X2
| function_inverse(X0) != X1 ),
inference(cnf_transformation,[],[f70]) ).
fof(f132,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_rng(X0) = relation_dom(function_inverse(X0)) ),
inference(cnf_transformation,[],[f72]) ).
fof(f133,plain,
( sK11 != apply(relation_composition(function_inverse(sK12),sK12),sK11)
| sK11 != apply(sK12,apply(function_inverse(sK12),sK11)) ),
inference(cnf_transformation,[],[f74]) ).
fof(f134,plain,
function(sK12),
inference(cnf_transformation,[],[f74]) ).
fof(f135,plain,
relation(sK12),
inference(cnf_transformation,[],[f74]) ).
fof(f136,plain,
in(sK11,relation_rng(sK12)),
inference(cnf_transformation,[],[f74]) ).
fof(f137,plain,
one_to_one(sK12),
inference(cnf_transformation,[],[f74]) ).
fof(f148,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_rng(X0))
| apply(X0,apply(X1,X2)) = X2
| function_inverse(X0) != X1 ),
inference(equality_resolution,[],[f121]) ).
fof(f149,plain,
! [X2,X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| ~ function(function_inverse(X0))
| ~ relation(function_inverse(X0))
| ~ in(X2,relation_rng(X0))
| apply(X0,apply(function_inverse(X0),X2)) = X2 ),
inference(equality_resolution,[],[f148]) ).
fof(f182,plain,
! [X2,X0] :
( ~ function(X0)
| ~ relation(X0)
| one_to_one(X0)
| ~ function(function_inverse(X0))
| ~ relation(function_inverse(X0))
| ~ in(X2,relation_rng(X0))
| apply(X0,apply(function_inverse(X0),X2)) = X2 ),
inference(consistent_polarity_flipping,[],[f149]) ).
fof(f183,plain,
! [X0] :
( one_to_one(X0)
| ~ relation(X0)
| ~ function(X0)
| relation_rng(X0) = relation_dom(function_inverse(X0)) ),
inference(consistent_polarity_flipping,[],[f132]) ).
fof(f185,plain,
~ one_to_one(sK12),
inference(consistent_polarity_flipping,[],[f137]) ).
fof(f190,definition,
( spl13_1
<=> sK11 = apply(sK12,apply(function_inverse(sK12),sK11)) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f191,plain,
( sK11 = apply(sK12,apply(function_inverse(sK12),sK11))
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f194,definition,
( spl13_2
<=> sK11 = apply(relation_composition(function_inverse(sK12),sK12),sK11) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f196,plain,
( sK11 != apply(relation_composition(function_inverse(sK12),sK12),sK11)
| spl13_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f197,plain,
( ~ spl13_1
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f133,f194,f190]) ).
fof(f274,plain,
( ~ relation(sK12)
| ~ function(sK12)
| relation_rng(sK12) = relation_dom(function_inverse(sK12)) ),
inference(resolution,[],[f183,f185]) ).
fof(f279,plain,
( ~ function(sK12)
| relation_rng(sK12) = relation_dom(function_inverse(sK12)) ),
inference(forward_subsumption_resolution,[],[f274,f135]) ).
fof(f282,plain,
relation_rng(sK12) = relation_dom(function_inverse(sK12)),
inference(forward_subsumption_resolution,[],[f279,f134]) ).
fof(f320,definition,
( spl13_6
<=> relation(function_inverse(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_6])],[avatar_definition]) ).
fof(f322,plain,
( ~ relation(function_inverse(sK12))
| spl13_6 ),
inference(avatar_component_clause,[],[f320]) ).
fof(f331,definition,
( spl13_8
<=> function(function_inverse(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_8])],[avatar_definition]) ).
fof(f333,plain,
( ~ function(function_inverse(sK12))
| spl13_8 ),
inference(avatar_component_clause,[],[f331]) ).
fof(f342,plain,
( ~ relation(sK12)
| ~ function(sK12)
| spl13_6 ),
inference(resolution,[],[f322,f83]) ).
fof(f343,plain,
( ~ function(sK12)
| spl13_6 ),
inference(forward_subsumption_resolution,[],[f342,f135]) ).
fof(f344,plain,
( $false
| spl13_6 ),
inference(forward_subsumption_resolution,[],[f343,f134]) ).
fof(f345,plain,
spl13_6,
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f346,plain,
! [X0,X1] :
( ~ in(X0,relation_rng(sK12))
| ~ relation(function_inverse(sK12))
| ~ function(X1)
| ~ relation(X1)
| ~ function(function_inverse(sK12))
| apply(relation_composition(function_inverse(sK12),X1),X0) = apply(X1,apply(function_inverse(sK12),X0)) ),
inference(superposition,[],[f119,f282]) ).
fof(f348,definition,
( spl13_11
<=> ! [X0,X1] :
( ~ in(X0,relation_rng(sK12))
| apply(relation_composition(function_inverse(sK12),X1),X0) = apply(X1,apply(function_inverse(sK12),X0))
| ~ function(X1)
| ~ relation(X1) ) ),
introduced(definition,[new_symbols(definition,[spl13_11])],[avatar_definition]) ).
fof(f349,plain,
( ! [X0,X1] :
( ~ in(X0,relation_rng(sK12))
| apply(relation_composition(function_inverse(sK12),X1),X0) = apply(X1,apply(function_inverse(sK12),X0))
| ~ function(X1)
| ~ relation(X1) )
| ~ spl13_11 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f350,plain,
( ~ spl13_8
| ~ spl13_6
| spl13_11 ),
inference(avatar_split_clause,[],[f346,f348,f320,f331]) ).
fof(f352,plain,
( ~ relation(sK12)
| ~ function(sK12)
| spl13_8 ),
inference(resolution,[],[f333,f82]) ).
fof(f353,plain,
( ~ function(sK12)
| spl13_8 ),
inference(forward_subsumption_resolution,[],[f352,f135]) ).
fof(f354,plain,
( $false
| spl13_8 ),
inference(forward_subsumption_resolution,[],[f353,f134]) ).
fof(f355,plain,
spl13_8,
inference(avatar_contradiction_clause,[],[f354]) ).
fof(f378,plain,
! [X2,X0] :
( ~ function(X0)
| ~ relation(X0)
| one_to_one(X0)
| ~ relation(function_inverse(X0))
| ~ in(X2,relation_rng(X0))
| apply(X0,apply(function_inverse(X0),X2)) = X2 ),
inference(forward_subsumption_resolution,[],[f182,f82]) ).
fof(f379,plain,
! [X2,X0] :
( ~ in(X2,relation_rng(X0))
| ~ relation(X0)
| one_to_one(X0)
| ~ function(X0)
| apply(X0,apply(function_inverse(X0),X2)) = X2 ),
inference(forward_subsumption_resolution,[],[f378,f83]) ).
fof(f380,plain,
( ~ relation(sK12)
| one_to_one(sK12)
| ~ function(sK12)
| sK11 = apply(sK12,apply(function_inverse(sK12),sK11)) ),
inference(resolution,[],[f379,f136]) ).
fof(f383,plain,
( one_to_one(sK12)
| ~ function(sK12)
| sK11 = apply(sK12,apply(function_inverse(sK12),sK11)) ),
inference(forward_subsumption_resolution,[],[f380,f135]) ).
fof(f385,plain,
( ~ function(sK12)
| sK11 = apply(sK12,apply(function_inverse(sK12),sK11)) ),
inference(forward_subsumption_resolution,[],[f383,f185]) ).
fof(f390,plain,
sK11 = apply(sK12,apply(function_inverse(sK12),sK11)),
inference(forward_subsumption_resolution,[],[f385,f134]) ).
fof(f393,plain,
spl13_1,
inference(avatar_split_clause,[],[f390,f190]) ).
fof(f862,plain,
( ! [X0] :
( ~ function(X0)
| apply(relation_composition(function_inverse(sK12),X0),sK11) = apply(X0,apply(function_inverse(sK12),sK11))
| ~ relation(X0) )
| ~ spl13_11 ),
inference(resolution,[],[f349,f136]) ).
fof(f6112,plain,
( apply(relation_composition(function_inverse(sK12),sK12),sK11) = apply(sK12,apply(function_inverse(sK12),sK11))
| ~ relation(sK12)
| ~ spl13_11 ),
inference(resolution,[],[f862,f134]) ).
fof(f6113,plain,
( apply(relation_composition(function_inverse(sK12),sK12),sK11) = apply(sK12,apply(function_inverse(sK12),sK11))
| ~ spl13_11 ),
inference(forward_subsumption_resolution,[],[f6112,f135]) ).
fof(f6128,plain,
( sK11 = apply(relation_composition(function_inverse(sK12),sK12),sK11)
| ~ spl13_1
| ~ spl13_11 ),
inference(forward_demodulation,[],[f6113,f191]) ).
fof(f6133,plain,
( $false
| ~ spl13_1
| spl13_2
| ~ spl13_11 ),
inference(forward_subsumption_resolution,[],[f6128,f196]) ).
fof(f6134,plain,
( ~ spl13_1
| spl13_2
| ~ spl13_11 ),
inference(avatar_contradiction_clause,[],[f6133]) ).
cnf(s1,plain,
( ~ spl13_1
| ~ spl13_2 ),
inference(sat_conversion,[],[f197]) ).
cnf(s7,plain,
spl13_6,
inference(sat_conversion,[],[f345]) ).
cnf(s8,plain,
( ~ spl13_6
| ~ spl13_8
| spl13_11 ),
inference(sat_conversion,[],[f350]) ).
cnf(s9,plain,
spl13_8,
inference(sat_conversion,[],[f355]) ).
cnf(s14,plain,
spl13_1,
inference(sat_conversion,[],[f393]) ).
cnf(s85,plain,
( ~ spl13_1
| spl13_2
| ~ spl13_11 ),
inference(sat_conversion,[],[f6134]) ).
cnf(s103,plain,
( ~ spl13_6
| spl13_11 ),
inference(rat,[],[s8,s9]) ).
cnf(s104,plain,
spl13_11,
inference(rat,[],[s103,s7]) ).
cnf(s105,plain,
spl13_2,
inference(rat,[],[s85,s14,s104]) ).
cnf(s109,plain,
$false,
inference(rat,[],[s1,s105,s14]) ).
fof(f6138,plain,
$false,
inference(avatar_sat_refutation,[],[s109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU220+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 04:03:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41 Running first-order model finding
% 0.14/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
% 1.04/0.57 % (3189072)Will run a generic schedule for satisfiability detection.
% 1.04/0.57 % (3189082)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1519360989:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.04/0.57 % (3189078)% WARNING: option uhcvi not known.
% 1.04/0.57 % (3189077)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3688279230_2999 on theBenchmark for (2999ds/0Mi)
% 1.04/0.57 % (3189081)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=992093508:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.04/0.57 % (3189078)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1584051984:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.04/0.57 % (3189079)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1951485615:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.04/0.57 % (3189080)dis+10_1_sil=32000:sp=arity:random_seed=3855457936:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.04/0.57 % (3189083)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3030631818:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.04/0.57 % TRYING [1]
% 1.04/0.57 % TRYING [2]
% 1.04/0.57 % TRYING [3]
% 1.04/0.57 % TRYING [4]
% 1.04/0.57 % (3189082)Instruction limit reached!
% 1.04/0.57 % (3189082)------------------------------
% 1.04/0.57 % (3189082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.04/0.57 % (3189082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.57 % (3189082)CaDiCaL version: 2.1.3
% 1.04/0.57 % (3189082)Termination reason: Instruction limit
% 1.04/0.57 % (3189082)Termination phase: Saturation
% 1.04/0.57 % (3189082)Time elapsed: 0.042 s
% 1.04/0.57 % (3189082)Peak memory usage: 13 MB
% 1.04/0.57 % (3189082)Instructions burned: 132 (million)
% 1.04/0.57 % (3189091)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=308794571:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.04/0.57 % TRYING [1]
% 1.04/0.57 % TRYING [2]
% 1.04/0.57 % TRYING [3]
% 1.04/0.57 % (3189080)Instruction limit reached!
% 1.04/0.57 % (3189080)------------------------------
% 1.04/0.57 % (3189080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.04/0.57 % (3189080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.57 % (3189080)CaDiCaL version: 2.1.3
% 1.04/0.57 % (3189080)Termination reason: Instruction limit
% 1.04/0.57 % (3189080)Termination phase: Saturation
% 1.04/0.57 % (3189080)Time elapsed: 0.057 s
% 1.04/0.57 % (3189080)Peak memory usage: 12 MB
% 1.04/0.57 % (3189080)Instructions burned: 104 (million)
% 1.04/0.57 % TRYING [4]
% 1.04/0.57 % (3189081)Instruction limit reached!
% 1.04/0.57 % (3189081)------------------------------
% 1.04/0.57 % (3189081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.04/0.57 % (3189081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.57 % (3189081)CaDiCaL version: 2.1.3
% 1.04/0.57 % (3189081)Termination reason: Instruction limit
% 1.04/0.57 % (3189081)Termination phase: Saturation
% 1.04/0.57 % (3189081)Time elapsed: 0.066 s
% 1.04/0.57 % (3189081)Peak memory usage: 13 MB
% 1.04/0.57 % (3189081)Instructions burned: 118 (million)
% 1.04/0.57 % (3189093)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1716301577:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.04/0.57 % (3189094)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1795386863:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.04/0.57 % (3189083)Instruction limit reached!
% 1.04/0.57 % (3189083)------------------------------
% 1.04/0.57 % (3189083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.04/0.57 % (3189083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.57 % (3189083)CaDiCaL version: 2.1.3
% 1.04/0.57 % (3189083)Termination reason: Instruction limit
% 1.04/0.57 % (3189083)Termination phase: Saturation
% 1.04/0.57 % (3189083)Time elapsed: 0.094 s
% 1.04/0.57 % (3189083)Peak memory usage: 13 MB
% 1.04/0.57 % (3189083)Instructions burned: 159 (million)
% 1.04/0.57 % (3189097)ott-21_1_sil=16000:fs=off:random_seed=2367226471:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.04/0.57 % (3189078) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3189072-3189078"...
% 1.04/0.57 % (3189078)...printing done.
% 1.04/0.57 % (3189078)Refutation found. Thanks to Tanya!
% 1.04/0.57 % SZS status Theorem for theBenchmark
% 1.04/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.04/0.58 % (3189078)------------------------------
% 1.04/0.58 % (3189078)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.04/0.58 % (3189078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.58 % (3189078)CaDiCaL version: 2.1.3
% 1.04/0.58 % (3189078)Termination reason: Refutation
% 1.04/0.58 % (3189078)Time elapsed: 0.120 s
% 1.04/0.58 % (3189078)Peak memory usage: 14 MB
% 1.04/0.58 % (3189078)Instructions burned: 213 (million)
% 1.04/0.58 % (3189072)Success in time 0.157 s
% 1.04/0.58 % Vampire exiting
%------------------------------------------------------------------------------