↑ 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  : SYN413+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 02:07:47 PM UTC 2026

% Result   : Theorem 0.27s 0.26s
% Output   : Refutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   36 (  18   ~;   9   |;   4   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   30 (  24   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
      ? [X1] :
      ! [X2] :
        ( f(X2,X1)
      <=> ( f(X2,X0)
          & ~ f(X2,X2) ) )
   => ~ ? [X3] :
        ! [X4] : f(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish256) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
        ? [X1] :
        ! [X2] :
          ( f(X2,X1)
        <=> ( f(X2,X0)
            & ~ f(X2,X2) ) )
     => ~ ? [X3] :
          ! [X4] : f(X4,X3) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ? [X3] :
      ! [X4] : f(X4,X3)
    & ! [X0] :
      ? [X1] :
      ! [X2] :
        ( f(X2,X1)
      <=> ( f(X2,X0)
          & ~ f(X2,X2) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ! [X2,X0] :
      ( ~ f(X2,X2)
      | ~ f(X2,sK1(X0)) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f5,plain,
    ! [X2,X0] :
      ( ~ f(X2,sK1(X0))
      | f(X2,X0) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f6,plain,
    ! [X2,X0] :
      ( f(X2,X2)
      | f(X2,sK1(X0))
      | ~ f(X2,X0) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f7,plain,
    ! [X4] : f(X4,sK0),
    inference(cnf_transformation,[],[f3]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( f(sK1(X0),sK1(X1))
      | ~ f(sK1(X0),X1)
      | ~ f(sK1(X0),sK1(X0)) ),
    inference(resolution,[],[f6,f4]) ).

fof(f13,plain,
    ! [X0] :
      ( f(sK1(X0),sK1(X0))
      | ~ f(sK1(X0),X0) ),
    inference(factoring,[],[f6]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( f(sK1(X0),sK1(X1))
      | ~ f(sK1(X0),X1) ),
    inference(forward_subsumption_resolution,[],[f10,f6]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ f(sK1(X0),X0)
      | ~ f(sK1(X0),sK1(X0)) ),
    inference(resolution,[],[f13,f4]) ).

fof(f18,plain,
    ! [X0] : ~ f(sK1(X0),sK1(X0)),
    inference(forward_subsumption_resolution,[],[f16,f5]) ).

fof(f23,plain,
    ! [X0] : ~ f(sK1(X0),X0),
    inference(resolution,[],[f18,f14]) ).

fof(f36,plain,
    $false,
    inference(resolution,[],[f23,f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN413+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n014.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 15:54:30 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.27/0.26  % (1892412)Will run a generic schedule for satisfiability detection.
% 0.27/0.26  % (1892421)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=523866163:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.27/0.26  % (1892421) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1892412-1892421"...
% 0.27/0.26  % (1892421)...printing done.
% 0.27/0.26  % (1892421)Refutation found. Thanks to Tanya!
% 0.27/0.26  % SZS status Theorem for theBenchmark
% 0.27/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.26  % (1892421)------------------------------
% 0.27/0.26  % (1892421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.26  % (1892421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.26  % (1892421)CaDiCaL version: 2.1.3
% 0.27/0.26  % (1892421)Termination reason: Refutation
% 0.27/0.26  % (1892421)Time elapsed: 0.001 s
% 0.27/0.26  % (1892421)Peak memory usage: 11 MB
% 0.27/0.26  % (1892421)Instructions burned: 1 (million)
% 0.27/0.26  % (1892412)Success in time 0.029 s
% 0.27/0.26  % Vampire exiting
%------------------------------------------------------------------------------