%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC389-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 : n018.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:46 PM UTC 2026
% Result : Unsatisfiable 3.12s 1.22s
% Output : Refutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 32
% Syntax : Number of formulae : 122 ( 16 unt; 12 def)
% Number of atoms : 318 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 370 ( 174 ~; 184 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f79,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| segmentP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause79) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).
fof(f119,axiom,
! [X0,X1] :
( cons(X0,nil) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause116) ).
fof(f161,axiom,
! [X2,X0,X1] :
( app(app(X2,X1),X0) = app(X2,app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause149) ).
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/sandbox/benchmark/theBenchmark.p',clause173) ).
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,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f210,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
( sk3 = cons(sk5,nil)
| nil = sk4 ),
inference(reorient_equations,[],[f210]) ).
fof(f216,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f218,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f219,plain,
( sk3 = cons(sk5,nil)
| nil = sk3 ),
inference(reorient_equations,[],[f218]) ).
fof(f220,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
( sk4 = app(app(sk6,sk3),sk7)
| nil = sk3 ),
inference(reorient_equations,[],[f220]) ).
fof(f224,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
fof(f225,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_22) ).
fof(f228,plain,
( ~ segmentP(sk4,sk3)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f224,f204,f205,f204]) ).
fof(f229,plain,
( ~ segmentP(sk4,sk3)
| ~ singletonP(sk3) ),
inference(definition_unfolding,[],[f225,f204,f205,f205]) ).
fof(f235,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f236,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f238,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f239,plain,
! [X0] :
( singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f119]) ).
fof(f240,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f238]) ).
fof(f246,definition,
( spl0_1
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f247,plain,
( segmentP(nil,nil)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f249,definition,
( spl0_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f250,plain,
( ~ ssList(nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f236,f249,f246]) ).
fof(f257,definition,
( spl0_4
<=> singletonP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f260,definition,
( spl0_5
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f261,plain,
( ~ segmentP(sk4,sk3)
| spl0_5 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f229,f260,f257]) ).
fof(f264,definition,
( spl0_6
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f265,plain,
( neq(sk4,nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( spl0_6
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f228,f260,f264]) ).
fof(f268,definition,
( spl0_7
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f269,plain,
( nil = sk3
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f279,definition,
( spl0_10
<=> sk4 = app(app(sk6,sk3),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f280,plain,
( sk4 = app(app(sk6,sk3),sk7)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f281,plain,
( spl0_7
| spl0_10 ),
inference(avatar_split_clause,[],[f221,f279,f268]) ).
fof(f283,definition,
( spl0_11
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f284,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f285,plain,
( spl0_7
| spl0_11 ),
inference(avatar_split_clause,[],[f219,f283,f268]) ).
fof(f287,definition,
( spl0_12
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f288,plain,
( ssList(sk7)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f289,plain,
( spl0_7
| spl0_12 ),
inference(avatar_split_clause,[],[f217,f287,f268]) ).
fof(f291,definition,
( spl0_13
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f292,plain,
( ssList(sk6)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f293,plain,
( spl0_7
| spl0_13 ),
inference(avatar_split_clause,[],[f216,f291,f268]) ).
fof(f295,definition,
( spl0_14
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f296,plain,
( nil = sk4
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f300,plain,
( spl0_14
| spl0_11 ),
inference(avatar_split_clause,[],[f211,f283,f295]) ).
fof(f304,definition,
( spl0_15
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f305,plain,
( ssItem(sk5)
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f306,plain,
( spl0_7
| spl0_15 ),
inference(avatar_split_clause,[],[f207,f304,f268]) ).
fof(f307,plain,
( spl0_14
| spl0_15 ),
inference(avatar_split_clause,[],[f206,f304,f295]) ).
fof(f310,plain,
( ~ segmentP(nil,sk3)
| spl0_5
| ~ spl0_14 ),
inference(superposition,[],[f261,f296]) ).
fof(f313,plain,
( ~ segmentP(nil,nil)
| spl0_5
| ~ spl0_7
| ~ spl0_14 ),
inference(superposition,[],[f310,f269]) ).
fof(f318,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f250,f8]) ).
fof(f319,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f318]) ).
fof(f333,plain,
( nil != sk3
| ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl0_11 ),
inference(superposition,[],[f99,f284]) ).
fof(f334,plain,
( nil != sk3
| ~ ssList(nil)
| ~ spl0_11
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f333,f305]) ).
fof(f335,plain,
( nil != sk3
| ~ spl0_11
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f334,f8]) ).
fof(f350,plain,
( singletonP(sk3)
| ~ ssList(sk3)
| ~ ssItem(sk5)
| ~ spl0_11 ),
inference(superposition,[],[f239,f284]) ).
fof(f351,plain,
( singletonP(sk3)
| ~ ssItem(sk5)
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f350,f202]) ).
fof(f352,plain,
( singletonP(sk3)
| ~ spl0_11
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f351,f305]) ).
fof(f447,plain,
( $false
| ~ spl0_1
| spl0_5
| ~ spl0_7
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f313,f247]) ).
fof(f448,plain,
( ~ spl0_1
| spl0_5
| ~ spl0_7
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f447]) ).
fof(f683,plain,
( neq(nil,nil)
| ~ spl0_6
| ~ spl0_14 ),
inference(superposition,[],[f265,f296]) ).
fof(f688,plain,
( ~ ssList(nil)
| ~ spl0_6
| ~ spl0_14 ),
inference(resolution,[],[f683,f240]) ).
fof(f689,plain,
( $false
| ~ spl0_6
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f688,f8]) ).
fof(f690,plain,
( ~ spl0_6
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f689]) ).
fof(f691,plain,
( ~ spl0_7
| ~ spl0_11
| ~ spl0_15 ),
inference(avatar_split_clause,[],[f335,f304,f283,f268]) ).
fof(f693,plain,
( spl0_4
| ~ spl0_11
| ~ spl0_15 ),
inference(avatar_split_clause,[],[f352,f304,f283,f257]) ).
fof(f708,plain,
( sk4 = app(sk6,app(sk3,sk7))
| ~ ssList(sk3)
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ spl0_10 ),
inference(superposition,[],[f280,f161]) ).
fof(f743,plain,
( sk4 = app(sk6,app(sk3,sk7))
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f708,f202]) ).
fof(f754,plain,
( sk4 = app(sk6,app(sk3,sk7))
| ~ ssList(sk7)
| ~ spl0_10
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f743,f292]) ).
fof(f762,plain,
( sk4 = app(sk6,app(sk3,sk7))
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f754,f288]) ).
fof(f1017,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(forward_subsumption_demodulation,[],[f235,f161]) ).
fof(f1018,plain,
! [X2,X0,X1] :
( segmentP(app(X0,app(X1,X2)),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| ~ ssList(X2) ),
inference(forward_subsumption_demodulation,[],[f1017,f161]) ).
fof(f1038,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(superposition,[],[f1018,f762]) ).
fof(f1046,plain,
( ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1038,f261]) ).
fof(f1054,plain,
( ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1046,f292]) ).
fof(f1067,plain,
( ~ ssList(sk4)
| ~ ssList(sk7)
| spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1054,f202]) ).
fof(f1068,plain,
( ~ ssList(sk7)
| spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1067,f203]) ).
fof(f1069,plain,
( $false
| spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1068,f288]) ).
fof(f1070,plain,
( spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(avatar_contradiction_clause,[],[f1069]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f251]) ).
cnf(s3,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f262]) ).
cnf(s4,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f266]) ).
cnf(s7,plain,
( spl0_7
| spl0_10 ),
inference(sat_conversion,[],[f281]) ).
cnf(s8,plain,
( spl0_7
| spl0_11 ),
inference(sat_conversion,[],[f285]) ).
cnf(s9,plain,
( spl0_7
| spl0_12 ),
inference(sat_conversion,[],[f289]) ).
cnf(s10,plain,
( spl0_7
| spl0_13 ),
inference(sat_conversion,[],[f293]) ).
cnf(s14,plain,
( spl0_11
| spl0_14 ),
inference(sat_conversion,[],[f300]) ).
cnf(s17,plain,
( spl0_7
| spl0_15 ),
inference(sat_conversion,[],[f306]) ).
cnf(s18,plain,
( spl0_14
| spl0_15 ),
inference(sat_conversion,[],[f307]) ).
cnf(s21,plain,
spl0_2,
inference(sat_conversion,[],[f319]) ).
cnf(s29,plain,
( ~ spl0_1
| spl0_5
| ~ spl0_7
| ~ spl0_14 ),
inference(sat_conversion,[],[f448]) ).
cnf(s56,plain,
( ~ spl0_6
| ~ spl0_14 ),
inference(sat_conversion,[],[f690]) ).
cnf(s57,plain,
( ~ spl0_7
| ~ spl0_11
| ~ spl0_15 ),
inference(sat_conversion,[],[f691]) ).
cnf(s59,plain,
( spl0_4
| ~ spl0_11
| ~ spl0_15 ),
inference(sat_conversion,[],[f693]) ).
cnf(s82,plain,
( spl0_5
| ~ spl0_10
| ~ spl0_12
| ~ spl0_13 ),
inference(sat_conversion,[],[f1070]) ).
cnf(s85,plain,
spl0_1,
inference(rat,[],[s1,s21]) ).
cnf(s86,plain,
( spl0_7
| spl0_4 ),
inference(rat,[],[s59,s8,s17]) ).
cnf(s87,plain,
( spl0_14
| spl0_4 ),
inference(rat,[],[s59,s14,s18]) ).
cnf(s88,plain,
spl0_4,
inference(rat,[],[s4,s29,s56,s87,s86,s85]) ).
cnf(s89,plain,
~ spl0_5,
inference(rat,[],[s3,s88]) ).
cnf(s90,plain,
spl0_7,
inference(rat,[],[s82,s7,s9,s10,s89]) ).
cnf(s91,plain,
~ spl0_14,
inference(rat,[],[s29,s89,s85,s90]) ).
cnf(s92,plain,
spl0_15,
inference(rat,[],[s18,s91]) ).
cnf(s95,plain,
spl0_11,
inference(rat,[],[s14,s91]) ).
cnf(s99,plain,
$false,
inference(rat,[],[s57,s90,s92,s95]) ).
fof(f1071,plain,
$false,
inference(avatar_sat_refutation,[],[s99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC389-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 : n018.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:28:10 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 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.12/1.22 % (3249527)Input is clausal, will run a generic CNF schedule.
% 3.12/1.22 % (3249612)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2157367095:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.12/1.22 % (3249612)First to succeed.
% 3.12/1.22 % (3249612)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3249527"
% 3.12/1.22 % (3249610)lrs+10_1_sil=8000:sp=occurrence:random_seed=2249160245:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.12/1.22 % (3249610)Also succeeded, but the first one will report.
% 3.12/1.22 % (3249609)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1520536833:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.12/1.22 % (3249608)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2258746927:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.12/1.22 % (3249607)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=3061627864:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.12/1.22 % (3249614)dis-21_1_sil=8000:lcm=predicate:random_seed=4147229947: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.12/1.22 % (3249613)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=522074992:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.12/1.22 % (3249613)Also succeeded, but the first one will report.
% 3.12/1.22 % (3249614)Instruction limit reached!
% 3.12/1.22 % (3249614)------------------------------
% 3.12/1.22 % (3249614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.22 % (3249614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.22 % (3249614)CaDiCaL version: 2.1.3
% 3.12/1.22 % (3249614)Termination reason: Instruction limit
% 3.12/1.22 % (3249614)Termination phase: Saturation
% 3.12/1.22 % (3249614)Time elapsed: 0.115 s
% 3.12/1.22 % (3249614)Peak memory usage: 90 MB
% 3.12/1.22 % (3249614)Instructions burned: 117 (million)
% 3.12/1.22 % (3249612)Refutation found. Thanks to Tanya!
% 3.12/1.22 % SZS status Unsatisfiable for theBenchmark
% 3.12/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 4.00/1.53 % (3249612)------------------------------
% 4.00/1.53 % (3249612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.00/1.53 % (3249612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.00/1.53 % (3249612)CaDiCaL version: 2.1.3
% 4.00/1.53 % (3249612)Termination reason: Refutation
% 4.00/1.53 % (3249612)Time elapsed: 0.022 s
% 4.00/1.53 % (3249612)Peak memory usage: 90 MB
% 4.00/1.53 % (3249612)Instructions burned: 35 (million)
% 4.00/1.53 % (3249612)------------------------------
% 4.00/1.53 % (3249612)------------------------------
% 4.00/1.53 % (3249527)Success in time 0.449 s
% 4.00/1.53 % Vampire exiting
%------------------------------------------------------------------------------