%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV394+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 : n007.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 3.81s 1.17s
% Output : Refutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 77 ( 17 unt; 3 def)
% Number of atoms : 191 ( 24 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 186 ( 72 ~; 74 |; 23 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 192 ( 0 sgn 178 !; 14 ?)
% 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(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,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',l30_li4142) ).
fof(f43,axiom,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(X1,X3,X4)
& strictly_less_than(X3,X4)
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> pair_in_list(remove_slb(X1,X3),X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l30_li3132) ).
fof(f44,conjecture,
! [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',l30_co) ).
fof(f45,negated_conjecture,
~ ! [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) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f48,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f49,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f48]) ).
fof(f54,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] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f58,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f57]) ).
fof(f72,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(f73,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(f74,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,[],[f73]) ).
fof(f75,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(f76,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,[],[f75]) ).
fof(f84,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(f85,plain,
! [X0,X1,X2,X3,X4] :
( pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f86,plain,
! [X0,X1,X2,X3,X4] :
( pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(flattening,[],[f85]) ).
fof(f87,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,[],[f45]) ).
fof(f88,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,[],[f87]) ).
fof(f95,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,[],[f84]) ).
fof(f96,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,[],[f95]) ).
fof(f97,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))],[f96]) ).
fof(f98,plain,
( ~ less_than(sK6,sK5)
& pair_in_list(sK3,sK5,sK6)
& 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,sK6]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5),skolemize(X4,sK6)],[f88]) ).
fof(f100,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f102,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f133,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f49]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( contains_slb(X1,X3)
| triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f72]) ).
fof(f137,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,[],[f74]) ).
fof(f138,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,[],[f76]) ).
fof(f147,plain,
! [X2,X0,X1,X6,X5] :
( ~ pair_in_list(X1,X5,X6)
| less_than(X6,X5)
| ~ check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f97]) ).
fof(f150,plain,
! [X2,X3,X0,X1,X4] :
( ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f151,plain,
ok(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f98]) ).
fof(f152,plain,
check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f98]) ).
fof(f153,plain,
pair_in_list(sK3,sK5,sK6),
inference(cnf_transformation,[],[f98]) ).
fof(f154,plain,
~ less_than(sK6,sK5),
inference(cnf_transformation,[],[f98]) ).
fof(f166,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f102,f100]) ).
fof(f203,plain,
! [X0,X1] :
( less_than(sK6,sK5)
| ~ check_cpq(triple(X0,sK3,X1)) ),
inference(resolution,[],[f147,f153]) ).
fof(f205,plain,
! [X0,X1] : ~ check_cpq(triple(X0,sK3,X1)),
inference(forward_subsumption_resolution,[],[f203,f154]) ).
fof(f253,plain,
! [X2,X3,X0,X1,X4] :
( ~ ok(remove_cpq(triple(X3,X0,X4),X1))
| pair_in_list(remove_slb(X0,X1),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| less_than(X2,X1) ),
inference(resolution,[],[f150,f166]) ).
fof(f258,plain,
! [X2,X3,X0,X1,X4,X5] :
( triple(X4,X1,bad) = remove_cpq(triple(X4,X1,X5),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) ),
inference(resolution,[],[f137,f136]) ).
fof(f265,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,[],[f138,f166]) ).
fof(f464,plain,
! [X0] :
( ~ pair_in_list(sK3,sK5,X0)
| pair_in_list(remove_slb(sK3,sK5),sK5,X0)
| less_than(X0,sK5) ),
inference(resolution,[],[f253,f151]) ).
fof(f467,plain,
( pair_in_list(remove_slb(sK3,sK5),sK5,sK6)
| less_than(sK6,sK5) ),
inference(resolution,[],[f464,f153]) ).
fof(f468,plain,
pair_in_list(remove_slb(sK3,sK5),sK5,sK6),
inference(forward_subsumption_resolution,[],[f467,f154]) ).
fof(f470,plain,
! [X0,X1] :
( less_than(sK6,sK5)
| ~ check_cpq(triple(X0,remove_slb(sK3,sK5),X1)) ),
inference(resolution,[],[f468,f147]) ).
fof(f471,plain,
! [X0,X1] : ~ check_cpq(triple(X0,remove_slb(sK3,sK5),X1)),
inference(forward_subsumption_resolution,[],[f470,f154]) ).
fof(f475,plain,
! [X2,X3,X0,X1,X4,X5] :
( triple(X4,X1,bad) = remove_cpq(triple(X4,X1,X5),X3)
| less_than(lookup_slb(X1,X3),X3)
| remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad) ),
inference(resolution,[],[f265,f136]) ).
fof(f524,plain,
! [X0,X1] :
( check_cpq(triple(sK2,sK3,bad))
| ~ less_than(lookup_slb(sK3,sK5),sK5)
| remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1) ),
inference(superposition,[],[f152,f258]) ).
fof(f541,plain,
! [X0,X1] :
( ~ less_than(lookup_slb(sK3,sK5),sK5)
| remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1) ),
inference(forward_subsumption_resolution,[],[f524,f205]) ).
fof(f545,definition,
( spl7_6
<=> ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
fof(f546,plain,
( ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1)
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f548,definition,
( spl7_7
<=> less_than(lookup_slb(sK3,sK5),sK5) ),
introduced(definition,[new_symbols(definition,[spl7_7])],[avatar_definition]) ).
fof(f552,plain,
( spl7_6
| ~ spl7_7 ),
inference(avatar_split_clause,[],[f541,f548,f545]) ).
fof(f1045,plain,
! [X0,X1] :
( check_cpq(triple(sK2,sK3,bad))
| less_than(lookup_slb(sK3,sK5),sK5)
| remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad) ),
inference(superposition,[],[f152,f475]) ).
fof(f1050,plain,
! [X0,X1] :
( less_than(lookup_slb(sK3,sK5),sK5)
| remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad) ),
inference(forward_subsumption_resolution,[],[f1045,f205]) ).
fof(f1092,definition,
( spl7_26
<=> ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad) ),
introduced(definition,[new_symbols(definition,[spl7_26])],[avatar_definition]) ).
fof(f1093,plain,
( ! [X0,X1] : remove_cpq(triple(X0,sK3,X1),sK5) = triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad)
| ~ spl7_26 ),
inference(avatar_component_clause,[],[f1092]) ).
fof(f1095,plain,
( spl7_26
| spl7_7 ),
inference(avatar_split_clause,[],[f1050,f548,f1092]) ).
fof(f1102,plain,
( ! [X0,X1] : ~ check_cpq(remove_cpq(triple(X0,sK3,X1),sK5))
| ~ spl7_6 ),
inference(superposition,[],[f471,f546]) ).
fof(f1876,plain,
( ! [X0,X1] : ~ ok(remove_cpq(triple(X0,sK3,X1),sK5))
| ~ spl7_26 ),
inference(superposition,[],[f133,f1093]) ).
fof(f2065,plain,
( $false
| ~ spl7_6 ),
inference(resolution,[],[f1102,f152]) ).
fof(f2068,plain,
~ spl7_6,
inference(avatar_contradiction_clause,[],[f2065]) ).
fof(f2155,plain,
( $false
| ~ spl7_26 ),
inference(resolution,[],[f1876,f151]) ).
fof(f2159,plain,
~ spl7_26,
inference(avatar_contradiction_clause,[],[f2155]) ).
cnf(s5,plain,
( spl7_6
| ~ spl7_7 ),
inference(sat_conversion,[],[f552]) ).
cnf(s31,plain,
( spl7_7
| spl7_26 ),
inference(sat_conversion,[],[f1095]) ).
cnf(s71,plain,
~ spl7_6,
inference(sat_conversion,[],[f2068]) ).
cnf(s82,plain,
~ spl7_26,
inference(sat_conversion,[],[f2159]) ).
cnf(s84,plain,
spl7_7,
inference(rat,[],[s31,s82]) ).
cnf(s85,plain,
$false,
inference(rat,[],[s5,s84,s71]) ).
fof(f2160,plain,
$false,
inference(avatar_sat_refutation,[],[s85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV394+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n007.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 10:46:25 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 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
% 3.81/1.17 % (2316310)Detected formulas, will run a generic FOF schedule.
% 3.81/1.17 % (2316315)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=2155952911:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.81/1.17 % (2316319)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2749202710:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.81/1.17 % (2316317)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=3234086914:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.81/1.17 % (2316316)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=2475460722:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.81/1.17 % (2316321)dis-21_1_sil=8000:lcm=predicate:random_seed=2793251664: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)
% 3.81/1.17 % (2316318)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4183509760:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.81/1.17 % (2316320)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3555536153:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.81/1.17 % (2316319)Instruction limit reached!
% 3.81/1.17 % (2316319)------------------------------
% 3.81/1.17 % (2316319)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.81/1.17 % (2316319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.17 % (2316319)CaDiCaL version: 2.1.3
% 3.81/1.17 % (2316319)Termination reason: Instruction limit
% 3.81/1.17 % (2316319)Termination phase: Saturation
% 3.81/1.17 % (2316319)Time elapsed: 0.047 s
% 3.81/1.17 % (2316319)Peak memory usage: 88 MB
% 3.81/1.17 % (2316319)Instructions burned: 120 (million)
% 3.81/1.17 % (2316318)Instruction limit reached!
% 3.81/1.17 % (2316318)------------------------------
% 3.81/1.17 % (2316318)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.81/1.17 % (2316318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.17 % (2316318)CaDiCaL version: 2.1.3
% 3.81/1.17 % (2316318)Termination reason: Instruction limit
% 3.81/1.17 % (2316318)Termination phase: Saturation
% 3.81/1.17 % (2316318)Time elapsed: 0.047 s
% 3.81/1.17 % (2316318)Peak memory usage: 88 MB
% 3.81/1.17 % (2316318)Instructions burned: 112 (million)
% 3.81/1.17 % (2316321)Instruction limit reached!
% 3.81/1.17 % (2316321)------------------------------
% 3.81/1.17 % (2316321)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.81/1.17 % (2316321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.17 % (2316321)CaDiCaL version: 2.1.3
% 3.81/1.17 % (2316321)Termination reason: Instruction limit
% 3.81/1.17 % (2316321)Termination phase: Saturation
% 3.81/1.17 % (2316321)Time elapsed: 0.052 s
% 3.81/1.17 % (2316321)Peak memory usage: 88 MB
% 3.81/1.17 % (2316321)Instructions burned: 130 (million)
% 3.81/1.17 % (2316320)First to succeed.
% 3.81/1.17 % (2316320)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2316310"
% 3.81/1.17 % (2316329)lrs+10_1_sil=8000:sp=occurrence:random_seed=512446233:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.81/1.17 % (2316330)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1524671509:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.81/1.17 % (2316331)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3693803797:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.81/1.17 % (2316331)Also succeeded, but the first one will report.
% 3.81/1.17 % (2316330)Instruction limit reached!
% 3.81/1.17 % (2316330)------------------------------
% 3.81/1.17 % (2316330)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.81/1.17 % (2316330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.17 % (2316330)CaDiCaL version: 2.1.3
% 3.81/1.17 % (2316330)Termination reason: Instruction limit
% 3.81/1.17 % (2316330)Termination phase: Saturation
% 3.81/1.17 % (2316330)Time elapsed: 0.090 s
% 3.81/1.17 % (2316330)Peak memory usage: 89 MB
% 3.81/1.17 % (2316330)Instructions burned: 158 (million)
% 3.81/1.17 % (2316320)Refutation found. Thanks to Tanya!
% 3.81/1.17 % SZS status Theorem for theBenchmark
% 3.81/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 4.23/1.37 % (2316320)------------------------------
% 4.23/1.37 % (2316320)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.23/1.37 % (2316320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.23/1.37 % (2316320)CaDiCaL version: 2.1.3
% 4.23/1.37 % (2316320)Termination reason: Refutation
% 4.23/1.37 % (2316320)Time elapsed: 0.089 s
% 4.23/1.37 % (2316320)Peak memory usage: 90 MB
% 4.23/1.37 % (2316320)Instructions burned: 127 (million)
% 4.23/1.37 % (2316320)------------------------------
% 4.23/1.37 % (2316320)------------------------------
% 4.23/1.37 % (2316310)Success in time 0.514 s
% 4.23/1.37 % Vampire exiting
%------------------------------------------------------------------------------