↑ 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  : SYN728-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 : n002.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.10s 0.26s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (   7 unt;   4 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   61 (  32   ~;  25   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  18   !;   0   ?)

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

fof(f2,negated_conjecture,
    ! [X0] :
      ( m(X0)
      | p(X0,sk1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69_2) ).

fof(f3,negated_conjecture,
    ! [X0] :
      ( q(f(X0,sk1(X0)))
      | p(X0,sk1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69_3) ).

fof(f4,negated_conjecture,
    ! [X0] :
      ( ~ m(g(X0))
      | ~ q(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69_4) ).

fof(f5,negated_conjecture,
    ! [X0] :
      ( ~ p(sk2,sk2)
      | ~ p(g(sk2),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69_5) ).

fof(f7,definition,
    ( spl0_1
  <=> ! [X0] : ~ p(g(sk2),X0) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f8,plain,
    ( ! [X0] : ~ p(g(sk2),X0)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f7]) ).

fof(f10,definition,
    ( spl0_2
  <=> p(sk2,sk2) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f12,plain,
    ( ~ p(sk2,sk2)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f13,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f5,f10,f7]) ).

fof(f15,definition,
    ( spl0_3
  <=> ! [X2,X1] : ~ p(X1,X2) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f16,plain,
    ( ! [X2,X1] : ~ p(X1,X2)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f18,definition,
    ( spl0_4
  <=> ! [X0] : p(X0,X0) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f19,plain,
    ( ! [X0] : p(X0,X0)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f20,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f1,f18,f15]) ).

fof(f21,plain,
    ( ! [X0] : m(X0)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f2,f16]) ).

fof(f22,plain,
    ( ! [X0] : ~ q(X0)
    | ~ spl0_3 ),
    inference(resolution,[],[f21,f4]) ).

fof(f23,plain,
    ( ! [X0] : q(f(X0,sk1(X0)))
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f3,f16]) ).

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

fof(f25,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f24]) ).

fof(f26,plain,
    ( $false
    | spl0_2
    | ~ spl0_4 ),
    inference(resolution,[],[f19,f12]) ).

fof(f27,plain,
    ( spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f28,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f8,f19]) ).

fof(f29,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f28]) ).

cnf(s1,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f13]) ).

cnf(s2,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f20]) ).

cnf(s3,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f25]) ).

cnf(s4,plain,
    ( spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f27]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f29]) ).

cnf(s6,plain,
    spl0_4,
    inference(rat,[],[s2,s3]) ).

cnf(s7,plain,
    ~ spl0_1,
    inference(rat,[],[s5,s6]) ).

cnf(s8,plain,
    spl0_2,
    inference(rat,[],[s4,s6]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s1,s8,s7]) ).

fof(f30,plain,
    $false,
    inference(avatar_sat_refutation,[],[s9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN728-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.19  % Computer : n002.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 16:52:22 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22  Running first-order model finding
% 0.10/0.22  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.10/0.26  % (510400)Will run a generic schedule for satisfiability detection.
% 0.10/0.26  % (510408)dis+10_1_sil=32000:sp=arity:random_seed=991383424:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.26  % (510408) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-510400-510408"...
% 0.10/0.26  % (510408)...printing done.
% 0.10/0.26  % (510408)Refutation found. Thanks to Tanya!
% 0.10/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26  % (510408)------------------------------
% 0.10/0.26  % (510408)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26  % (510408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26  % (510408)CaDiCaL version: 2.1.3
% 0.10/0.26  % (510408)Termination reason: Refutation
% 0.10/0.26  % (510408)Time elapsed: 0.001 s
% 0.10/0.26  % (510408)Peak memory usage: 11 MB
% 0.10/0.26  % (510400)Success in time 0.026 s
% 0.10/0.26  % Vampire exiting
%------------------------------------------------------------------------------