%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV582+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:58:23 PM UTC 2026
% Result : Theorem 4.05s 1.47s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 71 ( 26 unt; 4 def)
% Number of atoms : 148 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 141 ( 64 ~; 57 |; 11 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 70 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( mem(X2,X0)
=> mem(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subq_def) ).
fof(f5,axiom,
! [X0,X1] :
( mem(X0,s(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_ax) ).
fof(f6,axiom,
! [X0,X1,X2] :
( mem(X0,u(X1,X2))
<=> ( mem(X0,X1)
| mem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_ax) ).
fof(f8,axiom,
! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_def) ).
fof(f26,conjecture,
subq(u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subq_402_33170) ).
fof(f27,negated_conjecture,
~ subq(u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),
inference(negated_conjecture,[status(cth)],[f26]) ).
fof(f28,plain,
~ subq(u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( mem(X2,X1)
| ~ mem(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f32,plain,
! [X0,X1] :
( ( subq(X0,X1)
| ? [X2] :
( ~ mem(X2,X1)
& mem(X2,X0) ) )
& ( ! [X2] :
( mem(X2,X1)
| ~ mem(X2,X0) )
| ~ subq(X0,X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f33,plain,
! [X0,X1] :
( ( subq(X0,X1)
| ? [X2] :
( ~ mem(X2,X1)
& mem(X2,X0) ) )
& ( ! [X3] :
( mem(X3,X1)
| ~ mem(X3,X0) )
| ~ subq(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( subq(X0,X1)
| ( ~ mem(sK0(X0,X1),X1)
& mem(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( mem(X3,X1)
| ~ mem(X3,X0) )
| ~ subq(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( mem(X0,s(X1))
| X0 != X1 )
& ( X0 = X1
| ~ mem(X0,s(X1)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( mem(X0,u(X1,X2))
| ( ~ mem(X0,X1)
& ~ mem(X0,X2) ) )
& ( mem(X0,X1)
| mem(X0,X2)
| ~ mem(X0,u(X1,X2)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( mem(X0,u(X1,X2))
| ( ~ mem(X0,X1)
& ~ mem(X0,X2) ) )
& ( mem(X0,X1)
| mem(X0,X2)
| ~ mem(X0,u(X1,X2)) ) ),
inference(flattening,[],[f36]) ).
fof(f42,plain,
! [X0,X1] :
( subq(X0,X1)
| mem(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f43,plain,
! [X0,X1] :
( ~ mem(sK0(X0,X1),X1)
| subq(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f46,plain,
! [X0,X1] :
( ~ mem(X0,s(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f47,plain,
! [X0,X1] :
( mem(X0,s(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ mem(X0,u(X1,X2))
| mem(X0,X2)
| mem(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f49,plain,
! [X2,X0,X1] :
( mem(X0,u(X1,X2))
| ~ mem(X0,X2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f50,plain,
! [X2,X0,X1] :
( mem(X0,u(X1,X2))
| ~ mem(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
inference(cnf_transformation,[],[f8]) ).
fof(f58,plain,
~ subq(u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),
inference(cnf_transformation,[],[f28]) ).
fof(f59,plain,
! [X1] : mem(X1,s(X1)),
inference(equality_resolution,[],[f47]) ).
fof(f61,plain,
mem(sK0(u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),u(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(s(n(n(e)))))),
inference(resolution,[],[f42,f58]) ).
fof(f63,plain,
! [X2,X0,X1] :
( subq(X0,u(X1,X2))
| ~ mem(sK0(X0,u(X1,X2)),X2) ),
inference(resolution,[],[f49,f43]) ).
fof(f64,plain,
! [X2,X0,X1] :
( subq(X0,u(X1,X2))
| ~ mem(sK0(X0,u(X1,X2)),X1) ),
inference(resolution,[],[f50,f43]) ).
fof(f65,plain,
! [X2,X0,X1] :
( mem(X2,a(X0,X1))
| ~ mem(X2,X0) ),
inference(superposition,[],[f50,f54]) ).
fof(f66,plain,
! [X2,X0,X1] :
( ~ mem(X2,s(X1))
| mem(X2,a(X0,X1)) ),
inference(superposition,[],[f49,f54]) ).
fof(f67,plain,
mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e))))),
inference(superposition,[],[f61,f54]) ).
fof(f68,plain,
~ subq(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),
inference(superposition,[],[f58,f54]) ).
fof(f76,plain,
! [X2,X0,X1] :
( mem(X2,s(X1))
| ~ mem(X2,a(X0,X1))
| mem(X2,X0) ),
inference(superposition,[],[f48,f54]) ).
fof(f84,definition,
( spl1_2
<=> mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e)))))) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f86,plain,
( mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f93,plain,
! [X0,X1] : mem(X0,a(X1,X0)),
inference(resolution,[],[f66,f59]) ).
fof(f118,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(s(n(e)),p(n(n(e))))),
inference(resolution,[],[f63,f68]) ).
fof(f121,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),s(n(e))),
inference(resolution,[],[f118,f65]) ).
fof(f127,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e)))))),
inference(resolution,[],[f64,f68]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ mem(X0,a(X1,X2))
| mem(X0,X1)
| X0 = X2 ),
inference(resolution,[],[f76,f46]) ).
fof(f134,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),s(u(n(e),n(s(n(e)))))),
inference(resolution,[],[f127,f50]) ).
fof(f135,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(s(s(s(n(e)))),s(n(n(e))))),
inference(resolution,[],[f127,f49]) ).
fof(f137,plain,
~ mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),s(s(s(n(e))))),
inference(resolution,[],[f135,f65]) ).
fof(f140,plain,
( mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))))
| s(n(n(e))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))) ),
inference(resolution,[],[f131,f67]) ).
fof(f141,plain,
( mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(s(n(e)),s(s(n(e)))))
| u(n(e),n(s(n(e)))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e))))))
| ~ spl1_2 ),
inference(resolution,[],[f131,f86]) ).
fof(f145,definition,
( spl1_3
<=> u(n(e),n(s(n(e)))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f147,plain,
( u(n(e),n(s(n(e)))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e))))))
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f149,definition,
( spl1_4
<=> mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(s(n(e)),s(s(n(e))))) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f151,plain,
( mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),a(s(n(e)),s(s(n(e)))))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f152,plain,
( spl1_3
| spl1_4
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f141,f84,f149,f145]) ).
fof(f164,plain,
( ~ mem(u(n(e),n(s(n(e)))),s(u(n(e),n(s(n(e))))))
| ~ spl1_3 ),
inference(superposition,[],[f134,f147]) ).
fof(f178,plain,
( $false
| ~ spl1_3 ),
inference(forward_subsumption_resolution,[],[f164,f59]) ).
fof(f179,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f178]) ).
fof(f184,plain,
( mem(sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))),s(n(e)))
| s(s(n(e))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e))))))
| ~ spl1_4 ),
inference(resolution,[],[f151,f131]) ).
fof(f185,plain,
( s(s(n(e))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e))))))
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f184,f121]) ).
fof(f196,plain,
( ~ mem(s(s(n(e))),s(s(s(n(e)))))
| ~ spl1_4 ),
inference(superposition,[],[f137,f185]) ).
fof(f207,plain,
( $false
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f196,f59]) ).
fof(f208,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f207]) ).
fof(f211,definition,
( spl1_8
<=> s(n(n(e))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e)))))) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f213,plain,
( s(n(n(e))) = sK0(a(a(a(s(n(e)),s(s(n(e)))),u(n(e),n(s(n(e))))),s(n(n(e)))),u(u(s(u(n(e),n(s(n(e))))),a(s(s(s(n(e)))),s(n(n(e))))),a(s(n(e)),p(n(n(e))))))
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f214,plain,
( spl1_8
| spl1_2 ),
inference(avatar_split_clause,[],[f140,f84,f211]) ).
fof(f224,plain,
( ~ mem(s(n(n(e))),a(s(s(s(n(e)))),s(n(n(e)))))
| ~ spl1_8 ),
inference(superposition,[],[f135,f213]) ).
fof(f230,plain,
( $false
| ~ spl1_8 ),
inference(forward_subsumption_resolution,[],[f224,f93]) ).
fof(f231,plain,
~ spl1_8,
inference(avatar_contradiction_clause,[],[f230]) ).
cnf(s2,plain,
( ~ spl1_2
| spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f152]) ).
cnf(s4,plain,
~ spl1_3,
inference(sat_conversion,[],[f179]) ).
cnf(s7,plain,
~ spl1_4,
inference(sat_conversion,[],[f208]) ).
cnf(s9,plain,
( spl1_2
| spl1_8 ),
inference(sat_conversion,[],[f214]) ).
cnf(s11,plain,
~ spl1_8,
inference(sat_conversion,[],[f231]) ).
cnf(s13,plain,
spl1_2,
inference(rat,[],[s9,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s2,s7,s4,s13]) ).
fof(f232,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV582+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n006.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 28 06:38:25 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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
% 4.05/1.47 % (3771344)Detected formulas, will run a generic FOF schedule.
% 4.05/1.47 % (3771357)dis-21_1_sil=8000:lcm=predicate:random_seed=131352537: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)
% 4.05/1.47 % (3771356)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4231674348:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.05/1.47 % (3771351)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=3897054307:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.05/1.47 % (3771354)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3149596994:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.05/1.47 % (3771355)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3138713629:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.05/1.47 % (3771352)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=3592942094:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.05/1.47 % (3771353)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=2643812538:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.05/1.47 % (3771354)Refutation not found, incomplete strategy
% 4.05/1.47 % (3771354)------------------------------
% 4.05/1.47 % (3771354)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.05/1.47 % (3771354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/1.47 % (3771354)CaDiCaL version: 2.1.3
% 4.05/1.47 % (3771354)Termination reason: Refutation not found, incomplete strategy
% 4.05/1.47 % (3771354)Time elapsed: 0.002 s
% 4.05/1.47 % (3771354)Peak memory usage: 88 MB
% 4.05/1.47 % (3771354)Instructions burned: 1 (million)
% 4.05/1.47 % (3771356)First to succeed.
% 4.05/1.47 % (3771356)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3771344"
% 4.05/1.47 % (3771357)Instruction limit reached!
% 4.05/1.47 % (3771357)------------------------------
% 4.05/1.47 % (3771357)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.05/1.47 % (3771357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/1.47 % (3771357)CaDiCaL version: 2.1.3
% 4.05/1.47 % (3771357)Termination reason: Instruction limit
% 4.05/1.47 % (3771357)Termination phase: Saturation
% 4.05/1.47 % (3771357)Time elapsed: 0.060 s
% 4.05/1.47 % (3771357)Peak memory usage: 89 MB
% 4.05/1.47 % (3771357)Instructions burned: 131 (million)
% 4.05/1.47 % (3771355)Instruction limit reached!
% 4.05/1.47 % (3771355)------------------------------
% 4.05/1.47 % (3771355)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.05/1.47 % (3771355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.05/1.47 % (3771355)CaDiCaL version: 2.1.3
% 4.05/1.47 % (3771355)Termination reason: Instruction limit
% 4.05/1.47 % (3771355)Termination phase: Saturation
% 4.05/1.47 % (3771355)Time elapsed: 0.121 s
% 4.05/1.47 % (3771355)Peak memory usage: 88 MB
% 4.05/1.47 % (3771355)Instructions burned: 120 (million)
% 4.05/1.47 % (3771365)lrs+10_1_sil=8000:sp=occurrence:random_seed=397203129:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.05/1.47 % (3771366)lrs+10_1_sil=32000:urr=on:br=off:random_seed=561986604:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 4.05/1.47 % (3771354)------------------------------
% 4.05/1.47 % (3771354)------------------------------
% 4.05/1.47 % (3771356)Refutation found. Thanks to Tanya!
% 4.05/1.47 % SZS status Theorem for theBenchmark
% 4.05/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/1.71 % (3771356)------------------------------
% 0.26/1.71 % (3771356)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.26/1.71 % (3771356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/1.71 % (3771356)CaDiCaL version: 2.1.3
% 0.26/1.71 % (3771356)Termination reason: Refutation
% 0.26/1.71 % (3771356)Time elapsed: 0.018 s
% 0.26/1.71 % (3771356)Peak memory usage: 90 MB
% 0.26/1.71 % (3771356)Instructions burned: 17 (million)
% 0.26/1.71 % (3771356)------------------------------
% 0.26/1.71 % (3771356)------------------------------
% 0.26/1.71 % (3771344)Success in time 0.654 s
% 0.26/1.71 % Vampire exiting
%------------------------------------------------------------------------------