↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 13.07s 3.15s
% Output   : Refutation 16.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   29
% Syntax   : Number of formulae    :  147 (  79 unt;  18 def)
%            Number of atoms       :  233 (  32 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  171 (  85   ~;  82   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;  16 con; 0-2 aty)
%            Number of variables   :  114 (   0 sgn 114   !;   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(or(and(p,q),not(q)),or(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,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

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

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,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,
    ! [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(f18,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

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

fof(f20,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f21,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF1 = not(q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    not(q) = sF1,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF2 = or(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f25,plain,
    or(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f27,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f26]) ).

fof(f28,definition,
    sF4 = or(sF3,sF1),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f29,plain,
    or(sF3,sF1) = sF4,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF5 = not(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f31,plain,
    not(sF4) = sF5,
    inference(reorient_equations,[],[f30]) ).

fof(f32,definition,
    sF6 = or(p,sF1),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f33,plain,
    or(p,sF1) = sF6,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF7 = or(sF5,sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f35,plain,
    or(sF5,sF6) = sF7,
    inference(reorient_equations,[],[f34]) ).

fof(f36,definition,
    sF8 = not(sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f37,plain,
    not(sF7) = sF8,
    inference(reorient_equations,[],[f36]) ).

fof(f38,definition,
    sF9 = not(sF6),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f39,plain,
    not(sF6) = sF9,
    inference(reorient_equations,[],[f38]) ).

fof(f40,definition,
    sF10 = or(sF9,sF4),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f41,plain,
    or(sF9,sF4) = sF10,
    inference(reorient_equations,[],[f40]) ).

fof(f42,definition,
    sF11 = not(sF10),
    introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).

fof(f43,plain,
    not(sF10) = sF11,
    inference(reorient_equations,[],[f42]) ).

fof(f44,definition,
    sF12 = or(sF8,sF11),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f45,plain,
    or(sF8,sF11) = sF12,
    inference(reorient_equations,[],[f44]) ).

fof(f46,definition,
    sF13 = not(sF12),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f47,plain,
    not(sF12) = sF13,
    inference(reorient_equations,[],[f46]) ).

fof(f48,plain,
    ~ theorem(sF13),
    inference(definition_folding,[],[f19,f47,f45,f43,f41,f29,f23,f27,f25,f23,f21,f39,f33,f23,f37,f35,f33,f23,f31,f29,f23,f27,f25,f23,f21]) ).

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

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

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

fof(f73,plain,
    ! [X0] : theorem(or(not(or(sF3,or(X0,sF1))),or(X0,sF4))),
    inference(superposition,[],[f50,f29]) ).

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

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

fof(f82,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f18,f57]) ).

fof(f87,plain,
    ! [X0] :
      ( ~ theorem(or(sF8,X0))
      | theorem(X0)
      | ~ theorem(sF7) ),
    inference(superposition,[],[f18,f37]) ).

fof(f98,definition,
    ( spl14_3
  <=> theorem(sF7) ),
    introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).

fof(f100,plain,
    ( ~ theorem(sF7)
    | spl14_3 ),
    inference(avatar_component_clause,[],[f98]) ).

fof(f102,definition,
    ( spl14_4
  <=> ! [X0] :
        ( ~ theorem(or(sF8,X0))
        | theorem(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).

fof(f103,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF8,X0))
        | theorem(X0) )
    | ~ spl14_4 ),
    inference(avatar_component_clause,[],[f102]) ).

fof(f104,plain,
    ( ~ spl14_3
    | spl14_4 ),
    inference(avatar_split_clause,[],[f87,f102,f98]) ).

fof(f197,plain,
    theorem(or(not(sF12),or(sF11,sF8))),
    inference(superposition,[],[f57,f45]) ).

fof(f199,plain,
    theorem(or(sF13,or(sF11,sF8))),
    inference(forward_demodulation,[],[f197,f47]) ).

fof(f223,plain,
    ! [X0] : theorem(or(not(or(sF9,or(X0,sF4))),or(X0,sF10))),
    inference(superposition,[],[f50,f41]) ).

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

fof(f258,plain,
    ! [X0] : theorem(or(not(or(sF5,or(X0,sF6))),or(X0,sF7))),
    inference(superposition,[],[f50,f35]) ).

fof(f289,plain,
    theorem(or(not(sF1),sF4)),
    inference(superposition,[],[f233,f29]) ).

fof(f290,plain,
    theorem(or(not(sF1),sF6)),
    inference(superposition,[],[f233,f33]) ).

fof(f292,plain,
    theorem(or(not(sF4),sF10)),
    inference(superposition,[],[f233,f41]) ).

fof(f296,plain,
    theorem(or(sF5,sF10)),
    inference(forward_demodulation,[],[f292,f31]) ).

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

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

fof(f304,plain,
    ! [X0] :
      ( theorem(or(not(sF4),or(sF3,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(superposition,[],[f81,f29]) ).

fof(f305,plain,
    ! [X0] :
      ( theorem(or(not(sF6),or(p,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(superposition,[],[f81,f33]) ).

fof(f320,plain,
    ! [X0] :
      ( theorem(or(sF9,or(p,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(forward_demodulation,[],[f305,f39]) ).

fof(f321,plain,
    ! [X0] :
      ( theorem(or(sF5,or(sF3,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(forward_demodulation,[],[f304,f31]) ).

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

fof(f327,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f301,f81]) ).

fof(f328,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f301,f233]) ).

fof(f329,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f301,f297]) ).

fof(f330,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF0,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,p)) ),
    inference(superposition,[],[f301,f21]) ).

fof(f332,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF2)) ),
    inference(superposition,[],[f301,f27]) ).

fof(f333,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF5,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF4)) ),
    inference(superposition,[],[f301,f31]) ).

fof(f336,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF11,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF10)) ),
    inference(superposition,[],[f301,f43]) ).

fof(f341,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f329,f233]) ).

fof(f347,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f326,f233]) ).

fof(f363,plain,
    theorem(or(sF3,sF2)),
    inference(superposition,[],[f341,f27]) ).

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

fof(f452,plain,
    theorem(or(sF11,or(sF13,sF8))),
    inference(resolution,[],[f199,f80]) ).

fof(f458,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f328,f326]) ).

fof(f469,plain,
    theorem(or(sF11,or(sF8,sF13))),
    inference(resolution,[],[f452,f326]) ).

fof(f528,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f436,f18]) ).

fof(f562,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF0))
      | theorem(or(X0,sF2)) ),
    inference(superposition,[],[f458,f25]) ).

fof(f644,plain,
    theorem(or(not(p),sF6)),
    inference(superposition,[],[f347,f33]) ).

fof(f649,plain,
    theorem(or(sF0,sF6)),
    inference(forward_demodulation,[],[f644,f21]) ).

fof(f658,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF8,sF13)))
      | ~ theorem(or(X0,sF10)) ),
    inference(resolution,[],[f336,f469]) ).

fof(f747,plain,
    ! [X0] :
      ( theorem(or(sF8,or(X0,sF13)))
      | ~ theorem(or(X0,sF10)) ),
    inference(resolution,[],[f658,f80]) ).

fof(f754,plain,
    ! [X0] :
      ( ~ theorem(or(sF5,sF10))
      | theorem(or(X0,or(sF8,sF13)))
      | ~ theorem(or(X0,sF4)) ),
    inference(resolution,[],[f658,f333]) ).

fof(f783,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF8,sF13)))
      | ~ theorem(or(X0,sF4)) ),
    inference(forward_subsumption_resolution,[],[f754,f296]) ).

fof(f793,definition,
    ( spl14_29
  <=> theorem(or(sF8,sF13)) ),
    introduced(definition,[new_symbols(definition,[spl14_29])],[avatar_definition]) ).

fof(f794,plain,
    ( ~ theorem(or(sF8,sF13))
    | spl14_29 ),
    inference(avatar_component_clause,[],[f793]) ).

fof(f795,plain,
    ( theorem(or(sF8,sF13))
    | ~ spl14_29 ),
    inference(avatar_component_clause,[],[f793]) ).

fof(f836,definition,
    ( spl14_32
  <=> theorem(or(sF13,sF4)) ),
    introduced(definition,[new_symbols(definition,[spl14_32])],[avatar_definition]) ).

fof(f837,plain,
    ( theorem(or(sF13,sF4))
    | ~ spl14_32 ),
    inference(avatar_component_clause,[],[f836]) ).

fof(f838,plain,
    ( ~ theorem(or(sF13,sF4))
    | spl14_32 ),
    inference(avatar_component_clause,[],[f836]) ).

fof(f946,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,or(X0,sF1)))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f73,f18]) ).

fof(f962,plain,
    ( ~ theorem(or(sF3,sF2))
    | theorem(or(sF0,sF4)) ),
    inference(superposition,[],[f946,f25]) ).

fof(f963,plain,
    theorem(or(sF0,sF4)),
    inference(forward_subsumption_resolution,[],[f962,f363]) ).

fof(f987,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f528,f297]) ).

fof(f1009,plain,
    theorem(or(sF6,sF0)),
    inference(resolution,[],[f649,f82]) ).

fof(f1210,plain,
    ! [X0] :
      ( ~ theorem(or(X0,p))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f330,f963]) ).

fof(f1910,plain,
    theorem(or(sF6,sF2)),
    inference(resolution,[],[f1009,f562]) ).

fof(f2196,plain,
    ! [X0] :
      ( ~ theorem(or(sF9,or(X0,sF4)))
      | theorem(or(X0,sF10)) ),
    inference(resolution,[],[f223,f18]) ).

fof(f2207,plain,
    ( theorem(or(p,sF10))
    | ~ theorem(or(not(sF1),sF4)) ),
    inference(resolution,[],[f2196,f320]) ).

fof(f2217,plain,
    theorem(or(p,sF10)),
    inference(forward_subsumption_resolution,[],[f2207,f289]) ).

fof(f2248,plain,
    ( theorem(or(sF8,sF13))
    | ~ theorem(or(sF13,sF4)) ),
    inference(resolution,[],[f987,f783]) ).

fof(f2274,plain,
    ( ~ theorem(or(sF6,sF7))
    | theorem(sF7) ),
    inference(superposition,[],[f987,f35]) ).

fof(f2277,plain,
    ( ~ theorem(or(sF6,sF7))
    | spl14_3 ),
    inference(forward_subsumption_resolution,[],[f2274,f100]) ).

fof(f2307,plain,
    ! [X0] :
      ( ~ theorem(or(sF5,or(X0,sF6)))
      | theorem(or(X0,sF7)) ),
    inference(resolution,[],[f258,f18]) ).

fof(f2318,plain,
    ( theorem(or(sF3,sF7))
    | ~ theorem(or(not(sF1),sF6)) ),
    inference(resolution,[],[f2307,f321]) ).

fof(f2328,plain,
    theorem(or(sF3,sF7)),
    inference(forward_subsumption_resolution,[],[f2318,f290]) ).

fof(f2330,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF2))
      | theorem(or(X0,sF7)) ),
    inference(resolution,[],[f2328,f332]) ).

fof(f2343,plain,
    theorem(or(sF6,sF7)),
    inference(resolution,[],[f2330,f1910]) ).

fof(f2344,plain,
    ( $false
    | spl14_3 ),
    inference(forward_subsumption_resolution,[],[f2343,f2277]) ).

fof(f2345,plain,
    spl14_3,
    inference(avatar_contradiction_clause,[],[f2344]) ).

fof(f2350,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF10))
        | theorem(or(X0,sF13)) )
    | ~ spl14_4 ),
    inference(resolution,[],[f103,f747]) ).

fof(f2384,plain,
    ( theorem(or(p,sF13))
    | ~ spl14_4 ),
    inference(resolution,[],[f2350,f2217]) ).

fof(f2390,plain,
    ( theorem(or(sF13,p))
    | ~ spl14_4 ),
    inference(resolution,[],[f2384,f82]) ).

fof(f2470,plain,
    ( theorem(or(sF13,sF4))
    | ~ spl14_4 ),
    inference(resolution,[],[f2390,f1210]) ).

fof(f2472,plain,
    ( $false
    | ~ spl14_4
    | spl14_32 ),
    inference(forward_subsumption_resolution,[],[f2470,f838]) ).

fof(f2473,plain,
    ( ~ spl14_4
    | spl14_32 ),
    inference(avatar_contradiction_clause,[],[f2472]) ).

fof(f2474,plain,
    ( ~ theorem(or(sF13,sF4))
    | spl14_29 ),
    inference(forward_subsumption_resolution,[],[f2248,f794]) ).

fof(f2475,plain,
    ( $false
    | spl14_29
    | ~ spl14_32 ),
    inference(forward_subsumption_resolution,[],[f2474,f837]) ).

fof(f2476,plain,
    ( spl14_29
    | ~ spl14_32 ),
    inference(avatar_contradiction_clause,[],[f2475]) ).

fof(f2481,plain,
    ( theorem(sF13)
    | ~ spl14_4
    | ~ spl14_29 ),
    inference(resolution,[],[f795,f103]) ).

fof(f2484,plain,
    ( $false
    | ~ spl14_4
    | ~ spl14_29 ),
    inference(forward_subsumption_resolution,[],[f2481,f48]) ).

fof(f2485,plain,
    ( ~ spl14_4
    | ~ spl14_29 ),
    inference(avatar_contradiction_clause,[],[f2484]) ).

cnf(s2,plain,
    ( ~ spl14_3
    | spl14_4 ),
    inference(sat_conversion,[],[f104]) ).

cnf(s63,plain,
    spl14_3,
    inference(sat_conversion,[],[f2345]) ).

cnf(s68,plain,
    ( ~ spl14_4
    | spl14_32 ),
    inference(sat_conversion,[],[f2473]) ).

cnf(s69,plain,
    ( spl14_29
    | ~ spl14_32 ),
    inference(sat_conversion,[],[f2476]) ).

cnf(s72,plain,
    ( ~ spl14_4
    | ~ spl14_29 ),
    inference(sat_conversion,[],[f2485]) ).

cnf(s74,plain,
    spl14_4,
    inference(rat,[],[s2,s63]) ).

cnf(s75,plain,
    ~ spl14_29,
    inference(rat,[],[s72,s74]) ).

cnf(s76,plain,
    spl14_32,
    inference(rat,[],[s68,s74]) ).

cnf(s82,plain,
    $false,
    inference(rat,[],[s69,s76,s75]) ).

fof(f2486,plain,
    $false,
    inference(avatar_sat_refutation,[],[s82]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL348-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n019.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 15:36:03 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.07/3.14  % (3218527)Input is clausal, will run a generic CNF schedule.
% 13.07/3.14  % (3218624)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3722318421:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 13.07/3.14  % (3218625)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1748303181:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 13.07/3.14  % (3218626)lrs+10_1_sil=8000:sp=occurrence:random_seed=2977658881:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 13.07/3.14  % (3218623)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=4068775077:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 13.07/3.14  % (3218627)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1643156971:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 13.07/3.14  % (3218629)dis-21_1_sil=8000:lcm=predicate:random_seed=2400310186: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)
% 13.07/3.14  % (3218628)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1430905135:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 13.07/3.14  % (3218626)Instruction limit reached! 
% 13.07/3.14  % (3218626)------------------------------
% 13.07/3.14  % (3218626)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218626)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218626)Termination reason: Instruction limit
% 13.07/3.14  % (3218626)Termination phase: Saturation
% 13.07/3.14  % (3218626)Time elapsed: 0.071 s
% 13.07/3.14  % (3218626)Peak memory usage: 89 MB
% 13.07/3.14  % (3218626)Instructions burned: 107 (million)
% 13.07/3.14  % (3218629)Instruction limit reached! 
% 13.07/3.14  % (3218629)------------------------------
% 13.07/3.14  % (3218629)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218629)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218629)Termination reason: Instruction limit
% 13.07/3.14  % (3218629)Termination phase: Saturation
% 13.07/3.14  % (3218629)Time elapsed: 0.058 s
% 13.07/3.14  % (3218629)Peak memory usage: 87 MB
% 13.07/3.14  % (3218629)Instructions burned: 119 (million)
% 13.07/3.14  % (3218627)Instruction limit reached! 
% 13.07/3.14  % (3218627)------------------------------
% 13.07/3.14  % (3218627)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218627)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218627)Termination reason: Instruction limit
% 13.07/3.14  % (3218627)Termination phase: Saturation
% 13.07/3.14  % (3218627)Time elapsed: 0.073 s
% 13.07/3.14  % (3218627)Peak memory usage: 89 MB
% 13.07/3.14  % (3218627)Instructions burned: 115 (million)
% 13.07/3.14  % (3218628)Instruction limit reached! 
% 13.07/3.14  % (3218628)------------------------------
% 13.07/3.14  % (3218628)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218628)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218628)Termination reason: Instruction limit
% 13.07/3.14  % (3218628)Termination phase: Saturation
% 13.07/3.14  % (3218628)Time elapsed: 0.114 s
% 13.07/3.14  % (3218628)Peak memory usage: 89 MB
% 13.07/3.14  % (3218628)Instructions burned: 184 (million)
% 13.07/3.14  % (3218647)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=1113910690:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 13.07/3.14  % (3218647)Refutation not found, incomplete strategy
% 13.07/3.14  % (3218647)------------------------------
% 13.07/3.14  % (3218647)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218647)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218647)Termination reason: Refutation not found, incomplete strategy
% 13.07/3.14  % (3218647)Time elapsed: 0.002 s
% 13.07/3.14  % (3218647)Peak memory usage: 88 MB
% 13.07/3.14  % (3218648)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1104573034:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 13.07/3.14  % (3218648)Refutation not found, incomplete strategy
% 13.07/3.14  % (3218648)------------------------------
% 13.07/3.14  % (3218648)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218648)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218648)Termination reason: Refutation not found, incomplete strategy
% 13.07/3.14  % (3218648)Time elapsed: 0.002 s
% 13.07/3.14  % (3218648)Peak memory usage: 87 MB
% 13.07/3.14  % (3218649)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2159879855:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 13.07/3.14  % (3218649)Refutation not found, incomplete strategy
% 13.07/3.14  % (3218649)------------------------------
% 13.07/3.14  % (3218649)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218649)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218649)Termination reason: Refutation not found, incomplete strategy
% 13.07/3.14  % (3218649)Time elapsed: 0.003 s
% 13.07/3.14  % (3218649)Peak memory usage: 88 MB
% 13.07/3.14  % (3218649)Instructions burned: 1 (million)
% 13.07/3.14  % (3218653)lrs+10_64_to=lpo:sil=8000:random_seed=4123329839:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 13.07/3.14  % (3218653)Instruction limit reached! 
% 13.07/3.14  % (3218653)------------------------------
% 13.07/3.14  % (3218653)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218653)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218653)Termination reason: Instruction limit
% 13.07/3.14  % (3218653)Termination phase: Saturation
% 13.07/3.14  % (3218653)Time elapsed: 0.122 s
% 13.07/3.14  % (3218653)Peak memory usage: 89 MB
% 13.07/3.14  % (3218653)Instructions burned: 126 (million)
% 13.07/3.14  % (3218649)------------------------------
% 13.07/3.14  % (3218649)------------------------------
% 13.07/3.14  % (3218647)------------------------------
% 13.07/3.14  % (3218647)------------------------------
% 13.07/3.14  % (3218648)------------------------------
% 13.07/3.14  % (3218648)------------------------------
% 13.07/3.14  % (3218691)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2640931236:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 13.07/3.14  % (3218696)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1872255828:i=3394:sd=4:ss=included:sgt=64_2991 on theBenchmark for (2991ds/3394Mi)
% 13.07/3.14  % (3218695)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3316968735:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 13.07/3.14  % (3218697)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=2980967211:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2991 on theBenchmark for (2991ds/106Mi)
% 13.07/3.14  % (3218691)Instruction limit reached! 
% 13.07/3.14  % (3218691)------------------------------
% 13.07/3.14  % (3218691)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218691)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218691)Termination reason: Instruction limit
% 13.07/3.14  % (3218691)Termination phase: Saturation
% 13.07/3.14  % (3218691)Time elapsed: 0.187 s
% 13.07/3.14  % (3218691)Peak memory usage: 90 MB
% 13.07/3.14  % (3218691)Instructions burned: 194 (million)
% 13.07/3.14  % (3218697)Instruction limit reached! 
% 13.07/3.14  % (3218697)------------------------------
% 13.07/3.14  % (3218697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.14  % (3218697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.14  % (3218697)CaDiCaL version: 2.1.3
% 13.07/3.14  % (3218697)Termination reason: Instruction limit
% 13.07/3.14  % (3218697)Termination phase: Saturation
% 13.07/3.14  % (3218697)Time elapsed: 0.061 s
% 13.07/3.14  % (3218697)Peak memory usage: 89 MB
% 13.07/3.14  % (3218697)Instructions burned: 106 (million)
% 13.07/3.14  % (3218695)Instruction limit reached! 
% 13.07/3.14  % (3218695)------------------------------
% 13.07/3.14  % (3218695)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.15  % (3218695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.15  % (3218695)CaDiCaL version: 2.1.3
% 13.07/3.15  % (3218695)Termination reason: Instruction limit
% 13.07/3.15  % (3218695)Termination phase: Saturation
% 13.07/3.15  % (3218695)Time elapsed: 0.164 s
% 13.07/3.15  % (3218695)Peak memory usage: 90 MB
% 13.07/3.15  % (3218695)Instructions burned: 157 (million)
% 13.07/3.15  % (3218706)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=177126120:i=107_2988 on theBenchmark for (2988ds/107Mi)
% 13.07/3.15  % (3218706)Refutation not found, incomplete strategy
% 13.07/3.15  % (3218706)------------------------------
% 13.07/3.15  % (3218706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.15  % (3218706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.15  % (3218706)CaDiCaL version: 2.1.3
% 13.07/3.15  % (3218706)Termination reason: Refutation not found, incomplete strategy
% 13.07/3.15  % (3218706)Time elapsed: 0.002 s
% 13.07/3.15  % (3218706)Peak memory usage: 87 MB
% 13.07/3.15  % (3218707)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3313348080:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2988 on theBenchmark for (2988ds/242Mi)
% 13.07/3.15  % (3218710)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1016397724:cond=fast:i=5208:av=off_2987 on theBenchmark for (2987ds/5208Mi)
% 13.07/3.15  % (3218707)Instruction limit reached! 
% 13.07/3.15  % (3218707)------------------------------
% 13.07/3.15  % (3218707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.15  % (3218707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.15  % (3218707)CaDiCaL version: 2.1.3
% 13.07/3.15  % (3218707)Termination reason: Instruction limit
% 13.07/3.15  % (3218707)Termination phase: Saturation
% 13.07/3.15  % (3218707)Time elapsed: 0.245 s
% 13.07/3.15  % (3218707)Peak memory usage: 90 MB
% 13.07/3.15  % (3218707)Instructions burned: 242 (million)
% 13.07/3.15  % (3218706)------------------------------
% 13.07/3.15  % (3218706)------------------------------
% 13.07/3.15  % (3218623)First to succeed.
% 13.07/3.15  % (3218623)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3218527"
% 13.07/3.15  % (3218717)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=4030941518:i=134:sd=2:doe=on:ss=axioms:sgt=14_2983 on theBenchmark for (2983ds/134Mi)
% 13.07/3.15  % (3218719)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=1468889165:i=499:bd=all_2982 on theBenchmark for (2982ds/499Mi)
% 13.07/3.15  % (3218717)Instruction limit reached! 
% 13.07/3.15  % (3218717)------------------------------
% 13.07/3.15  % (3218717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.07/3.15  % (3218717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.07/3.15  % (3218717)CaDiCaL version: 2.1.3
% 13.07/3.15  % (3218717)Termination reason: Instruction limit
% 13.07/3.15  % (3218717)Termination phase: Saturation
% 13.07/3.15  % (3218717)Time elapsed: 0.144 s
% 13.07/3.15  % (3218717)Peak memory usage: 90 MB
% 13.07/3.15  % (3218717)Instructions burned: 134 (million)
% 13.07/3.15  % (3218623)Refutation found. Thanks to Tanya!
% 13.07/3.15  % SZS status Unsatisfiable for theBenchmark
% 13.07/3.15  % SZS output start Proof for theBenchmark
% See solution above
% 16.63/3.40  % (3218623)------------------------------
% 16.63/3.40  % (3218623)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.63/3.40  % (3218623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.63/3.40  % (3218623)CaDiCaL version: 2.1.3
% 16.63/3.40  % (3218623)Termination reason: Refutation
% 16.63/3.40  % (3218623)Time elapsed: 1.634 s
% 16.63/3.40  % (3218623)Peak memory usage: 134 MB
% 16.63/3.40  % (3218623)Instructions burned: 1555 (million)
% 16.63/3.40  % (3218623)------------------------------
% 16.63/3.40  % (3218623)------------------------------
% 16.63/3.40  % (3218527)Success in time 2.267 s
% 16.63/3.40  % Vampire exiting
%------------------------------------------------------------------------------