↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWC124+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n008.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:04:46 PM UTC 2026

% Result   : Theorem 5.32s 1.28s
% Output   : Refutation 5.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   74 (  18 unt;   5 def)
%            Number of atoms       :  254 (  47 equ)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :  303 ( 123   ~; 114   |;  40   &)
%                                         (   7 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   6 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   77 (   0 sgn  59   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).

fof(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).

fof(f56,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( segmentP(X0,X1)
                   => segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ neq(X1,nil)
                    | ! [X4] :
                        ( ssList(X4)
                       => ( app(X2,X4) != X3
                          | ~ totalorderedP(X2)
                          | ? [X5] :
                              ( ssItem(X5)
                              & ? [X6] :
                                  ( ssList(X6)
                                  & app(cons(X5,nil),X6) = X4
                                  & ? [X7] :
                                      ( ssItem(X7)
                                      & ? [X8] :
                                          ( ssList(X8)
                                          & app(X8,cons(X7,nil)) = X2
                                          & leq(X7,X5) ) ) ) ) ) )
                    | ( nil != X3
                      & nil = X2 )
                    | ( neq(X0,nil)
                      & segmentP(X1,X0) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X1 != X3
                      | X0 != X2
                      | ~ neq(X1,nil)
                      | ! [X4] :
                          ( ssList(X4)
                         => ( app(X2,X4) != X3
                            | ~ totalorderedP(X2)
                            | ? [X5] :
                                ( ssItem(X5)
                                & ? [X6] :
                                    ( ssList(X6)
                                    & app(cons(X5,nil),X6) = X4
                                    & ? [X7] :
                                        ( ssItem(X7)
                                        & ? [X8] :
                                            ( ssList(X8)
                                            & app(X8,cons(X7,nil)) = X2
                                            & leq(X7,X5) ) ) ) ) ) )
                      | ( nil != X3
                        & nil = X2 )
                      | ( neq(X0,nil)
                        & segmentP(X1,X0) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f134,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f172,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f173,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f174,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f173]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ? [X4] :
                      ( app(X2,X4) = X3
                      & totalorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ leq(X7,X5) ) ) ) )
                      & ssList(X4) )
                  & ( nil = X3
                    | nil != X2 )
                  & ( ~ neq(X0,nil)
                    | ~ segmentP(X1,X0) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ? [X4] :
                      ( app(X2,X4) = X3
                      & totalorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ leq(X7,X5) ) ) ) )
                      & ssList(X4) )
                  & ( nil = X3
                    | nil != X2 )
                  & ( ~ neq(X0,nil)
                    | ~ segmentP(X1,X0) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f303,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f304,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 != X1
      | ~ neq(X0,X1) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f306,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f320,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f134]) ).

fof(f357,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f172]) ).

fof(f358,plain,
    ! [X2,X3,X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | segmentP(app(app(X2,X0),X3),X1) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f412,plain,
    ssList(sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    sK50 = app(sK49,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    ( nil != sK49
    | nil = sK50 ),
    inference(cnf_transformation,[],[f222]) ).

fof(f416,plain,
    ( ~ segmentP(sK48,sK47)
    | ~ neq(sK47,nil) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f418,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f222]) ).

fof(f419,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f420,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f421,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f222]) ).

fof(f426,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f418,f420]) ).

fof(f427,plain,
    ( ~ segmentP(sK50,sK49)
    | ~ neq(sK49,nil) ),
    inference(definition_unfolding,[],[f416,f420,f419,f419]) ).

fof(f442,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f304]) ).

fof(f538,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f442]) ).

fof(f542,definition,
    ( spl52_1
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).

fof(f544,plain,
    ( nil = sK50
    | ~ spl52_1 ),
    inference(avatar_component_clause,[],[f542]) ).

fof(f546,definition,
    ( spl52_2
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).

fof(f548,plain,
    ( nil != sK49
    | spl52_2 ),
    inference(avatar_component_clause,[],[f546]) ).

fof(f549,plain,
    ( spl52_1
    | ~ spl52_2 ),
    inference(avatar_split_clause,[],[f415,f546,f542]) ).

fof(f551,definition,
    ( spl52_3
  <=> neq(sK49,nil) ),
    introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).

fof(f553,plain,
    ( ~ neq(sK49,nil)
    | spl52_3 ),
    inference(avatar_component_clause,[],[f551]) ).

fof(f555,definition,
    ( spl52_4
  <=> segmentP(sK50,sK49) ),
    introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).

fof(f558,plain,
    ( ~ spl52_3
    | ~ spl52_4 ),
    inference(avatar_split_clause,[],[f427,f555,f551]) ).

fof(f564,definition,
    ( spl52_6
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).

fof(f565,plain,
    ( ssList(nil)
    | ~ spl52_6 ),
    inference(avatar_component_clause,[],[f564]) ).

fof(f593,plain,
    spl52_6,
    inference(avatar_split_clause,[],[f306,f564]) ).

fof(f610,plain,
    sK49 = app(nil,sK49),
    inference(resolution,[],[f320,f421]) ).

fof(f781,plain,
    ( neq(nil,nil)
    | ~ spl52_1 ),
    inference(superposition,[],[f426,f544]) ).

fof(f835,plain,
    ( ~ ssList(nil)
    | ~ spl52_1 ),
    inference(resolution,[],[f781,f538]) ).

fof(f836,plain,
    ( $false
    | ~ spl52_1
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f835,f565]) ).

fof(f837,plain,
    ( ~ spl52_1
    | ~ spl52_6 ),
    inference(avatar_contradiction_clause,[],[f836]) ).

fof(f1850,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f358,f357]) ).

fof(f1853,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f1850]) ).

fof(f8855,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(sK49) ),
    inference(superposition,[],[f1853,f610]) ).

fof(f8877,plain,
    ( ! [X0] :
        ( segmentP(app(sK49,X0),sK49)
        | ~ ssList(X0)
        | ~ ssList(sK49) )
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f8855,f565]) ).

fof(f8887,plain,
    ( ! [X0] :
        ( segmentP(app(sK49,X0),sK49)
        | ~ ssList(X0) )
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f8877,f421]) ).

fof(f36710,plain,
    ( segmentP(sK50,sK49)
    | ~ ssList(sK51)
    | ~ spl52_6 ),
    inference(superposition,[],[f8887,f414]) ).

fof(f36734,plain,
    ( segmentP(sK50,sK49)
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f36710,f412]) ).

fof(f36736,plain,
    ( spl52_4
    | ~ spl52_6 ),
    inference(avatar_split_clause,[],[f36734,f564,f555]) ).

fof(f36737,plain,
    ( ~ ssList(nil)
    | nil = sK49
    | ~ ssList(sK49)
    | spl52_3 ),
    inference(resolution,[],[f553,f303]) ).

fof(f36740,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl52_3
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f36737,f565]) ).

fof(f36750,plain,
    ( ~ ssList(sK49)
    | spl52_2
    | spl52_3
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f36740,f548]) ).

fof(f36751,plain,
    ( $false
    | spl52_2
    | spl52_3
    | ~ spl52_6 ),
    inference(forward_subsumption_resolution,[],[f36750,f421]) ).

fof(f36752,plain,
    ( spl52_2
    | spl52_3
    | ~ spl52_6 ),
    inference(avatar_contradiction_clause,[],[f36751]) ).

cnf(s1,plain,
    ( spl52_1
    | ~ spl52_2 ),
    inference(sat_conversion,[],[f549]) ).

cnf(s2,plain,
    ( ~ spl52_3
    | ~ spl52_4 ),
    inference(sat_conversion,[],[f558]) ).

cnf(s11,plain,
    spl52_6,
    inference(sat_conversion,[],[f593]) ).

cnf(s17,plain,
    ( ~ spl52_1
    | ~ spl52_6 ),
    inference(sat_conversion,[],[f837]) ).

cnf(s3795,plain,
    ( spl52_4
    | ~ spl52_6 ),
    inference(sat_conversion,[],[f36736]) ).

cnf(s3797,plain,
    ( spl52_2
    | spl52_3
    | ~ spl52_6 ),
    inference(sat_conversion,[],[f36752]) ).

cnf(s3850,plain,
    spl52_4,
    inference(rat,[],[s3795,s11]) ).

cnf(s3858,plain,
    ~ spl52_1,
    inference(rat,[],[s17,s11]) ).

cnf(s3922,plain,
    ~ spl52_3,
    inference(rat,[],[s2,s3850]) ).

cnf(s3923,plain,
    spl52_2,
    inference(rat,[],[s3797,s11,s3922]) ).

cnf(s3968,plain,
    $false,
    inference(rat,[],[s1,s3923,s3858]) ).

fof(f36753,plain,
    $false,
    inference(avatar_sat_refutation,[],[s3968]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC124+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38  % Computer : n008.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 28 08:03:24 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.32/1.28  % (2090637)Will run a generic schedule for satisfiability detection.
% 5.32/1.28  % (2090642)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2450039755_2999 on theBenchmark for (2999ds/0Mi)
% 5.32/1.28  % (2090643)% WARNING: option uhcvi not known.
% 5.32/1.28  % (2090643)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3079264122:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.32/1.28  % (2090644)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4054558914:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.32/1.28  % (2090645)dis+10_1_sil=32000:sp=arity:random_seed=315070981:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.32/1.28  % (2090648)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1955428704:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.32/1.28  % (2090646)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3754993504:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.32/1.28  % TRYING [1]
% 5.32/1.28  % (2090647)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3212559591:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.32/1.28  % TRYING [2]
% 5.32/1.28  % TRYING [3]
% 5.32/1.28  % TRYING [4]
% 5.32/1.28  % TRYING [5]
% 5.32/1.28  % (2090645)Instruction limit reached! 
% 5.32/1.28  % (2090645)------------------------------
% 5.32/1.28  % (2090645)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090645)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090645)Termination reason: Instruction limit
% 5.32/1.28  % (2090645)Termination phase: Saturation
% 5.32/1.28  % (2090645)Time elapsed: 0.061 s
% 5.32/1.28  % (2090645)Peak memory usage: 13 MB
% 5.32/1.28  % (2090645)Instructions burned: 103 (million)
% 5.32/1.28  % (2090646)Instruction limit reached! 
% 5.32/1.28  % (2090646)------------------------------
% 5.32/1.28  % (2090646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090646)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090646)Termination reason: Instruction limit
% 5.32/1.28  % (2090646)Termination phase: Saturation
% 5.32/1.28  % (2090646)Time elapsed: 0.071 s
% 5.32/1.28  % (2090646)Peak memory usage: 13 MB
% 5.32/1.28  % (2090646)Instructions burned: 119 (million)
% 5.32/1.28  % (2090647)Instruction limit reached! 
% 5.32/1.28  % (2090647)------------------------------
% 5.32/1.28  % (2090647)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090647)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090647)Termination reason: Instruction limit
% 5.32/1.28  % (2090647)Termination phase: Saturation
% 5.32/1.28  % (2090647)Time elapsed: 0.074 s
% 5.32/1.28  % (2090647)Peak memory usage: 14 MB
% 5.32/1.28  % (2090647)Instructions burned: 131 (million)
% 5.32/1.28  % (2090656)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1743375103:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.32/1.28  % (2090657)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3214641470:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.32/1.28  % TRYING [1]
% 5.32/1.28  % TRYING [2]
% 5.32/1.28  % (2090658)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3026253244:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.32/1.28  % (2090648)Instruction limit reached! 
% 5.32/1.28  % (2090648)------------------------------
% 5.32/1.28  % (2090648)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % TRYING [3]
% 5.32/1.28  % (2090648)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090648)Termination reason: Instruction limit
% 5.32/1.28  % (2090648)Termination phase: Saturation
% 5.32/1.28  % (2090648)Time elapsed: 0.101 s
% 5.32/1.28  % (2090648)Peak memory usage: 15 MB
% 5.32/1.28  % (2090648)Instructions burned: 160 (million)
% 5.32/1.28  % TRYING [6]
% 5.32/1.28  % TRYING [4]
% 5.32/1.28  % (2090662)ott-21_1_sil=16000:fs=off:random_seed=3029345137:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.32/1.28  % (2090657)Instruction limit reached! 
% 5.32/1.28  % (2090657)------------------------------
% 5.32/1.28  % (2090657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090657)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090657)Termination reason: Instruction limit
% 5.32/1.28  % (2090657)Termination phase: Saturation
% 5.32/1.28  % (2090657)Time elapsed: 0.073 s
% 5.32/1.28  % (2090657)Peak memory usage: 13 MB
% 5.32/1.28  % (2090657)Instructions burned: 131 (million)
% 5.32/1.28  % TRYING [5]
% 5.32/1.28  % (2090664)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=626497961:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.32/1.28  % (2090662)Instruction limit reached! 
% 5.32/1.28  % (2090662)------------------------------
% 5.32/1.28  % (2090662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090662)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090662)Termination reason: Instruction limit
% 5.32/1.28  % (2090662)Termination phase: Saturation
% 5.32/1.28  % (2090662)Time elapsed: 0.089 s
% 5.32/1.28  % (2090662)Peak memory usage: 13 MB
% 5.32/1.28  % (2090662)Instructions burned: 181 (million)
% 5.32/1.28  % (2090666)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=760984105:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 5.32/1.28  % TRYING [1]
% 5.32/1.28  % TRYING [2]
% 5.32/1.28  % TRYING [3]
% 5.32/1.28  % TRYING [7]
% 5.32/1.28  % TRYING [4]
% 5.32/1.28  % TRYING [6]
% 5.32/1.28  % (2090656)Instruction limit reached! 
% 5.32/1.28  % (2090656)------------------------------
% 5.32/1.28  % (2090656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090656)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090656)Termination reason: Instruction limit
% 5.32/1.28  % (2090656)Termination phase: Finite model building constraint generation
% 5.32/1.28  % (2090656)Time elapsed: 0.277 s
% 5.32/1.28  % (2090656)Peak memory usage: 27 MB
% 5.32/1.28  % (2090656)Instructions burned: 714 (million)
% 5.32/1.28  % (2090668)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2355824084:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 5.32/1.28  % TRYING [5]
% 5.32/1.28  % (2090658)Instruction limit reached! 
% 5.32/1.28  % (2090658)------------------------------
% 5.32/1.28  % (2090658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090658)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090658)Termination reason: Instruction limit
% 5.32/1.28  % (2090658)Termination phase: Saturation
% 5.32/1.28  % (2090658)Time elapsed: 0.363 s
% 5.32/1.28  % (2090658)Peak memory usage: 23 MB
% 5.32/1.28  % (2090658)Instructions burned: 684 (million)
% 5.32/1.28  % (2090670)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1686210221:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 5.32/1.28  % (2090664)Instruction limit reached! 
% 5.32/1.28  % (2090664)------------------------------
% 5.32/1.28  % (2090664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090664)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090664)Termination reason: Instruction limit
% 5.32/1.28  % (2090664)Termination phase: Saturation
% 5.32/1.28  % (2090664)Time elapsed: 0.313 s
% 5.32/1.28  % (2090664)Peak memory usage: 14 MB
% 5.32/1.28  % (2090664)Instructions burned: 477 (million)
% 5.32/1.28  % (2090672)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3613721166:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 5.32/1.28  % (2090666)Instruction limit reached! 
% 5.32/1.28  % (2090666)------------------------------
% 5.32/1.28  % (2090666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090666)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090666)Termination reason: Instruction limit
% 5.32/1.28  % (2090666)Termination phase: Finite model building SAT solving
% 5.32/1.28  % (2090666)Time elapsed: 0.343 s
% 5.32/1.28  % (2090666)Peak memory usage: 23 MB
% 5.32/1.28  % (2090666)Instructions burned: 866 (million)
% 5.32/1.28  % TRYING [14]
% 5.32/1.28  % (2090674)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1936659953:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 5.32/1.28  % TRYING [8]
% 5.32/1.28  % (2090643) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2090637-2090643"...
% 5.32/1.28  % (2090670)Instruction limit reached! 
% 5.32/1.28  % (2090670)------------------------------
% 5.32/1.28  % (2090670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090670)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090670)Termination reason: Instruction limit
% 5.32/1.28  % (2090670)Termination phase: Finite model building constraint generation
% 5.32/1.28  % (2090670)Time elapsed: 0.320 s
% 5.32/1.28  % (2090670)Peak memory usage: 70 MB
% 5.32/1.28  % (2090670)Instructions burned: 890 (million)
% 5.32/1.28  % (2090643)...printing done.
% 5.32/1.28  % (2090643)Refutation found. Thanks to Tanya!
% 5.32/1.28  % SZS status Theorem for theBenchmark
% 5.32/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 5.32/1.28  % (2090643)------------------------------
% 5.32/1.28  % (2090643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.32/1.28  % (2090643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.32/1.28  % (2090643)CaDiCaL version: 2.1.3
% 5.32/1.28  % (2090643)Termination reason: Refutation
% 5.32/1.28  % (2090643)Time elapsed: 0.806 s
% 5.32/1.28  % (2090643)Peak memory usage: 32 MB
% 5.32/1.28  % (2090643)Instructions burned: 1512 (million)
% 5.32/1.28  % (2090637)Success in time 0.852 s
% 5.32/1.28  % Vampire exiting
%------------------------------------------------------------------------------