%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC108-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 : n003.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:29 PM UTC 2026
% Result : Unsatisfiable 2.54s 1.31s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 29
% Syntax : Number of formulae : 107 ( 19 unt; 10 def)
% Number of atoms : 256 ( 31 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 287 ( 138 ~; 139 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f50,axiom,
! [X0,X1] : ssList(skaf46(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause50) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause73) ).
fof(f82,axiom,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause82) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause115) ).
fof(f142,axiom,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| app(skaf46(X0,X1),X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause131) ).
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(f207,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil != sk1
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f213,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f220,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f228,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,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f245,definition,
( spl0_1
<=> rearsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f247,plain,
( rearsegP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f249,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f250,plain,
( nil != sk3
| spl0_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f252,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f213,f249,f245]) ).
fof(f254,definition,
( spl0_3
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f256,plain,
( neq(sk3,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f212,f249,f254]) ).
fof(f259,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f261,plain,
( nil = sk4
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f211,f259,f245]) ).
fof(f263,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f210,f259,f254]) ).
fof(f265,definition,
( spl0_5
<=> segmentP(sk2,sk1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f267,plain,
( ~ segmentP(sk2,sk1)
| spl0_5 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f269,definition,
( spl0_6
<=> neq(sk1,nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f273,definition,
( spl0_7
<=> nil = sk1 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f275,plain,
( nil != sk1
| spl0_7 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f276,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f209,f273,f269,f265]) ).
fof(f278,definition,
( spl0_8
<=> neq(sk2,nil) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f280,plain,
( neq(sk2,nil)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f281,plain,
( spl0_8
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f208,f273,f278]) ).
fof(f283,definition,
( spl0_9
<=> nil = sk2 ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f285,plain,
( nil = sk2
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f286,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_9 ),
inference(avatar_split_clause,[],[f207,f283,f269,f265]) ).
fof(f293,definition,
( spl0_11
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f294,plain,
( ssList(nil)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f329,plain,
spl0_11,
inference(avatar_split_clause,[],[f8,f293]) ).
fof(f333,plain,
( nil = sk1
| ~ spl0_2 ),
inference(superposition,[],[f205,f251]) ).
fof(f336,plain,
( spl0_7
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f333,f249,f273]) ).
fof(f338,plain,
( nil = sk2
| ~ spl0_4 ),
inference(superposition,[],[f204,f261]) ).
fof(f341,plain,
( spl0_9
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f338,f259,f283]) ).
fof(f345,plain,
( neq(nil,nil)
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f280,f285]) ).
fof(f350,plain,
( rearsegP(sk4,sk1)
| ~ spl0_1 ),
inference(forward_demodulation,[],[f247,f205]) ).
fof(f351,plain,
( neq(sk1,nil)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f256,f205]) ).
fof(f364,plain,
( nil != sk1
| spl0_2 ),
inference(forward_demodulation,[],[f250,f205]) ).
fof(f365,plain,
( rearsegP(sk2,sk1)
| ~ spl0_1 ),
inference(forward_demodulation,[],[f350,f204]) ).
fof(f366,plain,
( spl0_6
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f351,f254,f269]) ).
fof(f367,plain,
( ~ spl0_7
| spl0_2 ),
inference(avatar_split_clause,[],[f364,f249,f273]) ).
fof(f373,plain,
( rearsegP(nil,sk1)
| ~ spl0_1
| ~ spl0_9 ),
inference(forward_demodulation,[],[f365,f285]) ).
fof(f380,plain,
( ~ ssList(nil)
| ~ spl0_8
| ~ spl0_9 ),
inference(resolution,[],[f242,f345]) ).
fof(f381,plain,
( $false
| ~ spl0_8
| ~ spl0_9
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f380,f294]) ).
fof(f382,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f381]) ).
fof(f398,plain,
( ~ ssList(sk1)
| nil = sk1
| ~ spl0_1
| ~ spl0_9 ),
inference(resolution,[],[f82,f373]) ).
fof(f403,plain,
( nil = sk1
| ~ spl0_1
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f398,f200]) ).
fof(f404,plain,
( $false
| ~ spl0_1
| spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f403,f275]) ).
fof(f405,plain,
( ~ spl0_1
| spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f404]) ).
fof(f475,plain,
( ~ ssList(sk1)
| ~ ssList(sk2)
| sk2 = app(skaf46(sk2,sk1),sk1)
| ~ spl0_1 ),
inference(resolution,[],[f142,f365]) ).
fof(f479,plain,
( ~ ssList(sk2)
| sk2 = app(skaf46(sk2,sk1),sk1)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f475,f200]) ).
fof(f482,plain,
( sk2 = app(skaf46(sk2,sk1),sk1)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f479,f201]) ).
fof(f631,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(nil)
| segmentP(app(X0,X1),X1)
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f228,f73]) ).
fof(f632,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(nil)
| segmentP(app(X0,X1),X1) ),
inference(duplicate_literal_removal,[],[f631]) ).
fof(f637,plain,
( ! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f632,f294]) ).
fof(f1748,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f637,f85]) ).
fof(f1771,plain,
( segmentP(sk2,sk1)
| ~ ssList(sk1)
| ~ ssList(skaf46(sk2,sk1))
| ~ spl0_1
| ~ spl0_11 ),
inference(superposition,[],[f1748,f482]) ).
fof(f1786,plain,
( ~ ssList(sk1)
| ~ ssList(skaf46(sk2,sk1))
| ~ spl0_1
| spl0_5
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1771,f267]) ).
fof(f1799,plain,
( ~ ssList(skaf46(sk2,sk1))
| ~ spl0_1
| spl0_5
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1786,f200]) ).
fof(f1811,plain,
( $false
| ~ spl0_1
| spl0_5
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1799,f50]) ).
fof(f1812,plain,
( ~ spl0_1
| spl0_5
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f1811]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f252]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f257]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f262]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f263]) ).
cnf(s5,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(sat_conversion,[],[f276]) ).
cnf(s6,plain,
( ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f281]) ).
cnf(s7,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_9 ),
inference(sat_conversion,[],[f286]) ).
cnf(s18,plain,
spl0_11,
inference(sat_conversion,[],[f329]) ).
cnf(s20,plain,
( ~ spl0_2
| spl0_7 ),
inference(sat_conversion,[],[f336]) ).
cnf(s23,plain,
( ~ spl0_4
| spl0_9 ),
inference(sat_conversion,[],[f341]) ).
cnf(s33,plain,
( ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f366]) ).
cnf(s34,plain,
( spl0_2
| ~ spl0_7 ),
inference(sat_conversion,[],[f367]) ).
cnf(s38,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_11 ),
inference(sat_conversion,[],[f382]) ).
cnf(s39,plain,
( ~ spl0_1
| spl0_7
| ~ spl0_9 ),
inference(sat_conversion,[],[f405]) ).
cnf(s108,plain,
( ~ spl0_1
| spl0_5
| ~ spl0_11 ),
inference(sat_conversion,[],[f1812]) ).
cnf(s116,plain,
spl0_1,
inference(rat,[],[s6,s38,s20,s23,s1,s3,s18]) ).
cnf(s117,plain,
spl0_5,
inference(rat,[],[s108,s18,s116]) ).
cnf(s118,plain,
spl0_2,
inference(rat,[],[s7,s33,s39,s2,s34,s117,s116]) ).
cnf(s119,plain,
spl0_7,
inference(rat,[],[s20,s118]) ).
cnf(s120,plain,
spl0_8,
inference(rat,[],[s6,s119]) ).
cnf(s121,plain,
~ spl0_6,
inference(rat,[],[s5,s117,s119]) ).
cnf(s122,plain,
~ spl0_9,
inference(rat,[],[s38,s18,s120]) ).
cnf(s123,plain,
~ spl0_3,
inference(rat,[],[s33,s121]) ).
cnf(s124,plain,
~ spl0_4,
inference(rat,[],[s23,s122]) ).
cnf(s125,plain,
$false,
inference(rat,[],[s4,s124,s123]) ).
fof(f1813,plain,
$false,
inference(avatar_sat_refutation,[],[s125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC108-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.11/0.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 07:56:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.54/1.31 % (1417468)Input is clausal, will run a generic CNF schedule.
% 2.54/1.31 % (1417473)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=2985469961:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.54/1.31 % (1417476)lrs+10_1_sil=8000:sp=occurrence:random_seed=2727325299:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.54/1.31 % (1417474)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3214702979:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.54/1.31 % (1417477)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4258768545:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.54/1.31 % (1417478)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3290339055:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.54/1.31 % (1417479)dis-21_1_sil=8000:lcm=predicate:random_seed=3978163257: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.54/1.31 % (1417475)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=374425127:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.54/1.31 % (1417478)First to succeed.
% 2.54/1.31 % (1417478)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1417468"
% 2.54/1.31 % (1417479)Instruction limit reached!
% 2.54/1.31 % (1417479)------------------------------
% 2.54/1.31 % (1417479)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.31 % (1417479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.31 % (1417479)CaDiCaL version: 2.1.3
% 2.54/1.31 % (1417479)Termination reason: Instruction limit
% 2.54/1.31 % (1417479)Termination phase: Saturation
% 2.54/1.31 % (1417479)Time elapsed: 0.049 s
% 2.54/1.31 % (1417479)Peak memory usage: 88 MB
% 2.54/1.31 % (1417479)Instructions burned: 118 (million)
% 2.54/1.31 % (1417477)Instruction limit reached!
% 2.54/1.31 % (1417477)------------------------------
% 2.54/1.31 % (1417477)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.31 % (1417477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.31 % (1417477)CaDiCaL version: 2.1.3
% 2.54/1.31 % (1417477)Termination reason: Instruction limit
% 2.54/1.31 % (1417477)Termination phase: Saturation
% 2.54/1.31 % (1417477)Time elapsed: 0.058 s
% 2.54/1.31 % (1417477)Peak memory usage: 88 MB
% 2.54/1.31 % (1417477)Instructions burned: 116 (million)
% 2.54/1.31 % (1417476)Instruction limit reached!
% 2.54/1.31 % (1417476)------------------------------
% 2.54/1.31 % (1417476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.31 % (1417476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.31 % (1417476)CaDiCaL version: 2.1.3
% 2.54/1.31 % (1417476)Termination reason: Instruction limit
% 2.54/1.31 % (1417476)Termination phase: Saturation
% 2.54/1.31 % (1417476)Time elapsed: 0.067 s
% 2.54/1.31 % (1417476)Peak memory usage: 89 MB
% 2.54/1.31 % (1417476)Instructions burned: 108 (million)
% 2.54/1.31 % (1417487)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=2406393784:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 2.54/1.31 % (1417488)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1870640416: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.54/1.31 % (1417489)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1043134104:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.54/1.31 % (1417488)Also succeeded, but the first one will report.
% 2.54/1.31 % (1417478)Refutation found. Thanks to Tanya!
% 2.54/1.31 % SZS status Unsatisfiable for theBenchmark
% 2.54/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.51 % (1417478)------------------------------
% 0.17/1.51 % (1417478)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.51 % (1417478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.51 % (1417478)CaDiCaL version: 2.1.3
% 0.17/1.51 % (1417478)Termination reason: Refutation
% 0.17/1.51 % (1417478)Time elapsed: 0.038 s
% 0.17/1.51 % (1417478)Peak memory usage: 90 MB
% 0.17/1.51 % (1417478)Instructions burned: 52 (million)
% 0.17/1.51 % (1417478)------------------------------
% 0.17/1.51 % (1417478)------------------------------
% 0.17/1.51 % (1417468)Success in time 0.466 s
% 0.17/1.51 % Vampire exiting
%------------------------------------------------------------------------------