↑ 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  : SEU041+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 : n005.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:50 PM UTC 2026

% Result   : Theorem 0.10s 0.44s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  10 unt;   2 def)
%            Number of atoms       :   76 (  26 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   70 (  27   ~;  23   |;  10   &)
%                                         (   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   :   38 (   0 sgn  32   !;   6   ?)

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

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

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

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

fof(f59,plain,
    ? [X0,X1,X2] :
      ( ( relation_dom_restriction(X2,X0) != relation_dom_restriction(relation_dom_restriction(X2,X0),X1)
        | relation_dom_restriction(X2,X0) != relation_dom_restriction(relation_dom_restriction(X2,X1),X0) )
      & subset(X0,X1)
      & relation(X2)
      & function(X2) ),
    inference(ennf_transformation,[],[f33]) ).

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

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

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

fof(f63,plain,
    ! [X0,X1,X2] :
      ( relation_dom_restriction(relation_dom_restriction(X2,X1),X0) = relation_dom_restriction(X2,X0)
      | ~ subset(X0,X1)
      | ~ relation(X2) ),
    inference(ennf_transformation,[],[f35]) ).

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

fof(f110,plain,
    ( relation_dom_restriction(sK13,sK11) != relation_dom_restriction(relation_dom_restriction(sK13,sK12),sK11)
    | relation_dom_restriction(sK13,sK11) != relation_dom_restriction(relation_dom_restriction(sK13,sK11),sK12) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f112,plain,
    relation(sK13),
    inference(cnf_transformation,[],[f60]) ).

fof(f113,plain,
    subset(sK11,sK12),
    inference(cnf_transformation,[],[f60]) ).

fof(f114,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ relation(X2)
      | relation_dom_restriction(X2,X0) = relation_dom_restriction(relation_dom_restriction(X2,X0),X1) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f115,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ relation(X2)
      | relation_dom_restriction(X2,X0) = relation_dom_restriction(relation_dom_restriction(X2,X1),X0) ),
    inference(cnf_transformation,[],[f64]) ).

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

fof(f119,plain,
    ( relation_dom_restriction(sK13,sK11) != relation_dom_restriction(relation_dom_restriction(sK13,sK11),sK12)
    | spl14_1 ),
    inference(avatar_component_clause,[],[f117]) ).

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

fof(f123,plain,
    ( relation_dom_restriction(sK13,sK11) != relation_dom_restriction(relation_dom_restriction(sK13,sK12),sK11)
    | spl14_2 ),
    inference(avatar_component_clause,[],[f121]) ).

fof(f124,plain,
    ( ~ spl14_1
    | ~ spl14_2 ),
    inference(avatar_split_clause,[],[f110,f121,f117]) ).

fof(f181,plain,
    ! [X0] :
      ( ~ relation(X0)
      | relation_dom_restriction(X0,sK11) = relation_dom_restriction(relation_dom_restriction(X0,sK11),sK12) ),
    inference(resolution,[],[f114,f113]) ).

fof(f193,plain,
    relation_dom_restriction(sK13,sK11) = relation_dom_restriction(relation_dom_restriction(sK13,sK11),sK12),
    inference(resolution,[],[f181,f112]) ).

fof(f194,plain,
    ( $false
    | spl14_1 ),
    inference(forward_subsumption_resolution,[],[f193,f119]) ).

fof(f195,plain,
    spl14_1,
    inference(avatar_contradiction_clause,[],[f194]) ).

fof(f201,plain,
    ! [X0] :
      ( ~ relation(X0)
      | relation_dom_restriction(X0,sK11) = relation_dom_restriction(relation_dom_restriction(X0,sK12),sK11) ),
    inference(resolution,[],[f115,f113]) ).

fof(f216,plain,
    relation_dom_restriction(sK13,sK11) = relation_dom_restriction(relation_dom_restriction(sK13,sK12),sK11),
    inference(resolution,[],[f201,f112]) ).

fof(f217,plain,
    ( $false
    | spl14_2 ),
    inference(forward_subsumption_resolution,[],[f216,f123]) ).

fof(f218,plain,
    spl14_2,
    inference(avatar_contradiction_clause,[],[f217]) ).

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

cnf(s2,plain,
    spl14_1,
    inference(sat_conversion,[],[f195]) ).

cnf(s3,plain,
    spl14_2,
    inference(sat_conversion,[],[f218]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU041+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.10/0.37  % Computer : n005.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 03:26:02 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/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.10/0.44  % (406551)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (406560)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2400579968:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44  % (406560) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-406551-406560"...
% 0.10/0.44  % (406560)...printing done.
% 0.10/0.44  % (406557)% WARNING: option uhcvi not known.
% 0.10/0.44  % (406560)Refutation found. Thanks to Tanya!
% 0.10/0.44  % SZS status Theorem for theBenchmark
% 0.10/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (406560)------------------------------
% 0.10/0.44  % (406560)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (406560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (406560)CaDiCaL version: 2.1.3
% 0.10/0.44  % (406560)Termination reason: Refutation
% 0.10/0.44  % (406560)Time elapsed: 0.003 s
% 0.10/0.44  % (406560)Peak memory usage: 12 MB
% 0.10/0.44  % (406560)Instructions burned: 6 (million)
% 0.10/0.44  % (406551)Success in time 0.03 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------