↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 8.74s 2.15s
% Output   : Refutation 9.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :   32
% Syntax   : Number of formulae    :  151 ( 108 unt;  21 def)
%            Number of atoms       :  202 (  44 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  105 (  54   ~;  50   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   28 (  28 usr;  23 con; 0-2 aty)
%            Number of variables   :  132 (   0 sgn 132   !;   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(implies(equivalent(p,q),equivalent(implies(p,r),implies(q,r)))),
    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(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(or(not(p),r)),or(not(q),r))),not(or(not(or(not(q),r)),or(not(p),r))))))),
    inference(definition_unfolding,[],[f11,f6,f12,f12,f6,f6]) ).

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(sF0,q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    or(sF0,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(sF3,p),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

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

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

fof(f38,definition,
    sF9 = or(sF0,r),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f39,plain,
    or(sF0,r) = sF9,
    inference(reorient_equations,[],[f38]) ).

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

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

fof(f42,definition,
    sF11 = or(sF3,r),
    introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).

fof(f43,plain,
    or(sF3,r) = sF11,
    inference(reorient_equations,[],[f42]) ).

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

fof(f45,plain,
    or(sF10,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,definition,
    sF14 = not(sF11),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

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

fof(f50,definition,
    sF15 = or(sF14,sF9),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f51,plain,
    or(sF14,sF9) = sF15,
    inference(reorient_equations,[],[f50]) ).

fof(f52,definition,
    sF16 = not(sF15),
    introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).

fof(f53,plain,
    not(sF15) = sF16,
    inference(reorient_equations,[],[f52]) ).

fof(f54,definition,
    sF17 = or(sF13,sF16),
    introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).

fof(f55,plain,
    or(sF13,sF16) = sF17,
    inference(reorient_equations,[],[f54]) ).

fof(f56,definition,
    sF18 = not(sF17),
    introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).

fof(f57,plain,
    not(sF17) = sF18,
    inference(reorient_equations,[],[f56]) ).

fof(f58,definition,
    sF19 = or(sF8,sF18),
    introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).

fof(f59,plain,
    or(sF8,sF18) = sF19,
    inference(reorient_equations,[],[f58]) ).

fof(f60,plain,
    ~ theorem(sF19),
    inference(definition_folding,[],[f19,f59,f57,f55,f53,f51,f39,f21,f49,f43,f27,f47,f45,f43,f27,f41,f39,f21,f37,f35,f33,f31,f29,f27,f25,f23,f21]) ).

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

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

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

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

fof(f183,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f92,f62]) ).

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

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

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

fof(f249,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X2,or(X1,X3))))
      | theorem(or(X0,or(X1,or(X2,X3)))) ),
    inference(resolution,[],[f238,f61]) ).

fof(f250,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f238,f219]) ).

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

fof(f256,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF7,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF6)) ),
    inference(superposition,[],[f238,f35]) ).

fof(f278,plain,
    ! [X0] : theorem(or(not(or(not(q),X0)),or(not(sF1),or(sF0,X0)))),
    inference(superposition,[],[f62,f23]) ).

fof(f288,plain,
    ! [X0] : theorem(or(not(or(not(q),X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f278,f25]) ).

fof(f292,plain,
    ! [X0] : theorem(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f288,f27]) ).

fof(f302,plain,
    ! [X0] : theorem(or(not(or(not(p),X0)),or(not(sF4),or(sF3,X0)))),
    inference(superposition,[],[f62,f29]) ).

fof(f312,plain,
    ! [X0] : theorem(or(not(or(not(p),X0)),or(sF5,or(sF3,X0)))),
    inference(forward_demodulation,[],[f302,f31]) ).

fof(f316,plain,
    ! [X0] : theorem(or(not(or(sF0,X0)),or(sF5,or(sF3,X0)))),
    inference(forward_demodulation,[],[f312,f21]) ).

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

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

fof(f348,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f327,f250]) ).

fof(f362,plain,
    theorem(or(not(sF18),sF19)),
    inference(superposition,[],[f327,f59]) ).

fof(f384,plain,
    theorem(or(not(sF17),or(sF16,sF13))),
    inference(superposition,[],[f219,f55]) ).

fof(f388,plain,
    theorem(or(sF18,or(sF16,sF13))),
    inference(forward_demodulation,[],[f384,f57]) ).

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

fof(f476,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f475,f238]) ).

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

fof(f484,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f476,f327]) ).

fof(f488,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
    inference(resolution,[],[f249,f219]) ).

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

fof(f549,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,[],[f251,f61]) ).

fof(f551,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f251,f219]) ).

fof(f592,plain,
    ! [X0] :
      ( theorem(or(not(or(not(X0),sF18)),sF19))
      | ~ theorem(or(sF8,X0)) ),
    inference(superposition,[],[f502,f59]) ).

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

fof(f606,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF5))
      | theorem(or(X0,sF6)) ),
    inference(superposition,[],[f346,f33]) ).

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

fof(f618,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f551,f476]) ).

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

fof(f691,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f484,f228]) ).

fof(f922,plain,
    ! [X0] :
      ( theorem(or(X0,not(sF7)))
      | ~ theorem(or(X0,sF6)) ),
    inference(resolution,[],[f256,f691]) ).

fof(f923,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF6))
      | theorem(or(X0,sF8)) ),
    inference(forward_demodulation,[],[f922,f37]) ).

fof(f1070,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f599,f92]) ).

fof(f1090,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF2))
      | theorem(or(X0,sF6)) ),
    inference(superposition,[],[f599,f33]) ).

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

fof(f1193,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X2,or(X0,X1)))
      | theorem(or(X0,X1))
      | ~ theorem(or(not(X2),X1)) ),
    inference(resolution,[],[f659,f618]) ).

fof(f1256,plain,
    theorem(or(not(or(sF3,r)),or(sF2,sF9))),
    inference(superposition,[],[f292,f39]) ).

fof(f1258,plain,
    theorem(or(not(sF11),or(sF2,sF9))),
    inference(forward_demodulation,[],[f1256,f43]) ).

fof(f1261,plain,
    theorem(or(sF14,or(sF2,sF9))),
    inference(forward_demodulation,[],[f1258,f49]) ).

fof(f1266,plain,
    theorem(or(sF2,or(sF14,sF9))),
    inference(resolution,[],[f1261,f92]) ).

fof(f1268,plain,
    theorem(or(sF2,sF15)),
    inference(forward_demodulation,[],[f1266,f51]) ).

fof(f1271,plain,
    theorem(or(sF15,sF2)),
    inference(resolution,[],[f1268,f228]) ).

fof(f1458,plain,
    ! [X0] :
      ( ~ theorem(or(sF18,X0))
      | theorem(or(X0,sF19)) ),
    inference(resolution,[],[f362,f614]) ).

fof(f1599,plain,
    theorem(or(not(or(sF0,r)),or(sF5,sF11))),
    inference(superposition,[],[f316,f43]) ).

fof(f1601,plain,
    theorem(or(not(sF9),or(sF5,sF11))),
    inference(forward_demodulation,[],[f1599,f39]) ).

fof(f1604,plain,
    theorem(or(sF10,or(sF5,sF11))),
    inference(forward_demodulation,[],[f1601,f41]) ).

fof(f1609,plain,
    theorem(or(sF5,or(sF10,sF11))),
    inference(resolution,[],[f1604,f92]) ).

fof(f1611,plain,
    theorem(or(sF5,sF12)),
    inference(forward_demodulation,[],[f1609,f45]) ).

fof(f1614,plain,
    theorem(or(sF12,sF5)),
    inference(resolution,[],[f1611,f228]) ).

fof(f2000,plain,
    theorem(or(or(sF16,sF13),sF19)),
    inference(resolution,[],[f1458,f388]) ).

fof(f2089,plain,
    theorem(or(sF15,sF6)),
    inference(resolution,[],[f1090,f1271]) ).

fof(f2090,plain,
    theorem(or(sF15,sF8)),
    inference(resolution,[],[f2089,f923]) ).

fof(f2093,plain,
    theorem(or(sF8,sF15)),
    inference(resolution,[],[f2090,f228]) ).

fof(f2130,plain,
    theorem(or(sF16,or(sF19,sF13))),
    inference(resolution,[],[f1137,f2000]) ).

fof(f2163,plain,
    theorem(or(sF16,or(sF13,sF19))),
    inference(resolution,[],[f2130,f250]) ).

fof(f2656,definition,
    ( spl20_127
  <=> theorem(or(not(sF13),sF19)) ),
    introduced(definition,[new_symbols(definition,[spl20_127])],[avatar_definition]) ).

fof(f2657,plain,
    ( theorem(or(not(sF13),sF19))
    | ~ spl20_127 ),
    inference(avatar_component_clause,[],[f2656]) ).

fof(f2658,plain,
    ( ~ theorem(or(not(sF13),sF19))
    | spl20_127 ),
    inference(avatar_component_clause,[],[f2656]) ).

fof(f2898,plain,
    theorem(or(sF12,sF6)),
    inference(resolution,[],[f606,f1614]) ).

fof(f2900,plain,
    theorem(or(sF12,sF8)),
    inference(resolution,[],[f2898,f923]) ).

fof(f2903,plain,
    theorem(or(sF8,sF12)),
    inference(resolution,[],[f2900,f228]) ).

fof(f3018,plain,
    ( theorem(or(not(or(sF13,sF18)),sF19))
    | ~ theorem(or(sF8,sF12)) ),
    inference(superposition,[],[f592,f47]) ).

fof(f3019,plain,
    ( theorem(or(not(or(sF16,sF18)),sF19))
    | ~ theorem(or(sF8,sF15)) ),
    inference(superposition,[],[f592,f53]) ).

fof(f3021,plain,
    theorem(or(not(or(sF16,sF18)),sF19)),
    inference(forward_subsumption_resolution,[],[f3019,f2093]) ).

fof(f3022,plain,
    theorem(or(not(or(sF13,sF18)),sF19)),
    inference(forward_subsumption_resolution,[],[f3018,f2903]) ).

fof(f3063,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF16,sF18)))
      | theorem(or(X0,sF19)) ),
    inference(resolution,[],[f3021,f238]) ).

fof(f3067,plain,
    ! [X0] :
      ( ~ theorem(or(sF16,X0))
      | theorem(or(X0,sF19)) ),
    inference(resolution,[],[f3063,f1070]) ).

fof(f3092,plain,
    theorem(or(or(sF13,sF19),sF19)),
    inference(resolution,[],[f3067,f2163]) ).

fof(f3106,plain,
    theorem(or(sF13,or(sF19,sF19))),
    inference(resolution,[],[f3092,f1137]) ).

fof(f3110,plain,
    ( theorem(or(sF19,sF19))
    | ~ theorem(or(not(sF13),sF19)) ),
    inference(resolution,[],[f3106,f1193]) ).

fof(f3124,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF13,sF18)))
      | theorem(or(X0,sF19)) ),
    inference(resolution,[],[f3022,f238]) ).

fof(f3138,plain,
    theorem(or(not(sF13),sF19)),
    inference(resolution,[],[f3124,f348]) ).

fof(f3145,plain,
    ( $false
    | spl20_127 ),
    inference(forward_subsumption_resolution,[],[f3138,f2658]) ).

fof(f3146,plain,
    spl20_127,
    inference(avatar_contradiction_clause,[],[f3145]) ).

fof(f3147,plain,
    ( theorem(or(sF19,sF19))
    | ~ spl20_127 ),
    inference(forward_subsumption_resolution,[],[f3110,f2657]) ).

fof(f3149,plain,
    ( theorem(sF19)
    | ~ spl20_127 ),
    inference(resolution,[],[f3147,f477]) ).

fof(f3151,plain,
    ( $false
    | ~ spl20_127 ),
    inference(forward_subsumption_resolution,[],[f3149,f60]) ).

fof(f3152,plain,
    ~ spl20_127,
    inference(avatar_contradiction_clause,[],[f3151]) ).

cnf(s111,plain,
    spl20_127,
    inference(sat_conversion,[],[f3146]) ).

cnf(s112,plain,
    ~ spl20_127,
    inference(sat_conversion,[],[f3152]) ).

cnf(s113,plain,
    $false,
    inference(rat,[],[s111,s112]) ).

fof(f3153,plain,
    $false,
    inference(avatar_sat_refutation,[],[s113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL315-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n011.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:34:02 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.39  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
% 8.74/2.15  % (2567834)Input is clausal, will run a generic CNF schedule.
% 8.74/2.15  % (2567842)lrs+10_1_sil=8000:sp=occurrence:random_seed=3166708033:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 8.74/2.15  % (2567841)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1435226700:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 8.74/2.15  % (2567840)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2807684074:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 8.74/2.15  % (2567843)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1224581600:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 8.74/2.15  % (2567839)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=3250293799:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 8.74/2.15  % (2567844)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4183737228:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 8.74/2.15  % (2567845)dis-21_1_sil=8000:lcm=predicate:random_seed=2990956138: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)
% 8.74/2.15  % (2567842)Instruction limit reached! 
% 8.74/2.15  % (2567842)------------------------------
% 8.74/2.15  % (2567842)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567842)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567842)Termination reason: Instruction limit
% 8.74/2.15  % (2567842)Termination phase: Saturation
% 8.74/2.15  % (2567842)Time elapsed: 0.038 s
% 8.74/2.15  % (2567842)Peak memory usage: 89 MB
% 8.74/2.15  % (2567842)Instructions burned: 107 (million)
% 8.74/2.15  % (2567845)Instruction limit reached! 
% 8.74/2.15  % (2567845)------------------------------
% 8.74/2.15  % (2567845)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567845)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567845)Termination reason: Instruction limit
% 8.74/2.15  % (2567845)Termination phase: Saturation
% 8.74/2.15  % (2567845)Time elapsed: 0.057 s
% 8.74/2.15  % (2567845)Peak memory usage: 87 MB
% 8.74/2.15  % (2567845)Instructions burned: 118 (million)
% 8.74/2.15  % (2567843)Instruction limit reached! 
% 8.74/2.15  % (2567843)------------------------------
% 8.74/2.15  % (2567843)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567843)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567843)Termination reason: Instruction limit
% 8.74/2.15  % (2567843)Termination phase: Saturation
% 8.74/2.15  % (2567843)Time elapsed: 0.073 s
% 8.74/2.15  % (2567843)Peak memory usage: 88 MB
% 8.74/2.15  % (2567843)Instructions burned: 114 (million)
% 8.74/2.15  % (2567844)Instruction limit reached! 
% 8.74/2.15  % (2567844)------------------------------
% 8.74/2.15  % (2567844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567844)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567844)Termination reason: Instruction limit
% 8.74/2.15  % (2567844)Termination phase: Saturation
% 8.74/2.15  % (2567844)Time elapsed: 0.116 s
% 8.74/2.15  % (2567844)Peak memory usage: 89 MB
% 8.74/2.15  % (2567844)Instructions burned: 181 (million)
% 8.74/2.15  % (2567855)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=4206582432:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 8.74/2.15  % (2567855)Refutation not found, incomplete strategy
% 8.74/2.15  % (2567855)------------------------------
% 8.74/2.15  % (2567855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567855)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567855)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.15  % (2567855)Time elapsed: 0.001 s
% 8.74/2.15  % (2567855)Peak memory usage: 88 MB
% 8.74/2.15  % (2567856)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=668974944: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)
% 8.74/2.15  % (2567856)Refutation not found, incomplete strategy
% 8.74/2.15  % (2567856)------------------------------
% 8.74/2.15  % (2567856)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567856)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567856)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.15  % (2567856)Time elapsed: 0.001 s
% 8.74/2.15  % (2567856)Peak memory usage: 87 MB
% 8.74/2.15  % (2567857)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1131007148:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 8.74/2.15  % (2567857)Refutation not found, incomplete strategy
% 8.74/2.15  % (2567857)------------------------------
% 8.74/2.15  % (2567857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567857)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567857)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.15  % (2567857)Time elapsed: 0.001 s
% 8.74/2.15  % (2567857)Peak memory usage: 87 MB
% 8.74/2.15  % (2567858)lrs+10_64_to=lpo:sil=8000:random_seed=3088713880:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 8.74/2.15  % (2567855)------------------------------
% 8.74/2.15  % (2567855)------------------------------
% 8.74/2.15  % (2567858)Instruction limit reached! 
% 8.74/2.15  % (2567858)------------------------------
% 8.74/2.15  % (2567858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567858)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567858)Termination reason: Instruction limit
% 8.74/2.15  % (2567858)Termination phase: Saturation
% 8.74/2.15  % (2567858)Time elapsed: 0.074 s
% 8.74/2.15  % (2567858)Peak memory usage: 89 MB
% 8.74/2.15  % (2567858)Instructions burned: 128 (million)
% 8.74/2.15  % (2567863)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=693825593:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 8.74/2.15  % (2567856)------------------------------
% 8.74/2.15  % (2567856)------------------------------
% 8.74/2.15  % (2567857)------------------------------
% 8.74/2.15  % (2567857)------------------------------
% 8.74/2.15  % (2567863)Instruction limit reached! 
% 8.74/2.15  % (2567863)------------------------------
% 8.74/2.15  % (2567863)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567863)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567863)Termination reason: Instruction limit
% 8.74/2.15  % (2567863)Termination phase: Saturation
% 8.74/2.15  % (2567863)Time elapsed: 0.070 s
% 8.74/2.15  % (2567863)Peak memory usage: 90 MB
% 8.74/2.15  % (2567863)Instructions burned: 196 (million)
% 8.74/2.15  % (2567880)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2181605993:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 8.74/2.15  % (2567901)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=197101175:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 8.74/2.15  % (2567880)Instruction limit reached! 
% 8.74/2.15  % (2567880)------------------------------
% 8.74/2.15  % (2567880)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567880)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567880)Termination reason: Instruction limit
% 8.74/2.15  % (2567880)Termination phase: Saturation
% 8.74/2.15  % (2567880)Time elapsed: 0.096 s
% 8.74/2.15  % (2567880)Peak memory usage: 91 MB
% 8.74/2.15  % (2567880)Instructions burned: 158 (million)
% 8.74/2.15  % (2567903)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=4091051373:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 8.74/2.15  % (2567909)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1886032929:i=107_2993 on theBenchmark for (2993ds/107Mi)
% 8.74/2.15  % (2567909)Refutation not found, incomplete strategy
% 8.74/2.15  % (2567909)------------------------------
% 8.74/2.15  % (2567909)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567909)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567909)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.15  % (2567909)Time elapsed: 0.001 s
% 8.74/2.15  % (2567909)Peak memory usage: 87 MB
% 8.74/2.15  % (2567903)Instruction limit reached! 
% 8.74/2.15  % (2567903)------------------------------
% 8.74/2.15  % (2567903)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567903)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567903)Termination reason: Instruction limit
% 8.74/2.15  % (2567903)Termination phase: Saturation
% 8.74/2.15  % (2567903)Time elapsed: 0.055 s
% 8.74/2.15  % (2567903)Peak memory usage: 89 MB
% 8.74/2.15  % (2567903)Instructions burned: 107 (million)
% 8.74/2.15  % (2567918)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2587084745:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2992 on theBenchmark for (2992ds/242Mi)
% 8.74/2.15  % (2567839)First to succeed.
% 8.74/2.15  % (2567839)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2567834"
% 8.74/2.15  % (2567920)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=3612137470:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 8.74/2.15  % (2567909)------------------------------
% 8.74/2.15  % (2567909)------------------------------
% 8.74/2.15  % (2567918)Instruction limit reached! 
% 8.74/2.15  % (2567918)------------------------------
% 8.74/2.15  % (2567918)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.15  % (2567918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.15  % (2567918)CaDiCaL version: 2.1.3
% 8.74/2.15  % (2567918)Termination reason: Instruction limit
% 8.74/2.15  % (2567918)Termination phase: Saturation
% 8.74/2.15  % (2567918)Time elapsed: 0.258 s
% 8.74/2.15  % (2567918)Peak memory usage: 90 MB
% 8.74/2.15  % (2567918)Instructions burned: 242 (million)
% 8.74/2.15  % (2567839)Refutation found. Thanks to Tanya!
% 8.74/2.15  % SZS status Unsatisfiable for theBenchmark
% 8.74/2.15  % SZS output start Proof for theBenchmark
% See solution above
% 9.74/2.43  % (2567839)------------------------------
% 9.74/2.43  % (2567839)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.74/2.43  % (2567839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.74/2.43  % (2567839)CaDiCaL version: 2.1.3
% 9.74/2.43  % (2567839)Termination reason: Refutation
% 9.74/2.43  % (2567839)Time elapsed: 0.854 s
% 9.74/2.43  % (2567839)Peak memory usage: 135 MB
% 9.74/2.43  % (2567839)Instructions burned: 1653 (million)
% 9.74/2.43  % (2567839)------------------------------
% 9.74/2.43  % (2567839)------------------------------
% 9.74/2.43  % (2567834)Success in time 1.28 s
% 9.74/2.43  % Vampire exiting
%------------------------------------------------------------------------------