↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% 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:58:19 AM UTC 2026

% Result   : Unsatisfiable 71.87s 10.73s
% Output   : Refutation 71.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   30
% Syntax   : Number of formulae    :  206 ( 142 unt;  19 def)
%            Number of atoms       :  286 (  42 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  172 (  92   ~;  80   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :   12 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   26 (  26 usr;  21 con; 0-2 aty)
%            Number of variables   :  170 ( 170   !;   0   ?)

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

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

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

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(implies(p,q),equivalent(q,or(p,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(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))),
    inference(definition_unfolding,[],[f11,f12,f6,f12]) ).

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

fof(f29,plain,
    or(p,q) = sF4,
    inference(reorient_equations,[],[f28]) ).

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

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

fof(f32,definition,
    sF6 = not(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

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

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

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

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

fof(f37,plain,
    or(sF7,q) = 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 = or(sF6,sF9),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f41,plain,
    or(sF6,sF9) = 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(sF2,sF11),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f45,plain,
    or(sF2,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,sF1),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f51,plain,
    or(sF14,sF1) = 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,plain,
    ~ theorem(sF18),
    inference(definition_folding,[],[f19,f57,f55,f53,f51,f23,f21,f49,f43,f41,f39,f37,f35,f29,f33,f31,f29,f27,f47,f45,f43,f41,f39,f37,f35,f29,f33,f31,f29,f27,f25,f23,f21]) ).

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

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

fof(f61,plain,
    ! [X0] : axiom(or(sF0,or(X0,p))),
    inference(superposition,[],[f14,f21]) ).

fof(f64,plain,
    ! [X0] : axiom(or(sF7,or(X0,sF4))),
    inference(superposition,[],[f14,f35]) ).

fof(f67,plain,
    ! [X0] : axiom(or(sF11,or(X0,sF10))),
    inference(superposition,[],[f14,f43]) ).

fof(f68,plain,
    ! [X0] : axiom(or(sF14,or(X0,sF11))),
    inference(superposition,[],[f14,f49]) ).

fof(f73,plain,
    axiom(or(not(q),sF4)),
    inference(superposition,[],[f14,f29]) ).

fof(f74,plain,
    axiom(or(not(q),sF8)),
    inference(superposition,[],[f14,f37]) ).

fof(f83,plain,
    axiom(or(sF3,sF8)),
    inference(forward_demodulation,[],[f74,f27]) ).

fof(f84,plain,
    axiom(or(sF3,sF4)),
    inference(forward_demodulation,[],[f73,f27]) ).

fof(f86,plain,
    axiom(sF5),
    inference(forward_demodulation,[],[f84,f31]) ).

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

fof(f95,plain,
    axiom(or(not(sF17),or(sF16,sF13))),
    inference(superposition,[],[f15,f55]) ).

fof(f97,plain,
    axiom(or(not(or(q,p)),sF4)),
    inference(superposition,[],[f15,f29]) ).

fof(f99,plain,
    axiom(or(not(or(sF1,sF14)),sF15)),
    inference(superposition,[],[f15,f51]) ).

fof(f104,plain,
    axiom(or(sF18,or(sF16,sF13))),
    inference(forward_demodulation,[],[f95,f57]) ).

fof(f112,plain,
    theorem(sF5),
    inference(resolution,[],[f86,f7]) ).

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

fof(f121,plain,
    ! [X0] :
      ( ~ theorem(or(sF13,X0))
      | theorem(X0)
      | ~ theorem(sF12) ),
    inference(superposition,[],[f18,f47]) ).

fof(f122,plain,
    ! [X0] :
      ( ~ theorem(or(sF16,X0))
      | theorem(X0)
      | ~ theorem(sF15) ),
    inference(superposition,[],[f18,f53]) ).

fof(f124,plain,
    ! [X0] :
      ( ~ theorem(or(sF6,X0))
      | theorem(X0) ),
    inference(forward_subsumption_resolution,[],[f117,f112]) ).

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

fof(f127,plain,
    ! [X0] : axiom(or(not(or(X0,sF4)),or(p,or(X0,q)))),
    inference(superposition,[],[f16,f29]) ).

fof(f131,plain,
    ! [X0] : axiom(or(not(or(X0,sF10)),or(sF6,or(X0,sF9)))),
    inference(superposition,[],[f16,f41]) ).

fof(f132,plain,
    ! [X0] : axiom(or(not(or(X0,sF12)),or(sF2,or(X0,sF11)))),
    inference(superposition,[],[f16,f45]) ).

fof(f139,plain,
    ! [X0] : axiom(or(not(or(sF6,or(X0,sF9))),or(X0,sF10))),
    inference(superposition,[],[f16,f41]) ).

fof(f140,plain,
    ! [X0] : axiom(or(not(or(sF2,or(X0,sF11))),or(X0,sF12))),
    inference(superposition,[],[f16,f45]) ).

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

fof(f144,plain,
    ! [X0,X1] : axiom(or(not(or(sF0,X0)),or(not(or(X1,p)),or(X1,X0)))),
    inference(superposition,[],[f17,f21]) ).

fof(f150,plain,
    ! [X0,X1] : axiom(or(not(or(sF11,X0)),or(not(or(X1,sF10)),or(X1,X0)))),
    inference(superposition,[],[f17,f43]) ).

fof(f155,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF1),or(sF0,X0)))),
    inference(superposition,[],[f17,f23]) ).

fof(f163,plain,
    ! [X0] : axiom(or(not(or(not(X0),q)),or(not(or(sF0,X0)),sF1))),
    inference(superposition,[],[f17,f23]) ).

fof(f169,plain,
    ! [X0] : axiom(or(not(or(not(X0),sF11)),or(not(or(sF2,X0)),sF12))),
    inference(superposition,[],[f17,f45]) ).

fof(f178,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f155,f25]) ).

fof(f184,plain,
    ! [X0] : axiom(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f178,f27]) ).

fof(f187,plain,
    theorem(or(sF3,sF8)),
    inference(resolution,[],[f83,f7]) ).

fof(f191,plain,
    ! [X0] : theorem(or(sF0,or(X0,p))),
    inference(resolution,[],[f61,f7]) ).

fof(f200,plain,
    ! [X0] : theorem(or(sF7,or(X0,sF4))),
    inference(resolution,[],[f64,f7]) ).

fof(f205,plain,
    ! [X0] : theorem(or(sF11,or(X0,sF10))),
    inference(resolution,[],[f67,f7]) ).

fof(f206,plain,
    ! [X0] : theorem(or(sF14,or(X0,sF11))),
    inference(resolution,[],[f68,f7]) ).

fof(f211,plain,
    theorem(or(sF18,or(sF16,sF13))),
    inference(resolution,[],[f104,f7]) ).

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

fof(f253,plain,
    theorem(or(not(or(q,p)),sF4)),
    inference(resolution,[],[f97,f7]) ).

fof(f257,plain,
    theorem(or(not(or(sF1,sF14)),sF15)),
    inference(resolution,[],[f99,f7]) ).

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

fof(f337,plain,
    axiom(or(not(or(sF7,sF4)),or(p,sF8))),
    inference(superposition,[],[f127,f37]) ).

fof(f350,plain,
    ! [X0] : theorem(or(not(or(X0,sF10)),or(sF6,or(X0,sF9)))),
    inference(resolution,[],[f131,f7]) ).

fof(f353,plain,
    ! [X0] : theorem(or(not(or(X0,sF12)),or(sF2,or(X0,sF11)))),
    inference(resolution,[],[f132,f7]) ).

fof(f397,plain,
    ! [X0] : theorem(or(not(or(sF6,or(X0,sF9))),or(X0,sF10))),
    inference(resolution,[],[f139,f7]) ).

fof(f400,plain,
    ! [X0] : theorem(or(not(or(sF2,or(X0,sF11))),or(X0,sF12))),
    inference(resolution,[],[f140,f7]) ).

fof(f426,plain,
    ! [X0] : theorem(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
    inference(resolution,[],[f184,f7]) ).

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

fof(f458,plain,
    axiom(or(not(or(sF7,q)),or(not(or(sF0,sF4)),sF1))),
    inference(superposition,[],[f163,f35]) ).

fof(f468,plain,
    axiom(or(not(sF8),or(not(or(sF0,sF4)),sF1))),
    inference(forward_demodulation,[],[f458,f37]) ).

fof(f472,plain,
    axiom(or(sF9,or(not(or(sF0,sF4)),sF1))),
    inference(forward_demodulation,[],[f468,f39]) ).

fof(f572,plain,
    ! [X0] : theorem(or(not(or(not(X0),sF11)),or(not(or(sF2,X0)),sF12))),
    inference(resolution,[],[f169,f7]) ).

fof(f578,plain,
    axiom(or(not(or(sF9,sF11)),or(not(or(sF2,sF8)),sF12))),
    inference(superposition,[],[f169,f39]) ).

fof(f606,plain,
    ! [X0,X1] : theorem(or(not(or(sF0,X0)),or(not(or(X1,p)),or(X1,X0)))),
    inference(resolution,[],[f144,f7]) ).

fof(f699,plain,
    ! [X0,X1] : theorem(or(not(or(sF11,X0)),or(not(or(X1,sF10)),or(X1,X0)))),
    inference(resolution,[],[f150,f7]) ).

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

fof(f799,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X0) ),
    inference(resolution,[],[f300,f221]) ).

fof(f917,plain,
    theorem(or(not(or(sF7,sF4)),or(p,sF8))),
    inference(resolution,[],[f337,f7]) ).

fof(f955,plain,
    theorem(or(sF9,or(not(or(sF0,sF4)),sF1))),
    inference(resolution,[],[f472,f7]) ).

fof(f1003,plain,
    ! [X0] :
      ( theorem(or(sF6,or(X0,sF9)))
      | ~ theorem(or(X0,sF10)) ),
    inference(resolution,[],[f350,f18]) ).

fof(f1022,plain,
    ! [X0] :
      ( theorem(or(sF2,or(X0,sF11)))
      | ~ theorem(or(X0,sF12)) ),
    inference(resolution,[],[f353,f18]) ).

fof(f1084,plain,
    ! [X0] :
      ( ~ theorem(or(sF6,or(X0,sF9)))
      | theorem(or(X0,sF10)) ),
    inference(resolution,[],[f397,f18]) ).

fof(f1138,plain,
    ! [X0] :
      ( theorem(or(sF2,or(sF0,X0)))
      | ~ theorem(or(sF3,X0)) ),
    inference(resolution,[],[f426,f18]) ).

fof(f1192,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f435,f221]) ).

fof(f1199,plain,
    ! [X0] : theorem(or(X0,or(not(or(sF2,or(X0,sF11))),sF12))),
    inference(resolution,[],[f435,f400]) ).

fof(f1201,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f435,f60]) ).

fof(f1202,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(resolution,[],[f435,f87]) ).

fof(f1233,plain,
    ! [X0] : theorem(or(X0,or(sF7,sF4))),
    inference(resolution,[],[f435,f200]) ).

fof(f1237,plain,
    ! [X0] : theorem(or(X0,or(sF11,sF10))),
    inference(resolution,[],[f435,f205]) ).

fof(f1241,plain,
    ! [X0] : theorem(or(X0,or(sF14,sF11))),
    inference(resolution,[],[f435,f206]) ).

fof(f1246,plain,
    theorem(or(sF16,or(sF18,sF13))),
    inference(resolution,[],[f435,f211]) ).

fof(f1396,plain,
    theorem(or(sF11,sF10)),
    inference(resolution,[],[f1237,f124]) ).

fof(f1446,plain,
    theorem(or(sF14,sF11)),
    inference(resolution,[],[f1241,f124]) ).

fof(f1456,plain,
    theorem(or(sF11,sF14)),
    inference(resolution,[],[f1446,f300]) ).

fof(f1507,plain,
    ( theorem(or(sF18,sF13))
    | ~ theorem(sF15) ),
    inference(resolution,[],[f1246,f122]) ).

fof(f1562,plain,
    theorem(or(not(or(sF9,sF11)),or(not(or(sF2,sF8)),sF12))),
    inference(resolution,[],[f578,f7]) ).

fof(f1729,plain,
    ! [X0] :
      ( theorem(or(not(or(sF2,X0)),sF12))
      | ~ theorem(or(not(X0),sF11)) ),
    inference(resolution,[],[f572,f18]) ).

fof(f1766,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,p)),or(X0,X1)))
      | ~ theorem(or(sF0,X1)) ),
    inference(resolution,[],[f606,f18]) ).

fof(f1872,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,sF10)),or(X0,X1)))
      | ~ theorem(or(sF11,X1)) ),
    inference(resolution,[],[f699,f18]) ).

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

fof(f1943,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X2,or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f756,f435]) ).

fof(f1985,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f1201,f124]) ).

fof(f2005,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f1985,f300]) ).

fof(f2030,plain,
    ( theorem(not(sF13))
    | ~ theorem(sF12) ),
    inference(resolution,[],[f2005,f121]) ).

fof(f2192,plain,
    theorem(or(not(or(sF0,sF4)),or(sF9,sF1))),
    inference(resolution,[],[f955,f435]) ).

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

fof(f2224,plain,
    ! [X0] :
      ( theorem(or(not(or(X0,sF16)),X0))
      | ~ theorem(sF15) ),
    inference(resolution,[],[f1202,f122]) ).

fof(f2287,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF10))
      | theorem(or(X0,sF9)) ),
    inference(resolution,[],[f1003,f124]) ).

fof(f2362,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF9))
      | theorem(or(X0,sF10)) ),
    inference(resolution,[],[f1084,f221]) ).

fof(f2491,plain,
    ! [X0] :
      ( theorem(or(sF0,or(sF2,X0)))
      | ~ theorem(or(sF3,X0)) ),
    inference(resolution,[],[f1138,f435]) ).

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

fof(f3008,plain,
    ! [X0] :
      ( theorem(or(not(or(sF2,or(not(X0),sF11))),sF12))
      | ~ theorem(X0) ),
    inference(resolution,[],[f1199,f18]) ).

fof(f3339,plain,
    theorem(or(sF11,sF9)),
    inference(resolution,[],[f2287,f1396]) ).

fof(f3355,plain,
    theorem(or(sF9,sF11)),
    inference(resolution,[],[f3339,f300]) ).

fof(f3617,plain,
    ( theorem(or(not(or(sF2,sF8)),sF12))
    | ~ theorem(or(sF9,sF11)) ),
    inference(resolution,[],[f1562,f18]) ).

fof(f3620,plain,
    theorem(or(not(or(sF2,sF8)),sF12)),
    inference(forward_subsumption_resolution,[],[f3617,f3355]) ).

fof(f4400,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f1942,f59]) ).

fof(f4431,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f1942,f87]) ).

fof(f4535,plain,
    ! [X0] :
      ( theorem(or(X0,or(p,sF8)))
      | ~ theorem(or(X0,or(sF7,sF4))) ),
    inference(resolution,[],[f1942,f917]) ).

fof(f4574,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(q,p)))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f1942,f253]) ).

fof(f4590,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF2,sF8)))
      | theorem(or(X0,sF12)) ),
    inference(resolution,[],[f1942,f3620]) ).

fof(f4591,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(sF2,X1)))
      | theorem(or(X0,sF12))
      | ~ theorem(or(not(X1),sF11)) ),
    inference(resolution,[],[f1942,f1729]) ).

fof(f4592,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF1,sF14)))
      | theorem(or(X0,sF15)) ),
    inference(resolution,[],[f1942,f257]) ).

fof(f4599,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,X2))
      | theorem(or(X0,X1))
      | ~ theorem(not(X2)) ),
    inference(resolution,[],[f1942,f799]) ).

fof(f4604,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f1942,f1202]) ).

fof(f4652,plain,
    ! [X0] : theorem(or(X0,or(p,sF8))),
    inference(forward_subsumption_resolution,[],[f4535,f1233]) ).

fof(f4653,plain,
    ! [X0] : theorem(or(p,or(X0,sF8))),
    inference(resolution,[],[f4652,f435]) ).

fof(f5149,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(sF6,X0)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f1943,f124]) ).

fof(f6052,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF16))
      | theorem(X0)
      | ~ theorem(sF15) ),
    inference(resolution,[],[f2224,f18]) ).

fof(f6330,plain,
    ! [X0,X1] :
      ( theorem(or(X1,not(or(X1,not(X0)))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f2214,f300]) ).

fof(f8631,plain,
    ! [X0] :
      ( theorem(or(not(or(X0,p)),X0))
      | ~ theorem(or(sF0,X0)) ),
    inference(resolution,[],[f4400,f1766]) ).

fof(f8892,plain,
    theorem(or(sF0,sF4)),
    inference(resolution,[],[f4574,f191]) ).

fof(f9204,plain,
    ( theorem(or(not(or(sF1,sF10)),sF15))
    | ~ theorem(or(sF11,sF14)) ),
    inference(resolution,[],[f4592,f1872]) ).

fof(f9257,plain,
    theorem(or(not(or(sF1,sF10)),sF15)),
    inference(forward_subsumption_resolution,[],[f9204,f1456]) ).

fof(f9387,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X2,X1)) ),
    inference(resolution,[],[f2519,f87]) ).

fof(f9530,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF9,sF1)))
      | ~ theorem(or(sF0,sF4)) ),
    inference(resolution,[],[f2519,f2192]) ).

fof(f9666,plain,
    ! [X0] : theorem(or(X0,or(sF9,sF1))),
    inference(forward_subsumption_resolution,[],[f9530,f8892]) ).

fof(f9944,plain,
    theorem(or(sF9,sF1)),
    inference(resolution,[],[f9666,f124]) ).

fof(f10046,plain,
    theorem(or(sF1,sF9)),
    inference(resolution,[],[f9944,f300]) ).

fof(f10060,plain,
    theorem(or(sF1,sF10)),
    inference(resolution,[],[f10046,f2362]) ).

fof(f13465,plain,
    ! [X0] :
      ( theorem(or(sF18,X0))
      | ~ theorem(not(sF13))
      | ~ theorem(sF15) ),
    inference(resolution,[],[f4599,f1507]) ).

fof(f14054,plain,
    ! [X0] :
      ( ~ theorem(or(sF2,or(not(X0),sF11)))
      | theorem(sF12)
      | ~ theorem(X0) ),
    inference(resolution,[],[f3008,f18]) ).

fof(f17203,plain,
    ! [X0] :
      ( theorem(or(sF2,or(sF11,X0)))
      | ~ theorem(or(X0,sF12)) ),
    inference(resolution,[],[f4431,f1022]) ).

fof(f29755,plain,
    ( theorem(or(p,sF12))
    | ~ theorem(or(not(sF8),sF11)) ),
    inference(resolution,[],[f4591,f4653]) ).

fof(f29833,plain,
    ( ~ theorem(or(sF9,sF11))
    | theorem(or(p,sF12)) ),
    inference(forward_demodulation,[],[f29755,f39]) ).

fof(f29857,plain,
    theorem(or(p,sF12)),
    inference(forward_subsumption_resolution,[],[f29833,f3355]) ).

fof(f41077,plain,
    ( theorem(sF15)
    | ~ theorem(or(sF1,sF10)) ),
    inference(resolution,[],[f9257,f18]) ).

fof(f41082,plain,
    theorem(sF15),
    inference(forward_subsumption_resolution,[],[f41077,f10060]) ).

fof(f67823,plain,
    ( ~ theorem(not(sF13))
    | ~ theorem(sF15)
    | theorem(sF18)
    | ~ theorem(sF15) ),
    inference(resolution,[],[f13465,f6052]) ).

fof(f67827,plain,
    ( ~ theorem(not(sF13))
    | ~ theorem(sF15)
    | theorem(sF18) ),
    inference(duplicate_literal_removal,[],[f67823]) ).

fof(f67828,plain,
    ( ~ theorem(not(sF13))
    | theorem(sF18) ),
    inference(forward_subsumption_resolution,[],[f67827,f41082]) ).

fof(f67852,plain,
    ~ theorem(not(sF13)),
    inference(forward_subsumption_resolution,[],[f67828,f58]) ).

fof(f67857,plain,
    ~ theorem(sF12),
    inference(resolution,[],[f67852,f2030]) ).

fof(f73768,plain,
    ( theorem(or(sF0,sF12))
    | ~ theorem(or(sF3,sF8)) ),
    inference(resolution,[],[f4590,f2491]) ).

fof(f73816,plain,
    theorem(or(sF0,sF12)),
    inference(forward_subsumption_resolution,[],[f73768,f187]) ).

fof(f126580,plain,
    ! [X0] :
      ( theorem(sF12)
      | ~ theorem(or(sF11,not(X0)))
      | ~ theorem(or(sF2,X0)) ),
    inference(resolution,[],[f14054,f4604]) ).

fof(f126623,plain,
    ! [X0] :
      ( ~ theorem(or(sF11,not(X0)))
      | ~ theorem(or(sF2,X0)) ),
    inference(forward_subsumption_resolution,[],[f126580,f67857]) ).

fof(f126739,plain,
    ! [X0] :
      ( ~ theorem(or(sF2,or(sF11,not(X0))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f126623,f6330]) ).

fof(f126961,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF12))
      | ~ theorem(X0) ),
    inference(resolution,[],[f126739,f17203]) ).

fof(f127179,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF12))
      | ~ theorem(or(sF6,X0)) ),
    inference(resolution,[],[f126961,f5149]) ).

fof(f130322,plain,
    ( ~ theorem(or(sF6,or(sF12,p)))
    | ~ theorem(or(sF0,sF12)) ),
    inference(resolution,[],[f127179,f8631]) ).

fof(f130442,plain,
    ~ theorem(or(sF6,or(sF12,p))),
    inference(forward_subsumption_resolution,[],[f130322,f73816]) ).

fof(f130920,plain,
    ~ theorem(or(p,sF12)),
    inference(resolution,[],[f130442,f9387]) ).

fof(f130927,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f130920,f29857]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL304-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48  % Computer : n019.cluster.edu
% 0.22/0.48  % Model    : x86_64 x86_64
% 0.22/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48  % Memory   : 8046.5625MB
% 0.22/0.48  % OS       : Linux 6.8.0-71-generic
% 0.22/0.48  % CPULimit : 300
% 0.22/0.48  % WCLimit  : 300
% 0.22/0.48  % DateTime : Sun Sep 27 15:33:33 UTC 2026
% 0.22/0.48  % CPUTime  : 
% 0.22/0.48  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.27/0.53  Running first-order model finding
% 0.27/0.53  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 43.75/6.78  % (3214284)Will run a generic schedule for satisfiability detection.
% 43.75/6.78  % (3214294)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1668882445:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 43.75/6.78  % (3214290)% WARNING: option uhcvi not known.
% 43.75/6.78  % (3214295)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2046683661:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 43.75/6.78  % (3214290)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1481897017:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 43.75/6.78  % (3214293)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1447812716:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 43.75/6.78  % (3214291)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4011396653:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 43.75/6.78  % (3214292)dis+10_1_sil=32000:sp=arity:random_seed=2208826376:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 43.75/6.78  % (3214289)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2016340558_2999 on theBenchmark for (2999ds/0Mi)
% 43.75/6.78  % TRYING [1]
% 43.75/6.78  % TRYING [2]
% 43.75/6.78  % TRYING [3]
% 43.75/6.78  % TRYING [4]
% 43.75/6.78  % (3214294)Instruction limit reached! 
% 43.75/6.78  % (3214294)------------------------------
% 43.75/6.78  % (3214294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.75/6.78  % (3214294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.75/6.78  % (3214294)CaDiCaL version: 2.1.3
% 43.75/6.78  % (3214294)Termination reason: Instruction limit
% 43.75/6.78  % (3214294)Termination phase: Saturation
% 43.75/6.78  % (3214294)Time elapsed: 0.072 s
% 43.75/6.78  % (3214294)Peak memory usage: 13 MB
% 43.75/6.78  % (3214294)Instructions burned: 133 (million)
% 43.75/6.78  % (3214293)Instruction limit reached! 
% 43.75/6.78  % (3214293)------------------------------
% 43.75/6.78  % (3214293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.75/6.78  % (3214293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.75/6.78  % (3214293)CaDiCaL version: 2.1.3
% 43.75/6.78  % (3214293)Termination reason: Instruction limit
% 43.75/6.78  % (3214293)Termination phase: Saturation
% 43.75/6.78  % (3214293)Time elapsed: 0.094 s
% 43.75/6.78  % (3214293)Peak memory usage: 11 MB
% 43.75/6.78  % (3214293)Instructions burned: 117 (million)
% 43.75/6.78  % (3214292)Instruction limit reached! 
% 43.75/6.78  % (3214292)------------------------------
% 43.75/6.78  % (3214292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.75/6.78  % (3214292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.75/6.78  % (3214292)CaDiCaL version: 2.1.3
% 43.75/6.78  % (3214292)Termination reason: Instruction limit
% 43.75/6.78  % (3214292)Termination phase: Saturation
% 43.75/6.78  % (3214292)Time elapsed: 0.101 s
% 43.75/6.78  % (3214292)Peak memory usage: 12 MB
% 43.75/6.78  % (3214292)Instructions burned: 103 (million)
% 43.75/6.78  % (3214303)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3366071416:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 43.75/6.78  % TRYING [1]
% 43.75/6.78  % TRYING [2]
% 43.75/6.78  % TRYING [3]
% 43.75/6.78  % (3214304)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2798737185:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 43.75/6.78  % (3214305)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2558083756:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 43.75/6.78  % TRYING [4]
% 43.75/6.78  % (3214295)Instruction limit reached! 
% 43.75/6.78  % (3214295)------------------------------
% 43.75/6.78  % (3214295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.75/6.78  % (3214295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.75/6.78  % (3214295)CaDiCaL version: 2.1.3
% 43.75/6.78  % (3214295)Termination reason: Instruction limit
% 43.75/6.78  % (3214295)Termination phase: Saturation
% 43.75/6.78  % (3214295)Time elapsed: 0.175 s
% 43.75/6.78  % (3214295)Peak memory usage: 13 MB
% 43.75/6.78  % (3214295)Instructions burned: 159 (million)
% 43.75/6.78  % (3214309)ott-21_1_sil=16000:fs=off:random_seed=4121824863:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 43.75/6.78  % (3214304)Instruction limit reached! 
% 43.75/6.78  % (3214304)------------------------------
% 43.75/6.78  % (3214304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.75/6.78  % (3214304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214304)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214304)Termination reason: Instruction limit
% 70.66/10.59  % (3214304)Termination phase: Saturation
% 70.66/10.59  % (3214304)Time elapsed: 0.121 s
% 70.66/10.59  % (3214304)Peak memory usage: 12 MB
% 70.66/10.59  % (3214304)Instructions burned: 132 (million)
% 70.66/10.59  % (3214311)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2522038200:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 70.66/10.59  % (3214309)Instruction limit reached! 
% 70.66/10.59  % (3214309)------------------------------
% 70.66/10.59  % (3214309)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214309)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214309)Termination reason: Instruction limit
% 70.66/10.59  % (3214309)Termination phase: Saturation
% 70.66/10.59  % (3214309)Time elapsed: 0.156 s
% 70.66/10.59  % (3214309)Peak memory usage: 12 MB
% 70.66/10.59  % (3214309)Instructions burned: 181 (million)
% 70.66/10.59  % TRYING [5]
% 70.66/10.59  % TRYING [5]
% 70.66/10.59  % (3214313)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1461300364:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 70.66/10.59  % TRYING [1]
% 70.66/10.59  % TRYING [2]
% 70.66/10.59  % TRYING [3]
% 70.66/10.59  % TRYING [4]
% 70.66/10.59  % (3214303)Instruction limit reached! 
% 70.66/10.59  % (3214303)------------------------------
% 70.66/10.59  % (3214303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214303)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214303)Termination reason: Instruction limit
% 70.66/10.59  % (3214303)Termination phase: Finite model building SAT solving
% 70.66/10.59  % (3214303)Time elapsed: 0.405 s
% 70.66/10.59  % (3214303)Peak memory usage: 15 MB
% 70.66/10.59  % (3214303)Instructions burned: 716 (million)
% 70.66/10.59  % (3214315)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1531658153:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 70.66/10.59  % TRYING [5]
% 70.66/10.59  % (3214311)Instruction limit reached! 
% 70.66/10.59  % (3214311)------------------------------
% 70.66/10.59  % (3214311)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214311)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214311)Termination reason: Instruction limit
% 70.66/10.59  % (3214311)Termination phase: Saturation
% 70.66/10.59  % (3214311)Time elapsed: 0.438 s
% 70.66/10.59  % (3214311)Peak memory usage: 12 MB
% 70.66/10.59  % (3214311)Instructions burned: 478 (million)
% 70.66/10.59  % (3214305)Instruction limit reached! 
% 70.66/10.59  % (3214305)------------------------------
% 70.66/10.59  % (3214305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214305)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214305)Termination reason: Instruction limit
% 70.66/10.59  % (3214305)Termination phase: Saturation
% 70.66/10.59  % (3214305)Time elapsed: 0.644 s
% 70.66/10.59  % (3214305)Peak memory usage: 17 MB
% 70.66/10.59  % (3214305)Instructions burned: 684 (million)
% 70.66/10.59  % (3214317)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1902121445:i=889:ins=1_2992 on theBenchmark for (2992ds/889Mi)
% 70.66/10.59  % (3214318)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3036899342:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 70.66/10.59  % TRYING [14]
% 70.66/10.59  % (3214313)Instruction limit reached! 
% 70.66/10.59  % (3214313)------------------------------
% 70.66/10.59  % (3214313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 70.66/10.59  % (3214313)CaDiCaL version: 2.1.3
% 70.66/10.59  % (3214313)Termination reason: Instruction limit
% 70.66/10.59  % (3214313)Termination phase: Finite model building SAT solving
% 70.66/10.59  % (3214313)Time elapsed: 0.739 s
% 70.66/10.59  % (3214313)Peak memory usage: 13 MB
% 70.66/10.59  % (3214313)Instructions burned: 866 (million)
% 70.66/10.59  % (3214315)Instruction limit reached! 
% 70.66/10.59  % (3214315)------------------------------
% 70.66/10.59  % (3214315)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 70.66/10.59  % (3214315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214315)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214315)Termination reason: Instruction limit
% 71.87/10.73  % (3214315)Termination phase: Saturation
% 71.87/10.73  % (3214315)Time elapsed: 0.630 s
% 71.87/10.73  % (3214315)Peak memory usage: 26 MB
% 71.87/10.73  % (3214315)Instructions burned: 1181 (million)
% 71.87/10.73  % (3214322)fmb+10_1_sil=64000:random_seed=2032111239:i=22061:nm=2:gsp=on_2987 on theBenchmark for (2987ds/22061Mi)
% 71.87/10.73  % TRYING [1]
% 71.87/10.73  % TRYING [2]
% 71.87/10.73  % TRYING [3]
% 71.87/10.73  % (3214321)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2680826324:i=879:kws=inv_precedence:fsr=off_2987 on theBenchmark for (2987ds/879Mi)
% 71.87/10.73  % TRYING [4]
% 71.87/10.73  % TRYING [5]
% 71.87/10.73  % (3214318)Instruction limit reached! 
% 71.87/10.73  % (3214318)------------------------------
% 71.87/10.73  % (3214318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214318)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214318)Termination reason: Instruction limit
% 71.87/10.73  % (3214318)Termination phase: Saturation
% 71.87/10.73  % (3214318)Time elapsed: 0.540 s
% 71.87/10.73  % (3214318)Peak memory usage: 28 MB
% 71.87/10.73  % (3214318)Instructions burned: 692 (million)
% 71.87/10.73  % (3214317)Instruction limit reached! 
% 71.87/10.73  % (3214317)------------------------------
% 71.87/10.73  % (3214317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214317)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214317)Termination reason: Instruction limit
% 71.87/10.73  % (3214317)Termination phase: Finite model building constraint generation
% 71.87/10.73  % (3214317)Time elapsed: 0.615 s
% 71.87/10.73  % (3214317)Peak memory usage: 69 MB
% 71.87/10.73  % (3214317)Instructions burned: 890 (million)
% 71.87/10.73  % (3214325)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=4285138044:i=9515:nm=5_2985 on theBenchmark for (2985ds/9515Mi)
% 71.87/10.73  % TRYING [20]
% 71.87/10.73  % (3214326)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=550000508:fmbsr=1.7:i=920_2985 on theBenchmark for (2985ds/920Mi)
% 71.87/10.73  % TRYING [8]
% 71.87/10.73  % (3214321)Instruction limit reached! 
% 71.87/10.73  % (3214321)------------------------------
% 71.87/10.73  % (3214321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214321)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214321)Termination reason: Instruction limit
% 71.87/10.73  % (3214321)Termination phase: Saturation
% 71.87/10.73  % (3214321)Time elapsed: 0.769 s
% 71.87/10.73  % (3214321)Peak memory usage: 18 MB
% 71.87/10.73  % (3214321)Instructions burned: 879 (million)
% 71.87/10.73  % (3214329)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3695178993:i=5131_2979 on theBenchmark for (2979ds/5131Mi)
% 71.87/10.73  % (3214326)Instruction limit reached! 
% 71.87/10.73  % (3214326)------------------------------
% 71.87/10.73  % (3214326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214326)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214326)Termination reason: Instruction limit
% 71.87/10.73  % (3214326)Termination phase: Finite model building SAT solving
% 71.87/10.73  % (3214326)Time elapsed: 0.777 s
% 71.87/10.73  % (3214326)Peak memory usage: 50 MB
% 71.87/10.73  % (3214326)Instructions burned: 920 (million)
% 71.87/10.73  % (3214331)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1756600162:i=1472:ins=7:fdi=8:gsp=on_2976 on theBenchmark for (2976ds/1472Mi)
% 71.87/10.73  % TRYING [6]
% 71.87/10.73  % (3214331)Instruction limit reached! 
% 71.87/10.73  % (3214331)------------------------------
% 71.87/10.73  % (3214331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214331)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214331)Termination reason: Instruction limit
% 71.87/10.73  % (3214331)Termination phase: Saturation
% 71.87/10.73  % (3214331)Time elapsed: 1.372 s
% 71.87/10.73  % (3214331)Peak memory usage: 32 MB
% 71.87/10.73  % (3214331)Instructions burned: 1472 (million)
% 71.87/10.73  % (3214333)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=110768860:i=6324_2962 on theBenchmark for (2962ds/6324Mi)
% 71.87/10.73  % TRYING [77]
% 71.87/10.73  % TRYING [6]
% 71.87/10.73  % (3214329)Instruction limit reached! 
% 71.87/10.73  % (3214329)------------------------------
% 71.87/10.73  % (3214329)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214329)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214329)Termination reason: Instruction limit
% 71.87/10.73  % (3214329)Termination phase: Saturation
% 71.87/10.73  % (3214329)Time elapsed: 4.126 s
% 71.87/10.73  % (3214329)Peak memory usage: 25 MB
% 71.87/10.73  % (3214329)Instructions burned: 5132 (million)
% 71.87/10.73  % (3214335)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1798299118:fmbsr=2.30978:i=2174_2937 on theBenchmark for (2937ds/2174Mi)
% 71.87/10.73  % TRYING [16]
% 71.87/10.73  % (3214335)Instruction limit reached! 
% 71.87/10.73  % (3214335)------------------------------
% 71.87/10.73  % (3214335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214335)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214335)Termination reason: Instruction limit
% 71.87/10.73  % (3214335)Termination phase: Finite model building constraint generation
% 71.87/10.73  % (3214335)Time elapsed: 1.354 s
% 71.87/10.73  % (3214335)Peak memory usage: 131 MB
% 71.87/10.73  % (3214335)Instructions burned: 2176 (million)
% 71.87/10.73  % (3214342)ott-2_1_sil=16000:newcnf=on:random_seed=1770466609:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2923 on theBenchmark for (2923ds/869Mi)
% 71.87/10.73  % (3214325)Instruction limit reached! 
% 71.87/10.73  % (3214325)------------------------------
% 71.87/10.73  % (3214325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214325)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214325)Termination reason: Instruction limit
% 71.87/10.73  % (3214325)Termination phase: Finite model building constraint generation
% 71.87/10.73  % (3214325)Time elapsed: 6.263 s
% 71.87/10.73  % (3214325)Peak memory usage: 545 MB
% 71.87/10.73  % (3214325)Instructions burned: 9515 (million)
% 71.87/10.73  % (3214373)ott+10_1_sil=32000:tgt=ground:random_seed=1769187183:i=5114:av=off_2921 on theBenchmark for (2921ds/5114Mi)
% 71.87/10.73  % (3214333)Instruction limit reached! 
% 71.87/10.73  % (3214333)------------------------------
% 71.87/10.73  % (3214333)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214333)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214333)Termination reason: Instruction limit
% 71.87/10.73  % (3214333)Termination phase: Finite model building constraint generation
% 71.87/10.73  % (3214333)Time elapsed: 4.120 s
% 71.87/10.73  % (3214333)Peak memory usage: 457 MB
% 71.87/10.73  % (3214333)Instructions burned: 6327 (million)
% 71.87/10.73  % (3214437)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=444934652:i=54282_2920 on theBenchmark for (2920ds/54282Mi)
% 71.87/10.73  % TRYING [1]
% 71.87/10.73  % TRYING [2]
% 71.87/10.73  % TRYING [3]
% 71.87/10.73  % TRYING [4]
% 71.87/10.73  % (3214342)Instruction limit reached! 
% 71.87/10.73  % (3214342)------------------------------
% 71.87/10.73  % (3214342)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214342)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214342)Termination reason: Instruction limit
% 71.87/10.73  % (3214342)Termination phase: Saturation
% 71.87/10.73  % (3214342)Time elapsed: 0.513 s
% 71.87/10.73  % (3214342)Peak memory usage: 14 MB
% 71.87/10.73  % (3214342)Instructions burned: 870 (million)
% 71.87/10.73  % (3214501)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=206280774:i=3512:aac=none_2918 on theBenchmark for (2918ds/3512Mi)
% 71.87/10.73  % TRYING [5]
% 71.87/10.73  % (3214501)Instruction limit reached! 
% 71.87/10.73  % (3214501)------------------------------
% 71.87/10.73  % (3214501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214501)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214501)Termination reason: Instruction limit
% 71.87/10.73  % (3214501)Termination phase: Saturation
% 71.87/10.73  % (3214501)Time elapsed: 1.638 s
% 71.87/10.73  % (3214501)Peak memory usage: 24 MB
% 71.87/10.73  % (3214501)Instructions burned: 3512 (million)
% 71.87/10.73  % (3214503)dis+21_1_sil=32000:sas=cadical:random_seed=3857839943:i=3773:amm=off_2901 on theBenchmark for (2901ds/3773Mi)
% 71.87/10.73  % TRYING [7]
% 71.87/10.73  % (3214373) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3214284-3214373"...
% 71.87/10.73  % (3214373)...printing done.
% 71.87/10.73  % (3214373)Refutation found. Thanks to Tanya!
% 71.87/10.73  % SZS status Unsatisfiable for theBenchmark
% 71.87/10.73  % SZS output start Proof for theBenchmark
% See solution above
% 71.87/10.73  % (3214373)------------------------------
% 71.87/10.73  % (3214373)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 71.87/10.73  % (3214373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 71.87/10.73  % (3214373)CaDiCaL version: 2.1.3
% 71.87/10.73  % (3214373)Termination reason: Refutation
% 71.87/10.73  % (3214373)Time elapsed: 2.323 s
% 71.87/10.73  % (3214373)Peak memory usage: 37 MB
% 71.87/10.73  % (3214373)Instructions burned: 3912 (million)
% 71.87/10.73  % (3214284)Success in time 10.18 s
% 71.87/10.73  % Vampire exiting
%------------------------------------------------------------------------------