↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL284-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 : n006.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:52 AM UTC 2026

% Result   : Unsatisfiable 18.55s 3.88s
% Output   : Refutation 20.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   32
% Syntax   : Number of formulae    :  180 (  88 unt;  21 def)
%            Number of atoms       :  314 (  34 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  265 ( 131   ~; 128   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  17 con; 0-2 aty)
%            Number of variables   :  154 (   0 sgn 154   !;   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(p,and(or(p,q),or(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,
    ! [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(p),not(or(not(or(p,q)),not(or(p,not(q))))))),not(or(not(not(or(not(or(p,q)),not(or(p,not(q)))))),p))))),
    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 = or(p,q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

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

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

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

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

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

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

fof(f29,plain,
    or(p,sF3) = 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(sF2,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f33,plain,
    or(sF2,sF5) = sF6,
    inference(reorient_equations,[],[f32]) ).

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

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

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

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

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

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

fof(f40,definition,
    sF10 = not(sF7),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f41,plain,
    not(sF7) = sF10,
    inference(reorient_equations,[],[f40]) ).

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

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

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

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

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

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

fof(f48,definition,
    sF14 = not(sF13),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f49,plain,
    not(sF13) = sF14,
    inference(reorient_equations,[],[f48]) ).

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

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

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

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

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

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

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

fof(f80,plain,
    ! [X0] :
      ( ~ theorem(or(sF12,X0))
      | theorem(X0)
      | ~ theorem(sF11) ),
    inference(superposition,[],[f18,f45]) ).

fof(f82,definition,
    ( spl15_1
  <=> theorem(sF11) ),
    introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).

fof(f84,plain,
    ( ~ theorem(sF11)
    | spl15_1 ),
    inference(avatar_component_clause,[],[f82]) ).

fof(f86,definition,
    ( spl15_2
  <=> ! [X0] :
        ( ~ theorem(or(sF12,X0))
        | theorem(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).

fof(f87,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF12,X0))
        | theorem(X0) )
    | ~ spl15_2 ),
    inference(avatar_component_clause,[],[f86]) ).

fof(f88,plain,
    ( ~ spl15_1
    | spl15_2 ),
    inference(avatar_split_clause,[],[f80,f86,f82]) ).

fof(f178,plain,
    theorem(or(not(sF4),or(sF3,p))),
    inference(superposition,[],[f53,f29]) ).

fof(f180,plain,
    theorem(or(sF5,or(sF3,p))),
    inference(forward_demodulation,[],[f178,f31]) ).

fof(f214,plain,
    theorem(or(not(sF13),or(sF12,sF9))),
    inference(superposition,[],[f53,f47]) ).

fof(f216,plain,
    theorem(or(sF14,or(sF12,sF9))),
    inference(forward_demodulation,[],[f214,f49]) ).

fof(f231,plain,
    theorem(or(not(sF6),or(sF5,sF2))),
    inference(superposition,[],[f53,f33]) ).

fof(f233,plain,
    theorem(or(sF7,or(sF5,sF2))),
    inference(forward_demodulation,[],[f231,f35]) ).

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

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

fof(f300,plain,
    theorem(or(not(sF7),sF8)),
    inference(superposition,[],[f267,f37]) ).

fof(f305,plain,
    theorem(or(sF10,sF8)),
    inference(forward_demodulation,[],[f300,f41]) ).

fof(f317,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f286,f18]) ).

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

fof(f344,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X2,or(X1,X3))))
      | theorem(or(X0,or(X1,or(X2,X3)))) ),
    inference(resolution,[],[f320,f52]) ).

fof(f346,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f320,f53]) ).

fof(f347,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f320,f71]) ).

fof(f348,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f320,f267]) ).

fof(f349,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f320,f286]) ).

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

fof(f356,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF9,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF8)) ),
    inference(superposition,[],[f320,f39]) ).

fof(f357,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF12,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF11)) ),
    inference(superposition,[],[f320,f45]) ).

fof(f362,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f349,f267]) ).

fof(f368,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f346,f267]) ).

fof(f381,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f362,f72]) ).

fof(f389,plain,
    theorem(or(sF12,sF11)),
    inference(superposition,[],[f362,f45]) ).

fof(f399,plain,
    theorem(or(sF7,sF10)),
    inference(superposition,[],[f381,f41]) ).

fof(f404,plain,
    theorem(or(sF12,or(sF14,sF9))),
    inference(resolution,[],[f216,f70]) ).

fof(f409,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f348,f346]) ).

fof(f419,plain,
    theorem(or(sF12,or(sF9,sF14))),
    inference(resolution,[],[f404,f346]) ).

fof(f426,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,[],[f347,f52]) ).

fof(f427,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,[],[f347,f51]) ).

fof(f428,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f347,f53]) ).

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

fof(f517,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f428,f349]) ).

fof(f569,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
    inference(resolution,[],[f344,f53]) ).

fof(f585,plain,
    theorem(or(sF3,or(sF5,p))),
    inference(resolution,[],[f180,f70]) ).

fof(f630,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
    inference(resolution,[],[f368,f70]) ).

fof(f634,plain,
    ! [X0] : theorem(or(sF0,or(p,X0))),
    inference(superposition,[],[f368,f21]) ).

fof(f644,plain,
    theorem(or(not(p),sF4)),
    inference(superposition,[],[f368,f29]) ).

fof(f645,plain,
    theorem(or(not(sF0),sF8)),
    inference(superposition,[],[f368,f37]) ).

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

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

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

fof(f713,plain,
    theorem(or(sF5,or(sF7,sF2))),
    inference(resolution,[],[f233,f70]) ).

fof(f717,plain,
    theorem(or(sF3,or(p,sF5))),
    inference(resolution,[],[f585,f346]) ).

fof(f722,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF9,sF14)))
      | ~ theorem(or(X0,sF11)) ),
    inference(resolution,[],[f357,f419]) ).

fof(f781,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF7,sF2)))
      | ~ theorem(or(X0,sF4)) ),
    inference(resolution,[],[f713,f353]) ).

fof(f793,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,[],[f427,f18]) ).

fof(f916,definition,
    ( spl15_40
  <=> theorem(or(sF7,sF11)) ),
    introduced(definition,[new_symbols(definition,[spl15_40])],[avatar_definition]) ).

fof(f917,plain,
    ( theorem(or(sF7,sF11))
    | ~ spl15_40 ),
    inference(avatar_component_clause,[],[f916]) ).

fof(f918,plain,
    ( ~ theorem(or(sF7,sF11))
    | spl15_40 ),
    inference(avatar_component_clause,[],[f916]) ).

fof(f937,definition,
    ( spl15_45
  <=> theorem(or(sF9,sF14)) ),
    introduced(definition,[new_symbols(definition,[spl15_45])],[avatar_definition]) ).

fof(f938,plain,
    ( ~ theorem(or(sF9,sF14))
    | spl15_45 ),
    inference(avatar_component_clause,[],[f937]) ).

fof(f939,plain,
    ( theorem(or(sF9,sF14))
    | ~ spl15_45 ),
    inference(avatar_component_clause,[],[f937]) ).

fof(f949,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF8))
        | theorem(or(X0,sF14)) )
    | ~ spl15_45 ),
    inference(resolution,[],[f939,f356]) ).

fof(f953,plain,
    ( theorem(or(sF10,sF14))
    | ~ spl15_45 ),
    inference(resolution,[],[f949,f305]) ).

fof(f977,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f652,f286]) ).

fof(f983,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(sF1),X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(p,or(X1,q))) ),
    inference(superposition,[],[f652,f23]) ).

fof(f986,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(sF6),X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF2,or(X1,sF5))) ),
    inference(superposition,[],[f652,f33]) ).

fof(f991,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF2,or(X1,sF5)))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF7,X0)) ),
    inference(forward_demodulation,[],[f986,f35]) ).

fof(f994,plain,
    ! [X0,X1] :
      ( ~ theorem(or(p,or(X1,q)))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF2,X0)) ),
    inference(forward_demodulation,[],[f983,f25]) ).

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

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

fof(f1480,definition,
    ( spl15_67
  <=> ! [X0] :
        ( theorem(or(p,X0))
        | ~ theorem(or(sF7,X0)) ) ),
    introduced(definition,[new_symbols(definition,[spl15_67])],[avatar_definition]) ).

fof(f1481,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF7,X0))
        | theorem(or(p,X0)) )
    | ~ spl15_67 ),
    inference(avatar_component_clause,[],[f1480]) ).

fof(f1659,plain,
    theorem(or(sF7,sF11)),
    inference(resolution,[],[f399,f690]) ).

fof(f1661,plain,
    ( $false
    | spl15_40 ),
    inference(forward_subsumption_resolution,[],[f1659,f918]) ).

fof(f1662,plain,
    spl15_40,
    inference(avatar_contradiction_clause,[],[f1661]) ).

fof(f2217,plain,
    ! [X0] :
      ( theorem(or(not(p),X0))
      | ~ theorem(or(sF2,X0)) ),
    inference(resolution,[],[f994,f630]) ).

fof(f2220,plain,
    ! [X0] :
      ( ~ theorem(or(sF2,X0))
      | theorem(or(sF0,X0)) ),
    inference(forward_demodulation,[],[f2217,f21]) ).

fof(f3012,plain,
    ( ~ theorem(or(p,sF11))
    | theorem(sF11) ),
    inference(superposition,[],[f977,f43]) ).

fof(f3013,plain,
    ( ~ theorem(or(p,sF11))
    | spl15_1 ),
    inference(forward_subsumption_resolution,[],[f3012,f84]) ).

fof(f3113,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),X2))
      | ~ theorem(or(not(X1),X2))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f793,f517]) ).

fof(f3201,plain,
    ! [X0] :
      ( theorem(or(not(sF1),X0))
      | ~ theorem(or(not(q),X0))
      | ~ theorem(or(not(p),X0)) ),
    inference(superposition,[],[f3113,f23]) ).

fof(f3212,plain,
    ! [X0] :
      ( theorem(or(sF2,X0))
      | ~ theorem(or(not(q),X0))
      | ~ theorem(or(not(p),X0)) ),
    inference(forward_demodulation,[],[f3201,f25]) ).

fof(f3217,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(sF2,X0))
      | ~ theorem(or(not(p),X0)) ),
    inference(forward_demodulation,[],[f3212,f27]) ).

fof(f3218,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,X0))
      | ~ theorem(or(sF0,X0))
      | theorem(or(sF2,X0)) ),
    inference(forward_demodulation,[],[f3217,f21]) ).

fof(f3656,definition,
    ( spl15_135
  <=> theorem(or(sF0,sF14)) ),
    introduced(definition,[new_symbols(definition,[spl15_135])],[avatar_definition]) ).

fof(f3658,plain,
    ( theorem(or(sF0,sF14))
    | ~ spl15_135 ),
    inference(avatar_component_clause,[],[f3656]) ).

fof(f3876,plain,
    ( ~ theorem(or(sF0,or(p,sF5)))
    | theorem(or(sF2,or(p,sF5))) ),
    inference(resolution,[],[f3218,f717]) ).

fof(f3901,plain,
    theorem(or(sF2,or(p,sF5))),
    inference(forward_subsumption_resolution,[],[f3876,f634]) ).

fof(f3912,plain,
    ! [X0] :
      ( theorem(or(p,X0))
      | ~ theorem(or(sF7,X0)) ),
    inference(resolution,[],[f3901,f991]) ).

fof(f3921,plain,
    spl15_67,
    inference(avatar_split_clause,[],[f3912,f1480]) ).

fof(f3938,plain,
    ( theorem(or(p,sF11))
    | ~ spl15_40
    | ~ spl15_67 ),
    inference(resolution,[],[f1481,f917]) ).

fof(f3958,plain,
    ( $false
    | spl15_1
    | ~ spl15_40
    | ~ spl15_67 ),
    inference(forward_subsumption_resolution,[],[f3938,f3013]) ).

fof(f3959,plain,
    ( spl15_1
    | ~ spl15_40
    | ~ spl15_67 ),
    inference(avatar_contradiction_clause,[],[f3958]) ).

fof(f3992,plain,
    ( theorem(or(sF9,sF14))
    | ~ theorem(or(sF12,sF11))
    | ~ spl15_2 ),
    inference(resolution,[],[f87,f722]) ).

fof(f3997,plain,
    ( ~ theorem(or(sF12,sF11))
    | ~ spl15_2
    | spl15_45 ),
    inference(forward_subsumption_resolution,[],[f3992,f938]) ).

fof(f4002,plain,
    ( $false
    | ~ spl15_2
    | spl15_45 ),
    inference(forward_subsumption_resolution,[],[f3997,f389]) ).

fof(f4003,plain,
    ( ~ spl15_2
    | spl15_45 ),
    inference(avatar_contradiction_clause,[],[f4002]) ).

fof(f4021,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF8))
        | theorem(or(X0,sF14)) )
    | ~ spl15_45 ),
    inference(resolution,[],[f939,f356]) ).

fof(f4023,plain,
    ( theorem(or(not(sF0),sF14))
    | ~ spl15_45 ),
    inference(resolution,[],[f4021,f645]) ).

fof(f4071,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF0,X0))
        | theorem(or(X0,sF14)) )
    | ~ spl15_45 ),
    inference(resolution,[],[f4023,f513]) ).

fof(f4099,plain,
    ( theorem(or(or(sF7,sF2),sF14))
    | ~ theorem(or(sF0,sF4))
    | ~ spl15_45 ),
    inference(resolution,[],[f4071,f781]) ).

fof(f4109,plain,
    ( theorem(or(or(sF7,sF2),sF14))
    | ~ spl15_45 ),
    inference(forward_subsumption_resolution,[],[f4099,f649]) ).

fof(f4129,plain,
    ( theorem(or(sF7,or(sF14,sF2)))
    | ~ spl15_45 ),
    inference(resolution,[],[f4109,f1323]) ).

fof(f4136,plain,
    ( theorem(or(sF7,or(sF2,sF14)))
    | ~ spl15_45 ),
    inference(resolution,[],[f4129,f346]) ).

fof(f4142,plain,
    ( theorem(or(sF2,sF14))
    | ~ theorem(or(not(sF7),sF14))
    | ~ spl15_45 ),
    inference(resolution,[],[f4136,f998]) ).

fof(f4147,plain,
    ( ~ theorem(or(sF10,sF14))
    | theorem(or(sF2,sF14))
    | ~ spl15_45 ),
    inference(forward_demodulation,[],[f4142,f41]) ).

fof(f4148,plain,
    ( theorem(or(sF2,sF14))
    | ~ spl15_45 ),
    inference(forward_subsumption_resolution,[],[f4147,f953]) ).

fof(f4149,plain,
    ( theorem(or(sF0,sF14))
    | ~ spl15_45 ),
    inference(resolution,[],[f4148,f2220]) ).

fof(f4152,plain,
    ( spl15_135
    | ~ spl15_45 ),
    inference(avatar_split_clause,[],[f4149,f937,f3656]) ).

fof(f4166,plain,
    ( theorem(or(sF14,sF14))
    | ~ spl15_45
    | ~ spl15_135 ),
    inference(resolution,[],[f3658,f4071]) ).

fof(f4171,plain,
    ( theorem(sF14)
    | ~ spl15_45
    | ~ spl15_135 ),
    inference(resolution,[],[f4166,f317]) ).

fof(f4173,plain,
    ( $false
    | ~ spl15_45
    | ~ spl15_135 ),
    inference(forward_subsumption_resolution,[],[f4171,f50]) ).

fof(f4174,plain,
    ( ~ spl15_45
    | ~ spl15_135 ),
    inference(avatar_contradiction_clause,[],[f4173]) ).

cnf(s1,plain,
    ( ~ spl15_1
    | spl15_2 ),
    inference(sat_conversion,[],[f88]) ).

cnf(s41,plain,
    spl15_40,
    inference(sat_conversion,[],[f1662]) ).

cnf(s116,plain,
    spl15_67,
    inference(sat_conversion,[],[f3921]) ).

cnf(s119,plain,
    ( spl15_1
    | ~ spl15_40
    | ~ spl15_67 ),
    inference(sat_conversion,[],[f3959]) ).

cnf(s127,plain,
    ( ~ spl15_2
    | spl15_45 ),
    inference(sat_conversion,[],[f4003]) ).

cnf(s137,plain,
    ( ~ spl15_45
    | spl15_135 ),
    inference(sat_conversion,[],[f4152]) ).

cnf(s138,plain,
    ( ~ spl15_45
    | ~ spl15_135 ),
    inference(sat_conversion,[],[f4174]) ).

cnf(s143,plain,
    spl15_1,
    inference(rat,[],[s119,s116,s41]) ).

cnf(s147,plain,
    spl15_2,
    inference(rat,[],[s1,s143]) ).

cnf(s148,plain,
    spl15_45,
    inference(rat,[],[s127,s147]) ).

cnf(s150,plain,
    ~ spl15_135,
    inference(rat,[],[s138,s148]) ).

cnf(s156,plain,
    $false,
    inference(rat,[],[s137,s150,s148]) ).

fof(f4175,plain,
    $false,
    inference(avatar_sat_refutation,[],[s156]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL284-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46  % Computer : n006.cluster.edu
% 0.20/0.46  % Model    : x86_64 x86_64
% 0.20/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46  % Memory   : 8046.5625MB
% 0.20/0.46  % OS       : Linux 6.8.0-71-generic
% 0.20/0.47  % CPULimit : 300
% 0.20/0.47  % WCLimit  : 300
% 0.20/0.47  % DateTime : Sun Sep 27 15:32:25 UTC 2026
% 0.20/0.47  % CPUTime  : 
% 0.20/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  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.55/3.88  % (3109022)Input is clausal, will run a generic CNF schedule.
% 18.55/3.88  % (3109029)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3326279297:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 18.55/3.88  % (3109028)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1670403233:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 18.55/3.88  % (3109027)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=3128015766:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 18.55/3.88  % (3109032)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1483552636:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 18.55/3.88  % (3109031)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=446009068:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 18.55/3.88  % (3109033)dis-21_1_sil=8000:lcm=predicate:random_seed=863325527: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.55/3.88  % (3109030)lrs+10_1_sil=8000:sp=occurrence:random_seed=1391635898:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 18.55/3.88  % (3109033)Instruction limit reached! 
% 18.55/3.88  % (3109033)------------------------------
% 18.55/3.88  % (3109033)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109033)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109033)Termination reason: Instruction limit
% 18.55/3.88  % (3109033)Termination phase: Saturation
% 18.55/3.88  % (3109033)Time elapsed: 0.093 s
% 18.55/3.88  % (3109033)Peak memory usage: 87 MB
% 18.55/3.88  % (3109033)Instructions burned: 117 (million)
% 18.55/3.88  % (3109031)Instruction limit reached! 
% 18.55/3.88  % (3109031)------------------------------
% 18.55/3.88  % (3109031)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109031)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109031)Termination reason: Instruction limit
% 18.55/3.88  % (3109031)Termination phase: Saturation
% 18.55/3.88  % (3109031)Time elapsed: 0.106 s
% 18.55/3.88  % (3109031)Peak memory usage: 88 MB
% 18.55/3.88  % (3109031)Instructions burned: 114 (million)
% 18.55/3.88  % (3109030)Instruction limit reached! 
% 18.55/3.88  % (3109030)------------------------------
% 18.55/3.88  % (3109030)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109030)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109030)Termination reason: Instruction limit
% 18.55/3.88  % (3109030)Termination phase: Saturation
% 18.55/3.88  % (3109030)Time elapsed: 0.114 s
% 18.55/3.88  % (3109030)Peak memory usage: 89 MB
% 18.55/3.88  % (3109030)Instructions burned: 107 (million)
% 18.55/3.88  % (3109032)Instruction limit reached! 
% 18.55/3.88  % (3109032)------------------------------
% 18.55/3.88  % (3109032)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109032)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109032)Termination reason: Instruction limit
% 18.55/3.88  % (3109032)Termination phase: Saturation
% 18.55/3.88  % (3109032)Time elapsed: 0.184 s
% 18.55/3.88  % (3109032)Peak memory usage: 89 MB
% 18.55/3.88  % (3109032)Instructions burned: 180 (million)
% 18.55/3.88  % (3109041)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=2401293358:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 18.55/3.88  % (3109041)Refutation not found, incomplete strategy
% 18.55/3.88  % (3109041)------------------------------
% 18.55/3.88  % (3109041)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109041)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109041)Termination reason: Refutation not found, incomplete strategy
% 18.55/3.88  % (3109041)Time elapsed: 0.002 s
% 18.55/3.88  % (3109041)Peak memory usage: 88 MB
% 18.55/3.88  % (3109043)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2439528899:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 18.55/3.88  % (3109042)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1387655403:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 18.55/3.88  % (3109042)Refutation not found, incomplete strategy
% 18.55/3.88  % (3109042)------------------------------
% 18.55/3.88  % (3109042)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109042)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109042)Termination reason: Refutation not found, incomplete strategy
% 18.55/3.88  % (3109042)Time elapsed: 0.002 s
% 18.55/3.88  % (3109042)Peak memory usage: 87 MB
% 18.55/3.88  % (3109043)Refutation not found, incomplete strategy
% 18.55/3.88  % (3109043)------------------------------
% 18.55/3.88  % (3109043)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109043)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109043)Termination reason: Refutation not found, incomplete strategy
% 18.55/3.88  % (3109043)Time elapsed: 0.003 s
% 18.55/3.88  % (3109043)Peak memory usage: 88 MB
% 18.55/3.88  % (3109043)Instructions burned: 1 (million)
% 18.55/3.88  % (3109044)lrs+10_64_to=lpo:sil=8000:random_seed=889690907:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 18.55/3.88  % (3109044)Instruction limit reached! 
% 18.55/3.88  % (3109044)------------------------------
% 18.55/3.88  % (3109044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109044)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109044)Termination reason: Instruction limit
% 18.55/3.88  % (3109044)Termination phase: Saturation
% 18.55/3.88  % (3109044)Time elapsed: 0.129 s
% 18.55/3.88  % (3109044)Peak memory usage: 89 MB
% 18.55/3.88  % (3109044)Instructions burned: 126 (million)
% 18.55/3.88  % (3109041)------------------------------
% 18.55/3.88  % (3109041)------------------------------
% 18.55/3.88  % (3109043)------------------------------
% 18.55/3.88  % (3109043)------------------------------
% 18.55/3.88  % (3109042)------------------------------
% 18.55/3.88  % (3109042)------------------------------
% 18.55/3.88  % (3109049)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3854779513:avsq=on:i=194:fgj=on:bd=preordered_2990 on theBenchmark for (2990ds/194Mi)
% 18.55/3.88  % (3109049)Instruction limit reached! 
% 18.55/3.88  % (3109049)------------------------------
% 18.55/3.88  % (3109049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109049)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109049)Termination reason: Instruction limit
% 18.55/3.88  % (3109049)Termination phase: Saturation
% 18.55/3.88  % (3109049)Time elapsed: 0.104 s
% 18.55/3.88  % (3109049)Peak memory usage: 90 MB
% 18.55/3.88  % (3109049)Instructions burned: 195 (million)
% 18.55/3.88  % (3109050)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=1208077057:i=157:gtg=all_2989 on theBenchmark for (2989ds/157Mi)
% 18.55/3.88  % (3109052)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1076052132:i=3394:sd=4:ss=included:sgt=64_2988 on theBenchmark for (2988ds/3394Mi)
% 18.55/3.88  % (3109053)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=4036886578:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2988 on theBenchmark for (2988ds/106Mi)
% 18.55/3.88  % (3109054)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3494797831:i=107_2987 on theBenchmark for (2987ds/107Mi)
% 18.55/3.88  % (3109054)Refutation not found, incomplete strategy
% 18.55/3.88  % (3109054)------------------------------
% 18.55/3.88  % (3109054)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109054)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109054)Termination reason: Refutation not found, incomplete strategy
% 18.55/3.88  % (3109054)Time elapsed: 0.001 s
% 18.55/3.88  % (3109054)Peak memory usage: 87 MB
% 18.55/3.88  % (3109053)Instruction limit reached! 
% 18.55/3.88  % (3109053)------------------------------
% 18.55/3.88  % (3109053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109053)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109053)Termination reason: Instruction limit
% 18.55/3.88  % (3109053)Termination phase: Saturation
% 18.55/3.88  % (3109053)Time elapsed: 0.093 s
% 18.55/3.88  % (3109053)Peak memory usage: 89 MB
% 18.55/3.88  % (3109053)Instructions burned: 107 (million)
% 18.55/3.88  % (3109050)Instruction limit reached! 
% 18.55/3.88  % (3109050)------------------------------
% 18.55/3.88  % (3109050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109050)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109050)Termination reason: Instruction limit
% 18.55/3.88  % (3109050)Termination phase: Saturation
% 18.55/3.88  % (3109050)Time elapsed: 0.160 s
% 18.55/3.88  % (3109050)Peak memory usage: 91 MB
% 18.55/3.88  % (3109050)Instructions burned: 157 (million)
% 18.55/3.88  % (3109054)------------------------------
% 18.55/3.88  % (3109054)------------------------------
% 18.55/3.88  % (3109059)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3790408074:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2984 on theBenchmark for (2984ds/242Mi)
% 18.55/3.88  % (3109060)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1042825178:cond=fast:i=5208:av=off_2984 on theBenchmark for (2984ds/5208Mi)
% 18.55/3.88  % (3109061)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=653474157:i=134:sd=2:doe=on:ss=axioms:sgt=14_2982 on theBenchmark for (2982ds/134Mi)
% 18.55/3.88  % (3109061)Instruction limit reached! 
% 18.55/3.88  % (3109061)------------------------------
% 18.55/3.88  % (3109061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109061)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109061)Termination reason: Instruction limit
% 18.55/3.88  % (3109061)Termination phase: Saturation
% 18.55/3.88  % (3109061)Time elapsed: 0.070 s
% 18.55/3.88  % (3109061)Peak memory usage: 90 MB
% 18.55/3.88  % (3109061)Instructions burned: 135 (million)
% 18.55/3.88  % (3109059)Instruction limit reached! 
% 18.55/3.88  % (3109059)------------------------------
% 18.55/3.88  % (3109059)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109059)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109059)Termination reason: Instruction limit
% 18.55/3.88  % (3109059)Termination phase: Saturation
% 18.55/3.88  % (3109059)Time elapsed: 0.241 s
% 18.55/3.88  % (3109059)Peak memory usage: 91 MB
% 18.55/3.88  % (3109059)Instructions burned: 243 (million)
% 18.55/3.88  % (3109027)First to succeed.
% 18.55/3.88  % (3109027)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3109022"
% 18.55/3.88  % (3109066)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=813550623:i=191:fgj=on:bd=all_2979 on theBenchmark for (2979ds/191Mi)
% 18.55/3.88  % (3109065)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3755423618:i=499:bd=all_2979 on theBenchmark for (2979ds/499Mi)
% 18.55/3.88  % (3109052)Also succeeded, but the first one will report.
% 18.55/3.88  % (3109066)Instruction limit reached! 
% 18.55/3.88  % (3109066)------------------------------
% 18.55/3.88  % (3109066)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.55/3.88  % (3109066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.55/3.88  % (3109066)CaDiCaL version: 2.1.3
% 18.55/3.88  % (3109066)Termination reason: Instruction limit
% 18.55/3.88  % (3109066)Termination phase: Saturation
% 18.55/3.88  % (3109066)Time elapsed: 0.212 s
% 18.55/3.88  % (3109066)Peak memory usage: 93 MB
% 18.55/3.88  % (3109066)Instructions burned: 191 (million)
% 18.55/3.88  % (3109027)Refutation found. Thanks to Tanya!
% 18.55/3.88  % SZS status Unsatisfiable for theBenchmark
% 18.55/3.88  % SZS output start Proof for theBenchmark
% See solution above
% 20.10/4.24  % (3109027)------------------------------
% 20.10/4.24  % (3109027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 20.10/4.24  % (3109027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.10/4.24  % (3109027)CaDiCaL version: 2.1.3
% 20.10/4.24  % (3109027)Termination reason: Refutation
% 20.10/4.24  % (3109027)Time elapsed: 2.005 s
% 20.10/4.24  % (3109027)Peak memory usage: 137 MB
% 20.10/4.24  % (3109027)Instructions burned: 1831 (million)
% 20.10/4.24  % (3109027)------------------------------
% 20.10/4.24  % (3109027)------------------------------
% 20.10/4.24  % (3109022)Success in time 2.732 s
% 20.10/4.24  % Vampire exiting
%------------------------------------------------------------------------------