%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC100+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 : n011.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:02:26 PM UTC 2026
% Result : Theorem 1.08s 1.14s
% Output : Refutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 8
% Syntax : Number of formulae : 77 ( 17 unt; 0 def)
% Number of atoms : 329 ( 125 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 412 ( 160 ~; 151 |; 73 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 103 ( 81 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& frontsegP(X1,X0) ) ) ) ) ) ) ) ),
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
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& frontsegP(X1,X0) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f121,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f157,plain,
( sK1 = sK3
& sK0 = sK2
& sK3 = app(sK2,sK4)
& strictorderedP(sK2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK2
| ~ lt(X7,X5) ) ) ) )
& ssList(sK4)
& ( nil = sK3
| nil != sK2 )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) ) ) )
& 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(X4,sK4)],[f99]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f161,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f160]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f164,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f167,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f168,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f167]) ).
fof(f169,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK9(X0,X1))
& app(X1,sK9(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f168]) ).
fof(f180,plain,
ssList(sK2),
inference(cnf_transformation,[],[f157]) ).
fof(f183,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f157]) ).
fof(f184,plain,
( nil = sK1
| ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f186,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f157]) ).
fof(f187,plain,
ssList(sK4),
inference(cnf_transformation,[],[f157]) ).
fof(f190,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f157]) ).
fof(f191,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f157]) ).
fof(f192,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f157]) ).
fof(f205,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f206,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f214,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f215,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f216,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f219,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f220,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f222,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f232,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f265,plain,
( ~ frontsegP(sK3,sK2)
| ~ neq(sK2,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f184,f192,f191,f192,f191]) ).
fof(f266,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f183,f191,f192]) ).
fof(f272,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f215]) ).
fof(f276,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f232]) ).
fof(f284,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f272]) ).
fof(f330,plain,
( nil != sK3
| nil = sK2
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f205,f190]) ).
fof(f333,plain,
( nil != sK3
| nil = sK2
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f330,f187]) ).
fof(f334,plain,
( nil != sK3
| nil = sK2 ),
inference(forward_subsumption_resolution,[],[f333,f180]) ).
fof(f335,plain,
( nil != sK3
| nil = sK4
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f206,f190]) ).
fof(f338,plain,
( nil != sK3
| nil = sK4
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f335,f187]) ).
fof(f339,plain,
( nil != sK3
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f338,f180]) ).
fof(f399,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f276,f214]) ).
fof(f404,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f399,f190]) ).
fof(f409,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f404,f187]) ).
fof(f411,plain,
frontsegP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f409,f180]) ).
fof(f412,plain,
( ~ neq(sK2,nil)
| nil = sK3 ),
inference(resolution,[],[f411,f265]) ).
fof(f430,plain,
( nil = sK3
| nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f412,f216]) ).
fof(f431,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f430,f186]) ).
fof(f433,plain,
( nil = sK3
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f431,f219]) ).
fof(f434,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f433,f180]) ).
fof(f466,plain,
! [X0] :
( frontsegP(X0,sK3)
| ~ ssList(X0) ),
inference(superposition,[],[f222,f434]) ).
fof(f473,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(superposition,[],[f334,f434]) ).
fof(f474,plain,
( sK3 != sK3
| sK3 = sK4 ),
inference(superposition,[],[f339,f434]) ).
fof(f479,plain,
sK3 = sK4,
inference(trivial_inequality_removal,[],[f474]) ).
fof(f480,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f473]) ).
fof(f495,plain,
sK2 = sK4,
inference(forward_demodulation,[],[f480,f479]) ).
fof(f572,plain,
! [X0] :
( frontsegP(X0,sK4)
| ~ ssList(X0) ),
inference(forward_demodulation,[],[f466,f479]) ).
fof(f573,plain,
( ~ ssList(nil)
| nil = sK4
| ~ ssList(sK4) ),
inference(resolution,[],[f572,f220]) ).
fof(f577,plain,
( nil = sK4
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f573,f219]) ).
fof(f578,plain,
nil = sK4,
inference(forward_subsumption_resolution,[],[f577,f187]) ).
fof(f593,plain,
( sK2 != sK4
| neq(sK3,sK4) ),
inference(superposition,[],[f266,f578]) ).
fof(f610,plain,
neq(sK3,sK4),
inference(forward_subsumption_resolution,[],[f593,f495]) ).
fof(f613,plain,
neq(sK4,sK4),
inference(forward_demodulation,[],[f610,f479]) ).
fof(f633,plain,
~ ssList(sK4),
inference(resolution,[],[f613,f284]) ).
fof(f635,plain,
$false,
inference(forward_subsumption_resolution,[],[f633,f187]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC100+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.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:52:45 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.08/1.14 % (3237069)Detected formulas, will run a generic FOF schedule.
% 1.08/1.14 % (3237078)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1025995282:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.08/1.14 % (3237078)First to succeed.
% 1.08/1.14 % (3237078)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3237069"
% 1.08/1.14 % (3237080)dis-21_1_sil=8000:lcm=predicate:random_seed=2404975826: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.08/1.14 % (3237076)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=3799283299:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.08/1.14 % (3237077)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3549776964:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.08/1.14 % (3237074)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=840291535:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.08/1.14 % (3237075)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=772579391:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.08/1.14 % (3237079)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3869350058:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.08/1.14 % (3237077)Also succeeded, but the first one will report.
% 1.08/1.14 % (3237079)Also succeeded, but the first one will report.
% 1.08/1.14 % (3237080)Instruction limit reached!
% 1.08/1.14 % (3237080)------------------------------
% 1.08/1.14 % (3237080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.08/1.14 % (3237080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/1.14 % (3237080)CaDiCaL version: 2.1.3
% 1.08/1.14 % (3237080)Termination reason: Instruction limit
% 1.08/1.14 % (3237080)Termination phase: Saturation
% 1.08/1.14 % (3237080)Time elapsed: 0.072 s
% 1.08/1.14 % (3237080)Peak memory usage: 90 MB
% 1.08/1.14 % (3237080)Instructions burned: 129 (million)
% 1.08/1.14 % (3237078)Refutation found. Thanks to Tanya!
% 1.08/1.14 % SZS status Theorem for theBenchmark
% 1.08/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 2.81/1.34 % (3237078)------------------------------
% 2.81/1.34 % (3237078)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.81/1.34 % (3237078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.81/1.34 % (3237078)CaDiCaL version: 2.1.3
% 2.81/1.34 % (3237078)Termination reason: Refutation
% 2.81/1.34 % (3237078)Time elapsed: 0.007 s
% 2.81/1.34 % (3237078)Peak memory usage: 88 MB
% 2.81/1.34 % (3237078)Instructions burned: 17 (million)
% 2.81/1.34 % (3237078)------------------------------
% 2.81/1.34 % (3237078)------------------------------
% 2.81/1.34 % (3237069)Success in time 0.319 s
% 2.81/1.34 % Vampire exiting
%------------------------------------------------------------------------------