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

% Computer : n015.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:18:09 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.28s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  13 unt;   3 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  25   ~;  27   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   35 (   0 sgn  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p(X2,X1)
      | ~ p(X0,X2)
      | p(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_1) ).

fof(f2,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ q(X2,X1)
      | ~ q(X0,X2)
      | q(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_2) ).

fof(f3,negated_conjecture,
    ! [X0,X1] :
      ( ~ q(X1,X0)
      | q(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_3) ).

fof(f4,negated_conjecture,
    ! [X0,X1] :
      ( p(X0,X1)
      | q(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_4) ).

fof(f5,negated_conjecture,
    ~ p(sk1,sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_5) ).

fof(f6,negated_conjecture,
    ~ q(sk3,sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_6) ).

fof(f8,definition,
    ( spl0_1
  <=> ! [X0,X1] : q(X0,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f9,plain,
    ( ! [X0,X1] : q(X0,X1)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f21,plain,
    q(sk1,sk2),
    inference(resolution,[],[f4,f5]) ).

fof(f22,plain,
    ( $false
    | ~ spl0_1 ),
    inference(resolution,[],[f9,f6]) ).

fof(f24,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f22]) ).

fof(f27,plain,
    q(sk2,sk1),
    inference(resolution,[],[f21,f3]) ).

fof(f32,plain,
    ! [X2,X0,X1] :
      ( ~ p(X0,X1)
      | p(X0,X2)
      | q(X1,X2) ),
    inference(resolution,[],[f1,f4]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ q(X0,sk1)
      | q(X0,sk2) ),
    inference(resolution,[],[f2,f21]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ q(X0,sk2)
      | q(X0,sk1) ),
    inference(resolution,[],[f2,f27]) ).

fof(f41,definition,
    ( spl0_6
  <=> ! [X0] : q(X0,sk2) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f42,plain,
    ( ! [X0] : q(X0,sk2)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f47,plain,
    ( ! [X0] : q(sk2,X0)
    | ~ spl0_6 ),
    inference(resolution,[],[f42,f3]) ).

fof(f48,plain,
    ( ! [X0,X1] :
        ( ~ q(X0,sk2)
        | q(X0,X1) )
    | ~ spl0_6 ),
    inference(resolution,[],[f47,f2]) ).

fof(f51,plain,
    ( ! [X0,X1] : q(X0,X1)
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f48,f42]) ).

fof(f52,plain,
    ( spl0_1
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f51,f41,f8]) ).

fof(f59,definition,
    ( spl0_8
  <=> ! [X0] : q(X0,sk1) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f60,plain,
    ( ! [X0] : q(X0,sk1)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f59]) ).

fof(f67,plain,
    ( ! [X0] : q(X0,sk2)
    | ~ spl0_8 ),
    inference(resolution,[],[f60,f35]) ).

fof(f70,plain,
    ( spl0_6
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f67,f59,f41]) ).

fof(f74,plain,
    ! [X2,X0,X1] :
      ( p(X0,X1)
      | q(X2,X1)
      | q(X0,X2) ),
    inference(resolution,[],[f32,f4]) ).

fof(f75,plain,
    ! [X0] :
      ( q(X0,sk2)
      | q(sk1,X0) ),
    inference(resolution,[],[f74,f5]) ).

fof(f92,plain,
    ! [X0] :
      ( q(X0,sk2)
      | q(X0,sk1) ),
    inference(resolution,[],[f75,f3]) ).

fof(f93,plain,
    ! [X0] : q(X0,sk1),
    inference(forward_subsumption_resolution,[],[f92,f36]) ).

fof(f100,plain,
    spl0_8,
    inference(avatar_split_clause,[],[f93,f59]) ).

cnf(s23,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f24]) ).

cnf(s50,plain,
    ( spl0_1
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f52]) ).

cnf(s64,plain,
    ( spl0_6
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f70]) ).

cnf(s92,plain,
    spl0_8,
    inference(sat_conversion,[],[f100]) ).

cnf(s93,plain,
    spl0_6,
    inference(rat,[],[s64,s92]) ).

cnf(s94,plain,
    spl0_1,
    inference(rat,[],[s50,s93]) ).

cnf(s95,plain,
    $false,
    inference(rat,[],[s23,s94]) ).

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

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