↑ 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  : KRS072+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% 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 11:42:12 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.47s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   72 (   7 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   77 (  31   ~;  24   |;  16   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   35 (  29   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rinvR(X0,X1)
            & ! [X2,X3] :
                ( ( rr(X1,X2)
                  & rr(X1,X3) )
               => X2 = X3 )
            & ? [X4] :
                ( rr(X1,X4)
                & cp1(X4) ) )
        & cp2(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f18,axiom,
    ! [X0] :
      ( cp1(X0)
     => ~ ( cp3(X0)
          | cp2(X0)
          | cp4(X0)
          | cp5(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(f23,axiom,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f52,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rinvR(X0,X1)
            & ! [X2,X3] :
                ( X2 = X3
                | ~ rr(X1,X2)
                | ~ rr(X1,X3) )
            & ? [X4] :
                ( rr(X1,X4)
                & cp1(X4) ) )
        & cp2(X0) ) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f53,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rinvR(X0,X1)
            & ! [X2,X3] :
                ( X2 = X3
                | ~ rr(X1,X2)
                | ~ rr(X1,X3) )
            & ? [X4] :
                ( rr(X1,X4)
                & cp1(X4) ) )
        & cp2(X0) ) ),
    inference(flattening,[],[f52]) ).

fof(f54,plain,
    ! [X0] :
      ( ( ~ cp3(X0)
        & ~ cp2(X0)
        & ~ cp4(X0)
        & ~ cp5(X0) )
      | ~ cp1(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f76,plain,
    ! [X2,X3,X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(sK0(X0),X2)
      | X2 = X3
      | ~ rr(sK0(X0),X3) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f80,plain,
    ! [X0] :
      ( cp1(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f81,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(sK0(X0),sK1(X0)) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f82,plain,
    ! [X0] :
      ( rinvR(X0,sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f83,plain,
    ! [X0] :
      ( cp2(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f86,plain,
    ! [X0] :
      ( ~ cp2(X0)
      | ~ cp1(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f95,plain,
    ! [X0,X1] :
      ( ~ rinvR(X0,X1)
      | rr(X1,X0) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f96,plain,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    inference(cnf_transformation,[],[f23]) ).

fof(f112,plain,
    ! [X0] :
      ( ~ cp1(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f86,f83]) ).

fof(f113,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f112,f80]) ).

fof(f114,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(sK0(X0),X0) ),
    inference(resolution,[],[f95,f82]) ).

fof(f116,plain,
    rr(sK0(i2003_11_14_17_18_50190),sK1(i2003_11_14_17_18_50190)),
    inference(resolution,[],[f81,f96]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ~ rr(sK0(i2003_11_14_17_18_50190),X0)
      | ~ rr(sK0(i2003_11_14_17_18_50190),X1)
      | X0 = X1 ),
    inference(resolution,[],[f76,f96]) ).

fof(f118,plain,
    rr(sK0(i2003_11_14_17_18_50190),i2003_11_14_17_18_50190),
    inference(resolution,[],[f114,f96]) ).

fof(f124,plain,
    ! [X0] :
      ( ~ rr(sK0(i2003_11_14_17_18_50190),X0)
      | i2003_11_14_17_18_50190 = X0 ),
    inference(resolution,[],[f117,f118]) ).

fof(f126,plain,
    i2003_11_14_17_18_50190 = sK1(i2003_11_14_17_18_50190),
    inference(resolution,[],[f124,f116]) ).

fof(f131,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_18_50190)
    | ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
    inference(superposition,[],[f113,f126]) ).

fof(f133,plain,
    ~ cUnsatisfiable(i2003_11_14_17_18_50190),
    inference(duplicate_literal_removal,[],[f131]) ).

fof(f135,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f133,f96]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS072+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  % Computer : n001.cluster.edu
% 0.11/0.40  % Model    : x86_64 x86_64
% 0.11/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40  % Memory   : 8046.5625MB
% 0.11/0.40  % OS       : Linux 6.8.0-71-generic
% 0.11/0.40  % CPULimit : 300
% 0.11/0.40  % WCLimit  : 300
% 0.11/0.40  % DateTime : Sun Sep 27 13:25:16 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 0.11/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  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
% 0.16/0.47  % (3570920)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (3570929)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1806906682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47  % (3570929) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3570920-3570929"...
% 0.16/0.47  % (3570929)...printing done.
% 0.16/0.47  % (3570926)% WARNING: option uhcvi not known.
% 0.16/0.47  % (3570929)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (3570929)------------------------------
% 0.16/0.47  % (3570929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (3570929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (3570929)CaDiCaL version: 2.1.3
% 0.16/0.47  % (3570929)Termination reason: Refutation
% 0.16/0.47  % (3570929)Time elapsed: 0.002 s
% 0.16/0.47  % (3570929)Peak memory usage: 12 MB
% 0.16/0.47  % (3570929)Instructions burned: 2 (million)
% 0.16/0.47  % (3570920)Success in time 0.026 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------