↑ 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  : SYN977+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 : 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:22:59 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( a
    <=> b )
    | a
    | b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ( a
      <=> b )
      | a
      | b ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ( a
    <~> b )
    & ~ a
    & ~ b ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ( ~ b
      | ~ a )
    & ( b
      | a )
    & ~ a
    & ~ b ),
    inference(nnf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ~ b
      | ~ a )
    & ( b
      | a )
    & ~ a
    & ~ b ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ~ b,
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ~ a,
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ( b
    | a ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,definition,
    ( spl0_1
  <=> a ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f15,definition,
    ( spl0_2
  <=> b ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f18,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f8,f15,f11]) ).

fof(f20,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f6,f15]) ).

fof(f21,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f7,f11]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f18]) ).

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f20]) ).

cnf(s4,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f21]) ).

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

fof(f22,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN977+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.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 17:19:06 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.20/0.26  % (1928776)Will run a generic schedule for satisfiability detection.
% 0.20/0.26  % (1928784)dis+10_1_sil=32000:sp=arity:random_seed=2146747344:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.26  % (1928784) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1928776-1928784"...
% 0.20/0.26  % (1928784)...printing done.
% 0.20/0.26  % (1928782)% WARNING: option uhcvi not known.
% 0.20/0.26  % (1928784)Refutation found. Thanks to Tanya!
% 0.20/0.26  % SZS status Theorem for theBenchmark
% 0.20/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26  % (1928784)------------------------------
% 0.20/0.26  % (1928784)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26  % (1928784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26  % (1928784)CaDiCaL version: 2.1.3
% 0.20/0.26  % (1928784)Termination reason: Refutation
% 0.20/0.26  % (1928784)Time elapsed: 0.001 s
% 0.20/0.26  % (1928784)Peak memory usage: 12 MB
% 0.20/0.26  % (1928776)Success in time 0.029 s
% 0.20/0.26  % Vampire exiting
%------------------------------------------------------------------------------