%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV396+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 : n001.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 01:09:06 PM UTC 2026
% Result : Theorem 4.73s 1.49s
% Output : Refutation 6.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 23
% Syntax : Number of formulae : 159 ( 26 unt; 9 def)
% Number of atoms : 469 ( 70 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 533 ( 223 ~; 241 |; 44 &)
% ( 13 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 10 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 260 ( 0 sgn 239 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
<=> ( contains_slb(X0,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax23) ).
fof(f12,axiom,
! [X0,X1,X2] : remove_slb(insert_slb(X0,pair(X1,X2)),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f13,axiom,
! [X0,X1,X2,X3] :
( ( X1 != X2
& contains_slb(X0,X2) )
=> remove_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(remove_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax25) ).
fof(f14,axiom,
! [X0,X1,X2] : lookup_slb(insert_slb(X0,pair(X1,X2)),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( ( X1 != X2
& contains_slb(X0,X2) )
=> lookup_slb(insert_slb(X0,pair(X1,X3)),X2) = lookup_slb(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax27) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax41) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
=> remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax43) ).
fof(f32,axiom,
! [X0,X1,X2,X3] :
( ( contains_slb(X1,X3)
& less_than(lookup_slb(X1,X3),X3) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax44) ).
fof(f33,axiom,
! [X0,X1,X2,X3] :
( ( contains_slb(X1,X3)
& strictly_less_than(X3,lookup_slb(X1,X3)) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(f42,conjecture,
! [X0] :
( ! [X1,X2,X3,X4] :
( ( pair_in_list(X0,X3,X4)
& strictly_less_than(X3,X4)
& ok(remove_cpq(triple(X1,X0,X2),X3)) )
=> pair_in_list(remove_slb(X0,X3),X3,X4) )
=> ! [X5,X6,X7,X8,X9,X10] :
( ( pair_in_list(insert_slb(X0,pair(X9,X10)),X7,X8)
& strictly_less_than(X7,X8)
& ok(remove_cpq(triple(X5,insert_slb(X0,pair(X9,X10)),X6),X7)) )
=> pair_in_list(remove_slb(insert_slb(X0,pair(X9,X10)),X7),X7,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_co) ).
fof(f43,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3,X4] :
( ( pair_in_list(X0,X3,X4)
& strictly_less_than(X3,X4)
& ok(remove_cpq(triple(X1,X0,X2),X3)) )
=> pair_in_list(remove_slb(X0,X3),X3,X4) )
=> ! [X5,X6,X7,X8,X9,X10] :
( ( pair_in_list(insert_slb(X0,pair(X9,X10)),X7,X8)
& strictly_less_than(X7,X8)
& ok(remove_cpq(triple(X5,insert_slb(X0,pair(X9,X10)),X6),X7)) )
=> pair_in_list(remove_slb(insert_slb(X0,pair(X9,X10)),X7),X7,X8) ) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f48,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f47]) ).
fof(f52,plain,
? [X0] :
( ? [X5,X6,X7,X8,X9,X10] :
( ~ pair_in_list(remove_slb(insert_slb(X0,pair(X9,X10)),X7),X7,X8)
& pair_in_list(insert_slb(X0,pair(X9,X10)),X7,X8)
& strictly_less_than(X7,X8)
& ok(remove_cpq(triple(X5,insert_slb(X0,pair(X9,X10)),X6),X7)) )
& ! [X1,X2,X3,X4] :
( pair_in_list(remove_slb(X0,X3),X3,X4)
| ~ pair_in_list(X0,X3,X4)
| ~ strictly_less_than(X3,X4)
| ~ ok(remove_cpq(triple(X1,X0,X2),X3)) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f53,plain,
? [X0] :
( ? [X5,X6,X7,X8,X9,X10] :
( ~ pair_in_list(remove_slb(insert_slb(X0,pair(X9,X10)),X7),X7,X8)
& pair_in_list(insert_slb(X0,pair(X9,X10)),X7,X8)
& strictly_less_than(X7,X8)
& ok(remove_cpq(triple(X5,insert_slb(X0,pair(X9,X10)),X6),X7)) )
& ! [X1,X2,X3,X4] :
( pair_in_list(remove_slb(X0,X3),X3,X4)
| ~ pair_in_list(X0,X3,X4)
| ~ strictly_less_than(X3,X4)
| ~ ok(remove_cpq(triple(X1,X0,X2),X3)) ) ),
inference(flattening,[],[f52]) ).
fof(f56,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,lookup_slb(X1,X3)) ),
inference(ennf_transformation,[],[f33]) ).
fof(f57,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,lookup_slb(X1,X3)) ),
inference(flattening,[],[f56]) ).
fof(f61,plain,
! [X0,X1,X2,X3] :
( lookup_slb(insert_slb(X0,pair(X1,X3)),X2) = lookup_slb(X0,X2)
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f62,plain,
! [X0,X1,X2,X3] :
( lookup_slb(insert_slb(X0,pair(X1,X3)),X2) = lookup_slb(X0,X2)
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
! [X0,X1,X2,X3] :
( remove_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(remove_slb(X0,X2),pair(X1,X3))
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f64,plain,
! [X0,X1,X2,X3] :
( remove_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(remove_slb(X0,X2),pair(X1,X3))
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ contains_slb(X1,X3)
| ~ less_than(lookup_slb(X1,X3),X3) ),
inference(ennf_transformation,[],[f32]) ).
fof(f66,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ contains_slb(X1,X3)
| ~ less_than(lookup_slb(X1,X3),X3) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
| contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f81,plain,
? [X0] :
( ? [X1,X2,X3,X4,X5,X6] :
( ~ pair_in_list(remove_slb(insert_slb(X0,pair(X5,X6)),X3),X3,X4)
& pair_in_list(insert_slb(X0,pair(X5,X6)),X3,X4)
& strictly_less_than(X3,X4)
& ok(remove_cpq(triple(X1,insert_slb(X0,pair(X5,X6)),X2),X3)) )
& ! [X7,X8,X9,X10] :
( pair_in_list(remove_slb(X0,X9),X9,X10)
| ~ pair_in_list(X0,X9,X10)
| ~ strictly_less_than(X9,X10)
| ~ ok(remove_cpq(triple(X7,X0,X8),X9)) ) ),
inference(rectify,[],[f53]) ).
fof(f82,plain,
( ~ pair_in_list(remove_slb(insert_slb(sK0,pair(sK5,sK6)),sK3),sK3,sK4)
& pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK3,sK4)
& strictly_less_than(sK3,sK4)
& ok(remove_cpq(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),sK2),sK3))
& ! [X7,X8,X9,X10] :
( pair_in_list(remove_slb(sK0,X9),X9,X10)
| ~ pair_in_list(sK0,X9,X10)
| ~ strictly_less_than(X9,X10)
| ~ ok(remove_cpq(triple(X7,sK0,X8),X9)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f81]) ).
fof(f83,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f84,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
! [X0,X1,X2,X3] :
( ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| ( ~ contains_slb(X0,X2)
& X1 != X2 ) )
& ( contains_slb(X0,X2)
| X1 = X2
| ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f86,plain,
! [X0,X1,X2,X3] :
( ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| ( ~ contains_slb(X0,X2)
& X1 != X2 ) )
& ( contains_slb(X0,X2)
| X1 = X2
| ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2) ) ),
inference(flattening,[],[f85]) ).
fof(f87,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f88,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f87]) ).
fof(f90,plain,
! [X10,X8,X9,X7] :
( ~ ok(remove_cpq(triple(X7,sK0,X8),X9))
| ~ pair_in_list(sK0,X9,X10)
| ~ strictly_less_than(X9,X10)
| pair_in_list(remove_slb(sK0,X9),X9,X10) ),
inference(cnf_transformation,[],[f82]) ).
fof(f91,plain,
ok(remove_cpq(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),sK2),sK3)),
inference(cnf_transformation,[],[f82]) ).
fof(f92,plain,
strictly_less_than(sK3,sK4),
inference(cnf_transformation,[],[f82]) ).
fof(f93,plain,
pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK3,sK4),
inference(cnf_transformation,[],[f82]) ).
fof(f94,plain,
~ pair_in_list(remove_slb(insert_slb(sK0,pair(sK5,sK6)),sK3),sK3,sK4),
inference(cnf_transformation,[],[f82]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,lookup_slb(X1,X3)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f101,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f103,plain,
! [X2,X3,X0,X1] :
( lookup_slb(insert_slb(X0,pair(X1,X3)),X2) = lookup_slb(X0,X2)
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(cnf_transformation,[],[f62]) ).
fof(f104,plain,
! [X2,X0,X1] : lookup_slb(insert_slb(X0,pair(X1,X2)),X1) = X2,
inference(cnf_transformation,[],[f14]) ).
fof(f105,plain,
! [X2,X3,X0,X1] :
( remove_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(remove_slb(X0,X2),pair(X1,X3))
| X1 = X2
| ~ contains_slb(X0,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f106,plain,
! [X2,X0,X1] : remove_slb(insert_slb(X0,pair(X1,X2)),X1) = X0,
inference(cnf_transformation,[],[f12]) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| X1 = X2
| contains_slb(X0,X2) ),
inference(cnf_transformation,[],[f86]) ).
fof(f108,plain,
! [X2,X3,X0,X1] :
( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| X1 != X2 ),
inference(cnf_transformation,[],[f86]) ).
fof(f110,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ contains_slb(X1,X3)
| ~ less_than(lookup_slb(X1,X3),X3) ),
inference(cnf_transformation,[],[f66]) ).
fof(f111,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 = X4
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f88]) ).
fof(f112,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 = X2
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f88]) ).
fof(f113,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(cnf_transformation,[],[f88]) ).
fof(f114,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f88]) ).
fof(f117,plain,
! [X2,X3,X0,X1] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f67]) ).
fof(f119,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f120,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f48]) ).
fof(f134,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f144,plain,
! [X2,X3,X0] : contains_slb(insert_slb(X0,pair(X2,X3)),X2),
inference(equality_resolution,[],[f108]) ).
fof(f145,plain,
! [X2,X3,X0,X4] :
( pair_in_list(insert_slb(X0,pair(X2,X3)),X2,X4)
| X3 != X4 ),
inference(equality_resolution,[],[f113]) ).
fof(f146,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f145]) ).
fof(f149,plain,
( sK4 = sK6
| pair_in_list(sK0,sK3,sK4) ),
inference(resolution,[],[f93,f111]) ).
fof(f150,plain,
( sK3 = sK5
| pair_in_list(sK0,sK3,sK4) ),
inference(resolution,[],[f93,f112]) ).
fof(f152,definition,
( spl7_1
<=> pair_in_list(sK0,sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f154,plain,
( pair_in_list(sK0,sK3,sK4)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f156,definition,
( spl7_2
<=> sK3 = sK5 ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f157,plain,
( sK3 != sK5
| spl7_2 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f158,plain,
( sK3 = sK5
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f159,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f150,f156,f152]) ).
fof(f161,definition,
( spl7_3
<=> sK4 = sK6 ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f163,plain,
( sK4 = sK6
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f164,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f149,f161,f152]) ).
fof(f167,plain,
( ~ pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK6)),sK3,sK4)
| sK3 = sK5
| ~ contains_slb(sK0,sK3) ),
inference(superposition,[],[f94,f105]) ).
fof(f168,plain,
( ok(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),bad))
| contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3) ),
inference(superposition,[],[f91,f117]) ).
fof(f170,plain,
( ok(triple(remove_pqp(sK1,sK3),remove_slb(insert_slb(sK0,pair(sK5,sK6)),sK3),bad))
| ~ contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)
| ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)) ),
inference(superposition,[],[f91,f96]) ).
fof(f171,plain,
( ~ contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)
| ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)) ),
inference(forward_subsumption_resolution,[],[f170,f120]) ).
fof(f173,plain,
contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3),
inference(forward_subsumption_resolution,[],[f168,f120]) ).
fof(f174,plain,
( ~ contains_slb(insert_slb(sK0,pair(sK5,sK4)),sK3)
| ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3))
| ~ spl7_3 ),
inference(forward_demodulation,[],[f171,f163]) ).
fof(f177,plain,
( ~ contains_slb(insert_slb(sK0,pair(sK3,sK4)),sK3)
| ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3))
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f174,f158]) ).
fof(f180,plain,
( ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3))
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f177,f144]) ).
fof(f182,plain,
( ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK4)),sK3))
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f180,f163]) ).
fof(f184,plain,
( ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK3,sK4)),sK3))
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f182,f158]) ).
fof(f186,plain,
( ~ strictly_less_than(sK3,sK4)
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f184,f104]) ).
fof(f188,plain,
( $false
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f186,f92]) ).
fof(f189,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f188]) ).
fof(f199,definition,
( spl7_4
<=> contains_slb(sK0,sK3) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f200,plain,
( contains_slb(sK0,sK3)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f201,plain,
( ~ contains_slb(sK0,sK3)
| spl7_4 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f203,definition,
( spl7_5
<=> pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK4)),sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f204,plain,
( pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK4)),sK3,sK4)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f205,plain,
( ~ pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK4)),sK3,sK4)
| spl7_5 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( ~ ok(triple(remove_pqp(X0,X1),remove_slb(sK0,X1),X2))
| ~ pair_in_list(sK0,X1,X3)
| ~ strictly_less_than(X1,X3)
| pair_in_list(remove_slb(sK0,X1),X1,X3)
| ~ contains_slb(sK0,X1)
| ~ less_than(lookup_slb(sK0,X1),X1) ),
inference(superposition,[],[f90,f110]) ).
fof(f232,definition,
( spl7_9
<=> contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3) ),
introduced(definition,[new_symbols(definition,[spl7_9])],[avatar_definition]) ).
fof(f233,plain,
( contains_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f241,definition,
( spl7_11
<=> strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3)) ),
introduced(definition,[new_symbols(definition,[spl7_11])],[avatar_definition]) ).
fof(f243,plain,
( ~ strictly_less_than(sK3,lookup_slb(insert_slb(sK0,pair(sK5,sK6)),sK3))
| spl7_11 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f244,plain,
( ~ spl7_11
| ~ spl7_9 ),
inference(avatar_split_clause,[],[f171,f232,f241]) ).
fof(f245,plain,
spl7_9,
inference(avatar_split_clause,[],[f173,f232]) ).
fof(f246,plain,
( sK3 = sK5
| contains_slb(sK0,sK3)
| ~ spl7_9 ),
inference(resolution,[],[f233,f107]) ).
fof(f247,plain,
( contains_slb(sK0,sK3)
| spl7_2
| ~ spl7_9 ),
inference(forward_subsumption_resolution,[],[f246,f157]) ).
fof(f248,plain,
( $false
| spl7_2
| spl7_4
| ~ spl7_9 ),
inference(forward_subsumption_resolution,[],[f247,f201]) ).
fof(f249,plain,
( spl7_2
| spl7_4
| ~ spl7_9 ),
inference(avatar_contradiction_clause,[],[f248]) ).
fof(f262,plain,
( ~ strictly_less_than(sK3,lookup_slb(sK0,sK3))
| sK3 = sK5
| ~ contains_slb(sK0,sK3)
| spl7_11 ),
inference(superposition,[],[f243,f103]) ).
fof(f263,plain,
( ~ strictly_less_than(sK3,lookup_slb(sK0,sK3))
| ~ contains_slb(sK0,sK3)
| spl7_2
| spl7_11 ),
inference(forward_subsumption_resolution,[],[f262,f157]) ).
fof(f265,plain,
( ~ strictly_less_than(sK3,lookup_slb(sK0,sK3))
| spl7_2
| ~ spl7_4
| spl7_11 ),
inference(forward_subsumption_resolution,[],[f263,f200]) ).
fof(f268,plain,
( ~ less_than(sK3,lookup_slb(sK0,sK3))
| less_than(lookup_slb(sK0,sK3),sK3)
| spl7_2
| ~ spl7_4
| spl7_11 ),
inference(resolution,[],[f265,f101]) ).
fof(f269,plain,
( less_than(lookup_slb(sK0,sK3),sK3)
| spl7_2
| ~ spl7_4
| spl7_11 ),
inference(forward_subsumption_resolution,[],[f268,f134]) ).
fof(f277,plain,
( ~ pair_in_list(remove_slb(sK0,sK3),sK3,sK4)
| spl7_5 ),
inference(resolution,[],[f205,f114]) ).
fof(f306,plain,
! [X2,X0,X1] :
( ~ pair_in_list(sK0,X0,X1)
| ~ strictly_less_than(X0,X1)
| pair_in_list(remove_slb(sK0,X0),X0,X1)
| ~ contains_slb(sK0,X0)
| ~ less_than(lookup_slb(sK0,X0),X0)
| bad = X2 ),
inference(resolution,[],[f218,f119]) ).
fof(f312,definition,
( spl7_12
<=> ! [X2] : bad = X2 ),
introduced(definition,[new_symbols(definition,[spl7_12])],[avatar_definition]) ).
fof(f313,plain,
( ! [X2] : bad = X2
| ~ spl7_12 ),
inference(avatar_component_clause,[],[f312]) ).
fof(f315,definition,
( spl7_13
<=> ! [X0,X1] :
( ~ pair_in_list(sK0,X0,X1)
| ~ less_than(lookup_slb(sK0,X0),X0)
| ~ contains_slb(sK0,X0)
| pair_in_list(remove_slb(sK0,X0),X0,X1)
| ~ strictly_less_than(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl7_13])],[avatar_definition]) ).
fof(f316,plain,
( ! [X0,X1] :
( pair_in_list(remove_slb(sK0,X0),X0,X1)
| ~ less_than(lookup_slb(sK0,X0),X0)
| ~ contains_slb(sK0,X0)
| ~ pair_in_list(sK0,X0,X1)
| ~ strictly_less_than(X0,X1) )
| ~ spl7_13 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f317,plain,
( spl7_12
| spl7_13 ),
inference(avatar_split_clause,[],[f306,f315,f312]) ).
fof(f366,plain,
( ! [X2,X1] : pair_in_list(bad,X1,X2)
| ~ spl7_12 ),
inference(superposition,[],[f146,f313]) ).
fof(f504,plain,
( ~ pair_in_list(remove_slb(insert_slb(sK0,pair(bad,sK6)),sK3),sK3,sK4)
| ~ spl7_12 ),
inference(superposition,[],[f94,f313]) ).
fof(f543,plain,
( ~ pair_in_list(remove_slb(insert_slb(sK0,pair(bad,sK6)),sK3),sK3,bad)
| ~ spl7_12 ),
inference(forward_demodulation,[],[f504,f313]) ).
fof(f724,plain,
( ~ pair_in_list(remove_slb(insert_slb(sK0,pair(bad,sK6)),bad),bad,bad)
| ~ spl7_12 ),
inference(forward_demodulation,[],[f543,f313]) ).
fof(f810,plain,
( ~ pair_in_list(sK0,bad,bad)
| ~ spl7_12 ),
inference(forward_demodulation,[],[f724,f106]) ).
fof(f860,plain,
( ~ pair_in_list(bad,bad,bad)
| ~ spl7_12 ),
inference(forward_demodulation,[],[f810,f313]) ).
fof(f887,plain,
( $false
| ~ spl7_12 ),
inference(forward_subsumption_resolution,[],[f860,f366]) ).
fof(f888,plain,
~ spl7_12,
inference(avatar_contradiction_clause,[],[f887]) ).
fof(f897,plain,
( ~ less_than(lookup_slb(sK0,sK3),sK3)
| ~ contains_slb(sK0,sK3)
| ~ pair_in_list(sK0,sK3,sK4)
| ~ strictly_less_than(sK3,sK4)
| spl7_5
| ~ spl7_13 ),
inference(resolution,[],[f316,f277]) ).
fof(f898,plain,
( ~ contains_slb(sK0,sK3)
| ~ pair_in_list(sK0,sK3,sK4)
| ~ strictly_less_than(sK3,sK4)
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f897,f269]) ).
fof(f899,plain,
( ~ pair_in_list(sK0,sK3,sK4)
| ~ strictly_less_than(sK3,sK4)
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f898,f200]) ).
fof(f900,plain,
( ~ strictly_less_than(sK3,sK4)
| ~ spl7_1
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f899,f154]) ).
fof(f901,plain,
( $false
| ~ spl7_1
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f900,f92]) ).
fof(f902,plain,
( ~ spl7_1
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(avatar_contradiction_clause,[],[f901]) ).
fof(f908,plain,
( ~ pair_in_list(remove_slb(insert_slb(sK0,pair(sK3,sK6)),sK3),sK3,sK4)
| ~ spl7_2 ),
inference(superposition,[],[f94,f158]) ).
fof(f923,plain,
( ~ pair_in_list(sK0,sK3,sK4)
| ~ spl7_2 ),
inference(forward_demodulation,[],[f908,f106]) ).
fof(f926,plain,
( $false
| ~ spl7_1
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f923,f154]) ).
fof(f927,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f926]) ).
fof(f929,plain,
( ~ pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK6)),sK3,sK4)
| ~ contains_slb(sK0,sK3)
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f167,f157]) ).
fof(f930,plain,
( ~ pair_in_list(insert_slb(remove_slb(sK0,sK3),pair(sK5,sK6)),sK3,sK4)
| spl7_2
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f929,f200]) ).
fof(f933,plain,
( sK3 = sK5
| pair_in_list(remove_slb(sK0,sK3),sK3,sK4)
| ~ spl7_5 ),
inference(resolution,[],[f204,f112]) ).
fof(f934,plain,
( pair_in_list(remove_slb(sK0,sK3),sK3,sK4)
| spl7_2
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f933,f157]) ).
fof(f935,plain,
( ~ pair_in_list(remove_slb(sK0,sK3),sK3,sK4)
| spl7_2
| ~ spl7_4 ),
inference(resolution,[],[f930,f114]) ).
fof(f936,plain,
( $false
| spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f935,f934]) ).
fof(f937,plain,
( spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f936]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f159]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f164]) ).
cnf(s3,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f189]) ).
cnf(s8,plain,
( ~ spl7_9
| ~ spl7_11 ),
inference(sat_conversion,[],[f244]) ).
cnf(s9,plain,
spl7_9,
inference(sat_conversion,[],[f245]) ).
cnf(s10,plain,
( spl7_2
| spl7_4
| ~ spl7_9 ),
inference(sat_conversion,[],[f249]) ).
cnf(s15,plain,
( spl7_12
| spl7_13 ),
inference(sat_conversion,[],[f317]) ).
cnf(s69,plain,
~ spl7_12,
inference(sat_conversion,[],[f888]) ).
cnf(s70,plain,
( ~ spl7_1
| spl7_2
| ~ spl7_4
| spl7_5
| spl7_11
| ~ spl7_13 ),
inference(sat_conversion,[],[f902]) ).
cnf(s73,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f927]) ).
cnf(s74,plain,
( spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(sat_conversion,[],[f937]) ).
cnf(s75,plain,
spl7_13,
inference(rat,[],[s15,s69]) ).
cnf(s76,plain,
~ spl7_11,
inference(rat,[],[s8,s9]) ).
cnf(s80,plain,
spl7_1,
inference(rat,[],[s3,s1,s2]) ).
cnf(s81,plain,
~ spl7_2,
inference(rat,[],[s73,s80]) ).
cnf(s82,plain,
spl7_4,
inference(rat,[],[s10,s9,s81]) ).
cnf(s83,plain,
~ spl7_5,
inference(rat,[],[s74,s81,s82]) ).
cnf(s85,plain,
$false,
inference(rat,[],[s70,s75,s76,s81,s80,s83,s82]) ).
fof(f938,plain,
$false,
inference(avatar_sat_refutation,[],[s85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV396+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.08/0.19 % Computer : n001.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 10:56:03 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 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.73/1.49 % (280956)Detected formulas, will run a generic FOF schedule.
% 4.73/1.49 % (280967)dis-21_1_sil=8000:lcm=predicate:random_seed=687082015: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.73/1.49 % (280967)Instruction limit reached!
% 4.73/1.49 % (280967)------------------------------
% 4.73/1.49 % (280967)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280967)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280967)Termination reason: Instruction limit
% 4.73/1.49 % (280967)Termination phase: Saturation
% 4.73/1.49 % (280967)Time elapsed: 0.029 s
% 4.73/1.49 % (280967)Peak memory usage: 88 MB
% 4.73/1.49 % (280967)Instructions burned: 134 (million)
% 4.73/1.49 % (280963)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=3644359441:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.73/1.49 % (280965)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3383050315:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.73/1.49 % (280961)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=4129737941:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.73/1.49 % (280964)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=420131101:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.73/1.49 % (280962)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=1391780720:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.73/1.49 % (280964)Refutation not found, incomplete strategy
% 4.73/1.49 % (280964)------------------------------
% 4.73/1.49 % (280964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280964)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280964)Termination reason: Refutation not found, incomplete strategy
% 4.73/1.49 % (280964)Time elapsed: 0.003 s
% 4.73/1.49 % (280964)Peak memory usage: 88 MB
% 4.73/1.49 % (280964)Instructions burned: 2 (million)
% 4.73/1.49 % (280966)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4141646358:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.73/1.49 % (280965)Instruction limit reached!
% 4.73/1.49 % (280965)------------------------------
% 4.73/1.49 % (280965)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280965)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280965)Termination reason: Instruction limit
% 4.73/1.49 % (280965)Termination phase: Saturation
% 4.73/1.49 % (280965)Time elapsed: 0.053 s
% 4.73/1.49 % (280965)Peak memory usage: 87 MB
% 4.73/1.49 % (280965)Instructions burned: 122 (million)
% 4.73/1.49 % (280969)lrs+10_1_sil=8000:sp=occurrence:random_seed=1386812745:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.73/1.49 % (280966)Instruction limit reached!
% 4.73/1.49 % (280966)------------------------------
% 4.73/1.49 % (280966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280966)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280966)Termination reason: Instruction limit
% 4.73/1.49 % (280966)Termination phase: Saturation
% 4.73/1.49 % (280966)Time elapsed: 0.094 s
% 4.73/1.49 % (280966)Peak memory usage: 89 MB
% 4.73/1.49 % (280966)Instructions burned: 139 (million)
% 4.73/1.49 % (280969)Instruction limit reached!
% 4.73/1.49 % (280969)------------------------------
% 4.73/1.49 % (280969)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280969)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280969)Termination reason: Instruction limit
% 4.73/1.49 % (280969)Termination phase: Saturation
% 4.73/1.49 % (280969)Time elapsed: 0.074 s
% 4.73/1.49 % (280969)Peak memory usage: 89 MB
% 4.73/1.49 % (280969)Instructions burned: 286 (million)
% 4.73/1.49 % (280976)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3235308258:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.73/1.49 % (280979)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4274319739:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.73/1.49 % (280978)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1409728485:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.73/1.49 % (280964)------------------------------
% 4.73/1.49 % (280964)------------------------------
% 4.73/1.49 % (280976)Instruction limit reached!
% 4.73/1.49 % (280976)------------------------------
% 4.73/1.49 % (280976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280976)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280976)Termination reason: Instruction limit
% 4.73/1.49 % (280976)Termination phase: Saturation
% 4.73/1.49 % (280976)Time elapsed: 0.078 s
% 4.73/1.49 % (280976)Peak memory usage: 89 MB
% 4.73/1.49 % (280976)Instructions burned: 158 (million)
% 4.73/1.49 % (280979)Instruction limit reached!
% 4.73/1.49 % (280979)------------------------------
% 4.73/1.49 % (280979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280979)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280979)Termination reason: Instruction limit
% 4.73/1.49 % (280979)Termination phase: Saturation
% 4.73/1.49 % (280979)Time elapsed: 0.093 s
% 4.73/1.49 % (280979)Peak memory usage: 91 MB
% 4.73/1.49 % (280979)Instructions burned: 248 (million)
% 4.73/1.49 % (280984)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2443087859:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.73/1.49 % (280983)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=586734367:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.73/1.49 % (280983)First to succeed.
% 4.73/1.49 % (280983)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-280956"
% 4.73/1.49 % (280985)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=279842719:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 4.73/1.49 % (280978)Instruction limit reached!
% 4.73/1.49 % (280978)------------------------------
% 4.73/1.49 % (280978)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280978)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280978)Termination reason: Instruction limit
% 4.73/1.49 % (280978)Termination phase: Saturation
% 4.73/1.49 % (280978)Time elapsed: 0.193 s
% 4.73/1.49 % (280978)Peak memory usage: 91 MB
% 4.73/1.49 % (280978)Instructions burned: 325 (million)
% 4.73/1.49 % (280985)Instruction limit reached!
% 4.73/1.49 % (280985)------------------------------
% 4.73/1.49 % (280985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280985)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280985)Termination reason: Instruction limit
% 4.73/1.49 % (280985)Termination phase: Saturation
% 4.73/1.49 % (280985)Time elapsed: 0.040 s
% 4.73/1.49 % (280985)Peak memory usage: 89 MB
% 4.73/1.49 % (280985)Instructions burned: 116 (million)
% 4.73/1.49 % (280990)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2081284880:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 4.73/1.49 % (280989)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=4200332691:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 4.73/1.49 % (280990)Instruction limit reached!
% 4.73/1.49 % (280990)------------------------------
% 4.73/1.49 % (280990)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280990)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280990)Termination reason: Instruction limit
% 4.73/1.49 % (280990)Termination phase: Saturation
% 4.73/1.49 % (280990)Time elapsed: 0.035 s
% 4.73/1.49 % (280990)Peak memory usage: 89 MB
% 4.73/1.49 % (280990)Instructions burned: 115 (million)
% 4.73/1.49 % (280989)Instruction limit reached!
% 4.73/1.49 % (280989)------------------------------
% 4.73/1.49 % (280989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.73/1.49 % (280989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.73/1.49 % (280989)CaDiCaL version: 2.1.3
% 4.73/1.49 % (280989)Termination reason: Instruction limit
% 4.73/1.49 % (280989)Termination phase: Saturation
% 4.73/1.49 % (280989)Time elapsed: 0.059 s
% 4.73/1.49 % (280989)Peak memory usage: 88 MB
% 4.73/1.49 % (280989)Instructions burned: 128 (million)
% 4.73/1.49 % (280983)Refutation found. Thanks to Tanya!
% 4.73/1.49 % SZS status Theorem for theBenchmark
% 4.73/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 6.37/1.68 % (280983)------------------------------
% 6.37/1.68 % (280983)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.37/1.68 % (280983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.37/1.68 % (280983)CaDiCaL version: 2.1.3
% 6.37/1.68 % (280983)Termination reason: Refutation
% 6.37/1.68 % (280983)Time elapsed: 0.016 s
% 6.37/1.68 % (280983)Peak memory usage: 90 MB
% 6.37/1.68 % (280983)Instructions burned: 23 (million)
% 6.37/1.68 % (280983)------------------------------
% 6.37/1.68 % (280983)------------------------------
% 6.37/1.68 % (280956)Success in time 0.817 s
% 6.37/1.68 % Vampire exiting
%------------------------------------------------------------------------------