↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL328-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 : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:51:59 AM UTC 2026

% Result   : Unsatisfiable 24.62s 9.86s
% Output   : Refutation 28.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  153 (  51 unt;  11 def)
%            Number of atoms       :  293 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  270 ( 130   ~; 129   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :   15 (  13 usr;  12 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :  175 (   0 sgn 175   !;   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(equivalent(p,q),or(and(p,q),and(not(p),not(q))))),
    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(or(not(p),q)),not(or(not(q),p))))),or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q))))))),not(or(not(or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q)))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))))),
    inference(definition_unfolding,[],[f11,f12,f12,f9,f9]) ).

fof(f14,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(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f35,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,[],[f35,f26]) ).

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,[],[f35,f30]) ).

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,[],[f35,f21]) ).

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

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(f68,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
    inference(resolution,[],[f55,f27]) ).

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,f25]) ).

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

fof(f87,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,not(X1))),X0))
      | ~ theorem(X1) ),
    inference(resolution,[],[f29,f19]) ).

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

fof(f94,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,f21]) ).

fof(f103,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,[],[f94,f19]) ).

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

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

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

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

fof(f147,plain,
    ! [X0,X1] :
      ( theorem(not(or(not(X1),not(X0))))
      | ~ theorem(X0)
      | ~ theorem(X1) ),
    inference(resolution,[],[f145,f19]) ).

fof(f150,plain,
    ( ~ theorem(or(not(or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q)))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ theorem(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q))))))) ),
    inference(resolution,[],[f147,f13]) ).

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

fof(f154,plain,
    ( ~ theorem(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q)))))))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f152]) ).

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

fof(f158,plain,
    ( ~ theorem(or(not(or(not(or(not(p),not(q))),not(or(not(not(p)),not(not(q)))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f156]) ).

fof(f159,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f150,f156,f152]) ).

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

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

fof(f235,plain,
    ! [X0,X1] : theorem(or(or(not(X0),X1),X0)),
    inference(resolution,[],[f68,f25]) ).

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

fof(f244,plain,
    ! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
    inference(resolution,[],[f232,f25]) ).

fof(f293,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,f19]) ).

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

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

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

fof(f404,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f358]) ).

fof(f440,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
      | ~ theorem(X2) ),
    inference(resolution,[],[f293,f242]) ).

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

fof(f443,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f442]) ).

fof(f444,plain,
    ( spl0_3
    | spl0_5 ),
    inference(avatar_split_clause,[],[f440,f442,f351]) ).

fof(f452,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0)))
    | ~ spl0_5 ),
    inference(resolution,[],[f443,f41]) ).

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

fof(f591,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,f19]) ).

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

fof(f642,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ theorem(or(X3,or(not(or(X0,X2)),X4)))
      | theorem(or(X3,or(X1,X4)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f610,f35]) ).

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

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

fof(f998,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(not(or(X0,X1))),or(X2,X3)))
      | ~ theorem(or(X0,or(X2,X1))) ),
    inference(resolution,[],[f642,f55]) ).

fof(f999,plain,
    ( ! [X2,X0,X1] :
        ( theorem(or(not(not(X0)),or(X1,X2)))
        | ~ theorem(or(X2,or(X1,X0))) )
    | ~ spl0_5 ),
    inference(resolution,[],[f642,f845]) ).

fof(f1073,plain,
    ( ~ theorem(or(not(or(not(not(p)),not(not(q)))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_1
    | ~ spl0_5 ),
    inference(resolution,[],[f999,f154]) ).

fof(f1096,definition,
    ( spl0_17
  <=> theorem(or(not(not(not(q))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).

fof(f1098,plain,
    ( ~ theorem(or(not(not(not(q))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_17 ),
    inference(avatar_component_clause,[],[f1096]) ).

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

fof(f1765,definition,
    ( spl0_25
  <=> theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_25])],[avatar_definition]) ).

fof(f1766,plain,
    ( theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ spl0_25 ),
    inference(avatar_component_clause,[],[f1765]) ).

fof(f1767,plain,
    ( ~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_25 ),
    inference(avatar_component_clause,[],[f1765]) ).

fof(f1779,plain,
    ( ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(not(p)),not(not(q)))))
    | spl0_25 ),
    inference(resolution,[],[f1767,f163]) ).

fof(f1792,definition,
    ( spl0_28
  <=> theorem(or(not(not(or(not(q),p))),or(not(not(p)),not(not(q))))) ),
    introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).

fof(f1794,plain,
    ( ~ theorem(or(not(not(or(not(q),p))),or(not(not(p)),not(not(q)))))
    | spl0_28 ),
    inference(avatar_component_clause,[],[f1792]) ).

fof(f1919,plain,
    ( ~ theorem(or(not(not(not(p))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ theorem(or(not(not(not(q))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_1
    | ~ spl0_5 ),
    inference(resolution,[],[f132,f1073]) ).

fof(f1928,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(not(q)))))
    | ~ theorem(or(not(not(or(not(q),p))),or(not(not(p)),not(not(q)))))
    | spl0_25 ),
    inference(resolution,[],[f132,f1779]) ).

fof(f1932,plain,
    ( ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_2 ),
    inference(resolution,[],[f132,f158]) ).

fof(f1941,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,[],[f132,f27]) ).

fof(f1953,definition,
    ( spl0_32
  <=> theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(not(q))))) ),
    introduced(definition,[new_symbols(definition,[spl0_32])],[avatar_definition]) ).

fof(f1955,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(not(q)))))
    | spl0_32 ),
    inference(avatar_component_clause,[],[f1953]) ).

fof(f1956,plain,
    ( ~ spl0_28
    | ~ spl0_32
    | spl0_25 ),
    inference(avatar_split_clause,[],[f1928,f1765,f1953,f1792]) ).

fof(f2018,definition,
    ( spl0_46
  <=> theorem(or(not(not(not(p))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_46])],[avatar_definition]) ).

fof(f2020,plain,
    ( ~ theorem(or(not(not(not(p))),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_46 ),
    inference(avatar_component_clause,[],[f2018]) ).

fof(f2021,plain,
    ( ~ spl0_17
    | ~ spl0_46
    | spl0_1
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f1919,f442,f152,f2018,f1096]) ).

fof(f2367,plain,
    ( ~ theorem(or(not(p),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_46 ),
    inference(resolution,[],[f2020,f802]) ).

fof(f2421,plain,
    ( ~ theorem(or(not(p),or(not(not(p)),q)))
    | spl0_32 ),
    inference(resolution,[],[f1955,f998]) ).

fof(f2439,plain,
    ( $false
    | spl0_32 ),
    inference(forward_subsumption_resolution,[],[f2421,f68]) ).

fof(f2440,plain,
    spl0_32,
    inference(avatar_contradiction_clause,[],[f2439]) ).

fof(f2441,plain,
    ( ~ theorem(or(not(q),or(not(not(q)),p)))
    | spl0_28 ),
    inference(resolution,[],[f1794,f1139]) ).

fof(f2458,plain,
    ( $false
    | spl0_28 ),
    inference(forward_subsumption_resolution,[],[f2441,f68]) ).

fof(f2459,plain,
    spl0_28,
    inference(avatar_contradiction_clause,[],[f2458]) ).

fof(f2460,plain,
    ( ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_2
    | ~ spl0_25 ),
    inference(forward_subsumption_resolution,[],[f1932,f1766]) ).

fof(f2462,plain,
    ( ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(p),not(q))))
    | spl0_2
    | ~ spl0_25 ),
    inference(resolution,[],[f2460,f163]) ).

fof(f2513,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q))))
    | ~ theorem(or(not(not(or(not(q),p))),or(not(p),not(q))))
    | spl0_2
    | ~ spl0_25 ),
    inference(resolution,[],[f2462,f132]) ).

fof(f2518,definition,
    ( spl0_83
  <=> theorem(or(not(not(or(not(q),p))),or(not(p),not(q)))) ),
    introduced(definition,[new_symbols(definition,[spl0_83])],[avatar_definition]) ).

fof(f2520,plain,
    ( ~ theorem(or(not(not(or(not(q),p))),or(not(p),not(q))))
    | spl0_83 ),
    inference(avatar_component_clause,[],[f2518]) ).

fof(f2522,definition,
    ( spl0_84
  <=> theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))) ),
    introduced(definition,[new_symbols(definition,[spl0_84])],[avatar_definition]) ).

fof(f2524,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q))))
    | spl0_84 ),
    inference(avatar_component_clause,[],[f2522]) ).

fof(f2525,plain,
    ( ~ spl0_83
    | ~ spl0_84
    | spl0_2
    | ~ spl0_25 ),
    inference(avatar_split_clause,[],[f2513,f1765,f156,f2522,f2518]) ).

fof(f2589,plain,
    ( ~ theorem(or(not(q),or(not(p),p)))
    | spl0_83 ),
    inference(resolution,[],[f2520,f998]) ).

fof(f2602,plain,
    ( $false
    | spl0_83 ),
    inference(forward_subsumption_resolution,[],[f2589,f32]) ).

fof(f2603,plain,
    spl0_83,
    inference(avatar_contradiction_clause,[],[f2602]) ).

fof(f2604,plain,
    ( ~ theorem(or(not(p),or(not(q),q)))
    | spl0_84 ),
    inference(resolution,[],[f2524,f1139]) ).

fof(f2620,plain,
    ( $false
    | spl0_84 ),
    inference(forward_subsumption_resolution,[],[f2604,f32]) ).

fof(f2621,plain,
    spl0_84,
    inference(avatar_contradiction_clause,[],[f2620]) ).

fof(f5193,plain,
    ( ~ theorem(or(not(not(q)),or(not(p),or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ theorem(or(not(not(p)),or(not(p),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_46 ),
    inference(resolution,[],[f2367,f1941]) ).

fof(f5197,plain,
    ( ~ theorem(or(not(not(q)),or(not(p),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_46 ),
    inference(forward_subsumption_resolution,[],[f5193,f55]) ).

fof(f5201,plain,
    ( ~ theorem(or(or(not(or(not(p),q)),not(or(not(q),p))),or(not(p),q)))
    | ~ spl0_5
    | spl0_46 ),
    inference(resolution,[],[f5197,f999]) ).

fof(f5208,plain,
    ( $false
    | ~ spl0_5
    | spl0_46 ),
    inference(forward_subsumption_resolution,[],[f5201,f235]) ).

fof(f5209,plain,
    ( ~ spl0_5
    | spl0_46 ),
    inference(avatar_contradiction_clause,[],[f5208]) ).

fof(f5215,plain,
    ( ~ theorem(or(not(q),or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_17 ),
    inference(resolution,[],[f1098,f802]) ).

fof(f5235,plain,
    ( ~ theorem(or(not(not(q)),or(not(q),or(not(or(not(p),q)),not(or(not(q),p))))))
    | ~ theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_17 ),
    inference(resolution,[],[f5215,f1941]) ).

fof(f5239,plain,
    ( ~ theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),not(or(not(q),p))))))
    | spl0_17 ),
    inference(forward_subsumption_resolution,[],[f5235,f55]) ).

fof(f5243,plain,
    ( ~ theorem(or(or(not(or(not(p),q)),not(or(not(q),p))),or(not(q),p)))
    | ~ spl0_5
    | spl0_17 ),
    inference(resolution,[],[f5239,f999]) ).

fof(f5250,plain,
    ( $false
    | ~ spl0_5
    | spl0_17 ),
    inference(forward_subsumption_resolution,[],[f5243,f244]) ).

fof(f5251,plain,
    ( ~ spl0_5
    | spl0_17 ),
    inference(avatar_contradiction_clause,[],[f5250]) ).

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

cnf(s18,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f404]) ).

cnf(s19,plain,
    ( spl0_3
    | spl0_5 ),
    inference(sat_conversion,[],[f444]) ).

cnf(s39,plain,
    ( spl0_25
    | ~ spl0_28
    | ~ spl0_32 ),
    inference(sat_conversion,[],[f1956]) ).

cnf(s47,plain,
    ( spl0_1
    | ~ spl0_5
    | ~ spl0_17
    | ~ spl0_46 ),
    inference(sat_conversion,[],[f2021]) ).

cnf(s88,plain,
    spl0_32,
    inference(sat_conversion,[],[f2440]) ).

cnf(s91,plain,
    spl0_28,
    inference(sat_conversion,[],[f2459]) ).

cnf(s95,plain,
    ( spl0_2
    | ~ spl0_25
    | ~ spl0_83
    | ~ spl0_84 ),
    inference(sat_conversion,[],[f2525]) ).

cnf(s104,plain,
    spl0_83,
    inference(sat_conversion,[],[f2603]) ).

cnf(s107,plain,
    spl0_84,
    inference(sat_conversion,[],[f2621]) ).

cnf(s251,plain,
    ( ~ spl0_5
    | spl0_46 ),
    inference(sat_conversion,[],[f5209]) ).

cnf(s252,plain,
    ( ~ spl0_5
    | spl0_17 ),
    inference(sat_conversion,[],[f5251]) ).

cnf(s261,plain,
    ( spl0_2
    | ~ spl0_25 ),
    inference(rat,[],[s95,s107,s104]) ).

cnf(s268,plain,
    spl0_25,
    inference(rat,[],[s39,s88,s91]) ).

cnf(s269,plain,
    spl0_2,
    inference(rat,[],[s261,s268]) ).

cnf(s275,plain,
    spl0_5,
    inference(rat,[],[s19,s18]) ).

cnf(s276,plain,
    spl0_17,
    inference(rat,[],[s252,s275]) ).

cnf(s277,plain,
    spl0_46,
    inference(rat,[],[s251,s275]) ).

cnf(s283,plain,
    spl0_1,
    inference(rat,[],[s47,s277,s276,s275]) ).

cnf(s287,plain,
    $false,
    inference(rat,[],[s1,s269,s283]) ).

fof(f5252,plain,
    $false,
    inference(avatar_sat_refutation,[],[s287]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL328-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.41  % Computer : n005.cluster.edu
% 0.14/5.41  % Model    : x86_64 x86_64
% 0.14/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41  % Memory   : 8046.5625MB
% 0.14/5.41  % OS       : Linux 6.8.0-71-generic
% 0.14/5.41  % CPULimit : 300
% 0.14/5.41  % WCLimit  : 300
% 0.14/5.41  % DateTime : Sun Sep 27 15:34:39 UTC 2026
% 0.14/5.41  % CPUTime  : 
% 0.14/5.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.46  Running first-order theorem proving
% 0.14/5.46  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
% 18.34/8.57  % (4149435)Input is clausal, will run a generic CNF schedule.
% 18.34/8.57  % (4149442)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1092052270:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 18.34/8.57  % (4149445)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3091022218:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 18.34/8.57  % (4149444)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1143188381:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 18.34/8.57  % (4149441)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4008564185:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 18.34/8.57  % (4149443)lrs+10_1_sil=8000:sp=occurrence:random_seed=2110375932:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 18.34/8.57  % (4149440)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=1170354413:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 18.34/8.57  % (4149446)dis-21_1_sil=8000:lcm=predicate:random_seed=964012002: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)
% 18.34/8.57  % (4149446)Instruction limit reached! 
% 18.34/8.57  % (4149446)------------------------------
% 18.34/8.57  % (4149446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.34/8.57  % (4149446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.34/8.57  % (4149446)CaDiCaL version: 2.1.3
% 18.34/8.57  % (4149446)Termination reason: Instruction limit
% 18.34/8.57  % (4149446)Termination phase: Saturation
% 18.34/8.57  % (4149446)Time elapsed: 0.091 s
% 18.34/8.57  % (4149446)Peak memory usage: 87 MB
% 18.34/8.57  % (4149446)Instructions burned: 117 (million)
% 18.34/8.57  % (4149444)Instruction limit reached! 
% 18.34/8.57  % (4149444)------------------------------
% 18.34/8.57  % (4149444)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.34/8.57  % (4149444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.34/8.57  % (4149444)CaDiCaL version: 2.1.3
% 18.34/8.57  % (4149444)Termination reason: Instruction limit
% 18.34/8.57  % (4149444)Termination phase: Saturation
% 18.34/8.57  % (4149444)Time elapsed: 0.113 s
% 18.34/8.57  % (4149444)Peak memory usage: 89 MB
% 18.34/8.57  % (4149444)Instructions burned: 114 (million)
% 18.34/8.57  % (4149443)Instruction limit reached! 
% 18.34/8.57  % (4149443)------------------------------
% 18.34/8.57  % (4149443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.34/8.57  % (4149443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.34/8.57  % (4149443)CaDiCaL version: 2.1.3
% 18.34/8.57  % (4149443)Termination reason: Instruction limit
% 18.34/8.57  % (4149443)Termination phase: Saturation
% 18.34/8.57  % (4149443)Time elapsed: 0.115 s
% 18.34/8.57  % (4149443)Peak memory usage: 89 MB
% 18.34/8.57  % (4149443)Instructions burned: 108 (million)
% 18.34/8.57  % (4149445)Instruction limit reached! 
% 18.34/8.57  % (4149445)------------------------------
% 18.34/8.57  % (4149445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.34/8.57  % (4149445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.34/8.57  % (4149445)CaDiCaL version: 2.1.3
% 18.34/8.57  % (4149445)Termination reason: Instruction limit
% 18.34/8.57  % (4149445)Termination phase: Saturation
% 18.34/8.57  % (4149445)Time elapsed: 0.187 s
% 18.34/8.57  % (4149445)Peak memory usage: 89 MB
% 18.34/8.57  % (4149445)Instructions burned: 181 (million)
% 18.34/8.57  % (4149454)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=2574441562:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 18.34/8.57  % (4149454)Refutation not found, incomplete strategy
% 18.34/8.57  % (4149454)------------------------------
% 18.34/8.57  % (4149454)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.34/8.57  % (4149454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.34/8.57  % (4149454)CaDiCaL version: 2.1.3
% 18.34/8.57  % (4149454)Termination reason: Refutation not found, incomplete strategy
% 18.34/8.57  % (4149454)Time elapsed: 0.002 s
% 18.34/8.57  % (4149454)Peak memory usage: 88 MB
% 18.34/8.57  % (4149455)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4151481955: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)
% 24.62/9.86  % (4149455)Refutation not found, incomplete strategy
% 24.62/9.86  % (4149455)------------------------------
% 24.62/9.86  % (4149455)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149455)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149455)Termination reason: Refutation not found, incomplete strategy
% 24.62/9.86  % (4149455)Time elapsed: 0.002 s
% 24.62/9.86  % (4149455)Peak memory usage: 87 MB
% 24.62/9.86  % (4149456)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4248167568:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 24.62/9.86  % (4149456)Refutation not found, incomplete strategy
% 24.62/9.86  % (4149456)------------------------------
% 24.62/9.86  % (4149456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149456)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149456)Termination reason: Refutation not found, incomplete strategy
% 24.62/9.86  % (4149456)Time elapsed: 0.003 s
% 24.62/9.86  % (4149456)Peak memory usage: 88 MB
% 24.62/9.86  % (4149456)Instructions burned: 1 (million)
% 24.62/9.86  % (4149457)lrs+10_64_to=lpo:sil=8000:random_seed=1376861843:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 24.62/9.86  % (4149457)Instruction limit reached! 
% 24.62/9.86  % (4149457)------------------------------
% 24.62/9.86  % (4149457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149457)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149457)Termination reason: Instruction limit
% 24.62/9.86  % (4149457)Termination phase: Saturation
% 24.62/9.86  % (4149457)Time elapsed: 0.122 s
% 24.62/9.86  % (4149457)Peak memory usage: 89 MB
% 24.62/9.86  % (4149457)Instructions burned: 126 (million)
% 24.62/9.86  % (4149454)------------------------------
% 24.62/9.86  % (4149454)------------------------------
% 24.62/9.86  % (4149455)------------------------------
% 24.62/9.86  % (4149455)------------------------------
% 24.62/9.86  % (4149456)------------------------------
% 24.62/9.86  % (4149456)------------------------------
% 24.62/9.86  % (4149462)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1081849781:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 24.62/9.86  % (4149468)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=753567846:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2990 on theBenchmark for (2990ds/106Mi)
% 24.62/9.86  % (4149464)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=20185138:i=157:gtg=all_2990 on theBenchmark for (2990ds/157Mi)
% 24.62/9.86  % (4149462)Instruction limit reached! 
% 24.62/9.86  % (4149462)------------------------------
% 24.62/9.86  % (4149462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149462)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149462)Termination reason: Instruction limit
% 24.62/9.86  % (4149462)Termination phase: Saturation
% 24.62/9.86  % (4149462)Time elapsed: 0.179 s
% 24.62/9.86  % (4149462)Peak memory usage: 89 MB
% 24.62/9.86  % (4149462)Instructions burned: 194 (million)
% 24.62/9.86  % (4149466)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2596560448:i=3394:sd=4:ss=included:sgt=64_2990 on theBenchmark for (2990ds/3394Mi)
% 24.62/9.86  % (4149468)Instruction limit reached! 
% 24.62/9.86  % (4149468)------------------------------
% 24.62/9.86  % (4149468)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149468)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149468)Termination reason: Instruction limit
% 24.62/9.86  % (4149468)Termination phase: Saturation
% 24.62/9.86  % (4149468)Time elapsed: 0.097 s
% 24.62/9.86  % (4149468)Peak memory usage: 89 MB
% 24.62/9.86  % (4149468)Instructions burned: 106 (million)
% 24.62/9.86  % (4149464)Instruction limit reached! 
% 24.62/9.86  % (4149464)------------------------------
% 24.62/9.86  % (4149464)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149464)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149464)Termination reason: Instruction limit
% 24.62/9.86  % (4149464)Termination phase: Saturation
% 24.62/9.86  % (4149464)Time elapsed: 0.153 s
% 24.62/9.86  % (4149464)Peak memory usage: 91 MB
% 24.62/9.86  % (4149464)Instructions burned: 158 (million)
% 24.62/9.86  % (4149471)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=4244525103:i=107_2988 on theBenchmark for (2988ds/107Mi)
% 24.62/9.86  % (4149471)Refutation not found, incomplete strategy
% 24.62/9.86  % (4149471)------------------------------
% 24.62/9.86  % (4149471)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149471)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149471)Termination reason: Refutation not found, incomplete strategy
% 24.62/9.86  % (4149471)Time elapsed: 0.002 s
% 24.62/9.86  % (4149471)Peak memory usage: 87 MB
% 24.62/9.86  % (4149473)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=1377665901:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2987 on theBenchmark for (2987ds/242Mi)
% 24.62/9.86  % (4149474)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2769648299:cond=fast:i=5208:av=off_2987 on theBenchmark for (2987ds/5208Mi)
% 24.62/9.86  % (4149473)Instruction limit reached! 
% 24.62/9.86  % (4149473)------------------------------
% 24.62/9.86  % (4149473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149473)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149473)Termination reason: Instruction limit
% 24.62/9.86  % (4149473)Termination phase: Saturation
% 24.62/9.86  % (4149473)Time elapsed: 0.246 s
% 24.62/9.86  % (4149473)Peak memory usage: 91 MB
% 24.62/9.86  % (4149473)Instructions burned: 243 (million)
% 24.62/9.86  % (4149471)------------------------------
% 24.62/9.86  % (4149471)------------------------------
% 24.62/9.86  % (4149478)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=4056903990:i=134:sd=2:doe=on:ss=axioms:sgt=14_2983 on theBenchmark for (2983ds/134Mi)
% 24.62/9.86  % (4149479)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3945629981:i=499:bd=all_2982 on theBenchmark for (2982ds/499Mi)
% 24.62/9.86  % (4149478)Instruction limit reached! 
% 24.62/9.86  % (4149478)------------------------------
% 24.62/9.86  % (4149478)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149478)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149478)Termination reason: Instruction limit
% 24.62/9.86  % (4149478)Termination phase: Saturation
% 24.62/9.86  % (4149478)Time elapsed: 0.143 s
% 24.62/9.86  % (4149478)Peak memory usage: 89 MB
% 24.62/9.86  % (4149478)Instructions burned: 135 (million)
% 24.62/9.86  % (4149482)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=1913691266:i=191:fgj=on:bd=all_2979 on theBenchmark for (2979ds/191Mi)
% 24.62/9.86  % (4149479)Instruction limit reached! 
% 24.62/9.86  % (4149479)------------------------------
% 24.62/9.86  % (4149479)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149479)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149479)Termination reason: Instruction limit
% 24.62/9.86  % (4149479)Termination phase: Saturation
% 24.62/9.86  % (4149479)Time elapsed: 0.497 s
% 24.62/9.86  % (4149479)Peak memory usage: 94 MB
% 24.62/9.86  % (4149479)Instructions burned: 500 (million)
% 24.62/9.86  % (4149482)Instruction limit reached! 
% 24.62/9.86  % (4149482)------------------------------
% 24.62/9.86  % (4149482)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149482)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149482)Termination reason: Instruction limit
% 24.62/9.86  % (4149482)Termination phase: Saturation
% 24.62/9.86  % (4149482)Time elapsed: 0.214 s
% 24.62/9.86  % (4149482)Peak memory usage: 93 MB
% 24.62/9.86  % (4149482)Instructions burned: 192 (million)
% 24.62/9.86  % (4149486)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=2096143103:cond=on:i=156:bs=on:gtg=exists_all:er=known_2975 on theBenchmark for (2975ds/156Mi)
% 24.62/9.86  % (4149484)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=4283401269:i=264:kws=precedence:fsr=off_2975 on theBenchmark for (2975ds/264Mi)
% 24.62/9.86  % (4149486)Instruction limit reached! 
% 24.62/9.86  % (4149486)------------------------------
% 24.62/9.86  % (4149486)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149486)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149486)Termination reason: Instruction limit
% 24.62/9.86  % (4149486)Termination phase: Saturation
% 24.62/9.86  % (4149486)Time elapsed: 0.149 s
% 24.62/9.86  % (4149486)Peak memory usage: 88 MB
% 24.62/9.86  % (4149486)Instructions burned: 157 (million)
% 24.62/9.86  % (4149484)Instruction limit reached! 
% 24.62/9.86  % (4149484)------------------------------
% 24.62/9.86  % (4149484)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149484)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149484)Termination reason: Instruction limit
% 24.62/9.86  % (4149484)Termination phase: Saturation
% 24.62/9.86  % (4149484)Time elapsed: 0.263 s
% 24.62/9.86  % (4149484)Peak memory usage: 92 MB
% 24.62/9.86  % (4149484)Instructions burned: 264 (million)
% 24.62/9.86  % (4149490)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=1752628660:i=3256:kws=precedence:bd=preordered:av=off_2972 on theBenchmark for (2972ds/3256Mi)
% 24.62/9.86  % (4149491)dis+1003_128_sil=8000:tgt=full:fd=off:random_seed=283033731:i=537:av=off:ss=included_2970 on theBenchmark for (2970ds/537Mi)
% 24.62/9.86  % (4149466)First to succeed.
% 24.62/9.86  % (4149466)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4149435"
% 24.62/9.86  % (4149491)Instruction limit reached! 
% 24.62/9.86  % (4149491)------------------------------
% 24.62/9.86  % (4149491)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 24.62/9.86  % (4149491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.62/9.86  % (4149491)CaDiCaL version: 2.1.3
% 24.62/9.86  % (4149491)Termination reason: Instruction limit
% 24.62/9.86  % (4149491)Termination phase: Saturation
% 24.62/9.86  % (4149491)Time elapsed: 0.541 s
% 24.62/9.86  % (4149491)Peak memory usage: 91 MB
% 24.62/9.86  % (4149491)Instructions burned: 537 (million)
% 24.62/9.86  % (4149466)Refutation found. Thanks to Tanya!
% 24.62/9.86  % SZS status Unsatisfiable for theBenchmark
% 24.62/9.86  % SZS output start Proof for theBenchmark
% See solution above
% 28.13/10.12  % (4149466)------------------------------
% 28.13/10.12  % (4149466)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.13/10.12  % (4149466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.13/10.12  % (4149466)CaDiCaL version: 2.1.3
% 28.13/10.12  % (4149466)Termination reason: Refutation
% 28.13/10.12  % (4149466)Time elapsed: 2.276 s
% 28.13/10.12  % (4149466)Peak memory usage: 139 MB
% 28.13/10.12  % (4149466)Instructions burned: 2074 (million)
% 28.13/10.12  % (4149466)------------------------------
% 28.13/10.12  % (4149466)------------------------------
% 28.13/10.12  % (4149435)Success in time 3.914 s
% 28.13/10.12  % Vampire exiting
%------------------------------------------------------------------------------