%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC357+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 : n009.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:37 PM UTC 2026
% Result : Theorem 3.09s 1.11s
% Output : Refutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 81 ( 18 unt; 4 def)
% Number of atoms : 294 ( 49 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 362 ( 149 ~; 136 |; 53 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 68 !; 20 ?)
% 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(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| segmentP(X1,X0)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
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)
| segmentP(X1,X0)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ segmentP(X1,X0)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ segmentP(X1,X0)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f240,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,[],[f101]) ).
fof(f241,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,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(X1,sK11(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK13(X0,X1))
& ssList(sK14(X0,X1))
& app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ~ segmentP(sK54,sK53)
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& frontsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f309,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK11(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f310,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f318,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f442,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ segmentP(sK54,sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f318]) ).
fof(f543,definition,
( spl57_1
<=> frontsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f545,plain,
( frontsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f543]) ).
fof(f547,definition,
( spl57_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f549,plain,
( nil = sK55
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f547]) ).
fof(f550,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f500,f547,f543]) ).
fof(f563,definition,
( spl57_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f564,plain,
( ssList(nil)
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f563]) ).
fof(f596,plain,
spl57_5,
inference(avatar_split_clause,[],[f389,f563]) ).
fof(f597,plain,
~ segmentP(sK54,sK55),
inference(superposition,[],[f504,f506]) ).
fof(f600,plain,
~ segmentP(sK56,sK53),
inference(superposition,[],[f504,f507]) ).
fof(f602,plain,
~ segmentP(sK56,sK55),
inference(forward_demodulation,[],[f600,f506]) ).
fof(f607,plain,
( ~ segmentP(sK54,nil)
| ~ spl57_2 ),
inference(forward_demodulation,[],[f597,f549]) ).
fof(f608,plain,
( ~ segmentP(sK56,nil)
| ~ spl57_2 ),
inference(forward_demodulation,[],[f607,f507]) ).
fof(f614,plain,
( ~ ssList(sK56)
| ~ spl57_2 ),
inference(resolution,[],[f442,f608]) ).
fof(f615,plain,
( $false
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f614,f499]) ).
fof(f616,plain,
~ spl57_2,
inference(avatar_contradiction_clause,[],[f615]) ).
fof(f827,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(resolution,[],[f309,f545]) ).
fof(f832,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f827,f498]) ).
fof(f836,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f832,f499]) ).
fof(f844,definition,
( spl57_14
<=> ssList(sK11(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_14])],[avatar_definition]) ).
fof(f845,plain,
( ssList(sK11(sK56,sK55))
| ~ spl57_14 ),
inference(avatar_component_clause,[],[f844]) ).
fof(f846,plain,
( ~ ssList(sK11(sK56,sK55))
| spl57_14 ),
inference(avatar_component_clause,[],[f844]) ).
fof(f863,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| spl57_14 ),
inference(resolution,[],[f846,f310]) ).
fof(f864,plain,
( ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1
| spl57_14 ),
inference(forward_subsumption_resolution,[],[f863,f545]) ).
fof(f865,plain,
( ~ ssList(sK56)
| ~ spl57_1
| spl57_14 ),
inference(forward_subsumption_resolution,[],[f864,f498]) ).
fof(f866,plain,
( $false
| ~ spl57_1
| spl57_14 ),
inference(forward_subsumption_resolution,[],[f865,f499]) ).
fof(f867,plain,
( ~ spl57_1
| spl57_14 ),
inference(avatar_contradiction_clause,[],[f866]) ).
fof(f1681,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f513,f403]) ).
fof(f1688,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f1681]) ).
fof(f1697,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f1688,f401]) ).
fof(f1703,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl57_5 ),
inference(forward_subsumption_resolution,[],[f1697,f564]) ).
fof(f2343,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_5 ),
inference(superposition,[],[f1703,f836]) ).
fof(f2355,plain,
( ~ ssList(sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_5 ),
inference(forward_subsumption_resolution,[],[f2343,f602]) ).
fof(f2364,plain,
( ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_5 ),
inference(forward_subsumption_resolution,[],[f2355,f498]) ).
fof(f2371,plain,
( $false
| ~ spl57_1
| ~ spl57_5
| ~ spl57_14 ),
inference(forward_subsumption_resolution,[],[f2364,f845]) ).
fof(f2372,plain,
( ~ spl57_1
| ~ spl57_5
| ~ spl57_14 ),
inference(avatar_contradiction_clause,[],[f2371]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f550]) ).
cnf(s13,plain,
spl57_5,
inference(sat_conversion,[],[f596]) ).
cnf(s17,plain,
~ spl57_2,
inference(sat_conversion,[],[f616]) ).
cnf(s20,plain,
( ~ spl57_1
| spl57_14 ),
inference(sat_conversion,[],[f867]) ).
cnf(s65,plain,
( ~ spl57_1
| ~ spl57_5
| ~ spl57_14 ),
inference(sat_conversion,[],[f2372]) ).
cnf(s72,plain,
spl57_1,
inference(rat,[],[s1,s17]) ).
cnf(s73,plain,
~ spl57_14,
inference(rat,[],[s65,s13,s72]) ).
cnf(s74,plain,
$false,
inference(rat,[],[s20,s73,s72]) ).
fof(f2374,plain,
$false,
inference(avatar_sat_refutation,[],[s74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC357+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.09/0.18 % Computer : n009.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 09:15:30 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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
% 3.09/1.11 % (2905740)Detected formulas, will run a generic FOF schedule.
% 3.09/1.11 % (2905748)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3977512330:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.09/1.11 % (2905750)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3356107084:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.09/1.11 % (2905749)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1169627348:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.09/1.11 % (2905746)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=1962472729:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.09/1.11 % (2905751)dis-21_1_sil=8000:lcm=predicate:random_seed=4028445200: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.09/1.11 % (2905745)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=3536693211:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.09/1.11 % (2905747)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=3804936237:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.09/1.11 % (2905748)Instruction limit reached!
% 3.09/1.11 % (2905748)------------------------------
% 3.09/1.11 % (2905748)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.11 % (2905748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.11 % (2905748)CaDiCaL version: 2.1.3
% 3.09/1.11 % (2905748)Termination reason: Instruction limit
% 3.09/1.11 % (2905748)Termination phase: Saturation
% 3.09/1.11 % (2905748)Time elapsed: 0.037 s
% 3.09/1.11 % (2905748)Peak memory usage: 89 MB
% 3.09/1.11 % (2905748)Instructions burned: 112 (million)
% 3.09/1.11 % (2905750)First to succeed.
% 3.09/1.11 % (2905750)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2905740"
% 3.09/1.11 % (2905749)Instruction limit reached!
% 3.09/1.11 % (2905749)------------------------------
% 3.09/1.11 % (2905749)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.11 % (2905749)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.11 % (2905749)CaDiCaL version: 2.1.3
% 3.09/1.11 % (2905749)Termination reason: Instruction limit
% 3.09/1.11 % (2905749)Termination phase: Saturation
% 3.09/1.11 % (2905749)Time elapsed: 0.059 s
% 3.09/1.11 % (2905749)Peak memory usage: 88 MB
% 3.09/1.11 % (2905749)Instructions burned: 121 (million)
% 3.09/1.11 % (2905751)Instruction limit reached!
% 3.09/1.11 % (2905751)------------------------------
% 3.09/1.11 % (2905751)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.11 % (2905751)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.11 % (2905751)CaDiCaL version: 2.1.3
% 3.09/1.11 % (2905751)Termination reason: Instruction limit
% 3.09/1.11 % (2905751)Termination phase: Saturation
% 3.09/1.11 % (2905751)Time elapsed: 0.076 s
% 3.09/1.11 % (2905751)Peak memory usage: 90 MB
% 3.09/1.11 % (2905751)Instructions burned: 130 (million)
% 3.09/1.11 % (2905759)lrs+10_1_sil=8000:sp=occurrence:random_seed=371501173:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.09/1.11 % (2905759)Also succeeded, but the first one will report.
% 3.09/1.11 % (2905760)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3528775765:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.09/1.11 % (2905761)lrs+1011_1_sil=32000:sp=occurrence:random_seed=422363492:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.09/1.11 % (2905760)Instruction limit reached!
% 3.09/1.11 % (2905760)------------------------------
% 3.09/1.11 % (2905760)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.11 % (2905760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.11 % (2905760)CaDiCaL version: 2.1.3
% 3.09/1.11 % (2905760)Termination reason: Instruction limit
% 3.09/1.11 % (2905760)Termination phase: Saturation
% 3.09/1.11 % (2905760)Time elapsed: 0.077 s
% 3.09/1.11 % (2905760)Peak memory usage: 91 MB
% 3.09/1.11 % (2905760)Instructions burned: 159 (million)
% 3.09/1.11 % (2905750)Refutation found. Thanks to Tanya!
% 3.09/1.11 % SZS status Theorem for theBenchmark
% 3.75/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 3.75/1.22 % (2905750)------------------------------
% 3.75/1.22 % (2905750)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.22 % (2905750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.22 % (2905750)CaDiCaL version: 2.1.3
% 3.75/1.22 % (2905750)Termination reason: Refutation
% 3.75/1.22 % (2905750)Time elapsed: 0.051 s
% 3.75/1.22 % (2905750)Peak memory usage: 90 MB
% 3.75/1.22 % (2905750)Instructions burned: 75 (million)
% 3.75/1.22 % (2905750)------------------------------
% 3.75/1.22 % (2905750)------------------------------
% 3.75/1.22 % (2905740)Success in time 0.452 s
% 3.75/1.22 % Vampire exiting
%------------------------------------------------------------------------------