%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC247+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:07 PM UTC 2026
% Result : Theorem 1.04s 0.94s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 10 unt; 0 def)
% Number of atoms : 310 ( 68 equ)
% Maximal formula atoms : 23 ( 5 avg)
% Number of connectives : 416 ( 167 ~; 166 |; 66 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 105 ( 81 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ totalorderedP(X2)
| nil = X0
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X0
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ totalorderedP(X2)
| nil = X0
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X0
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& totalorderedP(X2)
& nil != X0
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X0
| ? [X8] :
( memberP(X6,X8)
& memberP(X7,X8)
& lt(X5,X8)
& ~ leq(X5,X8)
& ssItem(X8) ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& totalorderedP(X2)
& nil != X0
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X0
| ? [X8] :
( memberP(X6,X8)
& memberP(X7,X8)
& lt(X5,X8)
& ~ leq(X5,X8)
& ssItem(X8) ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f102,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f120,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f171,plain,
( sK1 = sK3
& sK0 = sK2
& frontsegP(sK3,sK2)
& totalorderedP(sK2)
& nil != sK0
& ! [X4] :
( ~ ssList(X4)
| ~ neq(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ segmentP(X4,sK2)
| ~ totalorderedP(X4) )
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK0
| ( memberP(X6,sK4(X5,X6,X7))
& memberP(X7,sK4(X5,X6,X7))
& lt(X5,sK4(X5,X6,X7))
& ~ leq(X5,sK4(X5,X6,X7))
& ssItem(sK4(X5,X6,X7)) ) ) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X8,sK4(X5,X6,X7))],[f99]) ).
fof(f173,plain,
! [X0] :
( nil = X0
| ( ssList(sK7(X0))
& ssItem(sK8(X0))
& cons(sK8(X0),sK7(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0))],[f102]) ).
fof(f205,plain,
ssList(sK2),
inference(cnf_transformation,[],[f171]) ).
fof(f207,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK0
| ssItem(sK4(X5,X6,X7)) ),
inference(cnf_transformation,[],[f171]) ).
fof(f211,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK0
| memberP(X6,sK4(X5,X6,X7)) ),
inference(cnf_transformation,[],[f171]) ).
fof(f213,plain,
nil != sK0,
inference(cnf_transformation,[],[f171]) ).
fof(f216,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f171]) ).
fof(f222,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f223,plain,
! [X0] :
( ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f224,plain,
! [X0] :
( ssList(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f228,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f234,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f237,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f244,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f245,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f311,plain,
nil != sK2,
inference(definition_unfolding,[],[f213,f216]) ).
fof(f312,plain,
! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK2
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssItem(X5)
| memberP(X6,sK4(X5,X6,X7)) ),
inference(definition_unfolding,[],[f211,f216]) ).
fof(f316,plain,
! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK2
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssItem(X5)
| ssItem(sK4(X5,X6,X7)) ),
inference(definition_unfolding,[],[f207,f216]) ).
fof(f358,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f312,f237]) ).
fof(f359,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f316,f237]) ).
fof(f360,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f359,f244]) ).
fof(f361,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f358,f244]) ).
fof(f470,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f361,f234]) ).
fof(f471,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f360,f234]) ).
fof(f488,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f471]) ).
fof(f489,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f470]) ).
fof(f498,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f488,f222]) ).
fof(f499,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK8(X0))
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f498,f224]) ).
fof(f500,plain,
! [X0] :
( sK2 != X0
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f499,f223]) ).
fof(f501,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f489,f222]) ).
fof(f502,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK8(X0))
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f501,f224]) ).
fof(f503,plain,
! [X0] :
( sK2 != X0
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f502,f223]) ).
fof(f539,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f500]) ).
fof(f540,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f539,f311]) ).
fof(f541,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f540,f205]) ).
fof(f542,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f503]) ).
fof(f543,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f542,f311]) ).
fof(f544,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f543,f205]) ).
fof(f550,plain,
( ~ ssList(cons(sK8(sK2),nil))
| ~ ssItem(sK4(sK8(sK2),nil,sK7(sK2))) ),
inference(resolution,[],[f544,f245]) ).
fof(f551,plain,
~ ssList(cons(sK8(sK2),nil)),
inference(forward_subsumption_resolution,[],[f550,f541]) ).
fof(f552,plain,
( ~ ssItem(sK8(sK2))
| ~ ssList(nil) ),
inference(resolution,[],[f551,f228]) ).
fof(f553,plain,
~ ssItem(sK8(sK2)),
inference(forward_subsumption_resolution,[],[f552,f244]) ).
fof(f555,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(resolution,[],[f553,f223]) ).
fof(f556,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f555,f311]) ).
fof(f557,plain,
$false,
inference(forward_subsumption_resolution,[],[f556,f205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC247+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n013.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 08:38:51 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running first-order theorem proving
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.04/0.94 % (1027671)Detected formulas, will run a generic FOF schedule.
% 1.04/0.94 % (1027680)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3158517945:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.04/0.94 % (1027680)First to succeed.
% 1.04/0.94 % (1027680)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1027671"
% 1.04/0.94 % (1027681)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2870771698:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.04/0.94 % (1027679)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2300377952:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.04/0.94 % (1027677)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=3869367501:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.04/0.94 % (1027678)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=3990161088:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.04/0.94 % (1027676)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=779550397:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.04/0.94 % (1027682)dis-21_1_sil=8000:lcm=predicate:random_seed=4216033048: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)
% 1.04/0.94 % (1027681)Also succeeded, but the first one will report.
% 1.04/0.94 % (1027679)Instruction limit reached!
% 1.04/0.94 % (1027679)------------------------------
% 1.04/0.94 % (1027679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/0.94 % (1027679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.94 % (1027679)CaDiCaL version: 2.1.3
% 1.04/0.94 % (1027679)Termination reason: Instruction limit
% 1.04/0.94 % (1027679)Termination phase: Saturation
% 1.04/0.94 % (1027679)Time elapsed: 0.069 s
% 1.04/0.94 % (1027679)Peak memory usage: 89 MB
% 1.04/0.94 % (1027679)Instructions burned: 109 (million)
% 1.04/0.94 % (1027682)Instruction limit reached!
% 1.04/0.94 % (1027682)------------------------------
% 1.04/0.94 % (1027682)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/0.94 % (1027682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.94 % (1027682)CaDiCaL version: 2.1.3
% 1.04/0.94 % (1027682)Termination reason: Instruction limit
% 1.04/0.94 % (1027682)Termination phase: Saturation
% 1.04/0.94 % (1027682)Time elapsed: 0.075 s
% 1.04/0.94 % (1027682)Peak memory usage: 91 MB
% 1.04/0.94 % (1027682)Instructions burned: 129 (million)
% 1.04/0.94 % (1027680)Refutation found. Thanks to Tanya!
% 1.04/0.94 % SZS status Theorem for theBenchmark
% 1.04/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.13 % (1027680)------------------------------
% 0.18/1.13 % (1027680)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.13 % (1027680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.13 % (1027680)CaDiCaL version: 2.1.3
% 0.18/1.13 % (1027680)Termination reason: Refutation
% 0.18/1.13 % (1027680)Time elapsed: 0.006 s
% 0.18/1.13 % (1027680)Peak memory usage: 88 MB
% 0.18/1.13 % (1027680)Instructions burned: 15 (million)
% 0.18/1.13 % (1027680)------------------------------
% 0.18/1.13 % (1027680)------------------------------
% 0.18/1.13 % (1027671)Success in time 0.289 s
% 0.18/1.13 % Vampire exiting
%------------------------------------------------------------------------------