↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN343-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 : n019.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:18 PM UTC 2026

% Result   : Unsatisfiable 2.60s 1.29s
% Output   : Refutation 2.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   4 unt;   3 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  20   ~;  18   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?)

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

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

fof(f5,definition,
    ( spl0_1
  <=> ! [X0,X1] : ~ f(X0,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f6,plain,
    ( ! [X0,X1] : ~ f(X0,X1)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f5]) ).

fof(f8,definition,
    ( spl0_2
  <=> f(a,a) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f9,plain,
    ( ~ f(a,a)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f8]) ).

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

fof(f11,plain,
    ( f(a,a)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f17,definition,
    ( spl0_4
  <=> ! [X0] : f(a,X0) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f18,plain,
    ( ! [X0] : f(a,X0)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f19,plain,
    ( spl0_2
    | spl0_4 ),
    inference(avatar_split_clause,[],[f1,f17,f8]) ).

fof(f20,plain,
    ( $false
    | spl0_2
    | ~ spl0_4 ),
    inference(resolution,[],[f18,f9]) ).

fof(f21,plain,
    ( spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f20]) ).

fof(f24,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f11,f6]) ).

fof(f25,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f24]) ).

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

cnf(s3,plain,
    ( spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f19]) ).

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

cnf(s6,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f25]) ).

cnf(s7,plain,
    spl0_2,
    inference(rat,[],[s3,s4]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN343-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.21  % Computer : n019.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.22  % CPULimit : 300
% 0.11/0.22  % WCLimit  : 300
% 0.11/0.22  % DateTime : Mon Sep 28 15:47:19 UTC 2026
% 0.11/0.22  % CPUTime  : 
% 0.11/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.27  Running first-order theorem proving
% 0.11/0.27  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.60/1.29  % (4110563)Input is clausal, will run a generic CNF schedule.
% 2.60/1.29  % (4110577)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3110967580:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 2.60/1.29  % (4110577)First to succeed.
% 2.60/1.29  % (4110577)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4110563"
% 2.60/1.29  % (4110575)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1528574052:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 2.60/1.29  % (4110573)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=3080221713:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 2.60/1.29  % (4110574)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1665817570:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 2.60/1.29  % (4110576)lrs+10_1_sil=8000:sp=occurrence:random_seed=1056340363:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 2.60/1.29  % (4110576)Also succeeded, but the first one will report.
% 2.60/1.29  % (4110579)dis-21_1_sil=8000:lcm=predicate:random_seed=3277872559:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 2.60/1.29  % (4110579)Also succeeded, but the first one will report.
% 2.60/1.29  % (4110578)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=324239922:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 2.60/1.29  % (4110578)Also succeeded, but the first one will report.
% 2.60/1.29  % (4110577)Refutation found. Thanks to Tanya!
% 2.60/1.29  % SZS status Unsatisfiable for theBenchmark
% 2.60/1.29  % SZS output start Proof for theBenchmark
% See solution above
% 2.60/1.29  % (4110577)------------------------------
% 2.60/1.29  % (4110577)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.29  % (4110577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.29  % (4110577)CaDiCaL version: 2.1.3
% 2.60/1.29  % (4110577)Termination reason: Refutation
% 2.60/1.29  % (4110577)Time elapsed: 0.001 s
% 2.60/1.29  % (4110577)Peak memory usage: 89 MB
% 2.60/1.29  % (4110577)------------------------------
% 2.60/1.29  % (4110577)------------------------------
% 2.60/1.29  % (4110563)Success in time 0.253 s
% 2.60/1.29  % Vampire exiting
%------------------------------------------------------------------------------