%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC308-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 : 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:03:24 PM UTC 2026
% Result : Unsatisfiable 3.02s 1.10s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of formulae : 97 ( 20 unt; 9 def)
% Number of atoms : 274 ( 60 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 330 ( 153 ~; 168 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause75) ).
fof(f76,axiom,
! [X0] :
( ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause76) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause86) ).
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(f107,axiom,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause104) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).
fof(f125,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
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,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| sk1 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk2) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk2) != X3
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(X1,cons(X0,nil)) = sk3
| app(cons(X0,nil),X1) != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
! [X0,X1] :
( sk3 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| app(cons(X0,nil),X1) != sk4 ),
inference(reorient_equations,[],[f208]) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| sk3 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(definition_unfolding,[],[f207,f205,f204,f204,f204,f204]) ).
fof(f215,plain,
! [X2,X3,X1] :
( ~ ssList(sk3)
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != sk3
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f214]) ).
fof(f216,plain,
! [X2,X3] :
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(X2)
| sk3 != app(tl(sk4),X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f215]) ).
fof(f217,plain,
! [X3] :
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(X3,nil))
| sk3 != app(tl(sk4),cons(X3,nil))
| ~ ssItem(X3)
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f216]) ).
fof(f218,plain,
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f217]) ).
fof(f222,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f229,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f222]) ).
fof(f232,plain,
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f249,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f250,plain,
( nil != sk4
| spl0_5 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f256,definition,
( spl0_7
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f257,plain,
( ~ neq(nil,sk4)
| spl0_7 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,definition,
( spl0_8
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f260,plain,
( ~ ssItem(hd(sk4))
| spl0_8 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,definition,
( spl0_9
<=> sk3 = app(tl(sk4),cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f263,plain,
( sk3 != app(tl(sk4),cons(hd(sk4),nil))
| spl0_9 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,definition,
( spl0_10
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f266,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_10 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,definition,
( spl0_11
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f269,plain,
( ~ ssList(tl(sk4))
| spl0_11 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f271,definition,
( spl0_12
<=> ssList(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f272,plain,
( ~ ssList(sk3)
| spl0_12 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f273,plain,
( ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f232,f271,f268,f265,f262,f259,f256]) ).
fof(f274,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[],[f272,f202]) ).
fof(f275,plain,
spl0_12,
inference(avatar_contradiction_clause,[],[f274]) ).
fof(f422,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_7 ),
inference(resolution,[],[f102,f257]) ).
fof(f427,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f422,f8]) ).
fof(f428,plain,
( nil = sk4
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f427,f203]) ).
fof(f443,plain,
( nil = sk4
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f451,plain,
( spl0_5
| spl0_7 ),
inference(avatar_split_clause,[],[f428,f256,f249]) ).
fof(f453,plain,
( neq(nil,nil)
| ~ spl0_5 ),
inference(superposition,[],[f213,f443]) ).
fof(f460,plain,
( ~ ssList(nil)
| ~ spl0_5 ),
inference(resolution,[],[f453,f229]) ).
fof(f461,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f460,f8]) ).
fof(f462,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f461]) ).
fof(f464,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_8 ),
inference(resolution,[],[f260,f76]) ).
fof(f465,plain,
( nil = sk4
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f464,f203]) ).
fof(f466,plain,
( $false
| spl0_5
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f465,f250]) ).
fof(f467,plain,
( spl0_5
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f466]) ).
fof(f470,plain,
( ! [X0,X1] :
( app(tl(sk4),cons(hd(sk4),nil)) != app(X0,cons(X1,nil))
| ~ ssList(X0)
| ~ ssItem(X1)
| sk4 != app(cons(X1,nil),X0) )
| spl0_9 ),
inference(superposition,[],[f263,f209]) ).
fof(f474,definition,
( spl0_24
<=> sk4 = app(cons(hd(sk4),nil),tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f475,plain,
( sk4 != app(cons(hd(sk4),nil),tl(sk4))
| spl0_24 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f481,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_11 ),
inference(resolution,[],[f269,f75]) ).
fof(f482,plain,
( nil = sk4
| spl0_11 ),
inference(forward_subsumption_resolution,[],[f481,f203]) ).
fof(f483,plain,
( $false
| spl0_5
| spl0_11 ),
inference(forward_subsumption_resolution,[],[f482,f250]) ).
fof(f484,plain,
( spl0_5
| spl0_11 ),
inference(avatar_contradiction_clause,[],[f483]) ).
fof(f595,plain,
( sk4 != cons(hd(sk4),tl(sk4))
| ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| spl0_24 ),
inference(superposition,[],[f475,f126]) ).
fof(f612,definition,
( spl0_32
<=> sk4 = cons(hd(sk4),tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_32])],[avatar_definition]) ).
fof(f613,plain,
( sk4 != cons(hd(sk4),tl(sk4))
| spl0_32 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f614,plain,
( ~ spl0_8
| ~ spl0_11
| ~ spl0_32
| spl0_24 ),
inference(avatar_split_clause,[],[f595,f474,f612,f268,f259]) ).
fof(f628,plain,
( sk4 != sk4
| ~ ssList(sk4)
| nil = sk4
| spl0_32 ),
inference(superposition,[],[f613,f107]) ).
fof(f629,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_32 ),
inference(trivial_inequality_removal,[],[f628]) ).
fof(f630,plain,
( nil = sk4
| spl0_32 ),
inference(forward_subsumption_resolution,[],[f629,f203]) ).
fof(f631,plain,
( $false
| spl0_5
| spl0_32 ),
inference(forward_subsumption_resolution,[],[f630,f250]) ).
fof(f632,plain,
( spl0_5
| spl0_32 ),
inference(avatar_contradiction_clause,[],[f631]) ).
fof(f671,plain,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| sk4 != app(cons(hd(sk4),nil),tl(sk4))
| spl0_9 ),
inference(equality_resolution,[],[f470]) ).
fof(f676,plain,
( ~ spl0_24
| ~ spl0_8
| ~ spl0_11
| spl0_9 ),
inference(avatar_split_clause,[],[f671,f262,f268,f259,f474]) ).
fof(f693,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_10 ),
inference(resolution,[],[f266,f86]) ).
fof(f694,plain,
( ~ ssItem(hd(sk4))
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f693,f8]) ).
fof(f695,plain,
( ~ spl0_8
| spl0_10 ),
inference(avatar_split_clause,[],[f694,f265,f259]) ).
cnf(s5,plain,
( ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12 ),
inference(sat_conversion,[],[f273]) ).
cnf(s6,plain,
spl0_12,
inference(sat_conversion,[],[f275]) ).
cnf(s22,plain,
( spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f451]) ).
cnf(s23,plain,
~ spl0_5,
inference(sat_conversion,[],[f462]) ).
cnf(s25,plain,
( spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f467]) ).
cnf(s28,plain,
( spl0_5
| spl0_11 ),
inference(sat_conversion,[],[f484]) ).
cnf(s40,plain,
( ~ spl0_8
| ~ spl0_11
| spl0_24
| ~ spl0_32 ),
inference(sat_conversion,[],[f614]) ).
cnf(s41,plain,
( spl0_5
| spl0_32 ),
inference(sat_conversion,[],[f632]) ).
cnf(s42,plain,
( ~ spl0_8
| spl0_9
| ~ spl0_11
| ~ spl0_24 ),
inference(sat_conversion,[],[f676]) ).
cnf(s47,plain,
( ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f695]) ).
cnf(s48,plain,
spl0_32,
inference(rat,[],[s41,s23]) ).
cnf(s49,plain,
spl0_11,
inference(rat,[],[s28,s23]) ).
cnf(s50,plain,
spl0_8,
inference(rat,[],[s25,s23]) ).
cnf(s51,plain,
spl0_10,
inference(rat,[],[s47,s50]) ).
cnf(s52,plain,
spl0_24,
inference(rat,[],[s40,s48,s49,s50]) ).
cnf(s53,plain,
spl0_9,
inference(rat,[],[s42,s50,s49,s52]) ).
cnf(s54,plain,
spl0_7,
inference(rat,[],[s22,s23]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s5,s6,s49,s51,s53,s50,s54]) ).
fof(f696,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC308-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.07/0.18 % Computer : n003.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 09:01:57 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/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.02/1.10 % (1445764)Input is clausal, will run a generic CNF schedule.
% 3.02/1.10 % (1445775)dis-21_1_sil=8000:lcm=predicate:random_seed=2640107753: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.02/1.10 % (1445775)Instruction limit reached!
% 3.02/1.10 % (1445775)------------------------------
% 3.02/1.10 % (1445775)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.10 % (1445775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.10 % (1445775)CaDiCaL version: 2.1.3
% 3.02/1.10 % (1445775)Termination reason: Instruction limit
% 3.02/1.10 % (1445775)Termination phase: Saturation
% 3.02/1.10 % (1445775)Time elapsed: 0.033 s
% 3.02/1.10 % (1445775)Peak memory usage: 90 MB
% 3.02/1.10 % (1445775)Instructions burned: 117 (million)
% 3.02/1.10 % (1445774)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1835217022:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.02/1.10 % (1445772)lrs+10_1_sil=8000:sp=occurrence:random_seed=2508640553:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.02/1.10 % (1445770)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2763841813:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.02/1.10 % (1445769)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=681694918:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.02/1.10 % (1445773)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1268922513:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.02/1.10 % (1445771)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1004367161:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.02/1.10 % (1445773)First to succeed.
% 3.02/1.10 % (1445773)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1445764"
% 3.02/1.10 % (1445772)Also succeeded, but the first one will report.
% 3.02/1.10 % (1445777)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=2888455336:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.02/1.10 % (1445777)Also succeeded, but the first one will report.
% 3.02/1.10 % (1445774)Instruction limit reached!
% 3.02/1.10 % (1445774)------------------------------
% 3.02/1.10 % (1445774)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.10 % (1445774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.10 % (1445774)CaDiCaL version: 2.1.3
% 3.02/1.10 % (1445774)Termination reason: Instruction limit
% 3.02/1.10 % (1445774)Termination phase: Saturation
% 3.02/1.10 % (1445774)Time elapsed: 0.120 s
% 3.02/1.10 % (1445774)Peak memory usage: 90 MB
% 3.02/1.10 % (1445774)Instructions burned: 180 (million)
% 3.02/1.10 % (1445785)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2181724304: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.02/1.10 % (1445773)Refutation found. Thanks to Tanya!
% 3.02/1.10 % SZS status Unsatisfiable for theBenchmark
% 3.02/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.19 % (1445773)------------------------------
% 3.57/1.19 % (1445773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.19 % (1445773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.19 % (1445773)CaDiCaL version: 2.1.3
% 3.57/1.19 % (1445773)Termination reason: Refutation
% 3.57/1.19 % (1445773)Time elapsed: 0.020 s
% 3.57/1.19 % (1445773)Peak memory usage: 90 MB
% 3.57/1.19 % (1445773)Instructions burned: 29 (million)
% 3.57/1.19 % (1445773)------------------------------
% 3.57/1.19 % (1445773)------------------------------
% 3.57/1.19 % (1445764)Success in time 0.443 s
% 3.57/1.19 % Vampire exiting
%------------------------------------------------------------------------------