%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC075-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 : n004.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:19 PM UTC 2026
% Result : Unsatisfiable 2.95s 1.33s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 25
% Syntax : Number of formulae : 113 ( 28 unt; 7 def)
% Number of atoms : 271 ( 59 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 308 ( 150 ~; 151 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause57) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = 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(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f163,axiom,
! [X2,X0,X1] :
( app(X0,X1) != app(X2,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause151) ).
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(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
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,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
sk4 = app(sk5,sk6),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
sk3 = app(sk6,sk5),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f217,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f213,f204,f205]) ).
fof(f218,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X2) ),
inference(equality_resolution,[],[f187]) ).
fof(f226,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f228,plain,
( nil != sk3
| spl0_1 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f230,definition,
( spl0_2
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f231,plain,
( nil = sk4
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f232,plain,
( nil != sk4
| spl0_2 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f233,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f217,f230,f226]) ).
fof(f234,plain,
nil = app(nil,nil),
inference(resolution,[],[f73,f8]) ).
fof(f235,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f236,plain,
sk4 = app(sk4,nil),
inference(resolution,[],[f73,f203]) ).
fof(f237,plain,
sk5 = app(sk5,nil),
inference(resolution,[],[f73,f207]) ).
fof(f243,plain,
sk6 = app(nil,sk6),
inference(resolution,[],[f74,f208]) ).
fof(f255,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(resolution,[],[f102,f216]) ).
fof(f258,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(duplicate_literal_removal,[],[f255]) ).
fof(f259,plain,
! [X0] :
( ~ segmentP(sk4,X0)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk3,X0) ),
inference(forward_subsumption_resolution,[],[f258,f8]) ).
fof(f270,definition,
( spl0_3
<=> nil = sk5 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f272,plain,
( nil = sk5
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f370,plain,
! [X0] :
( sk4 != app(X0,sk6)
| ~ ssList(X0)
| ~ ssList(sk6)
| ~ ssList(sk5)
| sk5 = X0 ),
inference(superposition,[],[f163,f210]) ).
fof(f379,plain,
! [X0] :
( sk4 != app(X0,sk6)
| ~ ssList(X0)
| ~ ssList(sk5)
| sk5 = X0 ),
inference(forward_subsumption_resolution,[],[f370,f208]) ).
fof(f399,plain,
! [X0] :
( sk4 != app(X0,sk6)
| ~ ssList(X0)
| sk5 = X0 ),
inference(forward_subsumption_resolution,[],[f379,f207]) ).
fof(f466,definition,
( spl0_5
<=> nil = sk6 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f468,plain,
( nil = sk6
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f470,definition,
( spl0_6
<=> sk4 = sk5 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f471,plain,
( sk4 = sk5
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f472,plain,
( sk4 != sk5
| spl0_6 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f479,plain,
! [X0] :
( segmentP(app(sk6,X0),sk6)
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(app(sk6,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f218,f243]) ).
fof(f482,plain,
! [X0] :
( segmentP(app(sk4,X0),sk6)
| ~ ssList(sk5)
| ~ ssList(sk6)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f218,f210]) ).
fof(f484,plain,
! [X0] :
( segmentP(app(sk3,X0),sk5)
| ~ ssList(sk6)
| ~ ssList(sk5)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f218,f212]) ).
fof(f488,plain,
! [X0] :
( segmentP(app(sk3,X0),sk5)
| ~ ssList(sk5)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f484,f208]) ).
fof(f489,plain,
! [X0] :
( segmentP(app(sk4,X0),sk6)
| ~ ssList(sk6)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f482,f207]) ).
fof(f490,plain,
! [X0] :
( segmentP(app(sk6,X0),sk6)
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f479,f85]) ).
fof(f494,plain,
! [X0] :
( segmentP(app(sk3,X0),sk5)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f488,f207]) ).
fof(f495,plain,
! [X0] :
( segmentP(app(sk4,X0),sk6)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f489,f208]) ).
fof(f496,plain,
! [X0] :
( segmentP(app(sk6,X0),sk6)
| ~ ssList(sk6)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f490,f8]) ).
fof(f500,plain,
! [X0] :
( segmentP(app(sk6,X0),sk6)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f496,f208]) ).
fof(f511,plain,
( sk4 != sk6
| ~ ssList(nil)
| nil = sk5 ),
inference(superposition,[],[f399,f243]) ).
fof(f512,plain,
( sk4 != sk6
| nil = sk5 ),
inference(forward_subsumption_resolution,[],[f511,f8]) ).
fof(f514,definition,
( spl0_8
<=> sk4 = sk6 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f516,plain,
( sk4 != sk6
| spl0_8 ),
inference(avatar_component_clause,[],[f514]) ).
fof(f517,plain,
( spl0_3
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f512,f514,f270]) ).
fof(f519,plain,
( nil = sk4
| ~ ssList(sk4)
| ~ segmentP(sk3,sk4)
| ~ ssList(sk4) ),
inference(resolution,[],[f259,f57]) ).
fof(f520,plain,
( nil = sk4
| ~ ssList(sk4)
| ~ segmentP(sk3,sk4) ),
inference(duplicate_literal_removal,[],[f519]) ).
fof(f521,plain,
( ~ ssList(sk4)
| ~ segmentP(sk3,sk4)
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f520,f232]) ).
fof(f522,plain,
( ~ segmentP(sk3,sk4)
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f521,f203]) ).
fof(f525,plain,
( segmentP(sk3,sk5)
| ~ ssList(sk3)
| ~ ssList(nil) ),
inference(superposition,[],[f494,f235]) ).
fof(f528,plain,
( segmentP(sk3,sk5)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f525,f202]) ).
fof(f531,plain,
segmentP(sk3,sk5),
inference(forward_subsumption_resolution,[],[f528,f8]) ).
fof(f541,plain,
( segmentP(sk4,sk6)
| ~ ssList(sk4)
| ~ ssList(nil) ),
inference(superposition,[],[f495,f236]) ).
fof(f544,plain,
( segmentP(sk4,sk6)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f541,f203]) ).
fof(f547,plain,
segmentP(sk4,sk6),
inference(forward_subsumption_resolution,[],[f544,f8]) ).
fof(f548,plain,
( nil = sk6
| ~ ssList(sk6)
| ~ segmentP(sk3,sk6) ),
inference(resolution,[],[f547,f259]) ).
fof(f553,plain,
( nil = sk6
| ~ segmentP(sk3,sk6) ),
inference(forward_subsumption_resolution,[],[f548,f208]) ).
fof(f557,definition,
( spl0_9
<=> segmentP(sk3,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f559,plain,
( ~ segmentP(sk3,sk6)
| spl0_9 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f560,plain,
( ~ spl0_9
| spl0_5 ),
inference(avatar_split_clause,[],[f553,f466,f557]) ).
fof(f588,plain,
( segmentP(sk3,sk6)
| ~ ssList(sk5) ),
inference(superposition,[],[f500,f212]) ).
fof(f591,plain,
( ~ ssList(sk5)
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f588,f559]) ).
fof(f594,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f591,f207]) ).
fof(f595,plain,
spl0_9,
inference(avatar_contradiction_clause,[],[f594]) ).
fof(f609,plain,
( sk4 = app(sk5,nil)
| ~ spl0_5 ),
inference(superposition,[],[f210,f468]) ).
fof(f618,plain,
( nil != sk4
| ~ spl0_5
| spl0_8 ),
inference(superposition,[],[f516,f468]) ).
fof(f691,plain,
( sk4 = sk5
| ~ spl0_5 ),
inference(superposition,[],[f609,f237]) ).
fof(f707,plain,
( $false
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f691,f472]) ).
fof(f708,plain,
( ~ spl0_5
| spl0_6 ),
inference(avatar_contradiction_clause,[],[f707]) ).
fof(f756,plain,
( segmentP(sk3,sk4)
| ~ spl0_6 ),
inference(superposition,[],[f531,f471]) ).
fof(f759,plain,
( $false
| spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f756,f522]) ).
fof(f760,plain,
( spl0_2
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f759]) ).
fof(f765,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f618,f231]) ).
fof(f766,plain,
( ~ spl0_2
| ~ spl0_5
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f765]) ).
fof(f787,plain,
( sk3 = app(sk6,nil)
| ~ spl0_3 ),
inference(superposition,[],[f212,f272]) ).
fof(f801,plain,
( sk3 = app(nil,nil)
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_demodulation,[],[f787,f468]) ).
fof(f804,plain,
( nil = sk3
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_demodulation,[],[f801,f234]) ).
fof(f806,plain,
( $false
| spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f804,f228]) ).
fof(f807,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f806]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f233]) ).
cnf(s6,plain,
( spl0_3
| ~ spl0_8 ),
inference(sat_conversion,[],[f517]) ).
cnf(s7,plain,
( spl0_5
| ~ spl0_9 ),
inference(sat_conversion,[],[f560]) ).
cnf(s8,plain,
spl0_9,
inference(sat_conversion,[],[f595]) ).
cnf(s10,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f708]) ).
cnf(s11,plain,
( spl0_2
| ~ spl0_6 ),
inference(sat_conversion,[],[f760]) ).
cnf(s12,plain,
( ~ spl0_2
| ~ spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f766]) ).
cnf(s13,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(sat_conversion,[],[f807]) ).
cnf(s14,plain,
spl0_5,
inference(rat,[],[s7,s8]) ).
cnf(s15,plain,
spl0_6,
inference(rat,[],[s10,s14]) ).
cnf(s16,plain,
spl0_2,
inference(rat,[],[s11,s15]) ).
cnf(s17,plain,
spl0_8,
inference(rat,[],[s12,s14,s16]) ).
cnf(s18,plain,
spl0_3,
inference(rat,[],[s6,s17]) ).
cnf(s19,plain,
spl0_1,
inference(rat,[],[s13,s14,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s1,s16,s19]) ).
fof(f808,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC075-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n004.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 07:44:07 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/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
% 2.95/1.33 % (187819)Input is clausal, will run a generic CNF schedule.
% 2.95/1.33 % (187828)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1269254957:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.95/1.33 % (187828)Instruction limit reached!
% 2.95/1.33 % (187828)------------------------------
% 2.95/1.33 % (187828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.33 % (187828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.33 % (187828)CaDiCaL version: 2.1.3
% 2.95/1.33 % (187828)Termination reason: Instruction limit
% 2.95/1.33 % (187828)Termination phase: Saturation
% 2.95/1.33 % (187828)Time elapsed: 0.032 s
% 2.95/1.33 % (187828)Peak memory usage: 89 MB
% 2.95/1.33 % (187828)Instructions burned: 119 (million)
% 2.95/1.33 % (187827)lrs+10_1_sil=8000:sp=occurrence:random_seed=3971735456:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.95/1.33 % (187826)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3796492503:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.95/1.33 % (187824)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=1278213699:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.95/1.33 % (187825)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2271015463:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.95/1.33 % (187830)dis-21_1_sil=8000:lcm=predicate:random_seed=2886689349: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)
% 2.95/1.33 % (187827)First to succeed.
% 2.95/1.33 % (187827)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-187819"
% 2.95/1.33 % (187829)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2851665545:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.95/1.33 % (187829)Also succeeded, but the first one will report.
% 2.95/1.33 % (187830)Instruction limit reached!
% 2.95/1.33 % (187830)------------------------------
% 2.95/1.33 % (187830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.33 % (187830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.33 % (187830)CaDiCaL version: 2.1.3
% 2.95/1.33 % (187830)Termination reason: Instruction limit
% 2.95/1.33 % (187830)Termination phase: Saturation
% 2.95/1.33 % (187830)Time elapsed: 0.067 s
% 2.95/1.33 % (187830)Peak memory usage: 89 MB
% 2.95/1.33 % (187830)Instructions burned: 118 (million)
% 2.95/1.33 % (187832)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=576469939:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.95/1.33 % (187832)Also succeeded, but the first one will report.
% 2.95/1.33 % (187839)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=441113422: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)
% 2.95/1.33 % (187827)Refutation found. Thanks to Tanya!
% 2.95/1.33 % SZS status Unsatisfiable for theBenchmark
% 2.95/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.78/1.53 % (187827)------------------------------
% 3.78/1.53 % (187827)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.78/1.53 % (187827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.78/1.53 % (187827)CaDiCaL version: 2.1.3
% 3.78/1.53 % (187827)Termination reason: Refutation
% 3.78/1.53 % (187827)Time elapsed: 0.016 s
% 3.78/1.53 % (187827)Peak memory usage: 89 MB
% 3.78/1.53 % (187827)Instructions burned: 22 (million)
% 3.78/1.53 % (187827)------------------------------
% 3.78/1.53 % (187827)------------------------------
% 3.78/1.53 % (187819)Success in time 0.451 s
% 3.78/1.53 % Vampire exiting
%------------------------------------------------------------------------------