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

% Computer : n005.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:06:30 PM UTC 2026

% Result   : Theorem 0.18s 0.29s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   8 unt;   2 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   27 (  13   ~;   5   |;   0   &)
%                                         (   4 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   2 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,
    ( ( p
     => q )
  <=> ( ~ q
     => ~ p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel1) ).

fof(f2,negated_conjecture,
    ~ ( ( p
       => q )
    <=> ( ~ q
       => ~ p ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ( q
      | ~ p )
  <~> ( ~ p
      | q ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ~ p
    | q ),
    inference(cnf_transformation,[],[f3]) ).

fof(f5,plain,
    ~ q,
    inference(cnf_transformation,[],[f3]) ).

fof(f8,plain,
    p,
    inference(cnf_transformation,[],[f3]) ).

fof(f10,definition,
    ( spl0_1
  <=> q ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f14,definition,
    ( spl0_2
  <=> p ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f17,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f4,f14,f10]) ).

fof(f18,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f5,f10]) ).

fof(f19,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f8,f14]) ).

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

cnf(s2,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f18]) ).

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

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

fof(f20,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

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