%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU023+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:47:05 PM UTC 2026
% Result : Theorem 2.47s 1.31s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 51 ( 7 unt; 1 def)
% Number of atoms : 324 ( 98 equ)
% Maximal formula atoms : 19 ( 6 avg)
% Number of connectives : 465 ( 192 ~; 175 |; 80 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 101 ( 91 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( relation(function_inverse(X0))
& function(function_inverse(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(f31,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/sandbox2/benchmark/theBenchmark.p',t23_funct_1) ).
fof(f35,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/sandbox2/benchmark/theBenchmark.p',t54_funct_1) ).
fof(f36,conjecture,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ( one_to_one(X1)
& in(X0,relation_dom(X1)) )
=> ( X0 = apply(function_inverse(X1),apply(X1,X0))
& X0 = apply(relation_composition(X1,function_inverse(X1)),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_funct_1) ).
fof(f37,negated_conjecture,
~ ! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ( one_to_one(X1)
& in(X0,relation_dom(X1)) )
=> ( X0 = apply(function_inverse(X1),apply(X1,X0))
& X0 = apply(relation_composition(X1,function_inverse(X1)),X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f42,plain,
? [X0,X1] :
( ( apply(function_inverse(X1),apply(X1,X0)) != X0
| apply(relation_composition(X1,function_inverse(X1)),X0) != X0 )
& one_to_one(X1)
& in(X0,relation_dom(X1))
& relation(X1)
& function(X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f43,plain,
? [X0,X1] :
( ( apply(function_inverse(X1),apply(X1,X0)) != X0
| apply(relation_composition(X1,function_inverse(X1)),X0) != X0 )
& one_to_one(X1)
& in(X0,relation_dom(X1))
& relation(X1)
& function(X1) ),
inference(flattening,[],[f42]) ).
fof(f45,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,[],[f35]) ).
fof(f46,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,[],[f45]) ).
fof(f47,plain,
! [X0] :
( ( relation(function_inverse(X0))
& function(function_inverse(X0)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f48,plain,
! [X0] :
( ( relation(function_inverse(X0))
& function(function_inverse(X0)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f47]) ).
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(ennf_transformation,[],[f31]) ).
fof(f67,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,[],[f66]) ).
fof(f71,definition,
! [X0,X2,X3,X1] :
( sP0(X0,X2,X3,X1)
<=> ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
| ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f72,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 )
& sP0(X0,X2,X3,X1) ) ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(definition_folding,[],[f46,f71]) ).
fof(f73,plain,
( ( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| sK1 != apply(relation_composition(sK2,function_inverse(sK2)),sK1) )
& one_to_one(sK2)
& in(sK1,relation_dom(sK2))
& relation(sK2)
& function(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f43]) ).
fof(f74,plain,
! [X0,X2,X3,X1] :
( ( sP0(X0,X2,X3,X1)
| ( ( ~ in(X2,relation_rng(X0))
| apply(X1,X2) != X3 )
& in(X3,relation_dom(X0))
& apply(X0,X3) = X2 ) )
& ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
| ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2
| ~ sP0(X0,X2,X3,X1) ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f75,plain,
! [X0,X2,X3,X1] :
( ( sP0(X0,X2,X3,X1)
| ( ( ~ in(X2,relation_rng(X0))
| apply(X1,X2) != X3 )
& in(X3,relation_dom(X0))
& apply(X0,X3) = X2 ) )
& ( ( in(X2,relation_rng(X0))
& X3 = apply(X1,X2) )
| ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2
| ~ sP0(X0,X2,X3,X1) ) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1,X2,X3] :
( ( sP0(X0,X1,X2,X3)
| ( ( ~ in(X1,relation_rng(X0))
| apply(X3,X1) != X2 )
& in(X2,relation_dom(X0))
& apply(X0,X2) = X1 ) )
& ( ( in(X1,relation_rng(X0))
& apply(X3,X1) = X2 )
| ~ in(X2,relation_dom(X0))
| apply(X0,X2) != X1
| ~ sP0(X0,X1,X2,X3) ) ),
inference(rectify,[],[f75]) ).
fof(f77,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = function_inverse(X0)
| relation_rng(X0) != relation_dom(X1)
| ? [X2,X3] :
( ( ( ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 )
& in(X2,relation_rng(X0))
& apply(X1,X2) = X3 )
| ~ sP0(X0,X2,X3,X1) ) )
& ( ( 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 )
& sP0(X0,X2,X3,X1) ) )
| function_inverse(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(nnf_transformation,[],[f72]) ).
fof(f78,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = function_inverse(X0)
| relation_rng(X0) != relation_dom(X1)
| ? [X2,X3] :
( ( ( ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 )
& in(X2,relation_rng(X0))
& apply(X1,X2) = X3 )
| ~ sP0(X0,X2,X3,X1) ) )
& ( ( 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 )
& sP0(X0,X2,X3,X1) ) )
| function_inverse(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = function_inverse(X0)
| relation_rng(X0) != relation_dom(X1)
| ? [X2,X3] :
( ( ( ~ in(X3,relation_dom(X0))
| apply(X0,X3) != X2 )
& in(X2,relation_rng(X0))
& apply(X1,X2) = X3 )
| ~ sP0(X0,X2,X3,X1) ) )
& ( ( relation_dom(X1) = relation_rng(X0)
& ! [X4,X5] :
( ( ( in(X5,relation_dom(X0))
& apply(X0,X5) = X4 )
| ~ in(X4,relation_rng(X0))
| apply(X1,X4) != X5 )
& sP0(X0,X4,X5,X1) ) )
| function_inverse(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(rectify,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = function_inverse(X0)
| relation_rng(X0) != relation_dom(X1)
| ( ( ~ in(sK4(X0,X1),relation_dom(X0))
| sK3(X0,X1) != apply(X0,sK4(X0,X1)) )
& in(sK3(X0,X1),relation_rng(X0))
& sK4(X0,X1) = apply(X1,sK3(X0,X1)) )
| ~ sP0(X0,sK3(X0,X1),sK4(X0,X1),X1) )
& ( ( relation_dom(X1) = relation_rng(X0)
& ! [X4,X5] :
( ( ( in(X5,relation_dom(X0))
& apply(X0,X5) = X4 )
| ~ in(X4,relation_rng(X0))
| apply(X1,X4) != X5 )
& sP0(X0,X4,X5,X1) ) )
| function_inverse(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X2,sK3(X0,X1)),skolemize(X3,sK4(X0,X1))],[f79]) ).
fof(f88,plain,
function(sK2),
inference(cnf_transformation,[],[f73]) ).
fof(f89,plain,
relation(sK2),
inference(cnf_transformation,[],[f73]) ).
fof(f90,plain,
in(sK1,relation_dom(sK2)),
inference(cnf_transformation,[],[f73]) ).
fof(f91,plain,
one_to_one(sK2),
inference(cnf_transformation,[],[f73]) ).
fof(f92,plain,
( sK1 != apply(relation_composition(sK2,function_inverse(sK2)),sK1)
| sK1 != apply(function_inverse(sK2),apply(sK2,sK1)) ),
inference(cnf_transformation,[],[f73]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( apply(X3,X1) = X2
| ~ in(X2,relation_dom(X0))
| apply(X0,X2) != X1
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f76]) ).
fof(f99,plain,
! [X0,X1,X4,X5] :
( sP0(X0,X4,X5,X1)
| function_inverse(X0) != X1
| ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f106,plain,
! [X0] :
( function(function_inverse(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f107,plain,
! [X0] :
( relation(function_inverse(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f137,plain,
! [X2,X0,X1] :
( 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(cnf_transformation,[],[f67]) ).
fof(f145,plain,
! [X2,X3,X0] :
( ~ sP0(X0,apply(X0,X2),X2,X3)
| ~ in(X2,relation_dom(X0))
| apply(X3,apply(X0,X2)) = X2 ),
inference(equality_resolution,[],[f94]) ).
fof(f151,plain,
! [X0,X4,X5] :
( sP0(X0,X4,X5,function_inverse(X0))
| ~ relation(function_inverse(X0))
| ~ function(function_inverse(X0))
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(equality_resolution,[],[f99]) ).
fof(f172,plain,
! [X0,X4,X5] :
( sP0(X0,X4,X5,function_inverse(X0))
| ~ function(function_inverse(X0))
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_subsumption_resolution,[],[f151,f107]) ).
fof(f173,plain,
! [X0,X4,X5] :
( sP0(X0,X4,X5,function_inverse(X0))
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_subsumption_resolution,[],[f172,f106]) ).
fof(f174,plain,
! [X0,X1] :
( apply(function_inverse(X0),apply(X0,X1)) = X1
| ~ relation(X0)
| ~ function(X0)
| ~ in(X1,relation_dom(X0))
| ~ one_to_one(X0) ),
inference(resolution,[],[f173,f145]) ).
fof(f176,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ in(sK1,relation_dom(sK2))
| ~ relation(function_inverse(sK2))
| ~ function(function_inverse(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(superposition,[],[f92,f137]) ).
fof(f180,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ in(sK1,relation_dom(sK2))
| ~ relation(function_inverse(sK2))
| ~ function(function_inverse(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(duplicate_literal_removal,[],[f176]) ).
fof(f181,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ relation(function_inverse(sK2))
| ~ function(function_inverse(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f180,f90]) ).
fof(f182,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ function(function_inverse(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f181,f107]) ).
fof(f183,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f182,f106]) ).
fof(f184,plain,
( sK1 != apply(function_inverse(sK2),apply(sK2,sK1))
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f183,f89]) ).
fof(f185,plain,
sK1 != apply(function_inverse(sK2),apply(sK2,sK1)),
inference(forward_subsumption_resolution,[],[f184,f88]) ).
fof(f267,plain,
( sK1 != sK1
| ~ relation(sK2)
| ~ function(sK2)
| ~ in(sK1,relation_dom(sK2))
| ~ one_to_one(sK2) ),
inference(superposition,[],[f185,f174]) ).
fof(f277,plain,
( ~ relation(sK2)
| ~ function(sK2)
| ~ in(sK1,relation_dom(sK2))
| ~ one_to_one(sK2) ),
inference(trivial_inequality_removal,[],[f267]) ).
fof(f280,plain,
( ~ function(sK2)
| ~ in(sK1,relation_dom(sK2))
| ~ one_to_one(sK2) ),
inference(forward_subsumption_resolution,[],[f277,f89]) ).
fof(f285,plain,
( ~ in(sK1,relation_dom(sK2))
| ~ one_to_one(sK2) ),
inference(forward_subsumption_resolution,[],[f280,f88]) ).
fof(f288,plain,
~ one_to_one(sK2),
inference(forward_subsumption_resolution,[],[f285,f90]) ).
fof(f289,plain,
$false,
inference(forward_subsumption_resolution,[],[f288,f91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU023+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 % Computer : n007.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.13/0.42 % CPULimit : 300
% 0.13/0.42 % WCLimit : 300
% 0.13/0.42 % DateTime : Mon Sep 28 03:22:39 UTC 2026
% 0.13/0.42 % CPUTime :
% 0.13/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.45 Running first-order theorem proving
% 0.13/0.45 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/1.31 % (1996656)Detected formulas, will run a generic FOF schedule.
% 2.47/1.31 % (1996664)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2102574979:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.47/1.31 % (1996664)Refutation not found, incomplete strategy
% 2.47/1.31 % (1996664)------------------------------
% 2.47/1.31 % (1996664)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/1.31 % (1996664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/1.31 % (1996664)CaDiCaL version: 2.1.3
% 2.47/1.31 % (1996664)Termination reason: Refutation not found, incomplete strategy
% 2.47/1.31 % (1996664)Time elapsed: 0.002 s
% 2.47/1.31 % (1996664)Peak memory usage: 88 MB
% 2.47/1.31 % (1996664)Instructions burned: 4 (million)
% 2.47/1.31 % (1996665)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2554159379:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.47/1.31 % (1996662)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=124998422:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.47/1.31 % (1996666)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3228800423:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.47/1.31 % (1996661)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3434785800:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.47/1.31 % (1996667)dis-21_1_sil=8000:lcm=predicate:random_seed=193379971:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.47/1.31 % (1996663)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2796700524:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.47/1.31 % (1996665)First to succeed.
% 2.47/1.31 % (1996665)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1996656"
% 2.47/1.31 % (1996667)Instruction limit reached!
% 2.47/1.31 % (1996667)------------------------------
% 2.47/1.31 % (1996667)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/1.31 % (1996667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/1.31 % (1996667)CaDiCaL version: 2.1.3
% 2.47/1.31 % (1996667)Termination reason: Instruction limit
% 2.47/1.31 % (1996667)Termination phase: Saturation
% 2.47/1.31 % (1996667)Time elapsed: 0.073 s
% 2.47/1.31 % (1996667)Peak memory usage: 90 MB
% 2.47/1.31 % (1996667)Instructions burned: 130 (million)
% 2.47/1.31 % (1996666)Instruction limit reached!
% 2.47/1.31 % (1996666)------------------------------
% 2.47/1.31 % (1996666)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/1.31 % (1996666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/1.31 % (1996666)CaDiCaL version: 2.1.3
% 2.47/1.31 % (1996666)Termination reason: Instruction limit
% 2.47/1.31 % (1996666)Termination phase: Saturation
% 2.47/1.31 % (1996666)Time elapsed: 0.078 s
% 2.47/1.31 % (1996666)Peak memory usage: 89 MB
% 2.47/1.31 % (1996666)Instructions burned: 139 (million)
% 2.47/1.31 % (1996664)------------------------------
% 2.47/1.31 % (1996664)------------------------------
% 2.47/1.31 % (1996677)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3503661249:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.47/1.31 % (1996677)Also succeeded, but the first one will report.
% 2.47/1.31 % (1996676)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4149177240:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.47/1.31 % (1996675)lrs+10_1_sil=8000:sp=occurrence:random_seed=1706896557:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.47/1.31 % (1996665)Refutation found. Thanks to Tanya!
% 2.47/1.31 % SZS status Theorem for theBenchmark
% 2.47/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.53 % (1996665)------------------------------
% 3.61/1.53 % (1996665)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.53 % (1996665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.53 % (1996665)CaDiCaL version: 2.1.3
% 3.61/1.53 % (1996665)Termination reason: Refutation
% 3.61/1.53 % (1996665)Time elapsed: 0.008 s
% 3.61/1.53 % (1996665)Peak memory usage: 88 MB
% 3.61/1.53 % (1996665)Instructions burned: 11 (million)
% 3.61/1.53 % (1996665)------------------------------
% 3.61/1.53 % (1996665)------------------------------
% 3.61/1.53 % (1996656)Success in time 0.411 s
% 3.61/1.53 % Vampire exiting
%------------------------------------------------------------------------------