%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:03:12 PM UTC 2026
% Result : Theorem 3.10s 1.10s
% Output : Refutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 7 unt; 0 def)
% Number of atoms : 329 ( 35 equ)
% Maximal formula atoms : 17 ( 6 avg)
% Number of connectives : 469 ( 189 ~; 188 |; 62 &)
% ( 8 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 143 ( 119 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& strictorderedP(X2)
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f101,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f102,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f105,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f106,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f147,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& strictorderedP(sK2)
& ~ totalorderedP(sK0)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f150,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f151,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f150]) ).
fof(f152,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK4(X0),sK5(X0))
& app(app(sK6(X0),cons(sK4(X0),sK7(X0))),cons(sK5(X0),sK8(X0))) = X0
& ssList(sK8(X0))
& ssList(sK7(X0))
& ssList(sK6(X0))
& ssItem(sK5(X0))
& ssItem(sK4(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8]),skolemize(X1,sK4(X0)),skolemize(X2,sK5(X0)),skolemize(X3,sK6(X0)),skolemize(X4,sK7(X0)),skolemize(X5,sK8(X0))],[f151]) ).
fof(f155,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f106]) ).
fof(f156,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f155]) ).
fof(f157,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK9(X0),sK10(X0))
& app(app(sK11(X0),cons(sK9(X0),sK12(X0))),cons(sK10(X0),sK13(X0))) = X0
& ssList(sK13(X0))
& ssList(sK12(X0))
& ssList(sK11(X0))
& ssItem(sK10(X0))
& ssItem(sK9(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13]),skolemize(X1,sK9(X0)),skolemize(X2,sK10(X0)),skolemize(X3,sK11(X0)),skolemize(X4,sK12(X0)),skolemize(X5,sK13(X0))],[f156]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f137]) ).
fof(f164,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f163]) ).
fof(f167,plain,
ssList(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f168,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f147]) ).
fof(f169,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f170,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f147]) ).
fof(f181,plain,
! [X0] :
( ssItem(sK4(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f182,plain,
! [X0] :
( ssItem(sK5(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f183,plain,
! [X0] :
( ssList(sK6(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f184,plain,
! [X0] :
( ssList(sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f185,plain,
! [X0] :
( ssList(sK8(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f186,plain,
! [X0] :
( app(app(sK6(X0),cons(sK4(X0),sK7(X0))),cons(sK5(X0),sK8(X0))) = X0
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f187,plain,
! [X0] :
( ~ leq(sK4(X0),sK5(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f195,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f234,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f242,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f168,f170]) ).
fof(f250,plain,
! [X10,X8,X6,X9,X7] :
( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| lt(X6,X7)
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f195]) ).
fof(f269,plain,
! [X0] :
( ~ lt(sK4(X0),sK5(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(resolution,[],[f234,f187]) ).
fof(f270,plain,
! [X0] :
( ~ lt(sK4(X0),sK5(X0))
| ~ ssItem(sK4(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f269,f182]) ).
fof(f271,plain,
! [X0] :
( ~ lt(sK4(X0),sK5(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f270,f181]) ).
fof(f858,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK8(X0))
| ~ ssList(sK7(X0))
| ~ ssList(sK6(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| lt(sK4(X0),sK5(X0))
| ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f250,f186]) ).
fof(f863,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK8(X0))
| ~ ssList(sK7(X0))
| ~ ssList(sK6(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| lt(sK4(X0),sK5(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(duplicate_literal_removal,[],[f858]) ).
fof(f867,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK8(X0))
| ~ ssList(sK7(X0))
| ~ ssList(sK6(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f863,f271]) ).
fof(f878,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK7(X0))
| ~ ssList(sK6(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f867,f185]) ).
fof(f886,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK6(X0))
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f878,f184]) ).
fof(f887,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK5(X0))
| ~ ssItem(sK4(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f886,f183]) ).
fof(f888,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK4(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f887,f182]) ).
fof(f889,plain,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f888,f181]) ).
fof(f890,plain,
( ~ ssList(sK2)
| ~ strictorderedP(sK2) ),
inference(resolution,[],[f889,f242]) ).
fof(f895,plain,
~ strictorderedP(sK2),
inference(forward_subsumption_resolution,[],[f890,f167]) ).
fof(f896,plain,
$false,
inference(forward_subsumption_resolution,[],[f895,f169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n014.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 08:45:31 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running first-order theorem proving
% 0.10/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.10/1.10 % (1638259)Detected formulas, will run a generic FOF schedule.
% 3.10/1.10 % (1638264)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=1602116931:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.10 % (1638269)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3398984751:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.10 % (1638268)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3516325376:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.10 % (1638265)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=907298311:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.10 % (1638267)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2950060981:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.10 % (1638270)dis-21_1_sil=8000:lcm=predicate:random_seed=1002486256: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.10/1.10 % (1638266)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=3998931904:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.10 % (1638267)Refutation not found, incomplete strategy
% 3.10/1.10 % (1638267)------------------------------
% 3.10/1.10 % (1638267)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (1638267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (1638267)CaDiCaL version: 2.1.3
% 3.10/1.10 % (1638267)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.10 % (1638267)Time elapsed: 0.003 s
% 3.10/1.10 % (1638267)Peak memory usage: 88 MB
% 3.10/1.10 % (1638267)Instructions burned: 3 (million)
% 3.10/1.10 % (1638268)First to succeed.
% 3.10/1.10 % (1638268)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1638259"
% 3.10/1.10 % (1638270)Instruction limit reached!
% 3.10/1.10 % (1638270)------------------------------
% 3.10/1.10 % (1638270)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (1638270)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (1638270)CaDiCaL version: 2.1.3
% 3.10/1.10 % (1638270)Termination reason: Instruction limit
% 3.10/1.10 % (1638270)Termination phase: Saturation
% 3.10/1.10 % (1638270)Time elapsed: 0.070 s
% 3.10/1.10 % (1638270)Peak memory usage: 91 MB
% 3.10/1.10 % (1638270)Instructions burned: 131 (million)
% 3.10/1.10 % (1638269)Instruction limit reached!
% 3.10/1.10 % (1638269)------------------------------
% 3.10/1.10 % (1638269)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (1638269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (1638269)CaDiCaL version: 2.1.3
% 3.10/1.10 % (1638269)Termination reason: Instruction limit
% 3.10/1.10 % (1638269)Termination phase: Saturation
% 3.10/1.10 % (1638269)Time elapsed: 0.093 s
% 3.10/1.10 % (1638269)Peak memory usage: 90 MB
% 3.10/1.10 % (1638269)Instructions burned: 139 (million)
% 3.10/1.10 % (1638278)lrs+10_1_sil=8000:sp=occurrence:random_seed=578051721:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.10/1.10 % (1638267)------------------------------
% 3.10/1.10 % (1638267)------------------------------
% 3.10/1.10 % (1638279)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4015381238:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.10/1.10 % (1638268)Refutation found. Thanks to Tanya!
% 3.10/1.10 % SZS status Theorem for theBenchmark
% 3.10/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.66/1.19 % (1638268)------------------------------
% 3.66/1.19 % (1638268)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.19 % (1638268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.19 % (1638268)CaDiCaL version: 2.1.3
% 3.66/1.19 % (1638268)Termination reason: Refutation
% 3.66/1.19 % (1638268)Time elapsed: 0.017 s
% 3.66/1.19 % (1638268)Peak memory usage: 88 MB
% 3.66/1.19 % (1638268)Instructions burned: 26 (million)
% 3.66/1.19 % (1638268)------------------------------
% 3.66/1.19 % (1638268)------------------------------
% 3.66/1.19 % (1638259)Success in time 0.449 s
% 3.66/1.19 % Vampire exiting
%------------------------------------------------------------------------------