↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n001.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 12:58:21 PM UTC 2026

% Result   : Theorem 3.33s 1.35s
% Output   : Refutation 4.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  102 (  25 unt;   6 def)
%            Number of atoms       :  261 (  70 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  254 (  95   ~; 137   |;  11   &)
%                                         (  10 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   86 (   0 sgn  84   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( subq(X0,X1)
    <=> ! [X2] :
          ( mem(X2,X0)
         => mem(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subq_def) ).

fof(f4,axiom,
    ! [X0] : ~ mem(X0,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_ax) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( mem(X0,s(X1))
    <=> X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_ax) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( mem(X0,u(X1,X2))
    <=> ( mem(X0,X1)
        | mem(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_ax) ).

fof(f8,axiom,
    ! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_def) ).

fof(f9,axiom,
    ! [X0] : n(X0) = a(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_def) ).

fof(f26,conjecture,
    ~ subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nsubq_2762_2760) ).

fof(f27,negated_conjecture,
    ~ ~ subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    inference(negated_conjecture,[status(cth)],[f26]) ).

fof(f28,plain,
    subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    inference(flattening,[],[f27]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( subq(X0,X1)
    <=> ! [X2] :
          ( mem(X2,X1)
          | ~ mem(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( subq(X0,X1)
        | ? [X2] :
            ( ~ mem(X2,X1)
            & mem(X2,X0) ) )
      & ( ! [X2] :
            ( mem(X2,X1)
            | ~ mem(X2,X0) )
        | ~ subq(X0,X1) ) ),
    inference(nnf_transformation,[],[f29]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( ( subq(X0,X1)
        | ? [X2] :
            ( ~ mem(X2,X1)
            & mem(X2,X0) ) )
      & ( ! [X3] :
            ( mem(X3,X1)
            | ~ mem(X3,X0) )
        | ~ subq(X0,X1) ) ),
    inference(rectify,[],[f32]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ( subq(X0,X1)
        | ( ~ mem(sK0(X0,X1),X1)
          & mem(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( mem(X3,X1)
            | ~ mem(X3,X0) )
        | ~ subq(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f33]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ( mem(X0,s(X1))
        | X0 != X1 )
      & ( X0 = X1
        | ~ mem(X0,s(X1)) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( ( mem(X0,u(X1,X2))
        | ( ~ mem(X0,X1)
          & ~ mem(X0,X2) ) )
      & ( mem(X0,X1)
        | mem(X0,X2)
        | ~ mem(X0,u(X1,X2)) ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ( mem(X0,u(X1,X2))
        | ( ~ mem(X0,X1)
          & ~ mem(X0,X2) ) )
      & ( mem(X0,X1)
        | mem(X0,X2)
        | ~ mem(X0,u(X1,X2)) ) ),
    inference(flattening,[],[f36]) ).

fof(f41,plain,
    ! [X3,X0,X1] :
      ( ~ subq(X0,X1)
      | ~ mem(X3,X0)
      | mem(X3,X1) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f45,plain,
    ! [X0] : ~ mem(X0,e),
    inference(cnf_transformation,[],[f4]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ mem(X0,s(X1))
      | X0 = X1 ),
    inference(cnf_transformation,[],[f35]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( mem(X0,s(X1))
      | X0 != X1 ),
    inference(cnf_transformation,[],[f35]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( ~ mem(X0,u(X1,X2))
      | mem(X0,X2)
      | mem(X0,X1) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f49,plain,
    ! [X2,X0,X1] :
      ( mem(X0,u(X1,X2))
      | ~ mem(X0,X2) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( mem(X0,u(X1,X2))
      | ~ mem(X0,X1) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f54,plain,
    ! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
    inference(cnf_transformation,[],[f8]) ).

fof(f55,plain,
    ! [X0] : n(X0) = a(X0,X0),
    inference(cnf_transformation,[],[f9]) ).

fof(f58,plain,
    subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    inference(cnf_transformation,[],[f28]) ).

fof(f59,plain,
    ! [X1] : mem(X1,s(X1)),
    inference(equality_resolution,[],[f47]) ).

fof(f62,plain,
    ! [X2,X0,X1] :
      ( mem(X2,a(X0,X1))
      | ~ mem(X2,X0) ),
    inference(superposition,[],[f50,f54]) ).

fof(f63,plain,
    ! [X2,X0,X1] :
      ( ~ mem(X2,s(X1))
      | mem(X2,a(X0,X1)) ),
    inference(superposition,[],[f49,f54]) ).

fof(f64,plain,
    ! [X0] :
      ( mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))) ),
    inference(resolution,[],[f41,f58]) ).

fof(f84,plain,
    ! [X0] :
      ( mem(X0,a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))))
      | mem(X0,u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))) ),
    inference(resolution,[],[f48,f64]) ).

fof(f85,plain,
    ! [X2,X0,X1] :
      ( mem(X2,s(X1))
      | ~ mem(X2,a(X0,X1))
      | mem(X2,X0) ),
    inference(superposition,[],[f48,f54]) ).

fof(f87,plain,
    ! [X0,X1] : mem(X0,a(X1,X0)),
    inference(resolution,[],[f63,f59]) ).

fof(f88,plain,
    ! [X0] : mem(X0,n(X0)),
    inference(superposition,[],[f87,f55]) ).

fof(f131,plain,
    ! [X2,X0,X1] :
      ( ~ mem(X0,a(X1,X2))
      | mem(X0,X1)
      | X0 = X2 ),
    inference(resolution,[],[f85,f46]) ).

fof(f142,plain,
    ! [X0] :
      ( mem(X0,u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))
      | a(n(e),n(n(e))) = X0
      | mem(X0,s(u(n(e),n(s(n(e))))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))) ),
    inference(resolution,[],[f131,f84]) ).

fof(f146,plain,
    ! [X0,X1] :
      ( ~ mem(X1,n(X0))
      | mem(X1,X0)
      | X0 = X1 ),
    inference(superposition,[],[f131,f55]) ).

fof(f147,plain,
    ! [X0] :
      ( mem(X0,a(s(n(s(n(e)))),n(n(n(e)))))
      | mem(X0,s(u(n(e),n(s(n(e))))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))))
      | a(n(e),n(n(e))) = X0
      | mem(X0,s(n(n(e)))) ),
    inference(resolution,[],[f142,f48]) ).

fof(f151,plain,
    ! [X0] :
      ( mem(X0,s(n(n(e))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))))
      | a(n(e),n(n(e))) = X0
      | mem(X0,s(u(n(e),n(s(n(e))))))
      | mem(X0,s(n(s(n(e)))))
      | n(n(n(e))) = X0 ),
    inference(resolution,[],[f147,f131]) ).

fof(f156,plain,
    ! [X0] :
      ( mem(X0,s(n(s(n(e)))))
      | a(n(e),n(n(e))) = X0
      | mem(X0,s(u(n(e),n(s(n(e))))))
      | ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))))
      | n(n(n(e))) = X0
      | n(n(e)) = X0 ),
    inference(resolution,[],[f151,f46]) ).

fof(f162,plain,
    ! [X0] :
      ( ~ mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))))
      | mem(X0,s(u(n(e),n(s(n(e))))))
      | a(n(e),n(n(e))) = X0
      | n(n(n(e))) = X0
      | n(n(e)) = X0
      | n(s(n(e))) = X0 ),
    inference(resolution,[],[f156,f46]) ).

fof(f183,plain,
    ! [X0] :
      ( mem(X0,s(u(n(e),n(s(n(e))))))
      | a(n(e),n(n(e))) = X0
      | n(n(n(e))) = X0
      | n(n(e)) = X0
      | n(s(n(e))) = X0
      | ~ mem(X0,u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))) ),
    inference(resolution,[],[f162,f49]) ).

fof(f200,plain,
    ! [X0] :
      ( ~ mem(X0,u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))
      | n(n(n(e))) = X0
      | n(n(e)) = X0
      | n(s(n(e))) = X0
      | a(n(e),n(n(e))) = X0
      | u(n(e),n(s(n(e)))) = X0 ),
    inference(resolution,[],[f183,f46]) ).

fof(f203,plain,
    ! [X0] :
      ( ~ mem(X0,a(s(n(e)),n(n(e))))
      | n(n(e)) = X0
      | n(s(n(e))) = X0
      | a(n(e),n(n(e))) = X0
      | u(n(e),n(s(n(e)))) = X0
      | n(n(n(e))) = X0 ),
    inference(resolution,[],[f200,f50]) ).

fof(f222,plain,
    ! [X0] :
      ( ~ mem(X0,s(n(e)))
      | n(s(n(e))) = X0
      | a(n(e),n(n(e))) = X0
      | u(n(e),n(s(n(e)))) = X0
      | n(n(n(e))) = X0
      | n(n(e)) = X0 ),
    inference(resolution,[],[f203,f62]) ).

fof(f233,plain,
    ( n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e)))
    | n(e) = u(n(e),n(s(n(e))))
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e)) ),
    inference(resolution,[],[f222,f59]) ).

fof(f239,definition,
    ( spl1_6
  <=> n(e) = n(n(e)) ),
    introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).

fof(f241,plain,
    ( n(e) = n(n(e))
    | ~ spl1_6 ),
    inference(avatar_component_clause,[],[f239]) ).

fof(f243,definition,
    ( spl1_7
  <=> n(e) = n(n(n(e))) ),
    introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).

fof(f245,plain,
    ( n(e) = n(n(n(e)))
    | ~ spl1_7 ),
    inference(avatar_component_clause,[],[f243]) ).

fof(f247,definition,
    ( spl1_8
  <=> n(e) = u(n(e),n(s(n(e)))) ),
    introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).

fof(f249,plain,
    ( n(e) = u(n(e),n(s(n(e))))
    | ~ spl1_8 ),
    inference(avatar_component_clause,[],[f247]) ).

fof(f251,definition,
    ( spl1_9
  <=> n(e) = a(n(e),n(n(e))) ),
    introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).

fof(f253,plain,
    ( n(e) = a(n(e),n(n(e)))
    | ~ spl1_9 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f255,definition,
    ( spl1_10
  <=> n(e) = n(s(n(e))) ),
    introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).

fof(f257,plain,
    ( n(e) = n(s(n(e)))
    | ~ spl1_10 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f258,plain,
    ( spl1_6
    | spl1_7
    | spl1_8
    | spl1_9
    | spl1_10 ),
    inference(avatar_split_clause,[],[f233,f255,f251,f247,f243,f239]) ).

fof(f281,plain,
    ( mem(n(e),n(e))
    | ~ spl1_6 ),
    inference(superposition,[],[f88,f241]) ).

fof(f667,definition,
    ( spl1_25
  <=> e = s(n(e)) ),
    introduced(definition,[new_symbols(definition,[spl1_25])],[avatar_definition]) ).

fof(f668,plain,
    ( e != s(n(e))
    | spl1_25 ),
    inference(avatar_component_clause,[],[f667]) ).

fof(f669,plain,
    ( e = s(n(e))
    | ~ spl1_25 ),
    inference(avatar_component_clause,[],[f667]) ).

fof(f839,plain,
    ( mem(n(n(e)),n(e))
    | ~ spl1_7 ),
    inference(superposition,[],[f88,f245]) ).

fof(f854,plain,
    ( mem(n(n(e)),e)
    | e = n(n(e))
    | ~ spl1_7 ),
    inference(resolution,[],[f146,f839]) ).

fof(f856,plain,
    ( e = n(n(e))
    | ~ spl1_7 ),
    inference(forward_subsumption_resolution,[],[f854,f45]) ).

fof(f878,plain,
    ( mem(n(e),e)
    | ~ spl1_7 ),
    inference(superposition,[],[f88,f856]) ).

fof(f879,plain,
    ( $false
    | ~ spl1_7 ),
    inference(forward_subsumption_resolution,[],[f878,f45]) ).

fof(f880,plain,
    ~ spl1_7,
    inference(avatar_contradiction_clause,[],[f879]) ).

fof(f908,plain,
    ( ! [X0] :
        ( mem(X0,n(e))
        | ~ mem(X0,n(s(n(e)))) )
    | ~ spl1_8 ),
    inference(superposition,[],[f49,f249]) ).

fof(f911,plain,
    ( ! [X0] :
        ( ~ mem(X0,n(s(n(e))))
        | mem(X0,e)
        | e = X0 )
    | ~ spl1_8 ),
    inference(resolution,[],[f908,f146]) ).

fof(f914,plain,
    ( ! [X0] :
        ( ~ mem(X0,n(s(n(e))))
        | e = X0 )
    | ~ spl1_8 ),
    inference(forward_subsumption_resolution,[],[f911,f45]) ).

fof(f918,plain,
    ( e = s(n(e))
    | ~ spl1_8 ),
    inference(resolution,[],[f914,f88]) ).

fof(f933,plain,
    ( spl1_25
    | ~ spl1_8 ),
    inference(avatar_split_clause,[],[f918,f247,f667]) ).

fof(f960,plain,
    ( mem(n(e),e)
    | ~ spl1_25 ),
    inference(superposition,[],[f59,f669]) ).

fof(f968,plain,
    ( $false
    | ~ spl1_25 ),
    inference(forward_subsumption_resolution,[],[f960,f45]) ).

fof(f969,plain,
    ~ spl1_25,
    inference(avatar_contradiction_clause,[],[f968]) ).

fof(f1068,plain,
    ( mem(n(n(e)),n(e))
    | ~ spl1_9 ),
    inference(superposition,[],[f87,f253]) ).

fof(f1073,plain,
    ( mem(n(n(e)),e)
    | e = n(n(e))
    | ~ spl1_9 ),
    inference(resolution,[],[f1068,f146]) ).

fof(f1074,plain,
    ( e = n(n(e))
    | ~ spl1_9 ),
    inference(forward_subsumption_resolution,[],[f1073,f45]) ).

fof(f1105,plain,
    ( mem(n(e),e)
    | ~ spl1_9 ),
    inference(superposition,[],[f88,f1074]) ).

fof(f1108,plain,
    ( $false
    | ~ spl1_9 ),
    inference(forward_subsumption_resolution,[],[f1105,f45]) ).

fof(f1109,plain,
    ~ spl1_9,
    inference(avatar_contradiction_clause,[],[f1108]) ).

fof(f1139,plain,
    ( mem(s(n(e)),n(e))
    | ~ spl1_10 ),
    inference(superposition,[],[f88,f257]) ).

fof(f1168,plain,
    ( mem(s(n(e)),e)
    | e = s(n(e))
    | ~ spl1_10 ),
    inference(resolution,[],[f1139,f146]) ).

fof(f1169,plain,
    ( e = s(n(e))
    | ~ spl1_10 ),
    inference(forward_subsumption_resolution,[],[f1168,f45]) ).

fof(f1170,plain,
    ( $false
    | ~ spl1_10
    | spl1_25 ),
    inference(forward_subsumption_resolution,[],[f1169,f668]) ).

fof(f1171,plain,
    ( ~ spl1_10
    | spl1_25 ),
    inference(avatar_contradiction_clause,[],[f1170]) ).

fof(f1198,plain,
    ( mem(n(e),e)
    | e = n(e)
    | ~ spl1_6 ),
    inference(resolution,[],[f281,f146]) ).

fof(f1199,plain,
    ( e = n(e)
    | ~ spl1_6 ),
    inference(forward_subsumption_resolution,[],[f1198,f45]) ).

fof(f1232,plain,
    ( mem(e,e)
    | ~ spl1_6 ),
    inference(superposition,[],[f281,f1199]) ).

fof(f1245,plain,
    ( $false
    | ~ spl1_6 ),
    inference(forward_subsumption_resolution,[],[f1232,f45]) ).

fof(f1246,plain,
    ~ spl1_6,
    inference(avatar_contradiction_clause,[],[f1245]) ).

cnf(s7,plain,
    ( spl1_6
    | spl1_7
    | spl1_8
    | spl1_9
    | spl1_10 ),
    inference(sat_conversion,[],[f258]) ).

cnf(s20,plain,
    ~ spl1_7,
    inference(sat_conversion,[],[f880]) ).

cnf(s23,plain,
    ( ~ spl1_8
    | spl1_25 ),
    inference(sat_conversion,[],[f933]) ).

cnf(s24,plain,
    ~ spl1_25,
    inference(sat_conversion,[],[f969]) ).

cnf(s28,plain,
    ~ spl1_9,
    inference(sat_conversion,[],[f1109]) ).

cnf(s31,plain,
    ( ~ spl1_10
    | spl1_25 ),
    inference(sat_conversion,[],[f1171]) ).

cnf(s35,plain,
    ~ spl1_6,
    inference(sat_conversion,[],[f1246]) ).

cnf(s37,plain,
    ~ spl1_10,
    inference(rat,[],[s31,s24]) ).

cnf(s38,plain,
    ~ spl1_8,
    inference(rat,[],[s23,s24]) ).

cnf(s40,plain,
    $false,
    inference(rat,[],[s7,s37,s28,s38,s20,s35]) ).

fof(f1434,plain,
    $false,
    inference(avatar_sat_refutation,[],[s40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV569+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n001.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 28 06:44:17 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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
% 3.33/1.35  % (164308)Detected formulas, will run a generic FOF schedule.
% 3.33/1.35  % (164317)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=744376769:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.33/1.35  % (164319)dis-21_1_sil=8000:lcm=predicate:random_seed=1471184166:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.33/1.35  % (164316)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2228203618:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.33/1.35  % (164314)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3154037877:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.33/1.35  % (164313)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=3797872349:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.33/1.35  % (164315)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=344413165:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.33/1.35  % (164316)Refutation not found, incomplete strategy
% 3.33/1.35  % (164316)------------------------------
% 3.33/1.35  % (164316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (164316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (164316)CaDiCaL version: 2.1.3
% 3.33/1.35  % (164316)Termination reason: Refutation not found, incomplete strategy
% 3.33/1.35  % (164316)Time elapsed: 0.001 s
% 3.33/1.35  % (164316)Peak memory usage: 88 MB
% 3.33/1.35  % (164317)Instruction limit reached! 
% 3.33/1.35  % (164317)------------------------------
% 3.33/1.35  % (164317)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (164317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (164317)CaDiCaL version: 2.1.3
% 3.33/1.35  % (164317)Termination reason: Instruction limit
% 3.33/1.35  % (164317)Termination phase: Saturation
% 3.33/1.35  % (164317)Time elapsed: 0.038 s
% 3.33/1.35  % (164317)Peak memory usage: 88 MB
% 3.33/1.35  % (164317)Instructions burned: 119 (million)
% 3.33/1.35  % (164318)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2705345770:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.33/1.35  % (164318)First to succeed.
% 3.33/1.35  % (164318)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-164308"
% 3.33/1.35  % (164319)Instruction limit reached! 
% 3.33/1.35  % (164319)------------------------------
% 3.33/1.35  % (164319)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (164319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (164319)CaDiCaL version: 2.1.3
% 3.33/1.35  % (164319)Termination reason: Instruction limit
% 3.33/1.35  % (164319)Termination phase: Saturation
% 3.33/1.35  % (164319)Time elapsed: 0.071 s
% 3.33/1.35  % (164319)Peak memory usage: 88 MB
% 3.33/1.35  % (164319)Instructions burned: 130 (million)
% 3.33/1.35  % (164327)lrs+10_1_sil=8000:sp=occurrence:random_seed=2268796131:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.33/1.35  % (164328)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1299350853:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.33/1.35  % (164327)Instruction limit reached! 
% 3.33/1.35  % (164327)------------------------------
% 3.33/1.35  % (164327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (164327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (164327)CaDiCaL version: 2.1.3
% 3.33/1.35  % (164327)Termination reason: Instruction limit
% 3.33/1.35  % (164327)Termination phase: Saturation
% 3.33/1.35  % (164327)Time elapsed: 0.096 s
% 3.33/1.35  % (164327)Peak memory usage: 91 MB
% 3.33/1.35  % (164327)Instructions burned: 286 (million)
% 3.33/1.35  % (164316)------------------------------
% 3.33/1.35  % (164316)------------------------------
% 3.33/1.35  % (164328)Instruction limit reached! 
% 3.33/1.35  % (164328)------------------------------
% 3.33/1.35  % (164328)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (164328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (164328)CaDiCaL version: 2.1.3
% 3.33/1.35  % (164328)Termination reason: Instruction limit
% 3.33/1.35  % (164328)Termination phase: Saturation
% 3.33/1.35  % (164328)Time elapsed: 0.078 s
% 3.33/1.35  % (164328)Peak memory usage: 89 MB
% 3.33/1.35  % (164328)Instructions burned: 158 (million)
% 3.33/1.35  % (164318)Refutation found. Thanks to Tanya!
% 3.33/1.35  % SZS status Theorem for theBenchmark
% 3.33/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 4.11/1.53  % (164318)------------------------------
% 4.11/1.53  % (164318)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.11/1.53  % (164318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.53  % (164318)CaDiCaL version: 2.1.3
% 4.11/1.53  % (164318)Termination reason: Refutation
% 4.11/1.53  % (164318)Time elapsed: 0.054 s
% 4.11/1.53  % (164318)Peak memory usage: 90 MB
% 4.11/1.53  % (164318)Instructions burned: 89 (million)
% 4.11/1.53  % (164318)------------------------------
% 4.11/1.53  % (164318)------------------------------
% 4.11/1.53  % (164308)Success in time 0.494 s
% 4.11/1.53  % Vampire exiting
%------------------------------------------------------------------------------