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

% Computer : n017.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:15 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.43s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   7 unt;   0 def)
%            Number of atoms       :   50 (  14 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   52 (  19   ~;  13   |;  14   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   29 (  21   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1,X2] :
            ( rr(X0,X1)
            & rr(X0,X2)
            & X1 != X2 )
        & ! [X1,X2] :
            ( ( rr(X0,X1)
              & rr(X0,X2) )
           => X1 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f14,axiom,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(f15,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1,X2] :
            ( rr(X0,X1)
            & rr(X0,X2)
            & X1 != X2 )
        & ! [X3,X4] :
            ( ( rr(X0,X3)
              & rr(X0,X4) )
           => X3 = X4 ) ) ),
    inference(rectify,[],[f12]) ).

fof(f34,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1,X2] :
            ( rr(X0,X1)
            & rr(X0,X2)
            & X1 != X2 )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X3)
            | ~ rr(X0,X4) ) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f35,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1,X2] :
            ( rr(X0,X1)
            & rr(X0,X2)
            & X1 != X2 )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X3)
            | ~ rr(X0,X4) ) ) ),
    inference(flattening,[],[f34]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | sK2(X0) != sK3(X0) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f51,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(X0,sK3(X0)) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f52,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(X0,sK2(X0)) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f56,plain,
    ! [X3,X0,X4] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X3)
      | X3 = X4
      | ~ rr(X0,X4) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f58,plain,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    inference(cnf_transformation,[],[f14]) ).

fof(f69,plain,
    rr(i2003_11_14_17_20_14253,sK3(i2003_11_14_17_20_14253)),
    inference(resolution,[],[f51,f58]) ).

fof(f70,plain,
    rr(i2003_11_14_17_20_14253,sK2(i2003_11_14_17_20_14253)),
    inference(resolution,[],[f52,f58]) ).

fof(f71,plain,
    sK3(i2003_11_14_17_20_14253) != sK2(i2003_11_14_17_20_14253),
    inference(resolution,[],[f50,f58]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( ~ rr(i2003_11_14_17_20_14253,X0)
      | ~ rr(i2003_11_14_17_20_14253,X1)
      | X0 = X1 ),
    inference(resolution,[],[f56,f58]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ rr(i2003_11_14_17_20_14253,X0)
      | sK3(i2003_11_14_17_20_14253) = X0 ),
    inference(resolution,[],[f72,f69]) ).

fof(f82,plain,
    sK3(i2003_11_14_17_20_14253) = sK2(i2003_11_14_17_20_14253),
    inference(resolution,[],[f75,f70]) ).

fof(f83,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f82,f71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS095+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 13:18:35 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.43  % (2550446)Will run a generic schedule for satisfiability detection.
% 0.10/0.43  % (2550455)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3254305706:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.43  % (2550455) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2550446-2550455"...
% 0.10/0.43  % (2550455)...printing done.
% 0.10/0.43  % (2550455)Refutation found. Thanks to Tanya!
% 0.10/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (2550455)------------------------------
% 0.10/0.44  % (2550455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (2550455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (2550455)CaDiCaL version: 2.1.3
% 0.10/0.44  % (2550455)Termination reason: Refutation
% 0.10/0.44  % (2550455)Time elapsed: 0.001 s
% 0.10/0.44  % (2550455)Peak memory usage: 11 MB
% 0.10/0.44  % (2550455)Instructions burned: 2 (million)
% 0.10/0.44  % (2550446)Success in time 0.026 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------