%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC366+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 : n008.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:39 PM UTC 2026
% Result : Theorem 2.64s 0.83s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 7
% Syntax : Number of formulae : 64 ( 12 unt; 0 def)
% Number of atoms : 300 ( 66 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 414 ( 178 ~; 162 |; 52 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 89 ( 71 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& app(X5,X2) = X4
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& neq(nil,X3) ) ) )
| rearsegP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& app(X5,X2) = X4
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& neq(nil,X3) ) ) )
| rearsegP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| app(X5,X2) != X4
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ neq(nil,X3) ) ) )
& ~ rearsegP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| app(X5,X2) != X4
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ neq(nil,X3) ) ) )
& ~ rearsegP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
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(f125,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f137,plain,
( sK1 = sK3
& sK0 = sK2
& ( ( neq(sK1,nil)
& ! [X4] :
( ~ ssList(X4)
| sK3 = X4
| ! [X5] :
( ~ ssList(X5)
| app(X5,sK2) != X4
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(sK3) != X6
| ~ neq(nil,sK3) ) ) )
& ~ rearsegP(sK1,sK0) )
| ( neq(sK1,nil)
& ~ neq(sK3,nil) ) )
& ssList(sK3)
& 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)],[f99]) ).
fof(f142,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f136]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f146]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK9(X0,X1))
& app(sK9(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f147]) ).
fof(f151,plain,
ssList(sK2),
inference(cnf_transformation,[],[f137]) ).
fof(f152,plain,
ssList(sK3),
inference(cnf_transformation,[],[f137]) ).
fof(f153,plain,
( ~ rearsegP(sK1,sK0)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f137]) ).
fof(f155,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| sK3 = X4
| ~ ssList(X5)
| app(X5,sK2) != X4
| ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(sK3) != X6
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f137]) ).
fof(f158,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f137]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f160,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f137]) ).
fof(f171,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f182,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f183,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f184,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f187,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f192,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f202,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| ~ ssList(X2)
| app(X2,X1) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f203,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f158,f160,f160]) ).
fof(f207,plain,
( ~ rearsegP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f153,f160,f159]) ).
fof(f213,plain,
! [X6,X5] :
( ~ ssList(app(X5,sK2))
| sK3 = app(X5,sK2)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(sK3) != X6
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f155]) ).
fof(f214,plain,
! [X6] :
( ~ ssList(app(cons(X6,nil),sK2))
| sK3 = app(cons(X6,nil),sK2)
| ~ ssList(cons(X6,nil))
| ~ ssItem(X6)
| hd(sK3) != X6
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f213]) ).
fof(f215,plain,
( ~ ssList(app(cons(hd(sK3),nil),sK2))
| sK3 = app(cons(hd(sK3),nil),sK2)
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f214]) ).
fof(f218,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f183]) ).
fof(f221,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f202]) ).
fof(f223,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f225,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f203]) ).
fof(f226,plain,
~ rearsegP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f207,f225]) ).
fof(f227,plain,
( sK3 = app(cons(hd(sK3),nil),sK2)
| ~ ssList(app(cons(hd(sK3),nil),sK2))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f215,f225]) ).
fof(f324,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f221,f182]) ).
fof(f329,plain,
( rearsegP(sK3,sK2)
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(sK2)
| ~ ssList(app(cons(hd(sK3),nil),sK2))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(superposition,[],[f324,f227]) ).
fof(f338,plain,
( rearsegP(sK3,sK2)
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(sK2)
| ~ ssList(app(cons(hd(sK3),nil),sK2))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(duplicate_literal_removal,[],[f329]) ).
fof(f341,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ ssList(sK2)
| ~ ssList(app(cons(hd(sK3),nil),sK2))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f338,f226]) ).
fof(f344,plain,
( ~ ssList(app(cons(hd(sK3),nil),sK2))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f341,f151]) ).
fof(f387,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ ssList(sK2)
| ~ ssList(cons(hd(sK3),nil)) ),
inference(resolution,[],[f344,f182]) ).
fof(f395,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ ssList(sK2) ),
inference(duplicate_literal_removal,[],[f387]) ).
fof(f398,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f395,f151]) ).
fof(f401,plain,
( ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f398,f171]) ).
fof(f405,plain,
( ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f401]) ).
fof(f407,plain,
( ~ neq(nil,sK3)
| ~ ssItem(hd(sK3)) ),
inference(forward_subsumption_resolution,[],[f405,f187]) ).
fof(f432,plain,
( ~ ssItem(hd(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(resolution,[],[f407,f184]) ).
fof(f433,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f432,f192]) ).
fof(f434,plain,
( nil = sK3
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f433,f152]) ).
fof(f435,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f434,f187]) ).
fof(f450,plain,
neq(sK3,sK3),
inference(superposition,[],[f225,f435]) ).
fof(f462,plain,
~ ssList(sK3),
inference(resolution,[],[f450,f223]) ).
fof(f464,plain,
$false,
inference(forward_subsumption_resolution,[],[f462,f152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC366+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n008.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:21:01 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 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
% 2.64/0.83 % (2120499)Detected formulas, will run a generic FOF schedule.
% 2.64/0.83 % (2120510)dis-21_1_sil=8000:lcm=predicate:random_seed=146978027: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.64/0.83 % (2120507)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2080731484:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.64/0.83 % (2120505)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=2560384424:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.64/0.83 % (2120504)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=3409489579:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.64/0.83 % (2120506)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=3041960500:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.64/0.83 % (2120508)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=165046273:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.64/0.83 % (2120509)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1276725564:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.64/0.83 % (2120510)Instruction limit reached!
% 2.64/0.83 % (2120510)------------------------------
% 2.64/0.83 % (2120510)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/0.83 % (2120510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/0.83 % (2120510)CaDiCaL version: 2.1.3
% 2.64/0.83 % (2120510)Termination reason: Instruction limit
% 2.64/0.83 % (2120510)Termination phase: Saturation
% 2.64/0.83 % (2120510)Time elapsed: 0.040 s
% 2.64/0.83 % (2120510)Peak memory usage: 90 MB
% 2.64/0.83 % (2120510)Instructions burned: 131 (million)
% 2.64/0.83 % (2120508)First to succeed.
% 2.64/0.83 % (2120507)Also succeeded, but the first one will report.
% 2.64/0.83 % (2120508)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2120499"
% 2.64/0.83 % (2120509)Also succeeded, but the first one will report.
% 2.64/0.83 % (2120518)lrs+10_1_sil=8000:sp=occurrence:random_seed=1391222887:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.64/0.83 % (2120518)Also succeeded, but the first one will report.
% 2.64/0.83 % (2120508)Refutation found. Thanks to Tanya!
% 2.64/0.83 % SZS status Theorem for theBenchmark
% 2.64/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.04 % (2120508)------------------------------
% 0.20/1.04 % (2120508)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.04 % (2120508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.04 % (2120508)CaDiCaL version: 2.1.3
% 0.20/1.04 % (2120508)Termination reason: Refutation
% 0.20/1.04 % (2120508)Time elapsed: 0.009 s
% 0.20/1.04 % (2120508)Peak memory usage: 89 MB
% 0.20/1.04 % (2120508)Instructions burned: 12 (million)
% 0.20/1.04 % (2120508)------------------------------
% 0.20/1.04 % (2120508)------------------------------
% 0.20/1.04 % (2120499)Success in time 0.41 s
% 0.20/1.04 % Vampire exiting
%------------------------------------------------------------------------------