↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SEU047+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:51:51 PM UTC 2026

% Result   : Theorem 0.09s 0.44s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  10 unt;   2 def)
%            Number of atoms       :   77 (  27 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   73 (  28   ~;  22   |;  13   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  34   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f31,conjecture,
    ! [X0,X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ( subset(X0,X1)
       => ( relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2)
          & relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t97_funct_1) ).

fof(f32,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( relation(X2)
          & function(X2) )
       => ( subset(X0,X1)
         => ( relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2)
            & relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f33,axiom,
    ! [X0,X1,X2] :
      ( relation(X2)
     => ( subset(X0,X1)
       => relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t129_relat_1) ).

fof(f34,axiom,
    ! [X0,X1,X2] :
      ( relation(X2)
     => ( subset(X0,X1)
       => relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t130_relat_1) ).

fof(f58,plain,
    ? [X0,X1,X2] :
      ( ( relation_rng_restriction(X0,X2) != relation_rng_restriction(X1,relation_rng_restriction(X0,X2))
        | relation_rng_restriction(X0,X2) != relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) )
      & subset(X0,X1)
      & relation(X2)
      & function(X2) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f59,plain,
    ? [X0,X1,X2] :
      ( ( relation_rng_restriction(X0,X2) != relation_rng_restriction(X1,relation_rng_restriction(X0,X2))
        | relation_rng_restriction(X0,X2) != relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) )
      & subset(X0,X1)
      & relation(X2)
      & function(X2) ),
    inference(flattening,[],[f58]) ).

fof(f60,plain,
    ! [X0,X1,X2] :
      ( relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2)
      | ~ subset(X0,X1)
      | ~ relation(X2) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2)
      | ~ subset(X0,X1)
      | ~ relation(X2) ),
    inference(flattening,[],[f60]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2)
      | ~ subset(X0,X1)
      | ~ relation(X2) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f63,plain,
    ! [X0,X1,X2] :
      ( relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2)
      | ~ subset(X0,X1)
      | ~ relation(X2) ),
    inference(flattening,[],[f62]) ).

fof(f76,plain,
    ( ( relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13))
      | relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)) )
    & subset(sK11,sK12)
    & relation(sK13)
    & function(sK13) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X0,sK11),skolemize(X1,sK12),skolemize(X2,sK13)],[f59]) ).

fof(f121,plain,
    relation(sK13),
    inference(cnf_transformation,[],[f76]) ).

fof(f122,plain,
    subset(sK11,sK12),
    inference(cnf_transformation,[],[f76]) ).

fof(f123,plain,
    ( relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13))
    | relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f124,plain,
    ! [X2,X0,X1] :
      ( ~ relation(X2)
      | ~ subset(X0,X1)
      | relation_rng_restriction(X0,X2) = relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) ),
    inference(cnf_transformation,[],[f61]) ).

fof(f125,plain,
    ! [X2,X0,X1] :
      ( ~ relation(X2)
      | ~ subset(X0,X1)
      | relation_rng_restriction(X0,X2) = relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) ),
    inference(cnf_transformation,[],[f63]) ).

fof(f127,definition,
    ( spl14_1
  <=> relation_rng_restriction(sK11,sK13) = relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)) ),
    introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).

fof(f129,plain,
    ( relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13))
    | spl14_1 ),
    inference(avatar_component_clause,[],[f127]) ).

fof(f131,definition,
    ( spl14_2
  <=> relation_rng_restriction(sK11,sK13) = relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)) ),
    introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).

fof(f134,plain,
    ( ~ spl14_1
    | ~ spl14_2 ),
    inference(avatar_split_clause,[],[f123,f131,f127]) ).

fof(f265,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | relation_rng_restriction(X0,sK13) = relation_rng_restriction(X1,relation_rng_restriction(X0,sK13)) ),
    inference(resolution,[],[f124,f121]) ).

fof(f285,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | relation_rng_restriction(X0,sK13) = relation_rng_restriction(X0,relation_rng_restriction(X1,sK13)) ),
    inference(resolution,[],[f125,f121]) ).

fof(f292,plain,
    relation_rng_restriction(sK11,sK13) = relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)),
    inference(resolution,[],[f265,f122]) ).

fof(f294,plain,
    spl14_2,
    inference(avatar_split_clause,[],[f292,f131]) ).

fof(f301,plain,
    relation_rng_restriction(sK11,sK13) = relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)),
    inference(resolution,[],[f285,f122]) ).

fof(f303,plain,
    ( $false
    | spl14_1 ),
    inference(forward_subsumption_resolution,[],[f301,f129]) ).

fof(f304,plain,
    spl14_1,
    inference(avatar_contradiction_clause,[],[f303]) ).

cnf(s1,plain,
    ( ~ spl14_1
    | ~ spl14_2 ),
    inference(sat_conversion,[],[f134]) ).

cnf(s2,plain,
    spl14_2,
    inference(sat_conversion,[],[f294]) ).

cnf(s3,plain,
    spl14_1,
    inference(sat_conversion,[],[f304]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

fof(f305,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU047+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 03:27:25 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.44  % (1408666)Will run a generic schedule for satisfiability detection.
% 0.09/0.44  % (1408676)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=746012822:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44  % (1408676) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1408666-1408676"...
% 0.09/0.44  % (1408676)...printing done.
% 0.09/0.44  % (1408676)Refutation found. Thanks to Tanya!
% 0.09/0.44  % SZS status Theorem for theBenchmark
% 0.09/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44  % (1408676)------------------------------
% 0.09/0.44  % (1408676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44  % (1408676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44  % (1408676)CaDiCaL version: 2.1.3
% 0.09/0.44  % (1408676)Termination reason: Refutation
% 0.09/0.44  % (1408676)Time elapsed: 0.003 s
% 0.09/0.44  % (1408676)Peak memory usage: 12 MB
% 0.09/0.44  % (1408676)Instructions burned: 7 (million)
% 0.09/0.44  % (1408666)Success in time 0.029 s
% 0.09/0.44  % Vampire exiting
%------------------------------------------------------------------------------