↑ 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  : SYN066+1 : TPTP v9.3.1. Bugfixed v3.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:38 PM UTC 2026

% Result   : Theorem 0.08s 0.25s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  10 unt;   2 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   47 (  22   ~;  15   |;   4   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  33   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
    ? [X3] :
      ( ( big_p(X2,X0)
       => big_p(X3,X1) )
      & big_p(X3,X0)
      & ( big_p(X3,X1)
       => ? [X4] : big_q(X4,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_1) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( ~ big_p(X0,X1)
     => ? [X2] : big_q(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_2) ).

fof(f3,axiom,
    ( ? [X0,X1] : big_q(X0,X1)
   => ! [X2] : big_r(X2,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_3) ).

fof(f4,conjecture,
    ! [X0] :
    ? [X1] : big_r(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37) ).

fof(f5,negated_conjecture,
    ~ ! [X0] :
      ? [X1] : big_r(X0,X1),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
    ? [X3] :
      ( ( big_p(X3,X1)
        | ~ big_p(X2,X0) )
      & big_p(X3,X0)
      & ( ? [X4] : big_q(X4,X1)
        | ~ big_p(X3,X1) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ? [X2] : big_q(X2,X1)
      | big_p(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f8,plain,
    ( ! [X2] : big_r(X2,X2)
    | ! [X0,X1] : ~ big_q(X0,X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f9,plain,
    ? [X0] :
    ! [X1] : ~ big_r(X0,X1),
    inference(ennf_transformation,[],[f5]) ).

fof(f11,plain,
    ! [X2,X0] :
      ( big_q(sK2(X0),sK0(X0))
      | ~ big_p(sK1(X0,X2),sK0(X0)) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( big_q(sK3(X1),X1)
      | big_p(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( ~ big_q(X0,X1)
      | big_r(X2,X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ! [X1] : ~ big_r(sK4,X1),
    inference(cnf_transformation,[],[f9]) ).

fof(f17,definition,
    ( spl5_1
  <=> ! [X2] : big_r(X2,X2) ),
    introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).

fof(f18,plain,
    ( ! [X2] : big_r(X2,X2)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f20,definition,
    ( spl5_2
  <=> ! [X0,X1] : ~ big_q(X0,X1) ),
    introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).

fof(f21,plain,
    ( ! [X0,X1] : ~ big_q(X0,X1)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f22,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f14,f20,f17]) ).

fof(f23,plain,
    ( ! [X0,X1] : big_p(X0,X1)
    | ~ spl5_2 ),
    inference(resolution,[],[f13,f21]) ).

fof(f24,plain,
    ( ! [X0,X1] : ~ big_p(sK1(X0,X1),sK0(X0))
    | ~ spl5_2 ),
    inference(resolution,[],[f11,f21]) ).

fof(f25,plain,
    ( $false
    | ~ spl5_2 ),
    inference(forward_subsumption_resolution,[],[f24,f23]) ).

fof(f26,plain,
    ~ spl5_2,
    inference(avatar_contradiction_clause,[],[f25]) ).

fof(f27,plain,
    ( $false
    | ~ spl5_1 ),
    inference(resolution,[],[f18,f15]) ).

fof(f28,plain,
    ~ spl5_1,
    inference(avatar_contradiction_clause,[],[f27]) ).

cnf(s1,plain,
    ( spl5_1
    | spl5_2 ),
    inference(sat_conversion,[],[f22]) ).

cnf(s2,plain,
    ~ spl5_2,
    inference(sat_conversion,[],[f26]) ).

cnf(s3,plain,
    ~ spl5_1,
    inference(sat_conversion,[],[f28]) ).

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

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

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