%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC080-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:21 PM UTC 2026
% Result : Unsatisfiable 3.72s 1.41s
% Output : Refutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 24
% Syntax : Number of formulae : 82 ( 19 unt; 8 def)
% Number of atoms : 231 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 298 ( 149 ~; 141 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f51,axiom,
! [X0,X1] : ssList(skaf45(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause51) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause74) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
fof(f143,axiom,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X1,skaf45(X0,X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause132) ).
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/sandbox2/benchmark/theBenchmark.p',clause173) ).
fof(f200,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f213,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f214,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f215,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f216,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f217,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f232,plain,
! [X2,X0,X1] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f242,plain,
neq(sk2,nil),
inference(duplicate_literal_removal,[],[f206]) ).
fof(f250,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f252,plain,
( ~ neq(sk4,nil)
| spl0_1 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f254,definition,
( spl0_2
<=> frontsegP(sk3,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f256,plain,
( frontsegP(sk3,sk5)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f217,f254,f250]) ).
fof(f259,definition,
( spl0_3
<=> frontsegP(sk4,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f261,plain,
( frontsegP(sk4,sk5)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f216,f259,f250]) ).
fof(f264,definition,
( spl0_4
<=> neq(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f266,plain,
( neq(sk5,nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f215,f264,f250]) ).
fof(f269,definition,
( spl0_5
<=> ssList(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f271,plain,
( ssList(sk5)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f272,plain,
( ~ spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f214,f269,f250]) ).
fof(f274,definition,
( spl0_6
<=> ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f275,plain,
( ! [X0] :
( ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0)
| ~ ssList(X0)
| ~ neq(X0,nil) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f276,plain,
( ~ spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f213,f274,f250]) ).
fof(f278,definition,
( spl0_7
<=> neq(sk2,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f287,plain,
spl0_7,
inference(avatar_split_clause,[],[f242,f278]) ).
fof(f293,definition,
( spl0_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f294,plain,
( ssList(nil)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f329,plain,
spl0_9,
inference(avatar_split_clause,[],[f8,f293]) ).
fof(f332,plain,
( ~ neq(sk2,nil)
| spl0_1 ),
inference(forward_demodulation,[],[f252,f204]) ).
fof(f333,plain,
( ~ spl0_7
| spl0_1 ),
inference(avatar_split_clause,[],[f332,f250,f278]) ).
fof(f335,plain,
( frontsegP(sk1,sk5)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f256,f205]) ).
fof(f336,plain,
( frontsegP(sk2,sk5)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f261,f204]) ).
fof(f455,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| sk1 = app(sk5,skaf45(sk1,sk5))
| ~ spl0_2 ),
inference(resolution,[],[f143,f335]) ).
fof(f456,plain,
( ~ ssList(sk5)
| ~ ssList(sk2)
| sk2 = app(sk5,skaf45(sk2,sk5))
| ~ spl0_3 ),
inference(resolution,[],[f143,f336]) ).
fof(f465,plain,
( ~ ssList(sk2)
| sk2 = app(sk5,skaf45(sk2,sk5))
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f456,f271]) ).
fof(f466,plain,
( ~ ssList(sk1)
| sk1 = app(sk5,skaf45(sk1,sk5))
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f455,f271]) ).
fof(f467,plain,
( sk2 = app(sk5,skaf45(sk2,sk5))
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f465,f201]) ).
fof(f468,plain,
( sk1 = app(sk5,skaf45(sk1,sk5))
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f466,f200]) ).
fof(f804,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f232,f74]) ).
fof(f813,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f804]) ).
fof(f817,plain,
( ! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f813,f294]) ).
fof(f1693,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f817,f85]) ).
fof(f1705,plain,
( segmentP(sk2,sk5)
| ~ ssList(skaf45(sk2,sk5))
| ~ ssList(sk5)
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(superposition,[],[f1693,f467]) ).
fof(f1706,plain,
( segmentP(sk1,sk5)
| ~ ssList(skaf45(sk1,sk5))
| ~ ssList(sk5)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_9 ),
inference(superposition,[],[f1693,f468]) ).
fof(f1723,plain,
( segmentP(sk1,sk5)
| ~ ssList(sk5)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1706,f51]) ).
fof(f1724,plain,
( segmentP(sk2,sk5)
| ~ ssList(sk5)
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1705,f51]) ).
fof(f1734,plain,
( segmentP(sk1,sk5)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1723,f271]) ).
fof(f1735,plain,
( segmentP(sk2,sk5)
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1724,f271]) ).
fof(f1778,plain,
( ~ segmentP(sk1,sk5)
| ~ ssList(sk5)
| ~ neq(sk5,nil)
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(resolution,[],[f1735,f275]) ).
fof(f1787,plain,
( ~ ssList(sk5)
| ~ neq(sk5,nil)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1778,f1734]) ).
fof(f1792,plain,
( ~ neq(sk5,nil)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1787,f271]) ).
fof(f1798,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1792,f266]) ).
fof(f1799,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f1798]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f257]) ).
cnf(s2,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f262]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f267]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f272]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f276]) ).
cnf(s12,plain,
spl0_7,
inference(sat_conversion,[],[f287]) ).
cnf(s22,plain,
spl0_9,
inference(sat_conversion,[],[f329]) ).
cnf(s23,plain,
( spl0_1
| ~ spl0_7 ),
inference(sat_conversion,[],[f333]) ).
cnf(s80,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_9 ),
inference(sat_conversion,[],[f1799]) ).
cnf(s88,plain,
spl0_1,
inference(rat,[],[s23,s12]) ).
cnf(s89,plain,
spl0_6,
inference(rat,[],[s5,s88]) ).
cnf(s90,plain,
spl0_5,
inference(rat,[],[s4,s88]) ).
cnf(s91,plain,
spl0_4,
inference(rat,[],[s3,s88]) ).
cnf(s94,plain,
spl0_3,
inference(rat,[],[s2,s88]) ).
cnf(s95,plain,
~ spl0_2,
inference(rat,[],[s80,s22,s89,s90,s91,s94]) ).
cnf(s103,plain,
$false,
inference(rat,[],[s1,s95,s88]) ).
fof(f1800,plain,
$false,
inference(avatar_sat_refutation,[],[s103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC080-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n026.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 07:47:57 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.31 % (3680280)Input is clausal, will run a generic CNF schedule.
% 3.06/1.31 % (3680291)dis-21_1_sil=8000:lcm=predicate:random_seed=924198417: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)
% 3.06/1.31 % (3680291)Instruction limit reached!
% 3.06/1.31 % (3680291)------------------------------
% 3.06/1.31 % (3680291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.31 % (3680291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.31 % (3680291)CaDiCaL version: 2.1.3
% 3.06/1.31 % (3680291)Termination reason: Instruction limit
% 3.06/1.31 % (3680291)Termination phase: Saturation
% 3.06/1.31 % (3680291)Time elapsed: 0.027 s
% 3.06/1.31 % (3680291)Peak memory usage: 89 MB
% 3.06/1.31 % (3680291)Instructions burned: 118 (million)
% 3.06/1.31 % (3680285)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=112931485:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.06/1.31 % (3680286)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3045262254:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.06/1.31 % (3680287)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2298595271:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.06/1.31 % (3680290)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2207454544:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.06/1.31 % (3680288)lrs+10_1_sil=8000:sp=occurrence:random_seed=4281925425:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.06/1.31 % (3680289)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=20822189:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.06/1.31 % (3680290)First to succeed.
% 3.06/1.31 % (3680290)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3680280"
% 3.06/1.31 % (3680289)Instruction limit reached!
% 3.06/1.31 % (3680289)------------------------------
% 3.06/1.31 % (3680289)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.31 % (3680289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.31 % (3680289)CaDiCaL version: 2.1.3
% 3.06/1.31 % (3680289)Termination reason: Instruction limit
% 3.06/1.31 % (3680289)Termination phase: Saturation
% 3.06/1.31 % (3680289)Time elapsed: 0.058 s
% 3.06/1.31 % (3680289)Peak memory usage: 89 MB
% 3.06/1.31 % (3680289)Instructions burned: 114 (million)
% 3.06/1.31 % (3680293)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=3439878085:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.06/1.31 % (3680288)Instruction limit reached!
% 3.06/1.31 % (3680288)------------------------------
% 3.06/1.31 % (3680288)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.31 % (3680288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.31 % (3680288)CaDiCaL version: 2.1.3
% 3.06/1.31 % (3680288)Termination reason: Instruction limit
% 3.06/1.31 % (3680288)Termination phase: Saturation
% 3.06/1.31 % (3680288)Time elapsed: 0.068 s
% 3.06/1.31 % (3680288)Peak memory usage: 90 MB
% 3.06/1.31 % (3680288)Instructions burned: 107 (million)
% 3.06/1.31 % (3680293)Instruction limit reached!
% 3.06/1.31 % (3680293)------------------------------
% 3.06/1.31 % (3680293)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.31 % (3680293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.31 % (3680293)CaDiCaL version: 2.1.3
% 3.06/1.31 % (3680293)Termination reason: Instruction limit
% 3.06/1.31 % (3680293)Termination phase: Saturation
% 3.06/1.31 % (3680293)Time elapsed: 0.053 s
% 3.06/1.31 % (3680293)Peak memory usage: 89 MB
% 3.06/1.31 % (3680293)Instructions burned: 146 (million)
% 3.06/1.31 % (3680302)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1595719458:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.06/1.31 % (3680300)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4163300895:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.06/1.31 % (3680303)lrs+10_64_to=lpo:sil=8000:random_seed=918100321:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.72/1.41 % (3680303)Instruction limit reached!
% 3.72/1.41 % (3680303)------------------------------
% 3.72/1.41 % (3680303)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.41 % (3680303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.41 % (3680303)CaDiCaL version: 2.1.3
% 3.72/1.41 % (3680303)Termination reason: Instruction limit
% 3.72/1.41 % (3680303)Termination phase: Saturation
% 3.72/1.41 % (3680303)Time elapsed: 0.036 s
% 3.72/1.41 % (3680303)Peak memory usage: 90 MB
% 3.72/1.41 % (3680303)Instructions burned: 129 (million)
% 3.72/1.41 % (3680290)Refutation found. Thanks to Tanya!
% 3.72/1.41 % SZS status Unsatisfiable for theBenchmark
% 3.72/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 3.72/1.41 % (3680290)------------------------------
% 3.72/1.41 % (3680290)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.41 % (3680290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.41 % (3680290)CaDiCaL version: 2.1.3
% 3.72/1.41 % (3680290)Termination reason: Refutation
% 3.72/1.41 % (3680290)Time elapsed: 0.040 s
% 3.72/1.41 % (3680290)Peak memory usage: 90 MB
% 3.72/1.41 % (3680290)Instructions burned: 51 (million)
% 3.72/1.41 % (3680290)------------------------------
% 3.72/1.41 % (3680290)------------------------------
% 3.72/1.41 % (3680280)Success in time 0.449 s
% 3.72/1.41 % Vampire exiting
%------------------------------------------------------------------------------