↑ 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  : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n003.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 12:05:43 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   33 (  15 unt;   2 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  25   ~;  19   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    9 (   8 usr;   3 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    at(something,here,now),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_is_here_now) ).

fof(f2,axiom,
    ! [X0,X1] : ~ held(X0,let_go(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cant_hold_and_let_go) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ at(X0,here,X1)
      | red(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',everything_is_red) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( ~ at(X0,X1,X2)
      | at(X0,X1,let_go(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_let_go) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ at(X0,X1,X2)
      | at(X0,X1,pick_up(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_pick_up) ).

fof(f6,axiom,
    ! [X2,X0,X1] :
      ( ~ at(X0,X1,X2)
      | grabbed(X0,pick_up(go(X1,let_go(X2)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_grab_if_previously_let_go) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ red(X0)
      | ~ put(X0,there,X1)
      | answer(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',answer_if_red_and_put_there) ).

fof(f8,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ grabbed(X0,X2)
      | ~ at(X0,X1,X2)
      | put(X0,X3,go(X3,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).

fof(f9,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ at(X0,X2,X1)
      | held(X0,X1)
      | at(X0,X2,go(X3,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thing_either_held_or_went_there) ).

fof(f10,negated_conjecture,
    ! [X0] : ~ answer(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_an_answer_situation) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ red(X0)
      | ~ put(X0,there,X1) ),
    inference(forward_subsumption_resolution,[],[f7,f10]) ).

fof(f12,plain,
    red(something),
    inference(resolution,[],[f3,f1]) ).

fof(f13,plain,
    at(something,here,let_go(now)),
    inference(resolution,[],[f4,f1]) ).

fof(f14,plain,
    ! [X0] : ~ put(something,there,X0),
    inference(resolution,[],[f12,f11]) ).

fof(f16,plain,
    grabbed(something,pick_up(go(here,let_go(now)))),
    inference(resolution,[],[f6,f1]) ).

fof(f26,plain,
    ! [X0] :
      ( held(something,let_go(now))
      | at(something,here,go(X0,let_go(now))) ),
    inference(resolution,[],[f9,f13]) ).

fof(f36,plain,
    ! [X0] : at(something,here,go(X0,let_go(now))),
    inference(forward_subsumption_resolution,[],[f26,f2]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( ~ at(something,X0,pick_up(go(here,let_go(now))))
      | put(something,X1,go(X1,pick_up(go(here,let_go(now))))) ),
    inference(resolution,[],[f16,f8]) ).

fof(f65,definition,
    ( spl0_7
  <=> ! [X1] : put(something,X1,go(X1,pick_up(go(here,let_go(now))))) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f66,plain,
    ( ! [X1] : put(something,X1,go(X1,pick_up(go(here,let_go(now)))))
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f65]) ).

fof(f68,definition,
    ( spl0_8
  <=> ! [X0] : ~ at(something,X0,pick_up(go(here,let_go(now)))) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f69,plain,
    ( ! [X0] : ~ at(something,X0,pick_up(go(here,let_go(now))))
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f68]) ).

fof(f70,plain,
    ( spl0_7
    | spl0_8 ),
    inference(avatar_split_clause,[],[f63,f68,f65]) ).

fof(f99,plain,
    ! [X0] : at(something,here,pick_up(go(X0,let_go(now)))),
    inference(resolution,[],[f36,f5]) ).

fof(f167,plain,
    ( $false
    | ~ spl0_7 ),
    inference(resolution,[],[f66,f14]) ).

fof(f168,plain,
    ~ spl0_7,
    inference(avatar_contradiction_clause,[],[f167]) ).

fof(f227,plain,
    ( $false
    | ~ spl0_8 ),
    inference(resolution,[],[f99,f69]) ).

fof(f233,plain,
    ~ spl0_8,
    inference(avatar_contradiction_clause,[],[f227]) ).

cnf(s4,plain,
    ( spl0_7
    | spl0_8 ),
    inference(sat_conversion,[],[f70]) ).

cnf(s10,plain,
    ~ spl0_7,
    inference(sat_conversion,[],[f168]) ).

cnf(s13,plain,
    ~ spl0_8,
    inference(sat_conversion,[],[f233]) ).

cnf(s14,plain,
    $false,
    inference(rat,[],[s4,s13,s10]) ).

fof(f234,plain,
    $false,
    inference(avatar_sat_refutation,[],[s14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n003.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 17:41:56 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.43  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.19/0.46  % (816699)Will run a generic schedule for satisfiability detection.
% 0.19/0.46  % (816710)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2282543716:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.19/0.46  % (816710) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-816699-816710"...
% 0.19/0.46  % (816706)% WARNING: option uhcvi not known.
% 0.19/0.46  % (816710)...printing done.
% 0.19/0.46  % (816710)Refutation found. Thanks to Tanya!
% 0.19/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46  % (816710)------------------------------
% 0.19/0.46  % (816710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46  % (816710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46  % (816710)CaDiCaL version: 2.1.3
% 0.19/0.46  % (816710)Termination reason: Refutation
% 0.19/0.46  % (816710)Time elapsed: 0.002 s
% 0.19/0.46  % (816710)Peak memory usage: 12 MB
% 0.19/0.46  % (816710)Instructions burned: 4 (million)
% 0.19/0.46  % (816699)Success in time 0.018 s
% 0.19/0.46  % Vampire exiting
%------------------------------------------------------------------------------