↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL334-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.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 11:52:01 AM UTC 2026

% Result   : Unsatisfiable 26.74s 5.44s
% Output   : Refutation 30.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  121 (  42 unt;   6 def)
%            Number of atoms       :  223 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  202 ( 100   ~;  96   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :   14 (   3 avg)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :  184 (   0 sgn 184   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(and(p,q),r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ~ theorem(not(or(not(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))),not(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),not(or(not(p),not(or(not(q),r))))))))),
    inference(definition_unfolding,[],[f11,f12,f9,f6,f9,f6,f9]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f16,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f17,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f18,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f19,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f20,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f17,f7]) ).

fof(f21,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f16,f7]) ).

fof(f22,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f15,f7]) ).

fof(f23,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f18,f7]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f14,f20]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f14,f22]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f14,f21]) ).

fof(f27,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(resolution,[],[f26,f20]) ).

fof(f28,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f26,f22]) ).

fof(f30,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f19,f7]) ).

fof(f33,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f25,f14]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f33,f20]) ).

fof(f42,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f33,f25]) ).

fof(f43,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f33,f28]) ).

fof(f44,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
      | ~ theorem(or(X0,or(not(X2),X3))) ),
    inference(resolution,[],[f33,f22]) ).

fof(f46,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X2,or(X1,X3))))
      | theorem(or(X0,or(X1,or(X2,X3)))) ),
    inference(resolution,[],[f33,f21]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f33,f30]) ).

fof(f49,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,X1))),
    inference(resolution,[],[f41,f20]) ).

fof(f55,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f41,f23]) ).

fof(f60,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
    inference(resolution,[],[f55,f26]) ).

fof(f75,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f48,f55]) ).

fof(f82,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f75,f24]) ).

fof(f83,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f82,f33]) ).

fof(f86,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f42,f20]) ).

fof(f89,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
      | ~ theorem(or(not(or(X2,X1)),X3)) ),
    inference(resolution,[],[f42,f22]) ).

fof(f91,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
      | ~ theorem(or(not(or(X0,X2)),X3)) ),
    inference(resolution,[],[f42,f21]) ).

fof(f97,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(not(or(X0,X3)),X2))
      | ~ theorem(or(not(X3),X1)) ),
    inference(resolution,[],[f89,f14]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f86,f14]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f86,f48]) ).

fof(f125,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X2)),X1))
      | ~ theorem(or(not(X0),X1))
      | ~ theorem(or(not(X2),X1)) ),
    inference(resolution,[],[f108,f97]) ).

fof(f131,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f27,f33]) ).

fof(f132,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,not(X1))),X0))
      | ~ theorem(X1) ),
    inference(resolution,[],[f27,f14]) ).

fof(f139,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f91,f14]) ).

fof(f149,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X1)),X0))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f83,f24]) ).

fof(f173,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X2,or(X0,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f139,f20]) ).

fof(f202,plain,
    ! [X2,X0,X1] : theorem(or(not(X0),or(X1,or(X0,X2)))),
    inference(resolution,[],[f46,f55]) ).

fof(f215,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
    inference(resolution,[],[f60,f41]) ).

fof(f229,plain,
    ! [X0,X1] :
      ( theorem(or(X1,not(or(X1,not(X0)))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f132,f24]) ).

fof(f231,plain,
    ! [X0,X1] :
      ( theorem(not(or(not(X1),not(X0))))
      | ~ theorem(X0)
      | ~ theorem(X1) ),
    inference(resolution,[],[f229,f14]) ).

fof(f235,plain,
    ( ~ theorem(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),not(or(not(p),not(or(not(q),r))))))
    | ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))) ),
    inference(resolution,[],[f231,f13]) ).

fof(f237,definition,
    ( spl0_1
  <=> theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f239,plain,
    ( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f241,definition,
    ( spl0_2
  <=> theorem(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),not(or(not(p),not(or(not(q),r)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f243,plain,
    ( ~ theorem(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),not(or(not(p),not(or(not(q),r))))))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f241]) ).

fof(f244,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f235,f241,f237]) ).

fof(f245,plain,
    ( ~ theorem(or(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r)))),or(not(p),not(or(not(q),r)))))
    | spl0_1 ),
    inference(resolution,[],[f239,f149]) ).

fof(f246,plain,
    ( ~ theorem(or(not(not(or(not(not(or(not(p),not(q)))),r))),not(or(not(q),r))))
    | spl0_1 ),
    inference(resolution,[],[f245,f25]) ).

fof(f249,plain,
    ( ~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r)))
    | spl0_1 ),
    inference(resolution,[],[f246,f149]) ).

fof(f268,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
    inference(resolution,[],[f215,f26]) ).

fof(f315,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(X0),or(not(X1),X2)))
      | theorem(or(not(or(X3,X1)),or(X3,X2)))
      | ~ theorem(X0) ),
    inference(resolution,[],[f44,f14]) ).

fof(f366,definition,
    ( spl0_3
  <=> ! [X2] : ~ theorem(X2) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f367,plain,
    ( ! [X2] : ~ theorem(X2)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f366]) ).

fof(f377,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f367,f49]) ).

fof(f425,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f377]) ).

fof(f444,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X1,X0)) ),
    inference(resolution,[],[f104,f82]) ).

fof(f486,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
      | ~ theorem(X2) ),
    inference(resolution,[],[f315,f268]) ).

fof(f488,definition,
    ( spl0_6
  <=> ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f489,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f488]) ).

fof(f490,plain,
    ( spl0_3
    | spl0_6 ),
    inference(avatar_split_clause,[],[f486,f488,f366]) ).

fof(f494,plain,
    ( ! [X2,X0,X1] :
        ( theorem(or(X0,or(X1,not(not(X2)))))
        | ~ theorem(or(X0,or(X1,X2))) )
    | ~ spl0_6 ),
    inference(resolution,[],[f489,f33]) ).

fof(f545,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(X0),or(X1,X2)))
      | theorem(or(not(or(not(X2),X3)),or(X1,X3)))
      | ~ theorem(X0) ),
    inference(resolution,[],[f43,f14]) ).

fof(f557,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f545,f20]) ).

fof(f634,plain,
    ( ~ theorem(or(q,not(not(or(not(p),not(q))))))
    | spl0_1 ),
    inference(resolution,[],[f557,f249]) ).

fof(f946,plain,
    ( ~ theorem(or(q,or(not(p),not(q))))
    | spl0_1 ),
    inference(resolution,[],[f634,f83]) ).

fof(f947,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f946,f215]) ).

fof(f948,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f947]) ).

fof(f949,plain,
    ( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))
    | spl0_2 ),
    inference(resolution,[],[f243,f149]) ).

fof(f1123,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X0)),X1))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f444,f24]) ).

fof(f1246,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X1,or(X2,not(or(X0,X3)))))
      | ~ theorem(or(not(X3),or(X1,X2)))
      | ~ theorem(or(not(X0),or(X1,X2))) ),
    inference(resolution,[],[f125,f173]) ).

fof(f1248,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,X3)),or(X2,X1)))
      | ~ theorem(or(not(X3),or(X1,X2)))
      | ~ theorem(or(not(X0),or(X1,X2))) ),
    inference(resolution,[],[f125,f41]) ).

fof(f1249,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X1,or(not(or(X0,X3)),X2)))
      | ~ theorem(or(not(X3),or(X1,X2)))
      | ~ theorem(or(not(X0),or(X1,X2))) ),
    inference(resolution,[],[f125,f26]) ).

fof(f1349,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X2,or(not(or(X3,X0)),X1)))
      | ~ theorem(or(not(X3),or(X1,X2)))
      | ~ theorem(or(not(X0),or(X1,X2))) ),
    inference(resolution,[],[f1248,f26]) ).

fof(f5401,plain,
    ( ~ theorem(or(not(r),or(not(or(not(p),not(or(not(q),r)))),not(p))))
    | ~ theorem(or(not(not(not(or(not(p),not(q))))),or(not(or(not(p),not(or(not(q),r)))),not(p))))
    | spl0_2 ),
    inference(resolution,[],[f1246,f949]) ).

fof(f5445,definition,
    ( spl0_114
  <=> theorem(or(not(not(not(or(not(p),not(q))))),or(not(or(not(p),not(or(not(q),r)))),not(p)))) ),
    introduced(definition,[new_symbols(definition,[spl0_114])],[avatar_definition]) ).

fof(f5447,plain,
    ( ~ theorem(or(not(not(not(or(not(p),not(q))))),or(not(or(not(p),not(or(not(q),r)))),not(p))))
    | spl0_114 ),
    inference(avatar_component_clause,[],[f5445]) ).

fof(f5449,definition,
    ( spl0_115
  <=> theorem(or(not(r),or(not(or(not(p),not(or(not(q),r)))),not(p)))) ),
    introduced(definition,[new_symbols(definition,[spl0_115])],[avatar_definition]) ).

fof(f5451,plain,
    ( ~ theorem(or(not(r),or(not(or(not(p),not(or(not(q),r)))),not(p))))
    | spl0_115 ),
    inference(avatar_component_clause,[],[f5449]) ).

fof(f5452,plain,
    ( ~ spl0_114
    | ~ spl0_115
    | spl0_2 ),
    inference(avatar_split_clause,[],[f5401,f241,f5449,f5445]) ).

fof(f5453,plain,
    ( ~ theorem(or(not(r),or(not(q),r)))
    | spl0_115 ),
    inference(resolution,[],[f5451,f131]) ).

fof(f5465,plain,
    ( $false
    | spl0_115 ),
    inference(forward_subsumption_resolution,[],[f5453,f23]) ).

fof(f5466,plain,
    spl0_115,
    inference(avatar_contradiction_clause,[],[f5465]) ).

fof(f5482,plain,
    ( ~ theorem(or(not(or(not(p),not(q))),or(not(or(not(p),not(or(not(q),r)))),not(p))))
    | spl0_114 ),
    inference(resolution,[],[f5447,f1123]) ).

fof(f5583,plain,
    ( ~ theorem(or(not(not(or(not(q),r))),or(not(or(not(p),not(q))),not(p))))
    | ~ theorem(or(not(not(p)),or(not(or(not(p),not(q))),not(p))))
    | spl0_114 ),
    inference(resolution,[],[f5482,f1249]) ).

fof(f5589,plain,
    ( ~ theorem(or(not(not(or(not(q),r))),or(not(or(not(p),not(q))),not(p))))
    | spl0_114 ),
    inference(forward_subsumption_resolution,[],[f5583,f23]) ).

fof(f5607,plain,
    ( ~ theorem(or(not(not(p)),or(not(p),not(not(or(not(q),r))))))
    | ~ theorem(or(not(not(q)),or(not(p),not(not(or(not(q),r))))))
    | spl0_114 ),
    inference(resolution,[],[f5589,f1349]) ).

fof(f5614,plain,
    ( ~ theorem(or(not(not(q)),or(not(p),not(not(or(not(q),r))))))
    | spl0_114 ),
    inference(forward_subsumption_resolution,[],[f5607,f55]) ).

fof(f5623,plain,
    ( ~ theorem(or(not(not(q)),or(not(p),or(not(q),r))))
    | ~ spl0_6
    | spl0_114 ),
    inference(resolution,[],[f5614,f494]) ).

fof(f5628,plain,
    ( $false
    | ~ spl0_6
    | spl0_114 ),
    inference(forward_subsumption_resolution,[],[f5623,f202]) ).

fof(f5629,plain,
    ( ~ spl0_6
    | spl0_114 ),
    inference(avatar_contradiction_clause,[],[f5628]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f244]) ).

cnf(s20,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f425]) ).

cnf(s21,plain,
    ( spl0_3
    | spl0_6 ),
    inference(sat_conversion,[],[f490]) ).

cnf(s31,plain,
    spl0_1,
    inference(sat_conversion,[],[f948]) ).

cnf(s148,plain,
    ( spl0_2
    | ~ spl0_114
    | ~ spl0_115 ),
    inference(sat_conversion,[],[f5452]) ).

cnf(s149,plain,
    spl0_115,
    inference(sat_conversion,[],[f5466]) ).

cnf(s161,plain,
    ( ~ spl0_6
    | spl0_114 ),
    inference(sat_conversion,[],[f5629]) ).

cnf(s163,plain,
    ( spl0_2
    | ~ spl0_114 ),
    inference(rat,[],[s148,s149]) ).

cnf(s174,plain,
    spl0_6,
    inference(rat,[],[s21,s20]) ).

cnf(s176,plain,
    spl0_114,
    inference(rat,[],[s161,s174]) ).

cnf(s177,plain,
    spl0_2,
    inference(rat,[],[s163,s176]) ).

cnf(s180,plain,
    $false,
    inference(rat,[],[s1,s177,s31]) ).

fof(f5630,plain,
    $false,
    inference(avatar_sat_refutation,[],[s180]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL334-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.47  % Computer : n013.cluster.edu
% 0.18/0.47  % Model    : x86_64 x86_64
% 0.18/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.47  % Memory   : 8046.5625MB
% 0.18/0.47  % OS       : Linux 6.8.0-71-generic
% 0.18/0.47  % CPULimit : 300
% 0.18/0.47  % WCLimit  : 300
% 0.18/0.47  % DateTime : Sun Sep 27 15:34:37 UTC 2026
% 0.18/0.47  % CPUTime  : 
% 0.18/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.52  Running first-order theorem proving
% 0.25/0.52  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.33/4.06  % (360818)Input is clausal, will run a generic CNF schedule.
% 19.33/4.06  % (360827)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=59647971:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 19.33/4.06  % (360825)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4161548120:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 19.33/4.06  % (360824)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2783678526:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 19.33/4.06  % (360823)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=3240727244:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 19.33/4.06  % (360827)Instruction limit reached! 
% 19.33/4.06  % (360827)------------------------------
% 19.33/4.06  % (360827)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 19.33/4.06  % (360827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.33/4.06  % (360827)CaDiCaL version: 2.1.3
% 19.33/4.06  % (360827)Termination reason: Instruction limit
% 19.33/4.06  % (360827)Termination phase: Saturation
% 19.33/4.06  % (360827)Time elapsed: 0.056 s
% 19.33/4.06  % (360827)Peak memory usage: 89 MB
% 19.33/4.06  % (360827)Instructions burned: 115 (million)
% 19.33/4.06  % (360826)lrs+10_1_sil=8000:sp=occurrence:random_seed=1081478223:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 19.33/4.06  % (360829)dis-21_1_sil=8000:lcm=predicate:random_seed=226878963: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)
% 19.33/4.06  % (360828)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1702057425:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 19.33/4.06  % (360829)Instruction limit reached! 
% 19.33/4.06  % (360829)------------------------------
% 19.33/4.06  % (360829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 19.33/4.06  % (360829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.33/4.06  % (360829)CaDiCaL version: 2.1.3
% 19.33/4.06  % (360829)Termination reason: Instruction limit
% 19.33/4.06  % (360829)Termination phase: Saturation
% 19.33/4.06  % (360829)Time elapsed: 0.089 s
% 19.33/4.06  % (360829)Peak memory usage: 87 MB
% 19.33/4.06  % (360829)Instructions burned: 118 (million)
% 19.33/4.06  % (360826)Instruction limit reached! 
% 19.33/4.06  % (360826)------------------------------
% 19.33/4.06  % (360826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 19.33/4.06  % (360826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.33/4.06  % (360826)CaDiCaL version: 2.1.3
% 19.33/4.06  % (360826)Termination reason: Instruction limit
% 19.33/4.06  % (360826)Termination phase: Saturation
% 19.33/4.06  % (360826)Time elapsed: 0.106 s
% 19.33/4.06  % (360826)Peak memory usage: 89 MB
% 19.33/4.06  % (360826)Instructions burned: 107 (million)
% 19.33/4.06  % (360828)Instruction limit reached! 
% 19.33/4.06  % (360828)------------------------------
% 19.33/4.06  % (360828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 19.33/4.06  % (360828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.33/4.06  % (360828)CaDiCaL version: 2.1.3
% 19.33/4.06  % (360828)Termination reason: Instruction limit
% 19.33/4.06  % (360828)Termination phase: Saturation
% 19.33/4.06  % (360828)Time elapsed: 0.178 s
% 19.33/4.06  % (360828)Peak memory usage: 89 MB
% 19.33/4.06  % (360828)Instructions burned: 180 (million)
% 19.33/4.06  % (360834)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=1473244009:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 19.33/4.06  % (360834)Refutation not found, incomplete strategy
% 19.33/4.06  % (360834)------------------------------
% 19.33/4.06  % (360834)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 19.33/4.06  % (360834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.33/4.06  % (360834)CaDiCaL version: 2.1.3
% 19.33/4.06  % (360834)Termination reason: Refutation not found, incomplete strategy
% 19.33/4.06  % (360834)Time elapsed: 0.001 s
% 19.33/4.06  % (360834)Peak memory usage: 87 MB
% 19.33/4.06  % (360838)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=245642953:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 26.74/5.44  % (360838)Refutation not found, incomplete strategy
% 26.74/5.44  % (360838)------------------------------
% 26.74/5.44  % (360838)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360838)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360838)Termination reason: Refutation not found, incomplete strategy
% 26.74/5.44  % (360838)Time elapsed: 0.002 s
% 26.74/5.44  % (360838)Peak memory usage: 87 MB
% 26.74/5.44  % (360839)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2949598265:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 26.74/5.44  % (360839)Refutation not found, incomplete strategy
% 26.74/5.44  % (360839)------------------------------
% 26.74/5.44  % (360839)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360839)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360839)Termination reason: Refutation not found, incomplete strategy
% 26.74/5.44  % (360839)Time elapsed: 0.002 s
% 26.74/5.44  % (360839)Peak memory usage: 87 MB
% 26.74/5.44  % (360834)------------------------------
% 26.74/5.44  % (360834)------------------------------
% 26.74/5.44  % (360840)lrs+10_64_to=lpo:sil=8000:random_seed=1764733442:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 26.74/5.44  % (360840)Instruction limit reached! 
% 26.74/5.44  % (360840)------------------------------
% 26.74/5.44  % (360840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360840)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360840)Termination reason: Instruction limit
% 26.74/5.44  % (360840)Termination phase: Saturation
% 26.74/5.44  % (360840)Time elapsed: 0.065 s
% 26.74/5.44  % (360840)Peak memory usage: 88 MB
% 26.74/5.44  % (360840)Instructions burned: 127 (million)
% 26.74/5.44  % (360838)------------------------------
% 26.74/5.44  % (360838)------------------------------
% 26.74/5.44  % (360839)------------------------------
% 26.74/5.44  % (360839)------------------------------
% 26.74/5.44  % (360844)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=4288152109:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 26.74/5.44  % (360846)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3080556383:i=157:gtg=all_2991 on theBenchmark for (2991ds/157Mi)
% 26.74/5.44  % (360846)Instruction limit reached! 
% 26.74/5.44  % (360846)------------------------------
% 26.74/5.44  % (360846)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360846)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360846)Termination reason: Instruction limit
% 26.74/5.44  % (360846)Termination phase: Saturation
% 26.74/5.44  % (360846)Time elapsed: 0.079 s
% 26.74/5.44  % (360846)Peak memory usage: 91 MB
% 26.74/5.44  % (360846)Instructions burned: 159 (million)
% 26.74/5.44  % (360844)Instruction limit reached! 
% 26.74/5.44  % (360844)------------------------------
% 26.74/5.44  % (360844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360844)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360844)Termination reason: Instruction limit
% 26.74/5.44  % (360844)Termination phase: Saturation
% 26.74/5.44  % (360844)Time elapsed: 0.192 s
% 26.74/5.44  % (360844)Peak memory usage: 89 MB
% 26.74/5.44  % (360844)Instructions burned: 194 (million)
% 26.74/5.44  % (360847)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2175772550:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 26.74/5.44  % (360849)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=1432798039:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2989 on theBenchmark for (2989ds/106Mi)
% 26.74/5.44  % (360851)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1080350602:i=107_2988 on theBenchmark for (2988ds/107Mi)
% 26.74/5.44  % (360851)Refutation not found, incomplete strategy
% 26.74/5.44  % (360851)------------------------------
% 26.74/5.44  % (360851)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360851)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360851)Termination reason: Refutation not found, incomplete strategy
% 26.74/5.44  % (360851)Time elapsed: 0.001 s
% 26.74/5.44  % (360851)Peak memory usage: 87 MB
% 26.74/5.44  % (360849)Instruction limit reached! 
% 26.74/5.44  % (360849)------------------------------
% 26.74/5.44  % (360849)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360849)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360849)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360849)Termination reason: Instruction limit
% 26.74/5.44  % (360849)Termination phase: Saturation
% 26.74/5.44  % (360849)Time elapsed: 0.096 s
% 26.74/5.44  % (360849)Peak memory usage: 89 MB
% 26.74/5.44  % (360849)Instructions burned: 106 (million)
% 26.74/5.44  % (360852)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2480673594:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2987 on theBenchmark for (2987ds/242Mi)
% 26.74/5.44  % (360851)------------------------------
% 26.74/5.44  % (360851)------------------------------
% 26.74/5.44  % (360856)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2506101089:cond=fast:i=5208:av=off_2985 on theBenchmark for (2985ds/5208Mi)
% 26.74/5.44  % (360852)Instruction limit reached! 
% 26.74/5.44  % (360852)------------------------------
% 26.74/5.44  % (360852)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360852)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360852)Termination reason: Instruction limit
% 26.74/5.44  % (360852)Termination phase: Saturation
% 26.74/5.44  % (360852)Time elapsed: 0.232 s
% 26.74/5.44  % (360852)Peak memory usage: 90 MB
% 26.74/5.44  % (360852)Instructions burned: 243 (million)
% 26.74/5.44  % (360858)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=2638993419:i=134:sd=2:doe=on:ss=axioms:sgt=14_2983 on theBenchmark for (2983ds/134Mi)
% 26.74/5.44  % (360860)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3062081330:i=499:bd=all_2982 on theBenchmark for (2982ds/499Mi)
% 26.74/5.44  % (360858)Instruction limit reached! 
% 26.74/5.44  % (360858)------------------------------
% 26.74/5.44  % (360858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360858)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360858)Termination reason: Instruction limit
% 26.74/5.44  % (360858)Termination phase: Saturation
% 26.74/5.44  % (360858)Time elapsed: 0.142 s
% 26.74/5.44  % (360858)Peak memory usage: 89 MB
% 26.74/5.44  % (360858)Instructions burned: 135 (million)
% 26.74/5.44  % (360860)Instruction limit reached! 
% 26.74/5.44  % (360860)------------------------------
% 26.74/5.44  % (360860)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360860)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360860)Termination reason: Instruction limit
% 26.74/5.44  % (360860)Termination phase: Saturation
% 26.74/5.44  % (360860)Time elapsed: 0.223 s
% 26.74/5.44  % (360860)Peak memory usage: 93 MB
% 26.74/5.44  % (360860)Instructions burned: 501 (million)
% 26.74/5.44  % (360863)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=2903994114:i=191:fgj=on:bd=all_2979 on theBenchmark for (2979ds/191Mi)
% 26.74/5.44  % (360864)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=4183590357:i=264:kws=precedence:fsr=off_2977 on theBenchmark for (2977ds/264Mi)
% 26.74/5.44  % (360863)Instruction limit reached! 
% 26.74/5.44  % (360863)------------------------------
% 26.74/5.44  % (360863)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360863)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360863)Termination reason: Instruction limit
% 26.74/5.44  % (360863)Termination phase: Saturation
% 26.74/5.44  % (360863)Time elapsed: 0.223 s
% 26.74/5.44  % (360863)Peak memory usage: 93 MB
% 26.74/5.44  % (360863)Instructions burned: 191 (million)
% 26.74/5.44  % (360864)Instruction limit reached! 
% 26.74/5.44  % (360864)------------------------------
% 26.74/5.44  % (360864)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360864)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360864)Termination reason: Instruction limit
% 26.74/5.44  % (360864)Termination phase: Saturation
% 26.74/5.44  % (360864)Time elapsed: 0.241 s
% 26.74/5.44  % (360864)Peak memory usage: 92 MB
% 26.74/5.44  % (360864)Instructions burned: 265 (million)
% 26.74/5.44  % (360867)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=9289321:cond=on:i=156:bs=on:gtg=exists_all:er=known_2973 on theBenchmark for (2973ds/156Mi)
% 26.74/5.44  % (360867)Instruction limit reached! 
% 26.74/5.44  % (360867)------------------------------
% 26.74/5.44  % (360867)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360867)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360867)Termination reason: Instruction limit
% 26.74/5.44  % (360867)Termination phase: Saturation
% 26.74/5.44  % (360867)Time elapsed: 0.140 s
% 26.74/5.44  % (360867)Peak memory usage: 88 MB
% 26.74/5.44  % (360867)Instructions burned: 156 (million)
% 26.74/5.44  % (360868)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=4245343713:i=3256:kws=precedence:bd=preordered:av=off_2972 on theBenchmark for (2972ds/3256Mi)
% 26.74/5.44  % (360870)dis+1003_128_sil=8000:tgt=full:fd=off:random_seed=2554588643:i=537:av=off:ss=included_2969 on theBenchmark for (2969ds/537Mi)
% 26.74/5.44  % (360847)First to succeed.
% 26.74/5.44  % (360847)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-360818"
% 26.74/5.44  % (360870)Instruction limit reached! 
% 26.74/5.44  % (360870)------------------------------
% 26.74/5.44  % (360870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.74/5.44  % (360870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.74/5.44  % (360870)CaDiCaL version: 2.1.3
% 26.74/5.44  % (360870)Termination reason: Instruction limit
% 26.74/5.44  % (360870)Termination phase: Saturation
% 26.74/5.44  % (360870)Time elapsed: 0.414 s
% 26.74/5.44  % (360870)Peak memory usage: 89 MB
% 26.74/5.44  % (360870)Instructions burned: 538 (million)
% 26.74/5.44  % (360873)ott+1010_32_to=lpo:sil=8000:urr=on:nwc=4:random_seed=378081400:i=180:bd=preordered:av=off_2962 on theBenchmark for (2962ds/180Mi)
% 26.74/5.44  % (360847)Refutation found. Thanks to Tanya!
% 26.74/5.44  % SZS status Unsatisfiable for theBenchmark
% 26.74/5.44  % SZS output start Proof for theBenchmark
% See solution above
% 30.38/5.83  % (360847)------------------------------
% 30.38/5.83  % (360847)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.38/5.83  % (360847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.38/5.83  % (360847)CaDiCaL version: 2.1.3
% 30.38/5.83  % (360847)Termination reason: Refutation
% 30.38/5.83  % (360847)Time elapsed: 2.404 s
% 30.38/5.83  % (360847)Peak memory usage: 142 MB
% 30.38/5.83  % (360847)Instructions burned: 2485 (million)
% 30.38/5.83  % (360847)------------------------------
% 30.38/5.83  % (360847)------------------------------
% 30.38/5.83  % (360818)Success in time 4.17 s
% 30.38/5.83  % Vampire exiting
%------------------------------------------------------------------------------