↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n010.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:48 AM UTC 2026

% Result   : Unsatisfiable 30.74s 5.36s
% Output   : Refutation 0.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  173 (  52 unt;  13 def)
%            Number of atoms       :  331 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  302 ( 144   ~; 145   |;   0   &)
%                                         (  13 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :   12 (   2 avg)
%            Number of predicates  :   17 (  15 usr;  14 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :  233 (   0 sgn 233   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

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

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

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

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

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

fof(f11,negated_conjecture,
    ~ theorem(equivalent(equivalent(p,q),equivalent(not(p),not(q)))),
    file('/export/starexec/sandbox/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))))),not(or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p))))))),not(or(not(not(or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p)))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))))),
    inference(definition_unfolding,[],[f11,f12,f12,f12]) ).

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,[],[f7,f17]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f69,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f52,f58]) ).

fof(f76,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f69,f27]) ).

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

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

fof(f85,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,[],[f50,f21]) ).

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

fof(f96,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,[],[f85,f14]) ).

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

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

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

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

fof(f164,plain,
    ( ~ theorem(or(not(not(or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p)))))),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))))),not(or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p))))))) ),
    inference(resolution,[],[f162,f13]) ).

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

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

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

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

fof(f173,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f164,f170,f166]) ).

fof(f174,plain,
    ( ~ theorem(or(not(or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p))))),or(not(or(not(p),q)),not(or(not(q),p)))))
    | spl0_1 ),
    inference(resolution,[],[f168,f125]) ).

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

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

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

fof(f213,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X2,or(X1,X3))))
      | ~ theorem(or(not(X0),or(X2,X3))) ),
    inference(resolution,[],[f47,f88]) ).

fof(f215,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(X0,or(X2,X1)))),
    inference(resolution,[],[f47,f23]) ).

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

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

fof(f287,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,[],[f46,f14]) ).

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

fof(f369,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
      | ~ theorem(X2) ),
    inference(resolution,[],[f365,f287]) ).

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

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

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

fof(f382,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f381]) ).

fof(f383,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f369,f381,f378]) ).

fof(f384,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f379,f20]) ).

fof(f437,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f384]) ).

fof(f443,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0)))
    | ~ spl0_4 ),
    inference(resolution,[],[f382,f49]) ).

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

fof(f853,plain,
    ( ~ theorem(or(not(not(or(not(not(q)),not(p)))),or(not(or(not(p),q)),not(or(not(q),p)))))
    | spl0_8 ),
    inference(avatar_component_clause,[],[f851]) ).

fof(f884,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X2),X0))
      | ~ theorem(or(X1,X2))
      | theorem(or(not(not(X0)),X1)) ),
    inference(resolution,[],[f249,f77]) ).

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

fof(f1053,plain,
    ( ~ theorem(or(not(not(or(not(not(q)),not(p)))),or(not(or(not(p),q)),not(or(not(q),p)))))
    | ~ theorem(or(not(not(or(not(not(p)),not(q)))),or(not(or(not(p),q)),not(or(not(q),p)))))
    | spl0_1 ),
    inference(resolution,[],[f190,f174]) ).

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

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

fof(f1070,plain,
    ( ~ theorem(or(not(not(or(not(not(p)),not(q)))),or(not(or(not(p),q)),not(or(not(q),p)))))
    | spl0_9 ),
    inference(avatar_component_clause,[],[f1068]) ).

fof(f1071,plain,
    ( ~ spl0_9
    | ~ spl0_8
    | spl0_1 ),
    inference(avatar_split_clause,[],[f1053,f166,f851,f1068]) ).

fof(f1074,plain,
    ( ~ theorem(or(not(or(not(p),q)),not(not(or(not(not(q)),not(p))))))
    | spl0_8 ),
    inference(resolution,[],[f853,f272]) ).

fof(f1147,plain,
    ( ~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p))))
    | spl0_8 ),
    inference(resolution,[],[f1074,f77]) ).

fof(f1149,plain,
    ( $false
    | ~ spl0_4
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f1147,f443]) ).

fof(f1150,plain,
    ( ~ spl0_4
    | spl0_8 ),
    inference(avatar_contradiction_clause,[],[f1149]) ).

fof(f1376,plain,
    ( ! [X0,X1] : theorem(or(not(not(X0)),or(not(or(X1,X0)),X1)))
    | ~ spl0_4 ),
    inference(resolution,[],[f443,f26]) ).

fof(f1400,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,[],[f48,f14]) ).

fof(f1425,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,[],[f1400,f22]) ).

fof(f1464,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(not(not(X0)),X1)),or(X0,X1)))
      | ~ theorem(X2) ),
    inference(resolution,[],[f1400,f365]) ).

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

fof(f1472,plain,
    ( ! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X0,X1)))
    | ~ spl0_22 ),
    inference(avatar_component_clause,[],[f1471]) ).

fof(f1473,plain,
    ( spl0_3
    | spl0_22 ),
    inference(avatar_split_clause,[],[f1464,f1471,f378]) ).

fof(f1481,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,[],[f1425,f35]) ).

fof(f1508,plain,
    ( ! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X1,X0)))
    | ~ spl0_22 ),
    inference(resolution,[],[f1472,f49]) ).

fof(f1693,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(not(or(X0,X1))),or(X2,X3)))
      | ~ theorem(or(X0,or(X2,X1))) ),
    inference(resolution,[],[f1481,f58]) ).

fof(f1695,plain,
    ( ! [X2,X0,X1] :
        ( theorem(or(not(not(X0)),or(X1,X2)))
        | ~ theorem(or(X2,or(X1,X0))) )
    | ~ spl0_4 ),
    inference(resolution,[],[f1481,f1376]) ).

fof(f1708,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X2,or(X1,X0)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f1481,f32]) ).

fof(f1745,plain,
    ( ! [X2,X0,X1] :
        ( theorem(or(not(not(X2)),or(X0,X1)))
        | ~ theorem(or(X0,or(X1,X2))) )
    | ~ spl0_4 ),
    inference(resolution,[],[f1695,f49]) ).

fof(f1772,plain,
    ! [X2,X0,X1] : theorem(or(or(X0,X1),or(X2,not(or(X2,X1))))),
    inference(resolution,[],[f1708,f215]) ).

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

fof(f1888,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(not(or(X0,X2))),or(X3,X1)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f1693,f49]) ).

fof(f1908,plain,
    ( ~ theorem(or(not(not(p)),or(not(or(not(q),p)),not(q))))
    | spl0_9 ),
    inference(resolution,[],[f1888,f1070]) ).

fof(f1934,plain,
    ( $false
    | ~ spl0_4
    | spl0_9 ),
    inference(forward_subsumption_resolution,[],[f1908,f1376]) ).

fof(f1935,plain,
    ( ~ spl0_4
    | spl0_9 ),
    inference(avatar_contradiction_clause,[],[f1934]) ).

fof(f1938,plain,
    ( ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(or(not(not(p)),not(q))),not(or(not(not(q)),not(p))))))
    | spl0_2 ),
    inference(resolution,[],[f172,f125]) ).

fof(f1942,plain,
    ( ~ theorem(or(not(not(not(p))),or(not(or(not(or(not(p),q)),not(or(not(q),p)))),not(or(not(not(q)),not(p))))))
    | ~ theorem(or(not(not(q)),or(not(or(not(or(not(p),q)),not(or(not(q),p)))),not(or(not(not(q)),not(p))))))
    | spl0_2 ),
    inference(resolution,[],[f1938,f1062]) ).

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

fof(f1950,plain,
    ( ~ theorem(or(not(not(q)),or(not(or(not(or(not(p),q)),not(or(not(q),p)))),not(or(not(not(q)),not(p))))))
    | spl0_23 ),
    inference(avatar_component_clause,[],[f1948]) ).

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

fof(f1954,plain,
    ( ~ theorem(or(not(not(not(p))),or(not(or(not(or(not(p),q)),not(or(not(q),p)))),not(or(not(not(q)),not(p))))))
    | spl0_24 ),
    inference(avatar_component_clause,[],[f1952]) ).

fof(f1955,plain,
    ( ~ spl0_23
    | ~ spl0_24
    | spl0_2 ),
    inference(avatar_split_clause,[],[f1942,f170,f1952,f1948]) ).

fof(f1991,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(not(q)),not(or(not(not(q)),not(p))))))
    | ~ theorem(or(not(not(or(not(q),p))),or(not(not(q)),not(or(not(not(q)),not(p))))))
    | spl0_23 ),
    inference(resolution,[],[f1950,f1062]) ).

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

fof(f1999,plain,
    ( ~ theorem(or(not(not(or(not(q),p))),or(not(not(q)),not(or(not(not(q)),not(p))))))
    | spl0_27 ),
    inference(avatar_component_clause,[],[f1997]) ).

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

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

fof(f2004,plain,
    ( ~ spl0_27
    | ~ spl0_28
    | spl0_23 ),
    inference(avatar_split_clause,[],[f1991,f1948,f2001,f1997]) ).

fof(f2063,plain,
    ( ~ theorem(or(not(q),or(not(not(q)),p)))
    | spl0_27 ),
    inference(resolution,[],[f1999,f1693]) ).

fof(f2072,plain,
    ( $false
    | spl0_27 ),
    inference(forward_subsumption_resolution,[],[f2063,f63]) ).

fof(f2073,plain,
    spl0_27,
    inference(avatar_contradiction_clause,[],[f2072]) ).

fof(f2523,plain,
    ( ~ theorem(or(or(not(not(q)),not(or(not(not(q)),not(p)))),or(q,not(p))))
    | spl0_28 ),
    inference(resolution,[],[f912,f2003]) ).

fof(f2547,plain,
    ( $false
    | spl0_28 ),
    inference(forward_subsumption_resolution,[],[f2523,f1821]) ).

fof(f2548,plain,
    spl0_28,
    inference(avatar_contradiction_clause,[],[f2547]) ).

fof(f2583,plain,
    ( ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(or(not(not(q)),not(p))),not(p))))
    | ~ spl0_4
    | spl0_24 ),
    inference(resolution,[],[f1954,f1745]) ).

fof(f3773,plain,
    ( ~ theorem(or(not(not(or(not(q),p))),or(not(or(not(not(q)),not(p))),not(p))))
    | ~ theorem(or(not(not(or(not(p),q))),or(not(or(not(not(q)),not(p))),not(p))))
    | ~ spl0_4
    | spl0_24 ),
    inference(resolution,[],[f2583,f190]) ).

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

fof(f3783,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),or(not(or(not(not(q)),not(p))),not(p))))
    | spl0_78 ),
    inference(avatar_component_clause,[],[f3781]) ).

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

fof(f3787,plain,
    ( ~ theorem(or(not(not(or(not(q),p))),or(not(or(not(not(q)),not(p))),not(p))))
    | spl0_79 ),
    inference(avatar_component_clause,[],[f3785]) ).

fof(f3788,plain,
    ( ~ spl0_78
    | ~ spl0_79
    | ~ spl0_4
    | spl0_24 ),
    inference(avatar_split_clause,[],[f3773,f1952,f381,f3785,f3781]) ).

fof(f4269,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(not(X0)),or(X1,X2)))
      | ~ theorem(or(X1,X0)) ),
    inference(resolution,[],[f198,f63]) ).

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

fof(f5147,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(not(X0)),or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f4625,f63]) ).

fof(f5207,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(not(X0)),or(X2,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f5147,f49]) ).

fof(f5556,plain,
    ( ~ theorem(or(not(or(not(not(q)),not(p))),or(not(p),q)))
    | spl0_78 ),
    inference(resolution,[],[f3783,f4269]) ).

fof(f5574,plain,
    ( $false
    | ~ spl0_22
    | spl0_78 ),
    inference(forward_subsumption_resolution,[],[f5556,f1508]) ).

fof(f5575,plain,
    ( ~ spl0_22
    | spl0_78 ),
    inference(avatar_contradiction_clause,[],[f5574]) ).

fof(f5576,plain,
    ( ~ theorem(or(or(not(q),p),not(p)))
    | spl0_79 ),
    inference(resolution,[],[f3787,f5207]) ).

fof(f5598,plain,
    ( $false
    | spl0_79 ),
    inference(forward_subsumption_resolution,[],[f5576,f44]) ).

fof(f5599,plain,
    spl0_79,
    inference(avatar_contradiction_clause,[],[f5598]) ).

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

cnf(s2,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f383]) ).

cnf(s19,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f437]) ).

cnf(s25,plain,
    ( spl0_1
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f1071]) ).

cnf(s29,plain,
    ( ~ spl0_4
    | spl0_8 ),
    inference(sat_conversion,[],[f1150]) ).

cnf(s35,plain,
    ( spl0_3
    | spl0_22 ),
    inference(sat_conversion,[],[f1473]) ).

cnf(s38,plain,
    ( ~ spl0_4
    | spl0_9 ),
    inference(sat_conversion,[],[f1935]) ).

cnf(s39,plain,
    ( spl0_2
    | ~ spl0_23
    | ~ spl0_24 ),
    inference(sat_conversion,[],[f1955]) ).

cnf(s41,plain,
    ( spl0_23
    | ~ spl0_27
    | ~ spl0_28 ),
    inference(sat_conversion,[],[f2004]) ).

cnf(s43,plain,
    spl0_27,
    inference(sat_conversion,[],[f2073]) ).

cnf(s58,plain,
    spl0_28,
    inference(sat_conversion,[],[f2548]) ).

cnf(s89,plain,
    ( ~ spl0_4
    | spl0_24
    | ~ spl0_78
    | ~ spl0_79 ),
    inference(sat_conversion,[],[f3788]) ).

cnf(s113,plain,
    ( ~ spl0_22
    | spl0_78 ),
    inference(sat_conversion,[],[f5575]) ).

cnf(s115,plain,
    spl0_79,
    inference(sat_conversion,[],[f5599]) ).

cnf(s116,plain,
    ( ~ spl0_4
    | spl0_24
    | ~ spl0_78 ),
    inference(rat,[],[s89,s115]) ).

cnf(s121,plain,
    spl0_23,
    inference(rat,[],[s41,s58,s43]) ).

cnf(s122,plain,
    ( spl0_2
    | ~ spl0_24 ),
    inference(rat,[],[s39,s121]) ).

cnf(s131,plain,
    spl0_22,
    inference(rat,[],[s35,s19]) ).

cnf(s132,plain,
    spl0_78,
    inference(rat,[],[s113,s131]) ).

cnf(s135,plain,
    spl0_4,
    inference(rat,[],[s2,s19]) ).

cnf(s137,plain,
    spl0_24,
    inference(rat,[],[s116,s132,s135]) ).

cnf(s140,plain,
    spl0_9,
    inference(rat,[],[s38,s135]) ).

cnf(s142,plain,
    spl0_8,
    inference(rat,[],[s29,s135]) ).

cnf(s143,plain,
    spl0_2,
    inference(rat,[],[s122,s137]) ).

cnf(s145,plain,
    spl0_1,
    inference(rat,[],[s25,s140,s142]) ).

cnf(s146,plain,
    $false,
    inference(rat,[],[s1,s143,s145]) ).

fof(f5600,plain,
    $false,
    inference(avatar_sat_refutation,[],[s146]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL263-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.47  % Computer : n010.cluster.edu
% 0.22/0.47  % Model    : x86_64 x86_64
% 0.22/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47  % Memory   : 8046.5625MB
% 0.22/0.47  % OS       : Linux 6.8.0-71-generic
% 0.22/0.47  % CPULimit : 300
% 0.22/0.47  % WCLimit  : 300
% 0.22/0.47  % DateTime : Sun Sep 27 15:31:47 UTC 2026
% 0.22/0.47  % CPUTime  : 
% 0.22/0.47  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.77/3.52  % (1101507)Input is clausal, will run a generic CNF schedule.
% 17.77/3.52  % (1101517)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=670505035:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 17.77/3.52  % (1101512)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=3972803662:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 17.77/3.52  % (1101514)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=926960721:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 17.77/3.52  % (1101513)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3308955932:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 17.77/3.52  % (1101515)lrs+10_1_sil=8000:sp=occurrence:random_seed=960590329:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 17.77/3.52  % (1101517)Instruction limit reached! 
% 17.77/3.52  % (1101517)------------------------------
% 17.77/3.52  % (1101517)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.77/3.52  % (1101517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.77/3.52  % (1101517)CaDiCaL version: 2.1.3
% 17.77/3.52  % (1101517)Termination reason: Instruction limit
% 17.77/3.52  % (1101517)Termination phase: Saturation
% 17.77/3.52  % (1101517)Time elapsed: 0.092 s
% 17.77/3.52  % (1101517)Peak memory usage: 89 MB
% 17.77/3.52  % (1101517)Instructions burned: 181 (million)
% 17.77/3.52  % (1101516)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2078203641:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 17.77/3.52  % (1101518)dis-21_1_sil=8000:lcm=predicate:random_seed=1641295455:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 17.77/3.52  % (1101515)Instruction limit reached! 
% 17.77/3.52  % (1101515)------------------------------
% 17.77/3.52  % (1101515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.77/3.52  % (1101515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.77/3.52  % (1101515)CaDiCaL version: 2.1.3
% 17.77/3.52  % (1101515)Termination reason: Instruction limit
% 17.77/3.52  % (1101515)Termination phase: Saturation
% 17.77/3.52  % (1101515)Time elapsed: 0.109 s
% 17.77/3.52  % (1101515)Peak memory usage: 89 MB
% 17.77/3.52  % (1101515)Instructions burned: 107 (million)
% 17.77/3.52  % (1101518)Instruction limit reached! 
% 17.77/3.52  % (1101518)------------------------------
% 17.77/3.52  % (1101518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.77/3.52  % (1101518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.77/3.52  % (1101518)CaDiCaL version: 2.1.3
% 17.77/3.52  % (1101518)Termination reason: Instruction limit
% 17.77/3.52  % (1101518)Termination phase: Saturation
% 17.77/3.52  % (1101518)Time elapsed: 0.094 s
% 17.77/3.52  % (1101518)Peak memory usage: 87 MB
% 17.77/3.52  % (1101518)Instructions burned: 117 (million)
% 17.77/3.52  % (1101516)Instruction limit reached! 
% 17.77/3.52  % (1101516)------------------------------
% 17.77/3.52  % (1101516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.77/3.52  % (1101516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.77/3.52  % (1101516)CaDiCaL version: 2.1.3
% 17.77/3.52  % (1101516)Termination reason: Instruction limit
% 17.77/3.52  % (1101516)Termination phase: Saturation
% 17.77/3.52  % (1101516)Time elapsed: 0.110 s
% 17.77/3.52  % (1101516)Peak memory usage: 89 MB
% 17.77/3.52  % (1101516)Instructions burned: 115 (million)
% 17.77/3.52  % (1101524)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=2903418190:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 17.77/3.52  % (1101524)Refutation not found, incomplete strategy
% 17.77/3.52  % (1101524)------------------------------
% 17.77/3.52  % (1101524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.77/3.52  % (1101524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.77/3.52  % (1101524)CaDiCaL version: 2.1.3
% 17.77/3.52  % (1101524)Termination reason: Refutation not found, incomplete strategy
% 17.77/3.52  % (1101524)Time elapsed: 0.002 s
% 17.77/3.52  % (1101524)Peak memory usage: 88 MB
% 17.77/3.52  % (1101527)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=611702686: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)
% 30.74/5.36  % (1101527)Refutation not found, incomplete strategy
% 30.74/5.36  % (1101527)------------------------------
% 30.74/5.36  % (1101527)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101527)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101527)Termination reason: Refutation not found, incomplete strategy
% 30.74/5.36  % (1101527)Time elapsed: 0.002 s
% 30.74/5.36  % (1101527)Peak memory usage: 87 MB
% 30.74/5.36  % (1101528)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1658427703:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 30.74/5.36  % (1101528)Refutation not found, incomplete strategy
% 30.74/5.36  % (1101528)------------------------------
% 30.74/5.36  % (1101528)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101528)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101528)Termination reason: Refutation not found, incomplete strategy
% 30.74/5.36  % (1101528)Time elapsed: 0.002 s
% 30.74/5.36  % (1101528)Peak memory usage: 88 MB
% 30.74/5.36  % (1101529)lrs+10_64_to=lpo:sil=8000:random_seed=3594771575:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 30.74/5.36  % (1101524)------------------------------
% 30.74/5.36  % (1101524)------------------------------
% 30.74/5.36  % (1101529)Instruction limit reached! 
% 30.74/5.36  % (1101529)------------------------------
% 30.74/5.36  % (1101529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101529)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101529)Termination reason: Instruction limit
% 30.74/5.36  % (1101529)Termination phase: Saturation
% 30.74/5.36  % (1101529)Time elapsed: 0.116 s
% 30.74/5.36  % (1101529)Peak memory usage: 89 MB
% 30.74/5.36  % (1101529)Instructions burned: 126 (million)
% 30.74/5.36  % (1101534)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3110000254:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 30.74/5.36  % (1101535)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3810090211:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 30.74/5.36  % (1101527)------------------------------
% 30.74/5.36  % (1101527)------------------------------
% 30.74/5.36  % (1101535)Instruction limit reached! 
% 30.74/5.36  % (1101535)------------------------------
% 30.74/5.36  % (1101535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101535)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101535)Termination reason: Instruction limit
% 30.74/5.36  % (1101535)Termination phase: Saturation
% 30.74/5.36  % (1101535)Time elapsed: 0.087 s
% 30.74/5.36  % (1101535)Peak memory usage: 91 MB
% 30.74/5.36  % (1101535)Instructions burned: 158 (million)
% 30.74/5.36  % (1101528)------------------------------
% 30.74/5.36  % (1101528)------------------------------
% 30.74/5.36  % (1101534)Instruction limit reached! 
% 30.74/5.36  % (1101534)------------------------------
% 30.74/5.36  % (1101534)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101534)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101534)Termination reason: Instruction limit
% 30.74/5.36  % (1101534)Termination phase: Saturation
% 30.74/5.36  % (1101534)Time elapsed: 0.194 s
% 30.74/5.36  % (1101534)Peak memory usage: 89 MB
% 30.74/5.36  % (1101534)Instructions burned: 194 (million)
% 30.74/5.36  % (1101539)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=1039609264:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2990 on theBenchmark for (2990ds/106Mi)
% 30.74/5.36  % (1101539)Instruction limit reached! 
% 30.74/5.36  % (1101539)------------------------------
% 30.74/5.36  % (1101539)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101539)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101539)Termination reason: Instruction limit
% 30.74/5.36  % (1101539)Termination phase: Saturation
% 30.74/5.36  % (1101539)Time elapsed: 0.045 s
% 30.74/5.36  % (1101539)Peak memory usage: 88 MB
% 30.74/5.36  % (1101539)Instructions burned: 106 (million)
% 30.74/5.36  % (1101538)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=4293030260:i=3394:sd=4:ss=included:sgt=64_2990 on theBenchmark for (2990ds/3394Mi)
% 30.74/5.36  % (1101540)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=401785196:i=107_2990 on theBenchmark for (2990ds/107Mi)
% 30.74/5.36  % (1101540)Refutation not found, incomplete strategy
% 30.74/5.36  % (1101540)------------------------------
% 30.74/5.36  % (1101540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101540)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101540)Termination reason: Refutation not found, incomplete strategy
% 30.74/5.36  % (1101540)Time elapsed: 0.002 s
% 30.74/5.36  % (1101540)Peak memory usage: 87 MB
% 30.74/5.36  % (1101541)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3405306354:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 30.74/5.36  % (1101544)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=3367242379:cond=fast:i=5208:av=off_2988 on theBenchmark for (2988ds/5208Mi)
% 30.74/5.36  % (1101541)Instruction limit reached! 
% 30.74/5.36  % (1101541)------------------------------
% 30.74/5.36  % (1101541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101541)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101541)Termination reason: Instruction limit
% 30.74/5.36  % (1101541)Termination phase: Saturation
% 30.74/5.36  % (1101541)Time elapsed: 0.232 s
% 30.74/5.36  % (1101541)Peak memory usage: 91 MB
% 30.74/5.36  % (1101541)Instructions burned: 242 (million)
% 30.74/5.36  % (1101540)------------------------------
% 30.74/5.36  % (1101540)------------------------------
% 30.74/5.36  % (1101548)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=705110498:i=134:sd=2:doe=on:ss=axioms:sgt=14_2984 on theBenchmark for (2984ds/134Mi)
% 30.74/5.36  % (1101549)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=4117125279:i=499:bd=all_2983 on theBenchmark for (2983ds/499Mi)
% 30.74/5.36  % (1101548)Instruction limit reached! 
% 30.74/5.36  % (1101548)------------------------------
% 30.74/5.36  % (1101548)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101548)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101548)Termination reason: Instruction limit
% 30.74/5.36  % (1101548)Termination phase: Saturation
% 30.74/5.36  % (1101548)Time elapsed: 0.133 s
% 30.74/5.36  % (1101548)Peak memory usage: 89 MB
% 30.74/5.36  % (1101548)Instructions burned: 135 (million)
% 30.74/5.36  % (1101552)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=2489979989:i=191:fgj=on:bd=all_2981 on theBenchmark for (2981ds/191Mi)
% 30.74/5.36  % (1101549)Instruction limit reached! 
% 30.74/5.36  % (1101549)------------------------------
% 30.74/5.36  % (1101549)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101549)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101549)Termination reason: Instruction limit
% 30.74/5.36  % (1101549)Termination phase: Saturation
% 30.74/5.36  % (1101549)Time elapsed: 0.468 s
% 30.74/5.36  % (1101549)Peak memory usage: 93 MB
% 30.74/5.36  % (1101549)Instructions burned: 499 (million)
% 30.74/5.36  % (1101552)Instruction limit reached! 
% 30.74/5.36  % (1101552)------------------------------
% 30.74/5.36  % (1101552)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101552)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101552)Termination reason: Instruction limit
% 30.74/5.36  % (1101552)Termination phase: Saturation
% 30.74/5.36  % (1101552)Time elapsed: 0.209 s
% 30.74/5.36  % (1101552)Peak memory usage: 93 MB
% 30.74/5.36  % (1101552)Instructions burned: 191 (million)
% 30.74/5.36  % (1101554)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=2072524069:i=264:kws=precedence:fsr=off_2976 on theBenchmark for (2976ds/264Mi)
% 30.74/5.36  % (1101555)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=2363043776:cond=on:i=156:bs=on:gtg=exists_all:er=known_2976 on theBenchmark for (2976ds/156Mi)
% 30.74/5.36  % (1101555)Instruction limit reached! 
% 30.74/5.36  % (1101555)------------------------------
% 30.74/5.36  % (1101555)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101555)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101555)Termination reason: Instruction limit
% 30.74/5.36  % (1101555)Termination phase: Saturation
% 30.74/5.36  % (1101555)Time elapsed: 0.147 s
% 30.74/5.36  % (1101555)Peak memory usage: 88 MB
% 30.74/5.36  % (1101555)Instructions burned: 156 (million)
% 30.74/5.36  % (1101554)Instruction limit reached! 
% 30.74/5.36  % (1101554)------------------------------
% 30.74/5.36  % (1101554)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101554)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101554)Termination reason: Instruction limit
% 30.74/5.36  % (1101554)Termination phase: Saturation
% 30.74/5.36  % (1101554)Time elapsed: 0.242 s
% 30.74/5.36  % (1101554)Peak memory usage: 92 MB
% 30.74/5.36  % (1101554)Instructions burned: 265 (million)
% 30.74/5.36  % (1101558)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=4028770293:i=3256:kws=precedence:bd=preordered:av=off_2972 on theBenchmark for (2972ds/3256Mi)
% 30.74/5.36  % (1101559)dis+1003_128_sil=8000:tgt=full:fd=off:random_seed=3514004585:i=537:av=off:ss=included_2972 on theBenchmark for (2972ds/537Mi)
% 30.74/5.36  % (1101559)Instruction limit reached! 
% 30.74/5.36  % (1101559)------------------------------
% 30.74/5.36  % (1101559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101559)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101559)Termination reason: Instruction limit
% 30.74/5.36  % (1101559)Termination phase: Saturation
% 30.74/5.36  % (1101559)Time elapsed: 0.507 s
% 30.74/5.36  % (1101559)Peak memory usage: 92 MB
% 30.74/5.36  % (1101559)Instructions burned: 537 (million)
% 30.74/5.36  % (1101562)ott+1010_32_to=lpo:sil=8000:urr=on:nwc=4:random_seed=26286290:i=180:bd=preordered:av=off_2965 on theBenchmark for (2965ds/180Mi)
% 30.74/5.36  % (1101562)Instruction limit reached! 
% 30.74/5.36  % (1101562)------------------------------
% 30.74/5.36  % (1101562)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101562)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101562)Termination reason: Instruction limit
% 30.74/5.36  % (1101562)Termination phase: Saturation
% 30.74/5.36  % (1101562)Time elapsed: 0.156 s
% 30.74/5.36  % (1101562)Peak memory usage: 88 MB
% 30.74/5.36  % (1101562)Instructions burned: 181 (million)
% 30.74/5.36  % (1101538)First to succeed.
% 30.74/5.36  % (1101538)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1101507"
% 30.74/5.36  % (1101564)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:sas=cadical:sp=reverse_frequency:bsr=on:alpa=false:sac=on:random_seed=1158863096:i=10307:s2at=3:bs=on:bd=preordered:fsd=on_2961 on theBenchmark for (2961ds/10307Mi)
% 30.74/5.36  % (1101544)Instruction limit reached! 
% 30.74/5.36  % (1101544)------------------------------
% 30.74/5.36  % (1101544)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 30.74/5.36  % (1101544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.74/5.36  % (1101544)CaDiCaL version: 2.1.3
% 30.74/5.36  % (1101544)Termination reason: Instruction limit
% 30.74/5.36  % (1101544)Termination phase: Saturation
% 30.74/5.36  % (1101544)Time elapsed: 2.809 s
% 30.74/5.36  % (1101544)Peak memory usage: 168 MB
% 30.74/5.36  % (1101544)Instructions burned: 5209 (million)
% 30.74/5.36  % (1101566)lrs-1010_1024_to=lpo:sil=8000:tgt=ground:plsq=on:plsqc=1:sas=cadical:plsqr=1,32:sp=arity:lma=off:spb=goal:acc=on:bce=on:nwc=1.2:alpa=false:random_seed=3320164554:i=412:gtgl=4:gtg=exists_all_2958 on theBenchmark for (2958ds/412Mi)
% 30.74/5.36  % (1101538)Refutation found. Thanks to Tanya!
% 30.74/5.36  % SZS status Unsatisfiable for theBenchmark
% 30.74/5.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.31/5.70  % (1101538)------------------------------
% 0.31/5.70  % (1101538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.31/5.70  % (1101538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.31/5.70  % (1101538)CaDiCaL version: 2.1.3
% 0.31/5.70  % (1101538)Termination reason: Refutation
% 0.31/5.70  % (1101538)Time elapsed: 2.741 s
% 0.31/5.70  % (1101538)Peak memory usage: 144 MB
% 0.31/5.70  % (1101538)Instructions burned: 2670 (million)
% 0.31/5.70  % (1101538)------------------------------
% 0.31/5.70  % (1101538)------------------------------
% 0.31/5.70  % (1101507)Success in time 4.354 s
% 0.31/5.70  % Vampire exiting
%------------------------------------------------------------------------------