↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN392+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n007.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:28 PM UTC 2026

% Result   : Theorem 2.19s 0.86s
% Output   : Refutation 2.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   42 (   5 unt;   4 def)
%            Number of atoms       :  143 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  162 (  61   ~;  74   |;  15   &)
%                                         (  10 <=>;   0  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    7 (   6 usr;   7 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( p1
    <=> p2 )
  <=> ( ( p2
        | ~ p1 )
      & ( ~ p2
        | p1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel14) ).

fof(f2,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ( p1
    <=> p2 )
  <~> ( ( p2
        | ~ p1 )
      & ( ~ p2
        | p1 ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,definition,
    ( sP0
  <=> ( ( p2
        | ~ p1 )
      & ( ~ p2
        | p1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f5,plain,
    ( ( p1
    <=> p2 )
  <~> sP0 ),
    inference(definition_folding,[],[f3,f4]) ).

fof(f6,plain,
    ( ( sP0
      | ( ~ p2
        & p1 )
      | ( p2
        & ~ p1 ) )
    & ( ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) )
      | ~ sP0 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f7,plain,
    ( ( sP0
      | ( ~ p2
        & p1 )
      | ( p2
        & ~ p1 ) )
    & ( ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) )
      | ~ sP0 ) ),
    inference(flattening,[],[f6]) ).

fof(f8,plain,
    ( ( ~ sP0
      | ( ( ~ p2
          | ~ p1 )
        & ( p2
          | p1 ) ) )
    & ( sP0
      | ( ( p1
          | ~ p2 )
        & ( p2
          | ~ p1 ) ) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f9,plain,
    ( ~ p2
    | p1
    | ~ sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ( p2
    | ~ p1
    | ~ sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ( sP0
    | p1
    | p2 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ( sP0
    | ~ p2
    | ~ p1 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f15,plain,
    ( sP0
    | p2
    | ~ p1 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f16,plain,
    ( sP0
    | p1
    | ~ p2 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f17,plain,
    ( ~ sP0
    | p2
    | p1 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f18,plain,
    ( ~ sP0
    | ~ p2
    | ~ p1 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f20,definition,
    ( spl1_1
  <=> p1 ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

fof(f24,definition,
    ( spl1_2
  <=> p2 ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f28,definition,
    ( spl1_3
  <=> sP0 ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

fof(f31,plain,
    ( ~ spl1_1
    | spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f15,f28,f24,f20]) ).

fof(f32,plain,
    ( ~ spl1_2
    | spl1_1
    | spl1_3 ),
    inference(avatar_split_clause,[],[f16,f28,f20,f24]) ).

fof(f33,plain,
    ( spl1_1
    | spl1_2
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f17,f28,f24,f20]) ).

fof(f34,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f18,f28,f24,f20]) ).

fof(f35,plain,
    ( ~ spl1_3
    | spl1_1
    | ~ spl1_2 ),
    inference(avatar_split_clause,[],[f9,f24,f20,f28]) ).

fof(f36,plain,
    ( ~ spl1_3
    | ~ spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f10,f24,f20,f28]) ).

fof(f37,plain,
    ( spl1_2
    | spl1_1
    | spl1_3 ),
    inference(avatar_split_clause,[],[f12,f28,f20,f24]) ).

fof(f38,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f13,f28,f24,f20]) ).

cnf(s1,plain,
    ( ~ spl1_1
    | spl1_2
    | spl1_3 ),
    inference(sat_conversion,[],[f31]) ).

cnf(s2,plain,
    ( spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(sat_conversion,[],[f32]) ).

cnf(s3,plain,
    ( spl1_1
    | spl1_2
    | ~ spl1_3 ),
    inference(sat_conversion,[],[f33]) ).

cnf(s4,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | ~ spl1_3 ),
    inference(sat_conversion,[],[f34]) ).

cnf(s5,plain,
    ( spl1_1
    | ~ spl1_2
    | ~ spl1_3 ),
    inference(sat_conversion,[],[f35]) ).

cnf(s6,plain,
    ( ~ spl1_1
    | spl1_2
    | ~ spl1_3 ),
    inference(sat_conversion,[],[f36]) ).

cnf(s7,plain,
    ( spl1_1
    | spl1_2
    | spl1_3 ),
    inference(sat_conversion,[],[f37]) ).

cnf(s8,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s9,plain,
    ( spl1_2
    | spl1_1 ),
    inference(rat,[],[s3,s7]) ).

cnf(s10,plain,
    ( ~ spl1_2
    | spl1_1 ),
    inference(rat,[],[s2,s5]) ).

cnf(s11,plain,
    spl1_1,
    inference(rat,[],[s10,s9]) ).

cnf(s12,plain,
    spl1_2,
    inference(rat,[],[s6,s1,s11]) ).

cnf(s13,plain,
    spl1_3,
    inference(rat,[],[s8,s11,s12]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN392+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n007.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.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Mon Sep 28 15:51:56 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running first-order theorem proving
% 0.07/0.22  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.19/0.86  % (2517856)Detected formulas, will run a generic FOF schedule.
% 2.19/0.86  % (2517866)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1841422864:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.19/0.86  % (2517866)First to succeed.
% 2.19/0.86  % (2517866)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2517856"
% 2.19/0.86  % (2517862)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3657142067:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.19/0.86  % (2517861)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=695750404:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.19/0.86  % (2517865)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2896439435:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.19/0.86  % (2517864)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3384913693:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.19/0.86  % (2517867)dis-21_1_sil=8000:lcm=predicate:random_seed=210747109:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.19/0.86  % (2517863)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3701952360:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.19/0.86  % (2517865)Also succeeded, but the first one will report.
% 2.19/0.86  % (2517867)Also succeeded, but the first one will report.
% 2.19/0.86  % (2517864)Also succeeded, but the first one will report.
% 2.19/0.86  % (2517866)Refutation found. Thanks to Tanya!
% 2.19/0.86  % SZS status Theorem for theBenchmark
% 2.19/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 2.19/0.86  % (2517866)------------------------------
% 2.19/0.86  % (2517866)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.19/0.86  % (2517866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.86  % (2517866)CaDiCaL version: 2.1.3
% 2.19/0.86  % (2517866)Termination reason: Refutation
% 2.19/0.86  % (2517866)Time elapsed: 0.001 s
% 2.19/0.86  % (2517866)Peak memory usage: 89 MB
% 2.19/0.86  % (2517866)Instructions burned: 1 (million)
% 2.19/0.86  % (2517866)------------------------------
% 2.19/0.86  % (2517866)------------------------------
% 2.19/0.86  % (2517856)Success in time 0.257 s
% 2.19/0.86  % Vampire exiting
%------------------------------------------------------------------------------