↑ 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  : NUN088+2 : TPTP v9.3.1. Released v7.3.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 12:27:07 PM UTC 2026

% Result   : Theorem 0.13s 0.45s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   30 (   7 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   35 (  18   ~;  11   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (  14   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( ~ r1(X2)
          | X2 != X1 )
      | ~ r2(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).

fof(f12,conjecture,
    ! [X0] :
      ( ! [X1] :
          ( ~ r1(X1)
          | X1 != X0 )
      | ! [X2] :
          ( ~ r1(X2)
          | ~ r2(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqone) ).

fof(f13,negated_conjecture,
    ~ ! [X0] :
        ( ! [X1] :
            ( ~ r1(X1)
            | X1 != X0 )
        | ! [X2] :
            ( ~ r1(X2)
            | ~ r2(X2,X0) ) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ? [X0] :
      ( ? [X1] :
          ( r1(X1)
          & X0 = X1 )
      & ? [X2] :
          ( r1(X2)
          & r2(X2,X0) ) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f24,plain,
    ( r1(sK21)
    & sK20 = sK21
    & r1(sK22)
    & r2(sK22,sK20) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22)],[f14]) ).

fof(f63,plain,
    ! [X2,X0,X1] :
      ( ~ r1(X2)
      | X1 != X2
      | ~ r2(X0,X1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f64,plain,
    r2(sK22,sK20),
    inference(cnf_transformation,[],[f24]) ).

fof(f66,plain,
    sK20 = sK21,
    inference(cnf_transformation,[],[f24]) ).

fof(f67,plain,
    r1(sK21),
    inference(cnf_transformation,[],[f24]) ).

fof(f71,plain,
    r2(sK22,sK21),
    inference(definition_unfolding,[],[f64,f66]) ).

fof(f81,plain,
    ! [X2,X0] :
      ( ~ r2(X0,X2)
      | ~ r1(X2) ),
    inference(equality_resolution,[],[f63]) ).

fof(f92,plain,
    ~ r1(sK21),
    inference(resolution,[],[f71,f81]) ).

fof(f93,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f92,f67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN088+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38  % Computer : n001.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 27 22:05:47 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  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.13/0.45  % (4004865)Will run a generic schedule for satisfiability detection.
% 0.13/0.45  % (4004872)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2232709328:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.45  % (4004872) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4004865-4004872"...
% 0.13/0.45  % (4004872)...printing done.
% 0.13/0.45  % (4004872)Refutation found. Thanks to Tanya!
% 0.13/0.45  % SZS status Theorem for theBenchmark
% 0.13/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.45  % (4004872)------------------------------
% 0.13/0.45  % (4004872)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.45  % (4004872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.45  % (4004872)CaDiCaL version: 2.1.3
% 0.13/0.45  % (4004872)Termination reason: Refutation
% 0.13/0.45  % (4004872)Time elapsed: 0.001 s
% 0.13/0.45  % (4004872)Peak memory usage: 12 MB
% 0.13/0.45  % (4004872)Instructions burned: 2 (million)
% 0.13/0.45  % (4004865)Success in time 0.025 s
% 0.13/0.45  % Vampire exiting
%------------------------------------------------------------------------------