↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---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 THM

% Computer : n020.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 01:50:13 PM UTC 2026

% Result   : Unsatisfiable 2.72s 1.15s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (   5 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   49 (  23   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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   :   22 (  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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] :
      ( h(y(X0))
      | ~ f(y(X0))
      | ~ g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

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

fof(f9,negated_conjecture,
    ! [X0] :
      ( g(y(X0))
      | ~ f(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] :
      ( ~ h(z(X0))
      | ~ g(z(X0))
      | ~ f(z(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).

fof(f13,plain,
    ! [X0] :
      ( ~ f(y(X0))
      | ~ g(X0)
      | h(X0) ),
    inference(resolution,[],[f4,f10]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ f(y(X0))
      | h(X0)
      | f(X0) ),
    inference(resolution,[],[f9,f3]) ).

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

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

fof(f30,plain,
    ! [X0] :
      ( h(X0)
      | ~ g(X0)
      | h(X0) ),
    inference(resolution,[],[f25,f13]) ).

fof(f31,plain,
    ! [X0] :
      ( h(X0)
      | ~ g(X0) ),
    inference(duplicate_literal_removal,[],[f30]) ).

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

fof(f37,plain,
    ! [X0] :
      ( ~ g(z(X0))
      | ~ g(z(X0))
      | ~ f(z(X0)) ),
    inference(resolution,[],[f31,f11]) ).

fof(f38,plain,
    ! [X0] :
      ( ~ g(z(X0))
      | ~ f(z(X0)) ),
    inference(duplicate_literal_removal,[],[f37]) ).

fof(f46,plain,
    ! [X0] :
      ( h(X0)
      | ~ f(y(X0))
      | h(X0) ),
    inference(resolution,[],[f35,f9]) ).

fof(f48,plain,
    ! [X0] :
      ( h(X0)
      | ~ f(y(X0)) ),
    inference(duplicate_literal_removal,[],[f46]) ).

fof(f50,plain,
    ! [X0] : h(X0),
    inference(forward_subsumption_resolution,[],[f48,f25]) ).

fof(f53,plain,
    ! [X0] : g(X0),
    inference(resolution,[],[f50,f6]) ).

fof(f65,plain,
    ! [X0] : f(X0),
    inference(resolution,[],[f53,f3]) ).

fof(f68,plain,
    ! [X0] : ~ f(z(X0)),
    inference(forward_subsumption_resolution,[],[f38,f53]) ).

fof(f69,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f68,f65]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN328-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n020.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 15:43:04 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running first-order theorem proving
% 0.07/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.72/1.15  % (261109)Input is clausal, will run a generic CNF schedule.
% 2.72/1.15  % (261118)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2986021951:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.72/1.15  % (261118)First to succeed.
% 2.72/1.15  % (261118)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-261109"
% 2.72/1.15  % (261114)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4101331774:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.72/1.15  % (261116)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=592625240:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.72/1.15  % (261117)lrs+10_1_sil=8000:sp=occurrence:random_seed=3244295300:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.72/1.15  % (261115)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3257077734:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.72/1.15  % (261117)Also succeeded, but the first one will report.
% 2.72/1.15  % (261119)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3090051262:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.72/1.15  % (261120)dis-21_1_sil=8000:lcm=predicate:random_seed=1004901736:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.72/1.15  % (261119)Also succeeded, but the first one will report.
% 2.72/1.15  % (261120)Also succeeded, but the first one will report.
% 2.72/1.15  % (261118)Refutation found. Thanks to Tanya!
% 2.72/1.15  % SZS status Unsatisfiable for theBenchmark
% 2.72/1.15  % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.15  % (261118)------------------------------
% 2.72/1.15  % (261118)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.15  % (261118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.15  % (261118)CaDiCaL version: 2.1.3
% 2.72/1.15  % (261118)Termination reason: Refutation
% 2.72/1.15  % (261118)Time elapsed: 0.001 s
% 2.72/1.15  % (261118)Peak memory usage: 88 MB
% 2.72/1.15  % (261118)Instructions burned: 1 (million)
% 2.72/1.15  % (261118)------------------------------
% 2.72/1.15  % (261118)------------------------------
% 2.72/1.15  % (261109)Success in time 0.296 s
% 2.72/1.15  % Vampire exiting
%------------------------------------------------------------------------------