%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU225+3 : 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 : n014.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:51 PM UTC 2026
% Result : Theorem 2.58s 1.30s
% Output : Refutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 60 ( 8 unt; 0 def)
% Number of atoms : 286 ( 65 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 382 ( 156 ~; 154 |; 47 &)
% ( 12 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 99 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ! [X1,X2] :
( ( in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) )
& ( ~ in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> X2 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f9,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f19,axiom,
! [X0,X1] :
( ( relation(X0)
& function(X0) )
=> ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_funct_1) ).
fof(f42,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f49,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& relation(X2)
& function(X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f50,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& relation(X2)
& function(X2) ),
inference(flattening,[],[f49]) ).
fof(f55,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f56,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f58,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f57]) ).
fof(f60,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f61,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(flattening,[],[f65]) ).
fof(f71,plain,
( apply(relation_dom_restriction(sK2,sK0),sK1) != apply(sK2,sK1)
& in(sK1,sK0)
& relation(sK2)
& function(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f50]) ).
fof(f74,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(nnf_transformation,[],[f56]) ).
fof(f75,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(rectify,[],[f75]) ).
fof(f77,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ( apply(X1,sK5(X1,X2)) != apply(X2,sK5(X1,X2))
& in(sK5(X1,X2),relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X1,X2))],[f76]) ).
fof(f78,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( X2 = apply(X0,X1)
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) )
& ( ( ( X2 = apply(X0,X1)
| empty_set != X2 )
& ( X2 = empty_set
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(nnf_transformation,[],[f58]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X0) )
& ( ( in(X1,relation_dom(X2))
& in(X1,X0) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(nnf_transformation,[],[f66]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X0) )
& ( ( in(X1,relation_dom(X2))
& in(X1,X0) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
function(sK2),
inference(cnf_transformation,[],[f71]) ).
fof(f86,plain,
relation(sK2),
inference(cnf_transformation,[],[f71]) ).
fof(f87,plain,
in(sK1,sK0),
inference(cnf_transformation,[],[f71]) ).
fof(f88,plain,
apply(relation_dom_restriction(sK2,sK0),sK1) != apply(sK2,sK1),
inference(cnf_transformation,[],[f71]) ).
fof(f98,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f103,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| empty_set != X2
| in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f111,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f113,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f122,plain,
! [X2,X0,X1] :
( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X0)
| ~ relation(X2)
| ~ function(X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f132,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2)
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f98]) ).
fof(f134,plain,
! [X0,X1] :
( apply(X0,X1) = empty_set
| in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(equality_resolution,[],[f103]) ).
fof(f175,plain,
( empty_set != apply(sK2,sK1)
| in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(relation_dom_restriction(sK2,sK0))
| ~ function(relation_dom_restriction(sK2,sK0)) ),
inference(superposition,[],[f88,f134]) ).
fof(f176,plain,
( empty_set != empty_set
| in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(relation_dom_restriction(sK2,sK0))
| ~ function(relation_dom_restriction(sK2,sK0))
| in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(superposition,[],[f175,f134]) ).
fof(f177,plain,
( in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(relation_dom_restriction(sK2,sK0))
| ~ function(relation_dom_restriction(sK2,sK0))
| in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(trivial_inequality_removal,[],[f176]) ).
fof(f178,plain,
( in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(relation_dom_restriction(sK2,sK0))
| in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f177,f113]) ).
fof(f179,plain,
( in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f178,f111]) ).
fof(f180,plain,
( in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| in(sK1,relation_dom(sK2))
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f179,f86]) ).
fof(f181,plain,
( in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| in(sK1,relation_dom(sK2)) ),
inference(forward_subsumption_resolution,[],[f180,f85]) ).
fof(f186,plain,
( in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2)
| in(sK1,relation_dom(sK2)) ),
inference(resolution,[],[f121,f181]) ).
fof(f187,plain,
( in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f188,plain,
( in(sK1,relation_dom(sK2))
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f187,f86]) ).
fof(f189,plain,
in(sK1,relation_dom(sK2)),
inference(forward_subsumption_resolution,[],[f188,f85]) ).
fof(f254,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2)
| ~ function(relation_dom_restriction(X2,X0)) ),
inference(forward_subsumption_resolution,[],[f132,f113]) ).
fof(f255,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2) ),
inference(forward_subsumption_resolution,[],[f254,f111]) ).
fof(f260,plain,
( apply(sK2,sK1) != apply(sK2,sK1)
| ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(superposition,[],[f88,f255]) ).
fof(f264,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(sK2)
| ~ function(sK2) ),
inference(trivial_inequality_removal,[],[f260]) ).
fof(f266,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f264,f86]) ).
fof(f268,plain,
~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0))),
inference(forward_subsumption_resolution,[],[f266,f85]) ).
fof(f270,plain,
( ~ in(sK1,relation_dom(sK2))
| ~ in(sK1,sK0)
| ~ relation(sK2)
| ~ function(sK2) ),
inference(resolution,[],[f268,f122]) ).
fof(f273,plain,
( ~ in(sK1,sK0)
| ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f270,f189]) ).
fof(f275,plain,
( ~ relation(sK2)
| ~ function(sK2) ),
inference(forward_subsumption_resolution,[],[f273,f87]) ).
fof(f277,plain,
~ function(sK2),
inference(forward_subsumption_resolution,[],[f275,f86]) ).
fof(f278,plain,
$false,
inference(forward_subsumption_resolution,[],[f277,f85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU225+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.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:09:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.58/1.30 % (1424171)Detected formulas, will run a generic FOF schedule.
% 2.58/1.30 % (1424179)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2281278022:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.58/1.30 % (1424179)Refutation not found, incomplete strategy
% 2.58/1.30 % (1424179)------------------------------
% 2.58/1.30 % (1424179)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.30 % (1424179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.30 % (1424179)CaDiCaL version: 2.1.3
% 2.58/1.30 % (1424179)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.30 % (1424179)Time elapsed: 0.002 s
% 2.58/1.30 % (1424179)Peak memory usage: 88 MB
% 2.58/1.30 % (1424179)Instructions burned: 3 (million)
% 2.58/1.30 % (1424178)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=836054941:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.58/1.30 % (1424176)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=2449745649:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.58/1.30 % (1424177)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=1601808316:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.58/1.30 % (1424181)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=10438464:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.58/1.30 % (1424180)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1026581171:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.58/1.30 % (1424182)dis-21_1_sil=8000:lcm=predicate:random_seed=2622357677: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.58/1.30 % (1424180)First to succeed.
% 2.58/1.30 % (1424180)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1424171"
% 2.58/1.30 % (1424181)Also succeeded, but the first one will report.
% 2.58/1.30 % (1424182)Instruction limit reached!
% 2.58/1.30 % (1424182)------------------------------
% 2.58/1.30 % (1424182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.30 % (1424182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.30 % (1424182)CaDiCaL version: 2.1.3
% 2.58/1.30 % (1424182)Termination reason: Instruction limit
% 2.58/1.30 % (1424182)Termination phase: Saturation
% 2.58/1.30 % (1424182)Time elapsed: 0.080 s
% 2.58/1.30 % (1424182)Peak memory usage: 90 MB
% 2.58/1.30 % (1424182)Instructions burned: 129 (million)
% 2.58/1.30 % (1424179)------------------------------
% 2.58/1.30 % (1424179)------------------------------
% 2.58/1.30 % (1424191)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2704645389:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.58/1.30 % (1424191)Also succeeded, but the first one will report.
% 2.58/1.30 % (1424190)lrs+10_1_sil=8000:sp=occurrence:random_seed=4089556662:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.58/1.30 % (1424180)Refutation found. Thanks to Tanya!
% 2.58/1.30 % SZS status Theorem for theBenchmark
% 2.58/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.71/1.49 % (1424180)------------------------------
% 3.71/1.49 % (1424180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/1.49 % (1424180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/1.49 % (1424180)CaDiCaL version: 2.1.3
% 3.71/1.49 % (1424180)Termination reason: Refutation
% 3.71/1.49 % (1424180)Time elapsed: 0.008 s
% 3.71/1.49 % (1424180)Peak memory usage: 88 MB
% 3.71/1.49 % (1424180)Instructions burned: 10 (million)
% 3.71/1.49 % (1424180)------------------------------
% 3.71/1.49 % (1424180)------------------------------
% 3.71/1.49 % (1424171)Success in time 0.451 s
% 3.71/1.49 % Vampire exiting
%------------------------------------------------------------------------------