%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO009+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:30:24 PM UTC 2026
% Result : Theorem 2.74s 1.31s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 67 ( 3 unt; 0 def)
% Number of atoms : 299 ( 25 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 406 ( 174 ~; 163 |; 60 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 151 ( 133 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f15,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(f23,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f34,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_33) ).
fof(f42,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X0,X3)
& leaf_occ(X1,X0)
& root_occ(X2,X0)
& X1 != X2 )
=> min_precedes(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_41) ).
fof(f50,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0)
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0)
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f65,plain,
? [X0] :
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,X0)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f64]) ).
fof(f66,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X1,X3)
| ~ occurrence_of(X0,X3)
| ~ leaf_occ(X1,X0)
| ~ root_occ(X2,X0)
| X1 = X2 ),
inference(ennf_transformation,[],[f42]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X1,X3)
| ~ occurrence_of(X0,X3)
| ~ leaf_occ(X1,X0)
| ~ root_occ(X2,X0)
| X1 = X2 ),
inference(flattening,[],[f71]) ).
fof(f88,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f89,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f90,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f89]) ).
fof(f100,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f114,plain,
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK0)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,sK0) )
& occurrence_of(sK0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f65]) ).
fof(f115,plain,
! [X0] :
( ( occurrence_of(sK1(X0),tptp3)
& root_occ(sK1(X0),X0)
& occurrence_of(sK2(X0),tptp4)
& next_subocc(sK1(X0),sK2(X0),tptp0)
& ( occurrence_of(sK3(X0),tptp2)
| occurrence_of(sK3(X0),tptp1) )
& next_subocc(sK2(X0),sK3(X0),tptp0)
& leaf_occ(sK3(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0)),skolemize(X3,sK3(X0))],[f66]) ).
fof(f116,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f117,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& root(X0,X3) )
| ~ root_occ(X0,X1) ) ),
inference(rectify,[],[f116]) ).
fof(f118,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK4(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK4(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1))],[f117]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f88]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f119]) ).
fof(f121,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK5(X0,X1,X2),X2)
& min_precedes(sK5(X0,X1,X2),X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f121]) ).
fof(f129,plain,
occurrence_of(sK0,tptp0),
inference(cnf_transformation,[],[f114]) ).
fof(f130,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X2,tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ leaf_occ(X2,sK0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f131,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X2,tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ leaf_occ(X2,sK0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f134,plain,
! [X0] :
( leaf_occ(sK3(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f135,plain,
! [X0] :
( next_subocc(sK2(X0),sK3(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f136,plain,
! [X0] :
( occurrence_of(sK3(X0),tptp1)
| occurrence_of(sK3(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f139,plain,
! [X0] :
( root_occ(sK1(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f140,plain,
! [X0] :
( occurrence_of(sK1(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f149,plain,
! [X2,X3,X0,X1] :
( min_precedes(X2,X1,X3)
| ~ occurrence_of(X0,X3)
| ~ leaf_occ(X1,X0)
| ~ root_occ(X2,X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f152,plain,
! [X0,X1] :
( root(X0,sK4(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f154,plain,
! [X0,X1] :
( occurrence_of(X1,sK4(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f169,plain,
! [X2,X0,X1] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f172,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f90]) ).
fof(f182,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| ~ root(X1,X2) ),
inference(resolution,[],[f169,f182]) ).
fof(f224,plain,
! [X0] :
( ~ occurrence_of(sK0,X0)
| tptp0 = X0 ),
inference(resolution,[],[f172,f129]) ).
fof(f229,plain,
! [X0] :
( tptp0 = sK4(X0,sK0)
| ~ root_occ(X0,sK0) ),
inference(resolution,[],[f224,f154]) ).
fof(f231,plain,
! [X0] :
( root(X0,tptp0)
| ~ root_occ(X0,sK0)
| ~ root_occ(X0,sK0) ),
inference(superposition,[],[f152,f229]) ).
fof(f232,plain,
! [X0] :
( root(X0,tptp0)
| ~ root_occ(X0,sK0) ),
inference(duplicate_literal_removal,[],[f231]) ).
fof(f241,plain,
! [X0] :
( ~ root(sK3(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f207,f135]) ).
fof(f243,plain,
! [X0] :
( ~ root_occ(sK3(X0),sK0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f241,f232]) ).
fof(f341,plain,
! [X2,X0,X1] :
( ~ leaf_occ(X1,sK0)
| ~ leaf_occ(X1,X0)
| ~ root_occ(X2,X0)
| X1 = X2
| ~ root_occ(X2,sK0)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f149,f131]) ).
fof(f342,plain,
! [X2,X0,X1] :
( ~ leaf_occ(X1,sK0)
| ~ leaf_occ(X1,X0)
| ~ root_occ(X2,X0)
| X1 = X2
| ~ root_occ(X2,sK0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f149,f130]) ).
fof(f426,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(factoring,[],[f341]) ).
fof(f427,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(duplicate_literal_removal,[],[f426]) ).
fof(f428,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(forward_subsumption_resolution,[],[f427,f129]) ).
fof(f430,plain,
! [X0] :
( ~ root_occ(X0,sK0)
| sK3(sK0) = X0
| ~ occurrence_of(sK3(sK0),tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(resolution,[],[f428,f134]) ).
fof(f431,plain,
! [X0] :
( ~ occurrence_of(sK3(sK0),tptp2)
| sK3(sK0) = X0
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3) ),
inference(forward_subsumption_resolution,[],[f430,f129]) ).
fof(f433,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(factoring,[],[f342]) ).
fof(f434,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(duplicate_literal_removal,[],[f433]) ).
fof(f435,plain,
! [X0,X1] :
( ~ leaf_occ(X0,sK0)
| ~ root_occ(X1,sK0)
| X0 = X1
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(forward_subsumption_resolution,[],[f434,f129]) ).
fof(f437,plain,
! [X0] :
( ~ root_occ(X0,sK0)
| sK3(sK0) = X0
| ~ occurrence_of(sK3(sK0),tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(resolution,[],[f435,f134]) ).
fof(f438,plain,
! [X0] :
( ~ occurrence_of(sK3(sK0),tptp1)
| sK3(sK0) = X0
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3) ),
inference(forward_subsumption_resolution,[],[f437,f129]) ).
fof(f440,plain,
! [X0] :
( sK3(sK0) = X0
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3)
| occurrence_of(sK3(sK0),tptp2)
| ~ occurrence_of(sK0,tptp0) ),
inference(resolution,[],[f438,f136]) ).
fof(f441,plain,
! [X0] :
( sK3(sK0) = X0
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(forward_subsumption_resolution,[],[f440,f431]) ).
fof(f442,plain,
! [X0] :
( sK3(sK0) = X0
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3) ),
inference(forward_subsumption_resolution,[],[f441,f129]) ).
fof(f453,plain,
! [X0] :
( ~ root_occ(X0,sK0)
| ~ occurrence_of(sK0,tptp0)
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3) ),
inference(superposition,[],[f243,f442]) ).
fof(f462,plain,
! [X0] :
( ~ root_occ(X0,sK0)
| ~ occurrence_of(sK0,tptp0)
| ~ occurrence_of(X0,tptp3) ),
inference(duplicate_literal_removal,[],[f453]) ).
fof(f471,plain,
! [X0] :
( ~ root_occ(X0,sK0)
| ~ occurrence_of(X0,tptp3) ),
inference(forward_subsumption_resolution,[],[f462,f129]) ).
fof(f480,plain,
( ~ occurrence_of(sK1(sK0),tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(resolution,[],[f471,f139]) ).
fof(f482,plain,
~ occurrence_of(sK0,tptp0),
inference(forward_subsumption_resolution,[],[f480,f140]) ).
fof(f483,plain,
$false,
inference(forward_subsumption_resolution,[],[f482,f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO009+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:21:04 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 2.74/1.31 % (3821878)Detected formulas, will run a generic FOF schedule.
% 2.74/1.31 % (3821883)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=3935980904:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.31 % (3821888)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4184919613:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.31 % (3821884)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=994336285:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.31 % (3821886)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1596055327:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.31 % (3821889)dis-21_1_sil=8000:lcm=predicate:random_seed=1931936122: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.74/1.31 % (3821885)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=3328905784:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.31 % (3821887)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1086996731:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.31 % (3821886)Refutation not found, incomplete strategy
% 2.74/1.31 % (3821886)------------------------------
% 2.74/1.31 % (3821886)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.31 % (3821886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.31 % (3821886)CaDiCaL version: 2.1.3
% 2.74/1.31 % (3821886)Termination reason: Refutation not found, incomplete strategy
% 2.74/1.31 % (3821886)Time elapsed: 0.006 s
% 2.74/1.31 % (3821886)Peak memory usage: 88 MB
% 2.74/1.31 % (3821886)Instructions burned: 8 (million)
% 2.74/1.31 % (3821887)First to succeed.
% 2.74/1.31 % (3821887)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3821878"
% 2.74/1.31 % (3821888)Also succeeded, but the first one will report.
% 2.74/1.31 % (3821889)Instruction limit reached!
% 2.74/1.31 % (3821889)------------------------------
% 2.74/1.31 % (3821889)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.31 % (3821889)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.31 % (3821889)CaDiCaL version: 2.1.3
% 2.74/1.31 % (3821889)Termination reason: Instruction limit
% 2.74/1.31 % (3821889)Termination phase: Saturation
% 2.74/1.31 % (3821889)Time elapsed: 0.074 s
% 2.74/1.31 % (3821889)Peak memory usage: 88 MB
% 2.74/1.31 % (3821889)Instructions burned: 129 (million)
% 2.74/1.31 % (3821897)lrs+10_1_sil=8000:sp=occurrence:random_seed=4179038677:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.74/1.31 % (3821886)------------------------------
% 2.74/1.31 % (3821886)------------------------------
% 2.74/1.31 % (3821887)Refutation found. Thanks to Tanya!
% 2.74/1.31 % SZS status Theorem for theBenchmark
% 2.74/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.50 % (3821887)------------------------------
% 0.16/1.50 % (3821887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (3821887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (3821887)CaDiCaL version: 2.1.3
% 0.16/1.50 % (3821887)Termination reason: Refutation
% 0.16/1.50 % (3821887)Time elapsed: 0.014 s
% 0.16/1.50 % (3821887)Peak memory usage: 88 MB
% 0.16/1.50 % (3821887)Instructions burned: 20 (million)
% 0.16/1.50 % (3821887)------------------------------
% 0.16/1.50 % (3821887)------------------------------
% 0.16/1.50 % (3821878)Success in time 0.451 s
% 0.16/1.50 % Vampire exiting
%------------------------------------------------------------------------------