↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN070-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n011.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.26s 0.33s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   42 (   9 unt;   4 def)
%            Number of atoms       :  115 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  135 (  62   ~;  69   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( big_f(f(X0))
      | ~ big_f(X0)
      | big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,axiom,
    ! [X0] :
      ( big_h(f(X0),X0)
      | ~ big_f(X0)
      | big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ big_g(f(X0))
      | ~ big_f(X0)
      | big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f4,axiom,
    ! [X0] :
      ( ~ big_f(X0)
      | big_g(X0)
      | big_f(a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ big_f(X0)
      | big_g(X0)
      | ~ big_g(a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ big_f(X0)
      | big_g(X0)
      | ~ big_f(X1)
      | big_g(X1)
      | big_j(a,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ big_j(X1,X0)
      | ~ big_f(X1)
      | ~ big_h(X0,X1)
      | ~ big_f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

fof(f8,negated_conjecture,
    big_f(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f9,negated_conjecture,
    ~ big_g(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f22,definition,
    ( spl0_4
  <=> big_f(a) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f24,plain,
    ( big_f(a)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f29,definition,
    ( spl0_6
  <=> ! [X0] :
        ( ~ big_f(X0)
        | big_g(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f30,plain,
    ( ! [X0] :
        ( ~ big_f(X0)
        | big_g(X0) )
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f29]) ).

fof(f31,plain,
    ( spl0_4
    | spl0_6 ),
    inference(avatar_split_clause,[],[f4,f29,f22]) ).

fof(f35,definition,
    ( spl0_7
  <=> big_g(a) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f37,plain,
    ( ~ big_g(a)
    | spl0_7 ),
    inference(avatar_component_clause,[],[f35]) ).

fof(f38,plain,
    ( ~ spl0_7
    | spl0_6 ),
    inference(avatar_split_clause,[],[f5,f29,f35]) ).

fof(f39,plain,
    ( big_g(b)
    | ~ spl0_6 ),
    inference(resolution,[],[f30,f8]) ).

fof(f41,plain,
    ( $false
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f39,f9]) ).

fof(f42,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f41]) ).

fof(f60,definition,
    ( spl0_12
  <=> ! [X1] :
        ( ~ big_f(X1)
        | big_j(a,X1)
        | big_g(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f61,plain,
    ( ! [X1] :
        ( big_j(a,X1)
        | ~ big_f(X1)
        | big_g(X1) )
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f60]) ).

fof(f62,plain,
    ( spl0_12
    | spl0_6 ),
    inference(avatar_split_clause,[],[f6,f29,f60]) ).

fof(f82,plain,
    ( ! [X0] :
        ( ~ big_f(X0)
        | big_g(X0)
        | ~ big_f(a)
        | ~ big_h(X0,a)
        | ~ big_f(X0) )
    | ~ spl0_12 ),
    inference(resolution,[],[f61,f7]) ).

fof(f83,plain,
    ( ! [X0] :
        ( ~ big_f(X0)
        | big_g(X0)
        | ~ big_f(a)
        | ~ big_h(X0,a) )
    | ~ spl0_12 ),
    inference(duplicate_literal_removal,[],[f82]) ).

fof(f84,plain,
    ( ! [X0] :
        ( ~ big_h(X0,a)
        | big_g(X0)
        | ~ big_f(X0) )
    | ~ spl0_4
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f83,f24]) ).

fof(f86,plain,
    ( big_g(f(a))
    | ~ big_f(f(a))
    | ~ big_f(a)
    | big_g(a)
    | ~ spl0_4
    | ~ spl0_12 ),
    inference(resolution,[],[f84,f2]) ).

fof(f95,plain,
    ( ~ big_f(f(a))
    | ~ big_f(a)
    | big_g(a)
    | ~ spl0_4
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f86,f3]) ).

fof(f97,plain,
    ( ~ big_f(a)
    | big_g(a)
    | ~ spl0_4
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f95,f1]) ).

fof(f98,plain,
    ( big_g(a)
    | ~ spl0_4
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f97,f24]) ).

fof(f99,plain,
    ( $false
    | ~ spl0_4
    | spl0_7
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f98,f37]) ).

fof(f100,plain,
    ( ~ spl0_4
    | spl0_7
    | ~ spl0_12 ),
    inference(avatar_contradiction_clause,[],[f99]) ).

cnf(s22,plain,
    ( spl0_4
    | spl0_6 ),
    inference(sat_conversion,[],[f31]) ).

cnf(s29,plain,
    ( spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s33,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f42]) ).

cnf(s55,plain,
    ( spl0_6
    | spl0_12 ),
    inference(sat_conversion,[],[f62]) ).

cnf(s73,plain,
    ( ~ spl0_4
    | spl0_7
    | ~ spl0_12 ),
    inference(sat_conversion,[],[f100]) ).

cnf(s74,plain,
    spl0_12,
    inference(rat,[],[s55,s33]) ).

cnf(s77,plain,
    ~ spl0_7,
    inference(rat,[],[s29,s33]) ).

cnf(s78,plain,
    ~ spl0_4,
    inference(rat,[],[s73,s74,s77]) ).

cnf(s79,plain,
    $false,
    inference(rat,[],[s22,s33,s78]) ).

fof(f101,plain,
    $false,
    inference(avatar_sat_refutation,[],[s79]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN070-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24  % Computer : n011.cluster.edu
% 0.09/0.24  % Model    : x86_64 x86_64
% 0.09/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.24  % Memory   : 8046.5625MB
% 0.09/0.24  % OS       : Linux 6.8.0-71-generic
% 0.09/0.24  % CPULimit : 300
% 0.09/0.24  % WCLimit  : 300
% 0.09/0.24  % DateTime : Mon Sep 28 15:29:01 UTC 2026
% 0.09/0.25  % CPUTime  : 
% 0.09/0.25  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.29  Running first-order model finding
% 0.09/0.29  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.26/0.33  % (3468579)Will run a generic schedule for satisfiability detection.
% 0.26/0.33  % (3468586)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3934312054:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.26/0.33  % (3468586) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3468579-3468586"...
% 0.26/0.33  % (3468586)...printing done.
% 0.26/0.33  % (3468586)Refutation found. Thanks to Tanya!
% 0.26/0.33  % SZS status Unsatisfiable for theBenchmark
% 0.26/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.33  % (3468586)------------------------------
% 0.26/0.33  % (3468586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.33  % (3468586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.33  % (3468586)CaDiCaL version: 2.1.3
% 0.26/0.33  % (3468586)Termination reason: Refutation
% 0.26/0.33  % (3468586)Time elapsed: 0.002 s
% 0.26/0.33  % (3468586)Peak memory usage: 12 MB
% 0.26/0.33  % (3468586)Instructions burned: 2 (million)
% 0.26/0.33  % (3468579)Success in time 0.021 s
% 0.26/0.33  % Vampire exiting
%------------------------------------------------------------------------------