%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU192+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:39 PM UTC 2026
% Result : Theorem 1.64s 1.14s
% Output : Refutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 57 ( 7 unt; 0 def)
% Number of atoms : 269 ( 23 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 364 ( 152 ~; 151 |; 44 &)
% ( 10 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 164 ( 141 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( relation(X2)
=> ( X2 = relation_dom_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_relat_1) ).
fof(f5,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f12,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f30,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t86_relat_1) ).
fof(f31,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f33,plain,
? [X0,X1,X2] :
( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<~> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) )
& relation(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f36,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f37,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = relation_dom_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) ) ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f42,plain,
! [X0] :
( ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f44,plain,
? [X0,X1,X2] :
( ( ~ in(X0,X1)
| ~ in(X0,relation_dom(X2))
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& relation(X2) ),
inference(nnf_transformation,[],[f33]) ).
fof(f45,plain,
? [X0,X1,X2] :
( ( ~ in(X0,X1)
| ~ in(X0,relation_dom(X2))
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& relation(X2) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ( ~ in(sK0,sK1)
| ~ in(sK0,relation_dom(sK2))
| ~ in(sK0,relation_dom(relation_dom_restriction(sK2,sK1))) )
& ( ( in(sK0,sK1)
& in(sK0,relation_dom(sK2)) )
| in(sK0,relation_dom(relation_dom_restriction(sK2,sK1))) )
& relation(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f45]) ).
fof(f47,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = relation_dom_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X0) )
& ( ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f37]) ).
fof(f48,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = relation_dom_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X0) )
& ( ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(flattening,[],[f47]) ).
fof(f49,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = relation_dom_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X3,X1)
& in(ordered_pair(X3,X4),X0) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0) )
& ( ( in(X5,X1)
& in(ordered_pair(X5,X6),X0) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(rectify,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = relation_dom_restriction(X0,X1)
| ( ( ~ in(sK3(X0,X1,X2),X1)
| ~ in(ordered_pair(sK3(X0,X1,X2),sK4(X0,X1,X2)),X0)
| ~ in(ordered_pair(sK3(X0,X1,X2),sK4(X0,X1,X2)),X2) )
& ( ( in(sK3(X0,X1,X2),X1)
& in(ordered_pair(sK3(X0,X1,X2),sK4(X0,X1,X2)),X0) )
| in(ordered_pair(sK3(X0,X1,X2),sK4(X0,X1,X2)),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0) )
& ( ( in(X5,X1)
& in(ordered_pair(X5,X6),X0) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X3,sK3(X0,X1,X2)),skolemize(X4,sK4(X0,X1,X2))],[f49]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f42]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f53]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ( ( ! [X3] : ~ in(ordered_pair(sK7(X0,X1),X3),X0)
| ~ in(sK7(X0,X1),X1) )
& ( in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0)
| in(sK7(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK9(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X2,sK7(X0,X1)),skolemize(X4,sK8(X0,X1)),skolemize(X7,sK9(X0,X5))],[f54]) ).
fof(f58,plain,
relation(sK2),
inference(cnf_transformation,[],[f46]) ).
fof(f59,plain,
( in(sK0,relation_dom(relation_dom_restriction(sK2,sK1)))
| in(sK0,relation_dom(sK2)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f60,plain,
( in(sK0,relation_dom(relation_dom_restriction(sK2,sK1)))
| in(sK0,sK1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f61,plain,
( ~ in(sK0,relation_dom(relation_dom_restriction(sK2,sK1)))
| ~ in(sK0,relation_dom(sK2))
| ~ in(sK0,sK1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f64,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f65,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X5,X6),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f66,plain,
! [X2,X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f67,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X2)
| ~ in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f79,plain,
! [X0,X1,X5] :
( in(ordered_pair(X5,sK9(X0,X5)),X0)
| ~ in(X5,X1)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f80,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f87,plain,
! [X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| ~ in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f67]) ).
fof(f88,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f66]) ).
fof(f89,plain,
! [X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f65]) ).
fof(f90,plain,
! [X0,X6,X5] :
( ~ in(ordered_pair(X5,X6),X0)
| in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f80]) ).
fof(f91,plain,
! [X0,X5] :
( in(ordered_pair(X5,sK9(X0,X5)),X0)
| ~ in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f79]) ).
fof(f114,plain,
! [X0,X1,X6,X5] :
( ~ in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| in(X5,X1)
| ~ relation(X0) ),
inference(forward_subsumption_resolution,[],[f88,f64]) ).
fof(f115,plain,
! [X2,X0,X1] :
( in(X0,X1)
| ~ relation(X2)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ relation(relation_dom_restriction(X2,X1)) ),
inference(resolution,[],[f114,f91]) ).
fof(f116,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ relation(X2)
| in(X0,X1) ),
inference(forward_subsumption_resolution,[],[f115,f64]) ).
fof(f119,plain,
( ~ relation(sK2)
| in(sK0,sK1)
| in(sK0,sK1) ),
inference(resolution,[],[f116,f60]) ).
fof(f121,plain,
( ~ relation(sK2)
| in(sK0,sK1) ),
inference(duplicate_literal_removal,[],[f119]) ).
fof(f122,plain,
in(sK0,sK1),
inference(forward_subsumption_resolution,[],[f121,f58]) ).
fof(f128,plain,
! [X0,X1,X6,X5] :
( ~ in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| in(ordered_pair(X5,X6),X0)
| ~ relation(X0) ),
inference(forward_subsumption_resolution,[],[f89,f64]) ).
fof(f129,plain,
! [X2,X0,X1] :
( in(ordered_pair(X0,sK9(relation_dom_restriction(X1,X2),X0)),X1)
| ~ relation(X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2)) ),
inference(resolution,[],[f128,f91]) ).
fof(f130,plain,
! [X2,X0,X1] :
( in(ordered_pair(X0,sK9(relation_dom_restriction(X1,X2),X0)),X1)
| ~ relation(X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(forward_subsumption_resolution,[],[f129,f64]) ).
fof(f175,plain,
! [X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),relation_dom_restriction(X0,X1))
| ~ in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ relation(X0) ),
inference(forward_subsumption_resolution,[],[f87,f64]) ).
fof(f232,plain,
! [X2,X3,X0,X1] :
( ~ in(X0,X1)
| ~ in(ordered_pair(X0,X2),X3)
| ~ relation(X3)
| in(X0,relation_dom(relation_dom_restriction(X3,X1)))
| ~ relation(relation_dom_restriction(X3,X1)) ),
inference(resolution,[],[f175,f90]) ).
fof(f239,plain,
! [X2,X3,X0,X1] :
( in(X0,relation_dom(relation_dom_restriction(X3,X1)))
| ~ in(ordered_pair(X0,X2),X3)
| ~ relation(X3)
| ~ in(X0,X1) ),
inference(forward_subsumption_resolution,[],[f232,f64]) ).
fof(f568,plain,
! [X0] :
( ~ in(ordered_pair(sK0,X0),sK2)
| ~ relation(sK2)
| ~ in(sK0,sK1)
| ~ in(sK0,relation_dom(sK2))
| ~ in(sK0,sK1) ),
inference(resolution,[],[f239,f61]) ).
fof(f577,plain,
! [X0] :
( ~ in(ordered_pair(sK0,X0),sK2)
| ~ relation(sK2)
| ~ in(sK0,sK1)
| ~ in(sK0,relation_dom(sK2)) ),
inference(duplicate_literal_removal,[],[f568]) ).
fof(f580,plain,
! [X0] :
( ~ in(ordered_pair(sK0,X0),sK2)
| ~ relation(sK2)
| ~ in(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f577,f90]) ).
fof(f581,plain,
! [X0] :
( ~ in(ordered_pair(sK0,X0),sK2)
| ~ in(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f580,f58]) ).
fof(f582,plain,
! [X0] : ~ in(ordered_pair(sK0,X0),sK2),
inference(forward_subsumption_resolution,[],[f581,f122]) ).
fof(f583,plain,
( ~ in(sK0,relation_dom(sK2))
| ~ relation(sK2) ),
inference(resolution,[],[f582,f91]) ).
fof(f584,plain,
~ in(sK0,relation_dom(sK2)),
inference(forward_subsumption_resolution,[],[f583,f58]) ).
fof(f606,plain,
! [X0] :
( ~ relation(sK2)
| ~ in(sK0,relation_dom(relation_dom_restriction(sK2,X0))) ),
inference(resolution,[],[f130,f582]) ).
fof(f623,plain,
! [X0] : ~ in(sK0,relation_dom(relation_dom_restriction(sK2,X0))),
inference(forward_subsumption_resolution,[],[f606,f58]) ).
fof(f626,plain,
in(sK0,relation_dom(sK2)),
inference(resolution,[],[f623,f59]) ).
fof(f635,plain,
$false,
inference(forward_subsumption_resolution,[],[f626,f584]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU192+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n026.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 04:00:57 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 1.64/1.14 % (3446867)Detected formulas, will run a generic FOF schedule.
% 1.64/1.14 % (3446876)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2966062421:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.64/1.14 % (3446876)First to succeed.
% 1.64/1.14 % (3446876)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3446867"
% 1.64/1.14 % (3446874)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=3404080039:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.64/1.14 % (3446872)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=741486719:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.64/1.14 % (3446875)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1239593636:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.64/1.14 % (3446873)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=510355966:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.64/1.14 % (3446877)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2589818540:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.64/1.14 % (3446875)Refutation not found, incomplete strategy
% 1.64/1.14 % (3446875)------------------------------
% 1.64/1.14 % (3446875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.64/1.14 % (3446875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/1.14 % (3446875)CaDiCaL version: 2.1.3
% 1.64/1.14 % (3446875)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.14 % (3446875)Time elapsed: 0.002 s
% 1.64/1.14 % (3446875)Peak memory usage: 88 MB
% 1.64/1.14 % (3446875)Instructions burned: 2 (million)
% 1.64/1.14 % (3446878)dis-21_1_sil=8000:lcm=predicate:random_seed=3173652251: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)
% 1.64/1.14 % (3446877)Also succeeded, but the first one will report.
% 1.64/1.14 % (3446878)Also succeeded, but the first one will report.
% 1.64/1.14 % (3446876)Refutation found. Thanks to Tanya!
% 1.64/1.14 % SZS status Theorem for theBenchmark
% 1.64/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 2.56/1.34 % (3446876)------------------------------
% 2.56/1.34 % (3446876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.34 % (3446876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.34 % (3446876)CaDiCaL version: 2.1.3
% 2.56/1.34 % (3446876)Termination reason: Refutation
% 2.56/1.34 % (3446876)Time elapsed: 0.007 s
% 2.56/1.34 % (3446876)Peak memory usage: 88 MB
% 2.56/1.34 % (3446876)Instructions burned: 19 (million)
% 2.56/1.34 % (3446876)------------------------------
% 2.56/1.34 % (3446876)------------------------------
% 2.56/1.34 % (3446867)Success in time 0.283 s
% 2.56/1.34 % Vampire exiting
%------------------------------------------------------------------------------