↑ 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  : SYN409+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 : n010.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.08s 0.24s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (   6 unt;   4 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   58 (  23   ~;  25   |;   3   &)
%                                         (   6 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?)

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

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

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

fof(f4,plain,
    ( ~ f(sK2)
    | ~ f(sK1)
    | ~ f(sK0) ),
    inference(cnf_transformation,[],[f3]) ).

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

fof(f8,definition,
    ( spl3_1
  <=> f(sK0) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f10,plain,
    ( ~ f(sK0)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f12,definition,
    ( spl3_2
  <=> f(sK1) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f14,plain,
    ( ~ f(sK1)
    | spl3_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f16,definition,
    ( spl3_3
  <=> f(sK2) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

fof(f18,plain,
    ( ~ f(sK2)
    | spl3_3 ),
    inference(avatar_component_clause,[],[f16]) ).

fof(f19,plain,
    ( ~ spl3_1
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f4,f16,f12,f8]) ).

fof(f21,definition,
    ( spl3_4
  <=> ! [X0] : f(X0) ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

fof(f22,plain,
    ( ! [X0] : f(X0)
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f24,plain,
    ( spl3_4
    | spl3_4 ),
    inference(avatar_split_clause,[],[f6,f21,f21]) ).

fof(f25,plain,
    ( $false
    | spl3_1
    | ~ spl3_4 ),
    inference(backward_subsumption_resolution,[],[f10,f22]) ).

fof(f26,plain,
    ( spl3_1
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f25]) ).

fof(f27,plain,
    ( $false
    | spl3_2
    | ~ spl3_4 ),
    inference(forward_subsumption_resolution,[],[f14,f22]) ).

fof(f28,plain,
    ( spl3_2
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f27]) ).

fof(f29,plain,
    ( $false
    | spl3_3
    | ~ spl3_4 ),
    inference(forward_subsumption_resolution,[],[f18,f22]) ).

fof(f30,plain,
    ( spl3_3
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f29]) ).

cnf(s1,plain,
    ( ~ spl3_1
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(sat_conversion,[],[f19]) ).

cnf(s4,plain,
    ( spl3_4
    | spl3_4 ),
    inference(sat_conversion,[],[f24]) ).

cnf(s5,plain,
    spl3_4,
    inference(rat,[],[s4]) ).

cnf(s6,plain,
    ( spl3_1
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f26]) ).

cnf(s7,plain,
    ( spl3_2
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f28]) ).

cnf(s8,plain,
    ( spl3_3
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f30]) ).

cnf(s9,plain,
    spl3_3,
    inference(rat,[],[s8,s5]) ).

cnf(s10,plain,
    spl3_2,
    inference(rat,[],[s7,s5]) ).

cnf(s11,plain,
    spl3_1,
    inference(rat,[],[s6,s5]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s1,s9,s10,s11]) ).

fof(f31,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN409+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17  % Computer : n010.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 15:55:02 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  Running first-order model finding
% 0.08/0.20  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.24  % (2038177)Will run a generic schedule for satisfiability detection.
% 0.08/0.24  % (2038183)% WARNING: option uhcvi not known.
% 0.08/0.24  % (2038183)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2801013047:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.24  % (2038183) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2038177-2038183"...
% 0.08/0.24  % (2038183)...printing done.
% 0.08/0.24  % (2038183)Refutation found. Thanks to Tanya!
% 0.08/0.24  % SZS status Theorem for theBenchmark
% 0.08/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24  % (2038183)------------------------------
% 0.08/0.24  % (2038183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24  % (2038183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24  % (2038183)CaDiCaL version: 2.1.3
% 0.08/0.24  % (2038183)Termination reason: Refutation
% 0.08/0.24  % (2038183)Time elapsed: 0.001 s
% 0.08/0.24  % (2038183)Peak memory usage: 12 MB
% 0.08/0.24  % (2038177)Success in time 0.034 s
% 0.08/0.24  % Vampire exiting
%------------------------------------------------------------------------------