%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV391+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 : n009.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 6.76s 1.68s
% Output : Refutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 95 ( 18 unt; 5 def)
% Number of atoms : 230 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 231 ( 96 ~; 96 |; 19 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 188 ( 0 sgn 176 !; 12 ?)
% 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(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
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,axiom,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_li4142) ).
fof(f43,axiom,
! [X0,X1,X2] :
( pair_in_list(X0,X1,X2)
=> ! [X3] :
( contains_slb(X0,X3)
=> ( pair_in_list(remove_slb(X0,X3),X1,X2)
| X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_li2829) ).
fof(f44,axiom,
! [X0,X1,X2,X3] :
( ( check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> ! [X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_l30) ).
fof(f45,axiom,
! [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_l33) ).
fof(f46,conjecture,
! [X0,X1,X2,X3] :
( ( check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_co) ).
fof(f47,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> check_cpq(triple(X0,X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f54,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f55,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f57,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ! [X3] :
( pair_in_list(remove_slb(X0,X3),X1,X2)
| X1 = X3
| ~ contains_slb(X0,X3) )
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f43]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ! [X3] :
( pair_in_list(remove_slb(X0,X3),X1,X2)
| X1 = X3
| ~ contains_slb(X0,X3) )
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2,X3] :
( ! [X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f61,plain,
! [X0,X1,X2,X3] :
( ! [X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2,X3] :
( contains_slb(X1,X3)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f63,plain,
? [X0,X1,X2,X3] :
( ~ check_cpq(triple(X0,X1,X2))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f64,plain,
? [X0,X1,X2,X3] :
( ~ check_cpq(triple(X0,X1,X2))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(flattening,[],[f63]) ).
fof(f67,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(f68,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,[],[f67]) ).
fof(f71,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f72,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f71]) ).
fof(f81,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(f82,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,[],[f81]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(nnf_transformation,[],[f57]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(rectify,[],[f91]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X1)),skolemize(X4,sK1(X1))],[f92]) ).
fof(f94,plain,
( ~ check_cpq(triple(sK2,sK3,sK4))
& check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
& ok(remove_cpq(triple(sK2,sK3,sK4),sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f64]) ).
fof(f101,plain,
! [X2,X0,X1,X6,X5] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f102,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| pair_in_list(X1,sK0(X1),sK1(X1)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f103,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ less_than(sK1(X1),sK0(X1)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f104,plain,
! [X2,X3,X0,X1] :
( pair_in_list(remove_slb(X0,X3),X1,X2)
| X1 = X3
| ~ contains_slb(X0,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f59]) ).
fof(f105,plain,
! [X2,X3,X0,X1,X4] :
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ pair_in_list(X1,X3,X4)
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| less_than(X4,X3) ),
inference(cnf_transformation,[],[f61]) ).
fof(f106,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f62]) ).
fof(f107,plain,
ok(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f94]) ).
fof(f108,plain,
check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f94]) ).
fof(f109,plain,
~ check_cpq(triple(sK2,sK3,sK4)),
inference(cnf_transformation,[],[f94]) ).
fof(f111,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3) ),
inference(cnf_transformation,[],[f68]) ).
fof(f116,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f118,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3)
| remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad) ),
inference(cnf_transformation,[],[f82]) ).
fof(f136,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f55]) ).
fof(f159,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f116,f118]) ).
fof(f163,plain,
~ less_than(sK1(sK3),sK0(sK3)),
inference(resolution,[],[f103,f109]) ).
fof(f164,plain,
contains_slb(sK3,sK5),
inference(resolution,[],[f106,f107]) ).
fof(f167,plain,
pair_in_list(sK3,sK0(sK3),sK1(sK3)),
inference(resolution,[],[f102,f109]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ check_cpq(triple(X1,X0,X2))
| ~ pair_in_list(X0,sK0(sK3),sK1(sK3)) ),
inference(resolution,[],[f101,f163]) ).
fof(f177,plain,
! [X0] :
( ~ less_than(sK1(X0),sK0(X0))
| ~ pair_in_list(X0,sK0(sK3),sK1(sK3)) ),
inference(resolution,[],[f171,f103]) ).
fof(f243,plain,
! [X0] :
( ~ pair_in_list(sK3,sK5,X0)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| less_than(X0,sK5) ),
inference(resolution,[],[f105,f107]) ).
fof(f245,plain,
! [X0] :
( ~ pair_in_list(sK3,sK5,X0)
| less_than(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f243,f108]) ).
fof(f253,plain,
! [X0,X1] :
( remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1)
| ~ less_than(lookup_slb(sK3,sK5),sK5) ),
inference(resolution,[],[f111,f164]) ).
fof(f258,definition,
( spl6_1
<=> less_than(lookup_slb(sK3,sK5),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f260,plain,
( ~ less_than(lookup_slb(sK3,sK5),sK5)
| spl6_1 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f262,definition,
( spl6_2
<=> ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f263,plain,
( ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f253,f262,f258]) ).
fof(f270,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X0,X1)
| remove_cpq(triple(X2,X0,X3),X1) = triple(remove_pqp(X2,X1),remove_slb(X0,X1),bad)
| less_than(lookup_slb(X0,X1),X1) ),
inference(resolution,[],[f132,f159]) ).
fof(f465,plain,
! [X0,X1] :
( remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad)
| less_than(lookup_slb(sK3,sK5),sK5) ),
inference(resolution,[],[f270,f164]) ).
fof(f681,definition,
( spl6_6
<=> ! [X0,X1] : ~ check_cpq(remove_cpq(triple(X0,sK3,X1),sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f682,plain,
( ! [X0,X1] : ~ check_cpq(remove_cpq(triple(X0,sK3,X1),sK5))
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f681]) ).
fof(f712,definition,
( spl6_13
<=> pair_in_list(remove_slb(sK3,sK5),sK0(sK3),sK1(sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).
fof(f714,plain,
( ~ pair_in_list(remove_slb(sK3,sK5),sK0(sK3),sK1(sK3))
| spl6_13 ),
inference(avatar_component_clause,[],[f712]) ).
fof(f749,plain,
( ! [X0,X1] :
( ~ check_cpq(remove_cpq(triple(X0,sK3,X1),sK5))
| ~ pair_in_list(remove_slb(sK3,sK5),sK0(sK3),sK1(sK3)) )
| ~ spl6_2 ),
inference(superposition,[],[f171,f263]) ).
fof(f770,plain,
( ~ spl6_13
| spl6_6
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f749,f262,f681,f712]) ).
fof(f776,plain,
( ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad)
| spl6_1 ),
inference(forward_subsumption_resolution,[],[f465,f260]) ).
fof(f855,plain,
( ! [X0,X1] : ~ ok(remove_cpq(triple(X0,sK3,X1),sK5))
| spl6_1 ),
inference(superposition,[],[f136,f776]) ).
fof(f880,plain,
( $false
| spl6_1 ),
inference(resolution,[],[f855,f107]) ).
fof(f882,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f880]) ).
fof(f944,plain,
( sK5 = sK0(sK3)
| ~ contains_slb(sK3,sK5)
| ~ pair_in_list(sK3,sK0(sK3),sK1(sK3))
| spl6_13 ),
inference(resolution,[],[f714,f104]) ).
fof(f947,plain,
( sK5 = sK0(sK3)
| ~ pair_in_list(sK3,sK0(sK3),sK1(sK3))
| spl6_13 ),
inference(forward_subsumption_resolution,[],[f944,f164]) ).
fof(f948,plain,
( sK5 = sK0(sK3)
| spl6_13 ),
inference(forward_subsumption_resolution,[],[f947,f167]) ).
fof(f970,plain,
( pair_in_list(sK3,sK5,sK1(sK3))
| spl6_13 ),
inference(superposition,[],[f167,f948]) ).
fof(f981,plain,
( ~ less_than(sK1(sK3),sK5)
| ~ pair_in_list(sK3,sK5,sK1(sK3))
| spl6_13 ),
inference(superposition,[],[f177,f948]) ).
fof(f1014,definition,
( spl6_25
<=> pair_in_list(sK3,sK5,sK1(sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_25])],[avatar_definition]) ).
fof(f1028,plain,
( ~ pair_in_list(sK3,sK5,sK1(sK3))
| spl6_13 ),
inference(forward_subsumption_resolution,[],[f981,f245]) ).
fof(f1031,plain,
( spl6_25
| spl6_13 ),
inference(avatar_split_clause,[],[f970,f712,f1014]) ).
fof(f1034,plain,
( ~ spl6_25
| spl6_13 ),
inference(avatar_split_clause,[],[f1028,f712,f1014]) ).
fof(f1039,plain,
( $false
| ~ spl6_6 ),
inference(resolution,[],[f682,f108]) ).
fof(f1040,plain,
~ spl6_6,
inference(avatar_contradiction_clause,[],[f1039]) ).
cnf(s1,plain,
( ~ spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f264]) ).
cnf(s19,plain,
( ~ spl6_2
| spl6_6
| ~ spl6_13 ),
inference(sat_conversion,[],[f770]) ).
cnf(s25,plain,
spl6_1,
inference(sat_conversion,[],[f882]) ).
cnf(s37,plain,
( spl6_13
| spl6_25 ),
inference(sat_conversion,[],[f1031]) ).
cnf(s40,plain,
( spl6_13
| ~ spl6_25 ),
inference(sat_conversion,[],[f1034]) ).
cnf(s41,plain,
~ spl6_6,
inference(sat_conversion,[],[f1040]) ).
cnf(s42,plain,
( ~ spl6_2
| ~ spl6_13 ),
inference(rat,[],[s19,s41]) ).
cnf(s48,plain,
spl6_2,
inference(rat,[],[s1,s25]) ).
cnf(s49,plain,
~ spl6_13,
inference(rat,[],[s42,s48]) ).
cnf(s54,plain,
~ spl6_25,
inference(rat,[],[s40,s49]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s37,s54,s49]) ).
fof(f1041,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV391+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.10/0.18 % Computer : n009.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 10:48:30 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running first-order theorem proving
% 0.10/0.22 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
% 6.76/1.68 % (2948777)Detected formulas, will run a generic FOF schedule.
% 6.76/1.68 % (2948855)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1830714129:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.76/1.68 % (2948855)Instruction limit reached!
% 6.76/1.68 % (2948855)------------------------------
% 6.76/1.68 % (2948855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948855)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948855)Termination reason: Instruction limit
% 6.76/1.68 % (2948855)Termination phase: Saturation
% 6.76/1.68 % (2948855)Time elapsed: 0.025 s
% 6.76/1.68 % (2948855)Peak memory usage: 88 MB
% 6.76/1.68 % (2948855)Instructions burned: 109 (million)
% 6.76/1.68 % (2948852)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=3597609224:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.76/1.68 % (2948857)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=386261611:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.76/1.68 % (2948854)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=3701422738:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.76/1.68 % (2948858)dis-21_1_sil=8000:lcm=predicate:random_seed=2395253595: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)
% 6.76/1.68 % (2948853)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=1062378268:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.76/1.68 % (2948856)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=577006328:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.76/1.68 % (2948858)Instruction limit reached!
% 6.76/1.68 % (2948858)------------------------------
% 6.76/1.68 % (2948858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948858)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948858)Termination reason: Instruction limit
% 6.76/1.68 % (2948858)Termination phase: Saturation
% 6.76/1.68 % (2948858)Time elapsed: 0.053 s
% 6.76/1.68 % (2948858)Peak memory usage: 88 MB
% 6.76/1.68 % (2948858)Instructions burned: 131 (million)
% 6.76/1.68 % (2948857)Instruction limit reached!
% 6.76/1.68 % (2948857)------------------------------
% 6.76/1.68 % (2948857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948857)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948857)Termination reason: Instruction limit
% 6.76/1.68 % (2948857)Termination phase: Saturation
% 6.76/1.68 % (2948857)Time elapsed: 0.079 s
% 6.76/1.68 % (2948857)Peak memory usage: 90 MB
% 6.76/1.68 % (2948857)Instructions burned: 140 (million)
% 6.76/1.68 % (2948860)lrs+10_1_sil=8000:sp=occurrence:random_seed=3450115525:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.76/1.68 % (2948856)Instruction limit reached!
% 6.76/1.68 % (2948856)------------------------------
% 6.76/1.68 % (2948856)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948856)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948856)Termination reason: Instruction limit
% 6.76/1.68 % (2948856)Termination phase: Saturation
% 6.76/1.68 % (2948856)Time elapsed: 0.081 s
% 6.76/1.68 % (2948856)Peak memory usage: 87 MB
% 6.76/1.68 % (2948856)Instructions burned: 120 (million)
% 6.76/1.68 % (2948860)Instruction limit reached!
% 6.76/1.68 % (2948860)------------------------------
% 6.76/1.68 % (2948860)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948860)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948860)Termination reason: Instruction limit
% 6.76/1.68 % (2948860)Termination phase: Saturation
% 6.76/1.68 % (2948860)Time elapsed: 0.120 s
% 6.76/1.68 % (2948860)Peak memory usage: 90 MB
% 6.76/1.68 % (2948860)Instructions burned: 285 (million)
% 6.76/1.68 % (2948867)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2526382330:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.76/1.68 % (2948867)Refutation not found, incomplete strategy
% 6.76/1.68 % (2948867)------------------------------
% 6.76/1.68 % (2948867)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948867)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948867)Termination reason: Refutation not found, incomplete strategy
% 6.76/1.68 % (2948867)Time elapsed: 0.004 s
% 6.76/1.68 % (2948867)Peak memory usage: 88 MB
% 6.76/1.68 % (2948867)Instructions burned: 2 (million)
% 6.76/1.68 % (2948868)lrs+1011_1_sil=32000:sp=occurrence:random_seed=429033702:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.76/1.68 % (2948868)First to succeed.
% 6.76/1.68 % (2948868)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2948777"
% 6.76/1.68 % (2948870)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=921534044:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.76/1.68 % (2948879)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1214848811:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 6.76/1.68 % (2948879)Also succeeded, but the first one will report.
% 6.76/1.68 % (2948870)Instruction limit reached!
% 6.76/1.68 % (2948870)------------------------------
% 6.76/1.68 % (2948870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.76/1.68 % (2948870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.76/1.68 % (2948870)CaDiCaL version: 2.1.3
% 6.76/1.68 % (2948870)Termination reason: Instruction limit
% 6.76/1.68 % (2948870)Termination phase: Saturation
% 6.76/1.68 % (2948870)Time elapsed: 0.254 s
% 6.76/1.68 % (2948870)Peak memory usage: 90 MB
% 6.76/1.68 % (2948870)Instructions burned: 248 (million)
% 6.76/1.68 % (2948867)------------------------------
% 6.76/1.68 % (2948867)------------------------------
% 6.76/1.68 % (2948852)Also succeeded, but the first one will report.
% 6.76/1.68 % (2948868)Refutation found. Thanks to Tanya!
% 6.76/1.68 % SZS status Theorem for theBenchmark
% 6.76/1.68 % SZS output start Proof for theBenchmark
% See solution above
% 7.59/1.88 % (2948868)------------------------------
% 7.59/1.88 % (2948868)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.88 % (2948868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.88 % (2948868)CaDiCaL version: 2.1.3
% 7.59/1.88 % (2948868)Termination reason: Refutation
% 7.59/1.88 % (2948868)Time elapsed: 0.069 s
% 7.59/1.88 % (2948868)Peak memory usage: 90 MB
% 7.59/1.88 % (2948868)Instructions burned: 61 (million)
% 7.59/1.88 % (2948868)------------------------------
% 7.59/1.88 % (2948868)------------------------------
% 7.59/1.88 % (2948777)Success in time 1.012 s
% 7.59/1.88 % Vampire exiting
%------------------------------------------------------------------------------