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

% Computer : n014.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:19 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   29 (   4 unt;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   63 (  25   ~;  38   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] :
      ( ~ f(y(X0))
      | g(y(X0))
      | ~ f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f2,negated_conjecture,
    ! [X0] :
      ( f(y(X0))
      | f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

fof(f3,negated_conjecture,
    ! [X0] :
      ( ~ g(y(X0))
      | f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f4,negated_conjecture,
    ! [X0] :
      ( ~ f(y(X0))
      | h(y(X0))
      | ~ g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

fof(f5,negated_conjecture,
    ! [X0] :
      ( f(y(X0))
      | g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

fof(f6,negated_conjecture,
    ! [X0] :
      ( ~ h(y(X0))
      | g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

fof(f8,negated_conjecture,
    ! [X0] :
      ( ~ g(y(X0))
      | h(y(X0))
      | ~ h(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f9,negated_conjecture,
    ! [X0] :
      ( ~ f(y(X0))
      | g(y(X0))
      | h(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).

fof(f10,negated_conjecture,
    ! [X0] :
      ( ~ h(y(X0))
      | h(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).

fof(f11,negated_conjecture,
    ! [X0] :
      ( ~ f(z(X0))
      | ~ g(z(X0))
      | ~ h(z(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).

fof(f12,plain,
    ! [X0] :
      ( g(y(X0))
      | ~ f(X0)
      | g(X0) ),
    inference(resolution,[],[f1,f5]) ).

fof(f23,plain,
    ! [X0] :
      ( h(y(X0))
      | ~ h(X0)
      | ~ f(X0)
      | g(X0) ),
    inference(resolution,[],[f8,f12]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ h(X0)
      | ~ f(X0)
      | g(X0) ),
    inference(forward_subsumption_resolution,[],[f23,f6]) ).

fof(f28,plain,
    ! [X0] :
      ( g(y(X0))
      | h(X0)
      | g(X0) ),
    inference(resolution,[],[f9,f5]) ).

fof(f29,plain,
    ! [X0] :
      ( g(y(X0))
      | h(X0)
      | f(X0) ),
    inference(resolution,[],[f9,f2]) ).

fof(f30,plain,
    ! [X0] :
      ( h(X0)
      | f(X0) ),
    inference(forward_subsumption_resolution,[],[f29,f3]) ).

fof(f31,plain,
    ! [X0] :
      ( f(y(X0))
      | h(X0) ),
    inference(resolution,[],[f30,f10]) ).

fof(f34,plain,
    ! [X0] :
      ( ~ h(z(X0))
      | ~ f(z(X0)) ),
    inference(forward_subsumption_resolution,[],[f11,f24]) ).

fof(f36,plain,
    ! [X0] :
      ( h(X0)
      | h(y(X0))
      | ~ g(X0) ),
    inference(resolution,[],[f31,f4]) ).

fof(f40,plain,
    ! [X0] :
      ( ~ g(X0)
      | h(X0) ),
    inference(forward_subsumption_resolution,[],[f36,f10]) ).

fof(f42,plain,
    ! [X0] :
      ( h(y(X0))
      | ~ f(X0)
      | g(X0) ),
    inference(resolution,[],[f40,f12]) ).

fof(f43,plain,
    ! [X0] :
      ( ~ f(X0)
      | g(X0) ),
    inference(forward_subsumption_resolution,[],[f42,f6]) ).

fof(f44,plain,
    ! [X0] :
      ( g(y(X0))
      | h(X0) ),
    inference(forward_subsumption_resolution,[],[f28,f40]) ).

fof(f47,plain,
    ! [X0] :
      ( g(y(X0))
      | f(X0) ),
    inference(resolution,[],[f43,f2]) ).

fof(f48,plain,
    ! [X0] : f(X0),
    inference(forward_subsumption_resolution,[],[f47,f3]) ).

fof(f51,plain,
    ! [X0] :
      ( h(X0)
      | h(y(X0)) ),
    inference(resolution,[],[f44,f40]) ).

fof(f53,plain,
    ! [X0] : h(X0),
    inference(forward_subsumption_resolution,[],[f51,f10]) ).

fof(f57,plain,
    ! [X0] : ~ f(z(X0)),
    inference(resolution,[],[f53,f34]) ).

fof(f67,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f57,f48]) ).

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