↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC158-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 : 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:42 PM UTC 2026

% Result   : Unsatisfiable 13.38s 5.83s
% Output   : Refutation 35.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   41
%            Number of leaves      :   25
% Syntax   : Number of formulae    :  126 (  29 unt;   0 def)
%            Number of atoms       :  606 (  43 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :  964 ( 484   ~; 480   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   7 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :  158 ( 158   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f52,axiom,
    ! [X0,X1] : ssList(skaf43(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause52) ).

fof(f53,axiom,
    ! [X0,X1] : ssList(skaf42(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause53) ).

fof(f73,axiom,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause73) ).

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(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(f151,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause140) ).

fof(f152,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X2,X0),X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause141) ).

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(f182,axiom,
    ! [X0,X1] :
      ( app(skaf42(X0,X1),cons(X1,skaf43(X1,X0))) = X0
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause169) ).

fof(f189,axiom,
    ! [X2,X3,X0,X1] :
      ( app(X0,cons(X1,X2)) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | memberP(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause175) ).

fof(f196,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
      | ~ ssList(X4)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ totalorderedP(X5)
      | ~ ssList(X5)
      | leq(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause182) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f209,negated_conjecture,
    totalorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f212,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f213,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f214,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f215,negated_conjecture,
    ssList(sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f216,negated_conjecture,
    ssList(sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

fof(f217,negated_conjecture,
    app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

fof(f218,plain,
    sk1 = app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10),
    inference(reorient_equations,[],[f217]) ).

fof(f220,negated_conjecture,
    ( ~ leq(sk6,sk7)
    | ssItem(sk11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

fof(f221,negated_conjecture,
    ( memberP(sk9,sk11)
    | ~ leq(sk6,sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).

fof(f222,negated_conjecture,
    ( ~ leq(sk11,sk7)
    | ~ leq(sk6,sk11)
    | ~ leq(sk6,sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).

fof(f226,plain,
    sk3 = app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10),
    inference(definition_unfolding,[],[f218,f205]) ).

fof(f242,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X0,cons(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f189]) ).

fof(f247,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssList(X4)
      | leq(X1,X3) ),
    inference(equality_resolution,[],[f196]) ).

fof(f477,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),app(sk9,cons(sk7,nil))),sk10)
    | ~ ssList(sk9)
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(superposition,[],[f226,f161]) ).

fof(f480,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),sk9),app(cons(sk7,nil),sk10))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(app(app(sk8,cons(sk6,nil)),sk9))
    | ~ ssList(sk10) ),
    inference(superposition,[],[f226,f161]) ).

fof(f485,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),sk9),app(cons(sk7,nil),sk10))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(app(app(sk8,cons(sk6,nil)),sk9)) ),
    inference(forward_subsumption_resolution,[],[f480,f216]) ).

fof(f488,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),app(sk9,cons(sk7,nil))),sk10)
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(forward_subsumption_resolution,[],[f477,f215]) ).

fof(f528,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(sk10)
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(superposition,[],[f161,f488]) ).

fof(f530,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(sk10)
    | ~ ssList(cons(sk7,nil)) ),
    inference(duplicate_literal_removal,[],[f528]) ).

fof(f533,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(forward_subsumption_resolution,[],[f530,f216]) ).

fof(f537,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,app(cons(sk7,nil),sk10)))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(sk9)
    | ~ ssList(sk10) ),
    inference(superposition,[],[f533,f161]) ).

fof(f540,plain,
    ! [X0] :
      ( app(sk3,X0) = app(app(sk8,cons(sk6,nil)),app(app(app(sk9,cons(sk7,nil)),sk10),X0))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(cons(sk7,nil)) ),
    inference(superposition,[],[f161,f533]) ).

fof(f541,plain,
    ! [X0] :
      ( app(sk3,X0) = app(app(sk8,cons(sk6,nil)),app(app(app(sk9,cons(sk7,nil)),sk10),X0))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssList(cons(sk7,nil)) ),
    inference(duplicate_literal_removal,[],[f540]) ).

fof(f542,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,app(cons(sk7,nil),sk10)))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(sk9)
    | ~ ssList(sk10) ),
    inference(duplicate_literal_removal,[],[f537]) ).

fof(f545,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,app(cons(sk7,nil),sk10)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(sk9)
    | ~ ssList(sk10) ),
    inference(forward_subsumption_resolution,[],[f542,f85]) ).

fof(f548,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,app(cons(sk7,nil),sk10)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(sk10) ),
    inference(forward_subsumption_resolution,[],[f545,f215]) ).

fof(f549,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,app(cons(sk7,nil),sk10)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(forward_subsumption_resolution,[],[f548,f216]) ).

fof(f598,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(app(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(superposition,[],[f85,f161]) ).

fof(f605,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(app(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f598]) ).

fof(f606,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f605,f85]) ).

fof(f611,plain,
    ssList(cons(sk6,nil)),
    inference(unit_resulting_resolution,[],[f86,f212,f8]) ).

fof(f612,plain,
    ssList(cons(sk7,nil)),
    inference(unit_resulting_resolution,[],[f86,f213,f8]) ).

fof(f735,plain,
    app(cons(sk6,nil),sk9) = cons(sk6,sk9),
    inference(unit_resulting_resolution,[],[f126,f212,f215]) ).

fof(f738,plain,
    app(cons(sk7,nil),sk10) = cons(sk7,sk10),
    inference(unit_resulting_resolution,[],[f126,f213,f216]) ).

fof(f763,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,sk10))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(app(app(sk8,cons(sk6,nil)),sk9)) ),
    inference(backward_demodulation,[],[f485,f738]) ).

fof(f766,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,cons(sk7,sk10)))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(backward_demodulation,[],[f549,f738]) ).

fof(f777,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(sk9,cons(sk7,sk10)))
    | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(forward_subsumption_resolution,[],[f766,f612]) ).

fof(f780,plain,
    ( sk3 = app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,sk10))
    | ~ ssList(app(app(sk8,cons(sk6,nil)),sk9)) ),
    inference(forward_subsumption_resolution,[],[f763,f612]) ).

fof(f806,plain,
    ( sk3 = app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,sk10))
    | ~ ssList(app(sk8,app(cons(sk6,nil),sk9)))
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(sk8)
    | ~ ssList(sk9) ),
    inference(superposition,[],[f780,f161]) ).

fof(f819,plain,
    ( sk3 = app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,sk10))
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(sk8)
    | ~ ssList(sk9) ),
    inference(forward_subsumption_resolution,[],[f806,f606]) ).

fof(f822,plain,
    ( sk3 = app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,sk10))
    | ~ ssList(sk8)
    | ~ ssList(sk9) ),
    inference(forward_subsumption_resolution,[],[f819,f611]) ).

fof(f824,plain,
    ( sk3 = app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,sk10))
    | ~ ssList(sk9) ),
    inference(forward_subsumption_resolution,[],[f822,f214]) ).

fof(f825,plain,
    sk3 = app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,sk10)),
    inference(forward_subsumption_resolution,[],[f824,f215]) ).

fof(f826,plain,
    sk3 = app(app(sk8,cons(sk6,sk9)),cons(sk7,sk10)),
    inference(forward_demodulation,[],[f825,f735]) ).

fof(f828,plain,
    ( ~ ssList(sk3)
    | ~ ssList(sk9)
    | ~ ssList(sk8)
    | ~ ssItem(sk7)
    | ~ ssItem(sk6)
    | ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(superposition,[],[f247,f826]) ).

fof(f838,plain,
    ( ~ ssList(sk9)
    | ~ ssList(sk8)
    | ~ ssItem(sk7)
    | ~ ssItem(sk6)
    | ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f828,f202]) ).

fof(f843,plain,
    ( ~ ssList(sk8)
    | ~ ssItem(sk7)
    | ~ ssItem(sk6)
    | ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f838,f215]) ).

fof(f847,plain,
    ( ~ ssItem(sk7)
    | ~ ssItem(sk6)
    | ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f843,f214]) ).

fof(f849,plain,
    ( ~ ssItem(sk6)
    | ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f847,f213]) ).

fof(f850,plain,
    ( ~ totalorderedP(sk3)
    | ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f849,f212]) ).

fof(f851,plain,
    ( ~ ssList(sk10)
    | leq(sk6,sk7) ),
    inference(forward_subsumption_resolution,[],[f850,f209]) ).

fof(f852,plain,
    leq(sk6,sk7),
    inference(forward_subsumption_resolution,[],[f851,f216]) ).

fof(f853,plain,
    memberP(sk9,sk11),
    inference(unit_resulting_resolution,[],[f221,f852]) ).

fof(f855,plain,
    ssItem(sk11),
    inference(resolution,[],[f852,f220]) ).

fof(f896,plain,
    sk3 = app(sk3,nil),
    inference(unit_resulting_resolution,[],[f73,f202]) ).

fof(f1292,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(superposition,[],[f247,f182]) ).

fof(f1296,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(duplicate_literal_removal,[],[f1292]) ).

fof(f1300,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f1296,f52]) ).

fof(f1301,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f1300,f53]) ).

fof(f1308,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ ssList(app(X0,X1))
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(superposition,[],[f1301,f161]) ).

fof(f1318,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(forward_subsumption_resolution,[],[f1308,f85]) ).

fof(f1327,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(forward_subsumption_resolution,[],[f1318,f606]) ).

fof(f1333,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X4)
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f1327,f86]) ).

fof(f1351,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | ~ ssList(skaf43(X2,X0))
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssItem(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(superposition,[],[f1333,f182]) ).

fof(f1364,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | ~ ssList(skaf43(X2,X0))
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(duplicate_literal_removal,[],[f1351]) ).

fof(f1374,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(forward_subsumption_resolution,[],[f1364,f52]) ).

fof(f1382,plain,
    ! [X2,X3,X0,X1] :
      ( ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | leq(X3,X2)
      | ~ totalorderedP(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(forward_subsumption_resolution,[],[f1374,f53]) ).

fof(f1479,plain,
    ( app(sk3,nil) = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(nil)
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(cons(sk7,nil))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10)) ),
    inference(superposition,[],[f541,f73]) ).

fof(f1492,plain,
    ( app(sk3,nil) = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(nil)
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(duplicate_literal_removal,[],[f1479]) ).

fof(f1502,plain,
    ( app(sk3,nil) = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(app(sk9,cons(sk7,nil)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(forward_subsumption_resolution,[],[f1492,f8]) ).

fof(f1512,plain,
    ( app(sk3,nil) = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(app(sk9,cons(sk7,nil))) ),
    inference(forward_subsumption_resolution,[],[f1502,f612]) ).

fof(f1517,plain,
    ( sk3 = app(app(sk8,cons(sk6,nil)),app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
    | ~ ssList(app(sk8,cons(sk6,nil)))
    | ~ ssList(app(sk9,cons(sk7,nil))) ),
    inference(forward_demodulation,[],[f1512,f896]) ).

fof(f1643,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(skaf42(X0,X1))
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ totalorderedP(app(X2,X0))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(resolution,[],[f151,f1382]) ).

fof(f1673,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(skaf42(X0,X1))
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ totalorderedP(app(X2,X0))
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(duplicate_literal_removal,[],[f1643]) ).

fof(f1692,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X2,X0))
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f1673,f53]) ).

fof(f1726,plain,
    ! [X0,X1] :
      ( ~ totalorderedP(sk3)
      | ~ ssItem(X0)
      | ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ memberP(app(app(sk9,cons(sk7,nil)),sk10),X1)
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(sk9,cons(sk7,nil))) ),
    inference(superposition,[],[f1692,f1517]) ).

fof(f1742,plain,
    ! [X0,X1] :
      ( ~ totalorderedP(sk3)
      | ~ ssItem(X0)
      | ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ memberP(app(app(sk9,cons(sk7,nil)),sk10),X1)
      | ~ ssList(app(sk9,cons(sk7,nil))) ),
    inference(duplicate_literal_removal,[],[f1726]) ).

fof(f1761,plain,
    ! [X0,X1] :
      ( ~ memberP(app(app(sk9,cons(sk7,nil)),sk10),X1)
      | ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssItem(X0)
      | ~ ssList(app(sk9,cons(sk7,nil))) ),
    inference(forward_subsumption_resolution,[],[f1742,f209]) ).

fof(f1851,plain,
    ! [X0,X1] :
      ( ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssItem(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssList(sk10)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssItem(X1)
      | ~ memberP(app(sk9,cons(sk7,nil)),X1) ),
    inference(resolution,[],[f1761,f151]) ).

fof(f1853,plain,
    ! [X0,X1] :
      ( ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(app(sk9,cons(sk7,nil)),sk10))
      | ~ ssItem(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssList(sk10)
      | ~ memberP(app(sk9,cons(sk7,nil)),X1) ),
    inference(duplicate_literal_removal,[],[f1851]) ).

fof(f1855,plain,
    ! [X0,X1] :
      ( ~ memberP(app(sk8,cons(sk6,nil)),X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ ssList(sk10)
      | ~ memberP(app(sk9,cons(sk7,nil)),X1) ),
    inference(forward_subsumption_resolution,[],[f1853,f85]) ).

fof(f1857,plain,
    ! [X0,X1] :
      ( ~ memberP(app(sk9,cons(sk7,nil)),X1)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ memberP(app(sk8,cons(sk6,nil)),X0) ),
    inference(forward_subsumption_resolution,[],[f1855,f216]) ).

fof(f1863,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | leq(X1,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X1)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ memberP(app(sk8,cons(sk6,nil)),X1)
      | ~ ssList(cons(sk7,nil))
      | ~ ssList(sk9)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0) ),
    inference(resolution,[],[f1857,f151]) ).

fof(f1864,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | leq(X1,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X1)
      | ~ ssList(app(sk9,cons(sk7,nil)))
      | ~ memberP(app(sk8,cons(sk6,nil)),X1)
      | ~ ssList(cons(sk7,nil))
      | ~ ssList(sk9)
      | ~ memberP(sk9,X0) ),
    inference(duplicate_literal_removal,[],[f1863]) ).

fof(f1866,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | leq(X1,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X1)
      | ~ memberP(app(sk8,cons(sk6,nil)),X1)
      | ~ ssList(cons(sk7,nil))
      | ~ ssList(sk9)
      | ~ memberP(sk9,X0) ),
    inference(forward_subsumption_resolution,[],[f1864,f85]) ).

fof(f1867,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | leq(X1,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X1)
      | ~ memberP(app(sk8,cons(sk6,nil)),X1)
      | ~ ssList(sk9)
      | ~ memberP(sk9,X0) ),
    inference(forward_subsumption_resolution,[],[f1866,f612]) ).

fof(f1868,plain,
    ! [X0,X1] :
      ( ~ memberP(app(sk8,cons(sk6,nil)),X1)
      | leq(X1,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0) ),
    inference(forward_subsumption_resolution,[],[f1867,f215]) ).

fof(f1869,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(sk6)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(sk8)
      | ~ ssItem(sk6)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(nil) ),
    inference(resolution,[],[f1868,f242]) ).

fof(f1872,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(sk6)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(sk8)
      | ~ ssList(nil) ),
    inference(duplicate_literal_removal,[],[f1869]) ).

fof(f1874,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(sk8)
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f1872,f212]) ).

fof(f1876,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f1874,f214]) ).

fof(f1878,plain,
    ! [X0] :
      ( ~ ssList(app(sk8,cons(sk6,nil)))
      | leq(sk6,X0)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0) ),
    inference(forward_subsumption_resolution,[],[f1876,f8]) ).

fof(f1879,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(sk8)
      | ~ ssList(cons(sk6,nil)) ),
    inference(resolution,[],[f1878,f85]) ).

fof(f1880,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | ~ ssList(cons(sk6,nil)) ),
    inference(forward_subsumption_resolution,[],[f1879,f214]) ).

fof(f1881,plain,
    ! [X0] :
      ( leq(sk6,X0)
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0) ),
    inference(forward_subsumption_resolution,[],[f1880,f611]) ).

fof(f1882,plain,
    leq(sk6,sk11),
    inference(unit_resulting_resolution,[],[f1881,f855,f853]) ).

fof(f1885,plain,
    ~ leq(sk11,sk7),
    inference(unit_resulting_resolution,[],[f222,f852,f1882]) ).

fof(f2388,plain,
    ! [X0] :
      ( ~ totalorderedP(sk3)
      | ~ ssItem(X0)
      | ~ ssItem(sk7)
      | ~ ssList(sk10)
      | leq(X0,sk7)
      | ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(superposition,[],[f1333,f777]) ).

fof(f2405,plain,
    ! [X0] :
      ( ~ totalorderedP(sk3)
      | ~ ssItem(X0)
      | ~ ssItem(sk7)
      | ~ ssList(sk10)
      | leq(X0,sk7)
      | ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(duplicate_literal_removal,[],[f2388]) ).

fof(f2407,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ ssItem(sk7)
      | ~ ssList(sk10)
      | leq(X0,sk7)
      | ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(forward_subsumption_resolution,[],[f2405,f209]) ).

fof(f2409,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ ssList(sk10)
      | leq(X0,sk7)
      | ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(forward_subsumption_resolution,[],[f2407,f213]) ).

fof(f2411,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | leq(X0,sk7)
      | ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(forward_subsumption_resolution,[],[f2409,f216]) ).

fof(f2412,plain,
    ! [X0] :
      ( ~ memberP(app(app(sk8,cons(sk6,nil)),sk9),X0)
      | leq(X0,sk7)
      | ~ ssItem(X0)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(forward_subsumption_resolution,[],[f2411,f215]) ).

fof(f3305,plain,
    ! [X0] :
      ( ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | leq(X0,sk7)
      | ~ ssItem(X0)
      | ~ ssList(app(sk8,cons(sk6,nil))) ),
    inference(resolution,[],[f152,f2412]) ).

fof(f3366,plain,
    ! [X0] :
      ( ~ ssList(sk9)
      | ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | leq(X0,sk7) ),
    inference(duplicate_literal_removal,[],[f3305]) ).

fof(f3403,plain,
    ! [X0] :
      ( ~ ssList(app(sk8,cons(sk6,nil)))
      | ~ ssItem(X0)
      | ~ memberP(sk9,X0)
      | leq(X0,sk7) ),
    inference(forward_subsumption_resolution,[],[f3366,f215]) ).

fof(f3439,plain,
    ~ ssList(app(sk8,cons(sk6,nil))),
    inference(unit_resulting_resolution,[],[f3403,f855,f1885,f853]) ).

fof(f3443,plain,
    ~ ssList(cons(sk6,nil)),
    inference(unit_resulting_resolution,[],[f85,f214,f3439]) ).

fof(f3446,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3443,f611]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC158-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.11/0.38  % Computer : n004.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 08:12:22 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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
% 17.32/3.37  % (199537)Input is clausal, will run a generic CNF schedule.
% 17.32/3.37  % (199648)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2680183441:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 17.32/3.37  % (199649)dis-21_1_sil=8000:lcm=predicate:random_seed=732742516: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)
% 17.32/3.37  % (199644)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2988965998:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 17.32/3.37  % (199643)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=781779067:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 17.32/3.37  % (199647)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3015341727:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 17.32/3.37  % (199646)lrs+10_1_sil=8000:sp=occurrence:random_seed=2735210380:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 17.32/3.37  % (199645)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=592409627:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 17.32/3.37  % (199648)Instruction limit reached! 
% 17.32/3.37  % (199648)------------------------------
% 17.32/3.37  % (199648)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.32/3.37  % (199648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.32/3.37  % (199648)CaDiCaL version: 2.1.3
% 17.32/3.37  % (199648)Termination reason: Instruction limit
% 17.32/3.37  % (199648)Termination phase: Saturation
% 17.32/3.37  % (199648)Time elapsed: 0.066 s
% 17.32/3.37  % (199648)Peak memory usage: 90 MB
% 17.32/3.37  % (199648)Instructions burned: 180 (million)
% 17.32/3.37  % (199647)Instruction limit reached! 
% 17.32/3.37  % (199647)------------------------------
% 17.32/3.37  % (199647)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.32/3.37  % (199647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.32/3.37  % (199647)CaDiCaL version: 2.1.3
% 17.32/3.37  % (199647)Termination reason: Instruction limit
% 17.32/3.37  % (199647)Termination phase: Saturation
% 17.32/3.37  % (199647)Time elapsed: 0.068 s
% 17.32/3.37  % (199647)Peak memory usage: 89 MB
% 17.32/3.37  % (199647)Instructions burned: 114 (million)
% 17.32/3.37  % (199646)Instruction limit reached! 
% 17.32/3.37  % (199646)------------------------------
% 17.32/3.37  % (199646)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.32/3.37  % (199646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.32/3.37  % (199646)CaDiCaL version: 2.1.3
% 17.32/3.37  % (199646)Termination reason: Instruction limit
% 17.32/3.37  % (199646)Termination phase: Saturation
% 17.32/3.37  % (199646)Time elapsed: 0.068 s
% 17.32/3.37  % (199646)Peak memory usage: 90 MB
% 17.32/3.37  % (199646)Instructions burned: 108 (million)
% 17.32/3.37  % (199649)Instruction limit reached! 
% 17.32/3.37  % (199649)------------------------------
% 17.32/3.37  % (199649)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.32/3.37  % (199649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.32/3.37  % (199649)CaDiCaL version: 2.1.3
% 17.32/3.37  % (199649)Termination reason: Instruction limit
% 17.32/3.37  % (199649)Termination phase: Saturation
% 17.32/3.37  % (199649)Time elapsed: 0.072 s
% 17.32/3.37  % (199649)Peak memory usage: 89 MB
% 17.32/3.37  % (199649)Instructions burned: 117 (million)
% 17.32/3.37  % (199661)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=2637491308:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 17.32/3.37  % (199661)Instruction limit reached! 
% 17.32/3.37  % (199661)------------------------------
% 17.32/3.37  % (199661)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.32/3.37  % (199661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.32/3.37  % (199661)CaDiCaL version: 2.1.3
% 17.32/3.37  % (199661)Termination reason: Instruction limit
% 17.32/3.37  % (199661)Termination phase: Saturation
% 17.32/3.37  % (199661)Time elapsed: 0.079 s
% 17.32/3.37  % (199661)Peak memory usage: 90 MB
% 17.32/3.37  % (199661)Instructions burned: 144 (million)
% 17.32/3.37  % (199678)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=89545593: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)
% 28.02/4.88  % (199680)lrs+10_64_to=lpo:sil=8000:random_seed=4007259377:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 28.02/4.88  % (199679)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=495528612:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 28.02/4.88  % (199696)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1111758977:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 28.02/4.88  % (199680)Instruction limit reached! 
% 28.02/4.88  % (199680)------------------------------
% 28.02/4.88  % (199680)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.02/4.88  % (199680)CaDiCaL version: 2.1.3
% 28.02/4.88  % (199680)Termination reason: Instruction limit
% 28.02/4.88  % (199680)Termination phase: Saturation
% 28.02/4.88  % (199680)Time elapsed: 0.120 s
% 28.02/4.88  % (199680)Peak memory usage: 90 MB
% 28.02/4.88  % (199680)Instructions burned: 126 (million)
% 28.02/4.88  % (199678)Instruction limit reached! 
% 28.02/4.88  % (199678)------------------------------
% 28.02/4.88  % (199678)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.02/4.88  % (199678)CaDiCaL version: 2.1.3
% 28.02/4.88  % (199678)Termination reason: Instruction limit
% 28.02/4.88  % (199678)Termination phase: Saturation
% 28.02/4.88  % (199678)Time elapsed: 0.172 s
% 28.02/4.88  % (199678)Peak memory usage: 91 MB
% 28.02/4.88  % (199678)Instructions burned: 190 (million)
% 28.02/4.88  % (199696)Instruction limit reached! 
% 28.02/4.88  % (199696)------------------------------
% 28.02/4.88  % (199696)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.02/4.88  % (199696)CaDiCaL version: 2.1.3
% 28.02/4.88  % (199696)Termination reason: Instruction limit
% 28.02/4.88  % (199696)Termination phase: Saturation
% 28.02/4.88  % (199696)Time elapsed: 0.067 s
% 28.02/4.88  % (199696)Peak memory usage: 90 MB
% 28.02/4.88  % (199696)Instructions burned: 196 (million)
% 28.02/4.88  % (199679)Instruction limit reached! 
% 28.02/4.88  % (199679)------------------------------
% 28.02/4.88  % (199679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.02/4.88  % (199679)CaDiCaL version: 2.1.3
% 28.02/4.88  % (199679)Termination reason: Instruction limit
% 28.02/4.88  % (199679)Termination phase: Saturation
% 28.02/4.88  % (199679)Time elapsed: 0.224 s
% 28.02/4.88  % (199679)Peak memory usage: 90 MB
% 28.02/4.88  % (199679)Instructions burned: 219 (million)
% 28.02/4.88  % (199709)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1922062010:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 28.02/4.88  % (199707)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=92029356:i=157:gtg=all_2993 on theBenchmark for (2993ds/157Mi)
% 28.02/4.88  % (199710)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=766467562:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 28.02/4.88  % (199711)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=2009608595:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 28.02/4.88  % (199707)Instruction limit reached! 
% 28.02/4.88  % (199707)------------------------------
% 28.02/4.88  % (199707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.02/4.88  % (199707)CaDiCaL version: 2.1.3
% 28.02/4.88  % (199707)Termination reason: Instruction limit
% 28.02/4.88  % (199707)Termination phase: Saturation
% 28.02/4.88  % (199707)Time elapsed: 0.156 s
% 28.02/4.88  % (199707)Peak memory usage: 91 MB
% 28.02/4.88  % (199707)Instructions burned: 159 (million)
% 28.02/4.88  % (199710)Instruction limit reached! 
% 28.02/4.88  % (199710)------------------------------
% 28.02/4.88  % (199710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.02/4.88  % (199710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199710)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199710)Termination reason: Instruction limit
% 13.38/5.83  % (199710)Termination phase: Saturation
% 13.38/5.83  % (199710)Time elapsed: 0.100 s
% 13.38/5.83  % (199710)Peak memory usage: 90 MB
% 13.38/5.83  % (199710)Instructions burned: 107 (million)
% 13.38/5.83  % (199711)Instruction limit reached! 
% 13.38/5.83  % (199711)------------------------------
% 13.38/5.83  % (199711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199711)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199711)Termination reason: Instruction limit
% 13.38/5.83  % (199711)Termination phase: Saturation
% 13.38/5.83  % (199711)Time elapsed: 0.110 s
% 13.38/5.83  % (199711)Peak memory usage: 90 MB
% 13.38/5.83  % (199711)Instructions burned: 108 (million)
% 13.38/5.83  % (199718)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=1900694422:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 13.38/5.83  % (199721)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1374942811:cond=fast:i=5208:av=off_2989 on theBenchmark for (2989ds/5208Mi)
% 13.38/5.83  % (199724)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=3472132066:i=134:sd=2:doe=on:ss=axioms:sgt=14_2988 on theBenchmark for (2988ds/134Mi)
% 13.38/5.83  % (199724)Instruction limit reached! 
% 13.38/5.83  % (199724)------------------------------
% 13.38/5.83  % (199724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199724)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199724)Termination reason: Instruction limit
% 13.38/5.83  % (199724)Termination phase: Saturation
% 13.38/5.83  % (199724)Time elapsed: 0.144 s
% 13.38/5.83  % (199724)Peak memory usage: 90 MB
% 13.38/5.83  % (199724)Instructions burned: 135 (million)
% 13.38/5.83  % (199718)Instruction limit reached! 
% 13.38/5.83  % (199718)------------------------------
% 13.38/5.83  % (199718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199718)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199718)Termination reason: Instruction limit
% 13.38/5.83  % (199718)Termination phase: Saturation
% 13.38/5.83  % (199718)Time elapsed: 0.240 s
% 13.38/5.83  % (199718)Peak memory usage: 90 MB
% 13.38/5.83  % (199718)Instructions burned: 242 (million)
% 13.38/5.83  % (199728)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=2001735518:i=499:bd=all_2984 on theBenchmark for (2984ds/499Mi)
% 13.38/5.83  % (199729)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=1625168391:i=191:fgj=on:bd=all_2984 on theBenchmark for (2984ds/191Mi)
% 13.38/5.83  % (199729)Instruction limit reached! 
% 13.38/5.83  % (199729)------------------------------
% 13.38/5.83  % (199729)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199729)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199729)Termination reason: Instruction limit
% 13.38/5.83  % (199729)Termination phase: Saturation
% 13.38/5.83  % (199729)Time elapsed: 0.183 s
% 13.38/5.83  % (199729)Peak memory usage: 93 MB
% 13.38/5.83  % (199729)Instructions burned: 192 (million)
% 13.38/5.83  % (199728)Instruction limit reached! 
% 13.38/5.83  % (199728)------------------------------
% 13.38/5.83  % (199728)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199728)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199728)Termination reason: Instruction limit
% 13.38/5.83  % (199728)Termination phase: Saturation
% 13.38/5.83  % (199728)Time elapsed: 0.439 s
% 13.38/5.83  % (199728)Peak memory usage: 102 MB
% 13.38/5.83  % (199728)Instructions burned: 499 (million)
% 13.38/5.83  % (199740)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=2641128582:i=264:kws=precedence:fsr=off_2979 on theBenchmark for (2979ds/264Mi)
% 13.38/5.83  % (199740)Instruction limit reached! 
% 13.38/5.83  % (199740)------------------------------
% 13.38/5.83  % (199740)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199740)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199740)Termination reason: Instruction limit
% 13.38/5.83  % (199740)Termination phase: Saturation
% 13.38/5.83  % (199740)Time elapsed: 0.206 s
% 13.38/5.83  % (199740)Peak memory usage: 92 MB
% 13.38/5.83  % (199740)Instructions burned: 265 (million)
% 13.38/5.83  % (199741)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=4289454996:cond=on:i=156:bs=on:gtg=exists_all:er=known_2977 on theBenchmark for (2977ds/156Mi)
% 13.38/5.83  % (199709)Instruction limit reached! 
% 13.38/5.83  % (199709)------------------------------
% 13.38/5.83  % (199709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199709)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199709)Termination reason: Instruction limit
% 13.38/5.83  % (199709)Termination phase: Saturation
% 13.38/5.83  % (199709)Time elapsed: 1.844 s
% 13.38/5.83  % (199709)Peak memory usage: 152 MB
% 13.38/5.83  % (199709)Instructions burned: 3394 (million)
% 13.38/5.83  % (199741)Instruction limit reached! 
% 13.38/5.83  % (199741)------------------------------
% 13.38/5.83  % (199741)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199741)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199741)Termination reason: Instruction limit
% 13.38/5.83  % (199741)Termination phase: Saturation
% 13.38/5.83  % (199741)Time elapsed: 0.166 s
% 13.38/5.83  % (199741)Peak memory usage: 90 MB
% 13.38/5.83  % (199741)Instructions burned: 157 (million)
% 13.38/5.83  % (199746)lrs-1010_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:sp=reverse_frequency:spb=units:lcm=predicate:urr=on:s2agt=8:updr=off:random_seed=1791456773:i=3256:kws=precedence:bd=preordered:av=off_2974 on theBenchmark for (2974ds/3256Mi)
% 13.38/5.83  % (199747)dis+1003_128_sil=8000:tgt=full:fd=off:random_seed=2912456701:i=537:av=off:ss=included_2973 on theBenchmark for (2973ds/537Mi)
% 13.38/5.83  % (199748)ott+1010_32_to=lpo:sil=8000:urr=on:nwc=4:random_seed=2118398623:i=180:bd=preordered:av=off_2973 on theBenchmark for (2973ds/180Mi)
% 13.38/5.83  % (199748)Instruction limit reached! 
% 13.38/5.83  % (199748)------------------------------
% 13.38/5.83  % (199748)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199748)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199748)Termination reason: Instruction limit
% 13.38/5.83  % (199748)Termination phase: Saturation
% 13.38/5.83  % (199748)Time elapsed: 0.088 s
% 13.38/5.83  % (199748)Peak memory usage: 91 MB
% 13.38/5.83  % (199748)Instructions burned: 180 (million)
% 13.38/5.83  % (199752)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:sas=cadical:sp=reverse_frequency:bsr=on:alpa=false:sac=on:random_seed=949536261:i=10307:s2at=3:bs=on:bd=preordered:fsd=on_2969 on theBenchmark for (2969ds/10307Mi)
% 13.38/5.83  % (199747)Instruction limit reached! 
% 13.38/5.83  % (199747)------------------------------
% 13.38/5.83  % (199747)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199747)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199747)Termination reason: Instruction limit
% 13.38/5.83  % (199747)Termination phase: Saturation
% 13.38/5.83  % (199747)Time elapsed: 0.488 s
% 13.38/5.83  % (199747)Peak memory usage: 93 MB
% 13.38/5.83  % (199747)Instructions burned: 538 (million)
% 13.38/5.83  % (199754)lrs-1010_1024_to=lpo:sil=8000:tgt=ground:plsq=on:plsqc=1:sas=cadical:plsqr=1,32:sp=arity:lma=off:spb=goal:acc=on:bce=on:nwc=1.2:alpa=false:random_seed=4018457384:i=412:gtgl=4:gtg=exists_all_2966 on theBenchmark for (2966ds/412Mi)
% 13.38/5.83  % (199754)Instruction limit reached! 
% 13.38/5.83  % (199754)------------------------------
% 13.38/5.83  % (199754)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.38/5.83  % (199754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.38/5.83  % (199754)CaDiCaL version: 2.1.3
% 13.38/5.83  % (199754)Termination reason: Instruction limit
% 13.38/5.83  % (199754)Termination phase: Saturation
% 13.38/5.83  % (199754)Time elapsed: 0.179 s
% 13.38/5.83  % (199754)Peak memory usage: 91 MB
% 13.38/5.83  % (199754)Instructions burned: 415 (million)
% 13.38/5.83  % (199758)ott+1002_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=ground:npcc=on:etr=on:spb=units:urr=on:bsr=unit_only:gs=on:s2agt=16:br=off:random_seed=2942458831:s2pl=no:i=8478:s2at=4:nm=6_2962 on theBenchmark for (2962ds/8478Mi)
% 13.38/5.83  % (199746)First to succeed.
% 13.38/5.83  % (199746)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-199537"
% 13.38/5.83  % (199721)Also succeeded, but the first one will report.
% 13.38/5.83  % (199746)Refutation found. Thanks to Tanya!
% 13.38/5.83  % SZS status Unsatisfiable for theBenchmark
% 13.38/5.83  % SZS output start Proof for theBenchmark
% See solution above
% 35.50/6.06  % (199746)------------------------------
% 35.50/6.06  % (199746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 35.50/6.06  % (199746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.50/6.06  % (199746)CaDiCaL version: 2.1.3
% 35.50/6.06  % (199746)Termination reason: Refutation
% 35.50/6.06  % (199746)Time elapsed: 1.713 s
% 35.50/6.06  % (199746)Peak memory usage: 137 MB
% 35.50/6.06  % (199746)Instructions burned: 1723 (million)
% 35.50/6.06  % (199746)------------------------------
% 35.50/6.06  % (199746)------------------------------
% 35.50/6.06  % (199537)Success in time 4.956 s
% 35.50/6.06  % Vampire exiting
%------------------------------------------------------------------------------