%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC065-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 : n012.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:16 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.85s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 28
% Syntax : Number of formulae : 108 ( 21 unt; 8 def)
% Number of atoms : 296 ( 39 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 369 ( 181 ~; 180 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause56) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).
fof(f79,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| segmentP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause79) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
fof(f161,axiom,
! [X2,X0,X1] :
( app(app(X2,X1),X0) = app(X2,app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause149) ).
fof(f164,axiom,
! [X2,X0,X1] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause152) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f207]) ).
fof(f212,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f216,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f214,f204,f204,f205]) ).
fof(f221,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f222,plain,
! [X0] :
( nil != sk3
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f216,f205,f204,f205]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f227,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f231,definition,
( spl0_1
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f232,plain,
( segmentP(nil,nil)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f234,definition,
( spl0_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f235,plain,
( ~ ssList(nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f236,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f227,f234,f231]) ).
fof(f242,definition,
( spl0_4
<=> ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f243,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f245,definition,
( spl0_5
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f246,plain,
( nil != sk3
| spl0_5 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f247,plain,
( spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f222,f245,f242]) ).
fof(f249,definition,
( spl0_6
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f250,plain,
( neq(sk4,nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( spl0_6
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f221,f245,f249]) ).
fof(f253,definition,
( spl0_7
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f254,plain,
( nil = sk4
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f255,plain,
( spl0_4
| spl0_7 ),
inference(avatar_split_clause,[],[f220,f253,f242]) ).
fof(f257,plain,
( ~ spl0_5
| spl0_7 ),
inference(avatar_split_clause,[],[f212,f253,f245]) ).
fof(f258,plain,
( ~ segmentP(sk3,sk4)
| ~ segmentP(sk4,sk4)
| ~ ssList(sk4)
| ~ spl0_4
| ~ spl0_6 ),
inference(resolution,[],[f243,f250]) ).
fof(f259,plain,
( ~ segmentP(sk3,sk4)
| ~ segmentP(sk4,sk4)
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f258,f203]) ).
fof(f261,definition,
( spl0_8
<=> segmentP(sk4,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f262,plain,
( ~ segmentP(sk4,sk4)
| spl0_8 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,definition,
( spl0_9
<=> segmentP(sk3,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f265,plain,
( ~ segmentP(sk3,sk4)
| spl0_9 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f259,f249,f242,f264,f261]) ).
fof(f267,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f235,f8]) ).
fof(f268,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f269,plain,
( ~ ssList(sk4)
| spl0_8 ),
inference(resolution,[],[f57,f262]) ).
fof(f270,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f269,f203]) ).
fof(f271,plain,
spl0_8,
inference(avatar_contradiction_clause,[],[f270]) ).
fof(f284,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_4 ),
inference(resolution,[],[f102,f243]) ).
fof(f287,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0) )
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f284]) ).
fof(f288,plain,
( ! [X0] :
( ~ segmentP(sk4,X0)
| nil = X0
| ~ segmentP(sk3,X0)
| ~ ssList(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f287,f8]) ).
fof(f289,plain,
( nil != sk4
| ~ ssList(sk5)
| ~ ssList(sk3)
| nil = sk3 ),
inference(superposition,[],[f122,f208]) ).
fof(f292,plain,
( nil != sk4
| ~ ssList(sk3)
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f289,f206]) ).
fof(f293,plain,
( nil != sk4
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f292,f202]) ).
fof(f294,plain,
( nil != sk4
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f293,f246]) ).
fof(f311,plain,
( ! [X0] :
( ~ segmentP(X0,sk4)
| ~ ssList(sk4)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ segmentP(sk3,X0) )
| spl0_9 ),
inference(resolution,[],[f164,f265]) ).
fof(f317,plain,
( ! [X0] :
( ~ segmentP(X0,sk4)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ segmentP(sk3,X0) )
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f311,f203]) ).
fof(f319,plain,
( ! [X0] :
( ~ segmentP(sk3,X0)
| ~ ssList(X0)
| ~ segmentP(X0,sk4) )
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f317,f202]) ).
fof(f346,plain,
( ~ ssList(nil)
| ~ segmentP(nil,sk4)
| ~ ssList(sk3)
| spl0_9 ),
inference(resolution,[],[f319,f56]) ).
fof(f352,plain,
( ~ segmentP(nil,sk4)
| ~ ssList(sk3)
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f346,f8]) ).
fof(f353,plain,
( ~ segmentP(nil,sk4)
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f352,f202]) ).
fof(f471,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(forward_subsumption_demodulation,[],[f226,f161]) ).
fof(f472,plain,
! [X2,X0,X1] :
( segmentP(app(X0,app(X1,X2)),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| ~ ssList(X2) ),
inference(forward_subsumption_demodulation,[],[f471,f161]) ).
fof(f478,plain,
! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ ssList(app(X0,sk4))
| ~ ssList(sk5) ),
inference(superposition,[],[f472,f208]) ).
fof(f489,plain,
! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(X0)
| ~ ssList(app(X0,sk4))
| ~ ssList(sk5) ),
inference(forward_subsumption_resolution,[],[f478,f202]) ).
fof(f494,plain,
! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(X0)
| ~ ssList(app(X0,sk4)) ),
inference(forward_subsumption_resolution,[],[f489,f206]) ).
fof(f576,plain,
( segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssList(sk4) ),
inference(superposition,[],[f494,f74]) ).
fof(f578,plain,
( segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(duplicate_literal_removal,[],[f576]) ).
fof(f581,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4) ),
inference(forward_subsumption_resolution,[],[f578,f8]) ).
fof(f584,plain,
segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[],[f581,f203]) ).
fof(f585,plain,
( nil = sk3
| ~ segmentP(sk3,sk3)
| ~ ssList(sk3)
| ~ spl0_4 ),
inference(resolution,[],[f584,f288]) ).
fof(f591,plain,
( $false
| spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f254,f294]) ).
fof(f592,plain,
( spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f594,plain,
( nil = sk3
| ~ ssList(sk3)
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f585,f57]) ).
fof(f605,plain,
( nil = sk3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f594,f202]) ).
fof(f611,plain,
( spl0_5
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f605,f242,f245]) ).
fof(f616,plain,
( ~ segmentP(nil,nil)
| ~ spl0_7
| spl0_9 ),
inference(superposition,[],[f353,f254]) ).
fof(f620,plain,
( $false
| ~ spl0_1
| ~ spl0_7
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f616,f232]) ).
fof(f621,plain,
( ~ spl0_1
| ~ spl0_7
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f620]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f236]) ).
cnf(s3,plain,
( spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f247]) ).
cnf(s4,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f251]) ).
cnf(s5,plain,
( spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f255]) ).
cnf(s7,plain,
( ~ spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f257]) ).
cnf(s8,plain,
( ~ spl0_4
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f266]) ).
cnf(s9,plain,
spl0_2,
inference(sat_conversion,[],[f268]) ).
cnf(s10,plain,
spl0_8,
inference(sat_conversion,[],[f271]) ).
cnf(s15,plain,
( spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f592]) ).
cnf(s20,plain,
( ~ spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f611]) ).
cnf(s22,plain,
( ~ spl0_1
| ~ spl0_7
| spl0_9 ),
inference(sat_conversion,[],[f621]) ).
cnf(s23,plain,
( ~ spl0_4
| ~ spl0_6
| ~ spl0_9 ),
inference(rat,[],[s8,s10]) ).
cnf(s25,plain,
spl0_1,
inference(rat,[],[s1,s9]) ).
cnf(s26,plain,
spl0_4,
inference(rat,[],[s15,s3,s5]) ).
cnf(s27,plain,
spl0_5,
inference(rat,[],[s20,s26]) ).
cnf(s28,plain,
spl0_7,
inference(rat,[],[s7,s27]) ).
cnf(s29,plain,
spl0_6,
inference(rat,[],[s4,s27]) ).
cnf(s30,plain,
spl0_9,
inference(rat,[],[s22,s25,s28]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s23,s26,s30,s29]) ).
fof(f624,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC065-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 28 07:41:04 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.33 Running first-order theorem proving
% 0.08/0.33 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
% 0.44/0.85 % (3220029)Input is clausal, will run a generic CNF schedule.
% 0.44/0.85 % (3220035)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4059269254:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.44/0.85 % (3220039)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4082742930:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.44/0.85 % (3220034)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=21407909:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.44/0.85 % (3220038)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3585800670:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.44/0.85 % (3220037)lrs+10_1_sil=8000:sp=occurrence:random_seed=2461404703:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.44/0.85 % (3220036)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3090268261:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.44/0.85 % (3220040)dis-21_1_sil=8000:lcm=predicate:random_seed=1241854181:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 0.44/0.85 % (3220038)First to succeed.
% 0.44/0.85 % (3220038)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3220029"
% 0.44/0.85 % (3220037)Also succeeded, but the first one will report.
% 0.44/0.85 % (3220040)Instruction limit reached!
% 0.44/0.85 % (3220040)------------------------------
% 0.44/0.85 % (3220040)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.44/0.85 % (3220040)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.85 % (3220040)CaDiCaL version: 2.1.3
% 0.44/0.85 % (3220040)Termination reason: Instruction limit
% 0.44/0.85 % (3220040)Termination phase: Saturation
% 0.44/0.85 % (3220040)Time elapsed: 0.035 s
% 0.44/0.85 % (3220040)Peak memory usage: 89 MB
% 0.44/0.85 % (3220040)Instructions burned: 119 (million)
% 0.44/0.85 % (3220039)Also succeeded, but the first one will report.
% 0.44/0.85 % (3220048)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=563132234:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 0.44/0.85 % (3220038)Refutation found. Thanks to Tanya!
% 0.44/0.85 % SZS status Unsatisfiable for theBenchmark
% 0.44/0.85 % SZS output start Proof for theBenchmark
% See solution above
% 2.41/0.94 % (3220038)------------------------------
% 2.41/0.94 % (3220038)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.41/0.94 % (3220038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.41/0.94 % (3220038)CaDiCaL version: 2.1.3
% 2.41/0.94 % (3220038)Termination reason: Refutation
% 2.41/0.94 % (3220038)Time elapsed: 0.008 s
% 2.41/0.94 % (3220038)Peak memory usage: 89 MB
% 2.41/0.94 % (3220038)Instructions burned: 19 (million)
% 2.41/0.94 % (3220038)------------------------------
% 2.41/0.94 % (3220038)------------------------------
% 2.41/0.94 % (3220029)Success in time 0.312 s
% 2.41/0.94 % Vampire exiting
%------------------------------------------------------------------------------