%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC421-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 : n005.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:55 PM UTC 2026
% Result : Unsatisfiable 0.62s 0.96s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 29
% Syntax : Number of formulae : 112 ( 20 unt; 11 def)
% Number of atoms : 330 ( 66 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 420 ( 202 ~; 207 |; 0 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause73) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).
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(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).
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(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,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(app(X2,cons(X0,nil)),X1) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| sk1 != app(app(X2,cons(X0,nil)),X1) ),
inference(reorient_equations,[],[f207]) ).
fof(f210,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ neq(sk4,nil)
| ~ ssList(X0)
| sk4 = X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk3) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f215,plain,
! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| sk3 != app(app(X2,cons(X0,nil)),X1) ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f216,plain,
! [X2,X3,X0] :
( ~ neq(sk4,nil)
| ~ ssList(X0)
| sk4 = X0
| ~ ssList(tl(sk3))
| ~ ssList(X2)
| app(tl(sk3),X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f211]) ).
fof(f217,plain,
! [X2,X3] :
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),X2))
| sk4 = app(tl(sk3),X2)
| ~ ssList(tl(sk3))
| ~ ssList(X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f216]) ).
fof(f218,plain,
! [X3] :
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(X3,nil)))
| sk4 = app(tl(sk3),cons(X3,nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(X3,nil))
| ~ ssItem(X3)
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f217]) ).
fof(f219,plain,
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f218]) ).
fof(f223,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f230,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f233,plain,
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3) ),
inference(duplicate_literal_removal,[],[f219]) ).
fof(f250,definition,
( spl0_5
<=> neq(nil,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f251,plain,
( ~ neq(nil,sk3)
| spl0_5 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,definition,
( spl0_6
<=> ssItem(hd(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f254,plain,
( ~ ssItem(hd(sk3))
| spl0_6 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,definition,
( spl0_7
<=> ssList(cons(hd(sk3),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f257,plain,
( ~ ssList(cons(hd(sk3),nil))
| spl0_7 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,definition,
( spl0_8
<=> ssList(tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f260,plain,
( ~ ssList(tl(sk3))
| spl0_8 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,definition,
( spl0_9
<=> sk4 = app(tl(sk3),cons(hd(sk3),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f263,plain,
( sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,definition,
( spl0_10
<=> ssList(app(tl(sk3),cons(hd(sk3),nil))) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f266,plain,
( ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| spl0_10 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,definition,
( spl0_11
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f269,plain,
( ~ neq(sk4,nil)
| spl0_11 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f270,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f233,f268,f265,f262,f259,f256,f253,f250]) ).
fof(f272,definition,
( spl0_12
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f273,plain,
( neq(sk3,nil)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f274,plain,
( spl0_12
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f210,f268,f272]) ).
fof(f279,definition,
( spl0_14
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f280,plain,
( nil = sk3
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f282,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[],[f269,f214]) ).
fof(f283,plain,
spl0_11,
inference(avatar_contradiction_clause,[],[f282]) ).
fof(f288,plain,
! [X0,X1] :
( sk4 != app(X0,cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssItem(X1)
| sk3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(superposition,[],[f215,f73]) ).
fof(f289,plain,
! [X0,X1] :
( sk3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssList(X0)
| ~ ssItem(X1)
| sk4 != app(X0,cons(X1,nil))
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(forward_subsumption_resolution,[],[f288,f8]) ).
fof(f298,plain,
! [X0,X1] :
( app(cons(X0,nil),X1) != sk3
| ~ ssList(X1)
| ~ ssItem(X0)
| sk4 != app(X1,cons(X0,nil))
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f289,f74]) ).
fof(f314,plain,
! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| app(cons(X0,nil),X1) != sk3
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f298,f85]) ).
fof(f321,plain,
( ~ ssList(nil)
| ~ ssList(sk3)
| nil = sk3
| spl0_5 ),
inference(resolution,[],[f102,f251]) ).
fof(f326,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f321,f8]) ).
fof(f327,plain,
( nil = sk3
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f326,f202]) ).
fof(f328,plain,
( spl0_14
| spl0_5 ),
inference(avatar_split_clause,[],[f327,f250,f279]) ).
fof(f331,plain,
( neq(nil,nil)
| ~ spl0_12
| ~ spl0_14 ),
inference(superposition,[],[f273,f280]) ).
fof(f340,plain,
( ~ ssList(nil)
| ~ spl0_12
| ~ spl0_14 ),
inference(resolution,[],[f331,f230]) ).
fof(f341,plain,
( $false
| ~ spl0_12
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f340,f8]) ).
fof(f342,plain,
( ~ spl0_12
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f341]) ).
fof(f343,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_6 ),
inference(resolution,[],[f254,f76]) ).
fof(f344,plain,
( nil = sk3
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f343,f202]) ).
fof(f345,plain,
( spl0_14
| spl0_6 ),
inference(avatar_split_clause,[],[f344,f253,f279]) ).
fof(f346,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk3))
| spl0_7 ),
inference(resolution,[],[f257,f86]) ).
fof(f347,plain,
( ~ ssItem(hd(sk3))
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f346,f8]) ).
fof(f348,plain,
( ~ spl0_6
| spl0_7 ),
inference(avatar_split_clause,[],[f347,f256,f253]) ).
fof(f349,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_8 ),
inference(resolution,[],[f260,f75]) ).
fof(f350,plain,
( nil = sk3
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f349,f202]) ).
fof(f351,plain,
( spl0_14
| spl0_8 ),
inference(avatar_split_clause,[],[f350,f259,f279]) ).
fof(f352,plain,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| spl0_10 ),
inference(resolution,[],[f266,f85]) ).
fof(f353,plain,
( ~ spl0_7
| ~ spl0_8
| spl0_10 ),
inference(avatar_split_clause,[],[f352,f265,f259,f256]) ).
fof(f361,plain,
( ! [X0,X1] :
( app(tl(sk3),cons(hd(sk3),nil)) != app(X0,cons(X1,nil))
| ~ ssList(X0)
| ~ ssItem(X1)
| sk3 != app(cons(X1,nil),X0)
| ~ ssList(cons(X1,nil)) )
| ~ spl0_9 ),
inference(superposition,[],[f314,f263]) ).
fof(f383,plain,
( ~ ssList(tl(sk3))
| ~ ssItem(hd(sk3))
| sk3 != app(cons(hd(sk3),nil),tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ spl0_9 ),
inference(equality_resolution,[],[f361]) ).
fof(f386,definition,
( spl0_15
<=> sk3 = app(cons(hd(sk3),nil),tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f387,plain,
( sk3 != app(cons(hd(sk3),nil),tl(sk3))
| spl0_15 ),
inference(avatar_component_clause,[],[f386]) ).
fof(f388,plain,
( ~ spl0_7
| ~ spl0_15
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f383,f262,f259,f253,f386,f256]) ).
fof(f410,plain,
( sk3 != cons(hd(sk3),tl(sk3))
| ~ ssList(tl(sk3))
| ~ ssItem(hd(sk3))
| spl0_15 ),
inference(superposition,[],[f387,f126]) ).
fof(f412,definition,
( spl0_16
<=> sk3 = cons(hd(sk3),tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f413,plain,
( sk3 != cons(hd(sk3),tl(sk3))
| spl0_16 ),
inference(avatar_component_clause,[],[f412]) ).
fof(f414,plain,
( ~ spl0_6
| ~ spl0_8
| ~ spl0_16
| spl0_15 ),
inference(avatar_split_clause,[],[f410,f386,f412,f259,f253]) ).
fof(f421,plain,
( sk3 != sk3
| ~ ssList(sk3)
| nil = sk3
| spl0_16 ),
inference(superposition,[],[f413,f107]) ).
fof(f422,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_16 ),
inference(trivial_inequality_removal,[],[f421]) ).
fof(f423,plain,
( nil = sk3
| spl0_16 ),
inference(forward_subsumption_resolution,[],[f422,f202]) ).
fof(f424,plain,
( spl0_14
| spl0_16 ),
inference(avatar_split_clause,[],[f423,f412,f279]) ).
cnf(s4,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f270]) ).
cnf(s5,plain,
( ~ spl0_11
| spl0_12 ),
inference(sat_conversion,[],[f274]) ).
cnf(s7,plain,
spl0_11,
inference(sat_conversion,[],[f283]) ).
cnf(s11,plain,
( spl0_5
| spl0_14 ),
inference(sat_conversion,[],[f328]) ).
cnf(s12,plain,
( ~ spl0_12
| ~ spl0_14 ),
inference(sat_conversion,[],[f342]) ).
cnf(s13,plain,
( spl0_6
| spl0_14 ),
inference(sat_conversion,[],[f345]) ).
cnf(s14,plain,
( ~ spl0_6
| spl0_7 ),
inference(sat_conversion,[],[f348]) ).
cnf(s15,plain,
( spl0_8
| spl0_14 ),
inference(sat_conversion,[],[f351]) ).
cnf(s16,plain,
( ~ spl0_7
| ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f353]) ).
cnf(s17,plain,
( ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_15 ),
inference(sat_conversion,[],[f388]) ).
cnf(s18,plain,
( ~ spl0_6
| ~ spl0_8
| spl0_15
| ~ spl0_16 ),
inference(sat_conversion,[],[f414]) ).
cnf(s19,plain,
( spl0_14
| spl0_16 ),
inference(sat_conversion,[],[f424]) ).
cnf(s20,plain,
spl0_12,
inference(rat,[],[s5,s7]) ).
cnf(s21,plain,
~ spl0_14,
inference(rat,[],[s12,s20]) ).
cnf(s22,plain,
spl0_16,
inference(rat,[],[s19,s21]) ).
cnf(s23,plain,
spl0_8,
inference(rat,[],[s15,s21]) ).
cnf(s24,plain,
spl0_6,
inference(rat,[],[s13,s21]) ).
cnf(s25,plain,
spl0_5,
inference(rat,[],[s11,s21]) ).
cnf(s27,plain,
spl0_15,
inference(rat,[],[s18,s22,s23,s24]) ).
cnf(s28,plain,
spl0_7,
inference(rat,[],[s14,s24]) ).
cnf(s29,plain,
~ spl0_9,
inference(rat,[],[s17,s27,s24,s23,s28]) ).
cnf(s30,plain,
spl0_10,
inference(rat,[],[s16,s23,s28]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s4,s7,s30,s29,s23,s28,s24,s25]) ).
fof(f425,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC421-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.06/0.17 % Computer : n005.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 09:35:46 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.20 Running first-order theorem proving
% 0.06/0.20 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.62/0.96 % (668886)Input is clausal, will run a generic CNF schedule.
% 0.62/0.96 % (668895)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1997817312:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.62/0.96 % (668895)First to succeed.
% 0.62/0.96 % (668895)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-668886"
% 0.62/0.96 % (668894)lrs+10_1_sil=8000:sp=occurrence:random_seed=880300591:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.62/0.96 % (668892)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=899792825:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.62/0.96 % (668893)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3584157566:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.62/0.96 % (668891)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=2506992044:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.62/0.96 % (668896)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2611973854:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.62/0.96 % (668897)dis-21_1_sil=8000:lcm=predicate:random_seed=902843934: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.62/0.96 % (668894)Also succeeded, but the first one will report.
% 0.62/0.96 % (668896)Also succeeded, but the first one will report.
% 0.62/0.96 % (668897)Instruction limit reached!
% 0.62/0.96 % (668897)------------------------------
% 0.62/0.96 % (668897)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.62/0.96 % (668897)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.62/0.96 % (668897)CaDiCaL version: 2.1.3
% 0.62/0.96 % (668897)Termination reason: Instruction limit
% 0.62/0.96 % (668897)Termination phase: Saturation
% 0.62/0.96 % (668897)Time elapsed: 0.060 s
% 0.62/0.96 % (668897)Peak memory usage: 89 MB
% 0.62/0.96 % (668897)Instructions burned: 118 (million)
% 0.62/0.96 % (668895)Refutation found. Thanks to Tanya!
% 0.62/0.96 % SZS status Unsatisfiable for theBenchmark
% 0.62/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.07 % (668895)------------------------------
% 2.67/1.07 % (668895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.07 % (668895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.07 % (668895)CaDiCaL version: 2.1.3
% 2.67/1.07 % (668895)Termination reason: Refutation
% 2.67/1.07 % (668895)Time elapsed: 0.006 s
% 2.67/1.07 % (668895)Peak memory usage: 90 MB
% 2.67/1.07 % (668895)Instructions burned: 14 (million)
% 2.67/1.07 % (668895)------------------------------
% 2.67/1.07 % (668895)------------------------------
% 2.67/1.07 % (668886)Success in time 0.307 s
% 2.67/1.07 % Vampire exiting
%------------------------------------------------------------------------------