%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV580+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 2.60s 1.08s
% Output : Refutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 8
% Syntax : Number of formulae : 69 ( 23 unt; 2 def)
% Number of atoms : 148 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 144 ( 65 ~; 59 |; 12 &)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 73 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( mem(X2,X0)
=> mem(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subq_def) ).
fof(f5,axiom,
! [X0,X1] :
( mem(X0,s(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',u_ax) ).
fof(f8,axiom,
! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_def) ).
fof(f10,axiom,
! [X0,X1] :
( mem(X0,p(X1))
<=> subq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_ax) ).
fof(f26,conjecture,
subq(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subq_2456_2457) ).
fof(f27,negated_conjecture,
~ subq(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e)))))),
inference(negated_conjecture,[status(cth)],[f26]) ).
fof(f28,plain,
~ subq(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),s(n(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(f40,plain,
! [X0,X1] :
( ( mem(X0,p(X1))
| ~ subq(X0,X1) )
& ( subq(X0,X1)
| ~ mem(X0,p(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
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(f57,plain,
! [X0,X1] :
( ~ subq(X0,X1)
| mem(X0,p(X1)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
~ subq(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e)))))),
inference(cnf_transformation,[],[f28]) ).
fof(f59,plain,
! [X1] : mem(X1,s(X1)),
inference(equality_resolution,[],[f47]) ).
fof(f62,plain,
! [X0,X1] :
( mem(X0,p(X1))
| mem(sK0(X0,X1),X0) ),
inference(resolution,[],[f42,f57]) ).
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(f68,plain,
~ subq(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),
inference(superposition,[],[f58,f54]) ).
fof(f69,plain,
~ subq(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),
inference(forward_demodulation,[],[f68,f54]) ).
fof(f71,plain,
mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),
inference(resolution,[],[f69,f42]) ).
fof(f77,plain,
! [X2,X0,X1] :
( mem(X2,s(X1))
| ~ mem(X2,a(X0,X1))
| mem(X2,X0) ),
inference(superposition,[],[f48,f54]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ mem(sK0(X2,a(X0,X1)),s(X1))
| subq(X2,a(X0,X1)) ),
inference(superposition,[],[f63,f54]) ).
fof(f111,plain,
~ mem(sK0(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),u(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e)))))),u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e))))))),
inference(resolution,[],[f64,f58]) ).
fof(f117,plain,
~ mem(sK0(u(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),s(n(n(n(e))))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e))))))),
inference(forward_demodulation,[],[f111,f54]) ).
fof(f118,plain,
~ mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e))))))),
inference(forward_demodulation,[],[f117,f54]) ).
fof(f119,plain,
~ mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),s(u(n(e),n(s(n(e)))))),
inference(resolution,[],[f118,f50]) ).
fof(f120,plain,
~ mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),
inference(resolution,[],[f118,f49]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ mem(X0,a(X1,X2))
| mem(X0,X1)
| X0 = X2 ),
inference(resolution,[],[f77,f46]) ).
fof(f128,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))))
| n(n(n(e))) = sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))) ),
inference(resolution,[],[f122,f71]) ).
fof(f132,definition,
( spl1_1
<=> n(n(n(e))) = sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f134,plain,
( n(n(n(e))) = sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))))
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f136,definition,
( spl1_2
<=> mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e))))))) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f138,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f136]) ).
fof(f139,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f128,f136,f132]) ).
fof(f140,plain,
~ mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),p(s(s(n(e))))),
inference(resolution,[],[f120,f50]) ).
fof(f141,plain,
~ mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),n(s(n(n(e))))),
inference(resolution,[],[f120,f49]) ).
fof(f156,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e))))))
| mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),s(u(n(e),n(s(n(e))))))
| ~ spl1_2 ),
inference(resolution,[],[f138,f48]) ).
fof(f157,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e))))))
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f156,f119]) ).
fof(f169,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),n(s(n(n(e)))))
| mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),s(s(s(n(e)))))
| ~ spl1_2 ),
inference(resolution,[],[f157,f48]) ).
fof(f170,plain,
( mem(sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e))))),s(s(s(n(e)))))
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f169,f141]) ).
fof(f176,plain,
( s(s(n(e))) = sK0(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))))
| ~ spl1_2 ),
inference(resolution,[],[f170,f46]) ).
fof(f191,plain,
( ~ mem(s(s(n(e))),p(s(s(n(e)))))
| ~ spl1_2 ),
inference(superposition,[],[f140,f176]) ).
fof(f231,plain,
( mem(sK0(s(s(n(e))),s(s(n(e)))),s(s(n(e))))
| ~ spl1_2 ),
inference(resolution,[],[f191,f62]) ).
fof(f252,plain,
( subq(s(s(n(e))),s(s(n(e))))
| ~ spl1_2 ),
inference(resolution,[],[f231,f43]) ).
fof(f266,plain,
( mem(s(s(n(e))),p(s(s(n(e)))))
| ~ spl1_2 ),
inference(resolution,[],[f252,f57]) ).
fof(f267,plain,
( $false
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f266,f191]) ).
fof(f268,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f507,plain,
( ~ mem(n(n(n(e))),s(n(n(n(e)))))
| subq(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))))
| ~ spl1_1 ),
inference(superposition,[],[f108,f134]) ).
fof(f512,plain,
( subq(a(u(s(u(n(e),n(s(n(e))))),u(s(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))),a(u(s(u(n(e),n(s(n(e))))),u(p(s(s(n(e)))),n(s(n(n(e)))))),n(n(n(e)))))
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f507,f59]) ).
fof(f517,plain,
( $false
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f512,f69]) ).
fof(f518,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f517]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f139]) ).
cnf(s5,plain,
~ spl1_2,
inference(sat_conversion,[],[f268]) ).
cnf(s11,plain,
~ spl1_1,
inference(sat_conversion,[],[f518]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s1,s5,s11]) ).
fof(f519,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV580+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 % Computer : n008.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 06:39:40 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.08 % (2049077)Detected formulas, will run a generic FOF schedule.
% 2.60/1.08 % (2049082)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=2619545543:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.60/1.08 % (2049086)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2294000046:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.60/1.08 % (2049083)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=1856655918:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.60/1.08 % (2049085)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2367152028:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.60/1.08 % (2049088)dis-21_1_sil=8000:lcm=predicate:random_seed=2618209425: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.60/1.08 % (2049084)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=1973210337:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.60/1.08 % (2049085)Refutation not found, incomplete strategy
% 2.60/1.08 % (2049085)------------------------------
% 2.60/1.08 % (2049085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.08 % (2049085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.08 % (2049085)CaDiCaL version: 2.1.3
% 2.60/1.08 % (2049085)Termination reason: Refutation not found, incomplete strategy
% 2.60/1.08 % (2049085)Time elapsed: 0.001 s
% 2.60/1.08 % (2049085)Peak memory usage: 88 MB
% 2.60/1.08 % (2049087)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1434396556:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.60/1.08 % (2049087)First to succeed.
% 2.60/1.08 % (2049087)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2049077"
% 2.60/1.08 % (2049088)Instruction limit reached!
% 2.60/1.08 % (2049088)------------------------------
% 2.60/1.08 % (2049088)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.08 % (2049088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.08 % (2049088)CaDiCaL version: 2.1.3
% 2.60/1.08 % (2049088)Termination reason: Instruction limit
% 2.60/1.08 % (2049088)Termination phase: Saturation
% 2.60/1.08 % (2049088)Time elapsed: 0.064 s
% 2.60/1.08 % (2049088)Peak memory usage: 89 MB
% 2.60/1.08 % (2049088)Instructions burned: 130 (million)
% 2.60/1.08 % (2049086)Instruction limit reached!
% 2.60/1.08 % (2049086)------------------------------
% 2.60/1.08 % (2049086)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.08 % (2049086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.08 % (2049086)CaDiCaL version: 2.1.3
% 2.60/1.08 % (2049086)Termination reason: Instruction limit
% 2.60/1.08 % (2049086)Termination phase: Saturation
% 2.60/1.08 % (2049086)Time elapsed: 0.073 s
% 2.60/1.08 % (2049086)Peak memory usage: 88 MB
% 2.60/1.08 % (2049086)Instructions burned: 120 (million)
% 2.60/1.08 % (2049096)lrs+10_1_sil=8000:sp=occurrence:random_seed=501263625:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.60/1.08 % (2049097)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3307152721:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.60/1.08 % (2049085)------------------------------
% 2.60/1.08 % (2049085)------------------------------
% 2.60/1.08 % (2049097)Instruction limit reached!
% 2.60/1.08 % (2049097)------------------------------
% 2.60/1.08 % (2049097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.08 % (2049097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.08 % (2049097)CaDiCaL version: 2.1.3
% 2.60/1.08 % (2049097)Termination reason: Instruction limit
% 2.60/1.08 % (2049097)Termination phase: Saturation
% 2.60/1.08 % (2049097)Time elapsed: 0.073 s
% 2.60/1.08 % (2049097)Peak memory usage: 89 MB
% 2.60/1.08 % (2049097)Instructions burned: 157 (million)
% 2.60/1.08 % (2049087)Refutation found. Thanks to Tanya!
% 2.60/1.08 % SZS status Theorem for theBenchmark
% 2.60/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.54/1.27 % (2049087)------------------------------
% 3.54/1.27 % (2049087)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.27 % (2049087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.27 % (2049087)CaDiCaL version: 2.1.3
% 3.54/1.27 % (2049087)Termination reason: Refutation
% 3.54/1.27 % (2049087)Time elapsed: 0.022 s
% 3.54/1.27 % (2049087)Peak memory usage: 90 MB
% 3.54/1.27 % (2049087)Instructions burned: 31 (million)
% 3.54/1.27 % (2049087)------------------------------
% 3.54/1.27 % (2049087)------------------------------
% 3.54/1.27 % (2049077)Success in time 0.446 s
% 3.54/1.27 % Vampire exiting
%------------------------------------------------------------------------------