↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n005.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 12:49:21 PM UTC 2026

% Result   : Theorem 2.72s 1.37s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (  13 unt;   0 typ;   3 def)
%            Number of atoms       :   80 (   9 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   45 (  20   ~;  12   |;   2   &)
%                                         (   4 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   35 (  27 fml;   8 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   7 usr;   8 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   19 (   0 sgn  18   !;   1   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,axiom,
    ( emptysetE
    = ( ! [X0: $i] :
          ( in(X0,emptyset)
         => ! [X1: $o] : (X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE) ).

tff(f2,conjecture,
    ( emptysetE
   => ! [X0: $i] : ~ in(X0,emptyset) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinemptyset) ).

tff(f3,negated_conjecture,
    ~ ( emptysetE
     => ! [X0: $i] : ~ in(X0,emptyset) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

tff(f4,plain,
    ( emptysetE
    = ( ! [X0: $i] :
          ( in(X0,emptyset)
         => ! [X1: $o] : (X1) ) ) ),
    inference(rectify,[],[f1]) ).

tff(f5,plain,
    ( emptysetE
  <=> ! [X0: $i] :
        ( in(X0,emptyset)
       => ! [X1: $o] : ( $true = (X1) ) ) ),
    inference(fool_elimination,[],[f4]) ).

tff(f6,plain,
    ( emptysetE
   => ! [X0: $i] :
        ( in(X0,emptyset)
       => ! [X1: $o] : ( $true = (X1) ) ) ),
    inference(unused_predicate_definition_removal,[],[f5]) ).

tff(f7,plain,
    ( ! [X0: $i] :
        ( ! [X1: $o] : ( $true = (X1) )
        | ~ in(X0,emptyset) )
    | ~ emptysetE ),
    inference(ennf_transformation,[],[f6]) ).

tff(f8,plain,
    ( ? [X0: $i] : in(X0,emptyset)
    & emptysetE ),
    inference(ennf_transformation,[],[f3]) ).

tff(f9,plain,
    ( in(sK0,emptyset)
    & emptysetE ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f8]) ).

tff(f10,plain,
    ! [X0: $i,X1: $o] :
      ( ( $true = (X1) )
      | ~ in(X0,emptyset)
      | ~ emptysetE ),
    inference(cnf_transformation,[],[f7]) ).

tff(f11,plain,
    emptysetE,
    inference(cnf_transformation,[],[f9]) ).

tff(f12,plain,
    in(sK0,emptyset),
    inference(cnf_transformation,[],[f9]) ).

tff(f13,plain,
    $true != $false,
    introduced(definition,[],[fool_distinctness_axiom]) ).

tff(f16,definition,
    ( spl1_1
  <=> emptysetE ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

tff(f20,definition,
    ( spl1_2
  <=> ! [X0: $i] : ~ in(X0,emptyset) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

tff(f21,plain,
    ( ! [X0: $i] : ~ in(X0,emptyset)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f20]) ).

tff(f23,definition,
    ( spl1_3
  <=> ! [X1: $o] : ( $true = (X1) ) ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

tff(f24,plain,
    ( ! [X1: $o] : ( $true = (X1) )
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f23]) ).

tff(f25,plain,
    ( ~ spl1_1
    | spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f10,f23,f20,f16]) ).

tff(f26,plain,
    spl1_1,
    inference(avatar_split_clause,[],[f11,f16]) ).

tff(f30,plain,
    ( $false
    | ~ spl1_3 ),
    inference(forward_subsumption_resolution,[],[f13,f24]) ).

tff(f31,plain,
    ~ spl1_3,
    inference(avatar_contradiction_clause,[],[f30]) ).

tff(f32,plain,
    ( $false
    | ~ spl1_2 ),
    inference(resolution,[],[f21,f12]) ).

tff(f33,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f32]) ).

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

cnf(s2,plain,
    spl1_1,
    inference(sat_conversion,[],[f26]) ).

cnf(s3,plain,
    ~ spl1_3,
    inference(sat_conversion,[],[f31]) ).

cnf(s4,plain,
    ~ spl1_2,
    inference(sat_conversion,[],[f33]) ).

cnf(s5,plain,
    $false,
    inference(rat,[],[s1,s3,s4,s2]) ).

tff(f34,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU503_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  % Computer : n005.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Mon Sep 28 05:40:46 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43  Running first-order theorem proving
% 0.10/0.43  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.72/1.37  % (500098)Detected formulas, will run a generic FOF schedule.
% 2.72/1.37  % (500207)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3255185830:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.72/1.37  % (500207)First to succeed.
% 2.72/1.37  % (500207)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-500098"
% 2.72/1.37  % (500206)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=238892343:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.72/1.37  % (500202)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=496447223:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.72/1.37  % (500203)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=2500930488:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.72/1.37  % (500205)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1008103290:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.72/1.37  % (500204)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=2770945486:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.72/1.37  % (500206)Refutation not found, incomplete strategy
% 2.72/1.37  % (500206)------------------------------
% 2.72/1.37  % (500206)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.37  % (500205)Refutation not found, incomplete strategy
% 2.72/1.37  % (500205)------------------------------
% 2.72/1.37  % (500205)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.37  % (500206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.37  % (500206)CaDiCaL version: 2.1.3
% 2.72/1.37  % (500205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.37  % (500206)Termination reason: Refutation not found, incomplete strategy
% 2.72/1.37  % (500206)Time elapsed: 0.001 s
% 2.72/1.37  % (500206)Peak memory usage: 87 MB
% 2.72/1.37  % (500205)CaDiCaL version: 2.1.3
% 2.72/1.37  % (500205)Termination reason: Refutation not found, incomplete strategy
% 2.72/1.37  % (500205)Time elapsed: 0.001 s
% 2.72/1.37  % (500205)Peak memory usage: 87 MB
% 2.72/1.37  % (500208)dis-21_1_sil=8000:lcm=predicate:random_seed=2922556019: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.72/1.37  % (500208)Also succeeded, but the first one will report.
% 2.72/1.37  % (500207)Refutation found. Thanks to Tanya!
% 2.72/1.37  % SZS status Theorem for theBenchmark
% 2.72/1.37  % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.38  % (500207)------------------------------
% 2.72/1.38  % (500207)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.38  % (500207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.38  % (500207)CaDiCaL version: 2.1.3
% 2.72/1.38  % (500207)Termination reason: Refutation
% 2.72/1.38  % (500207)Time elapsed: 0.002 s
% 2.72/1.38  % (500207)Peak memory usage: 90 MB
% 2.72/1.38  % (500207)Instructions burned: 1 (million)
% 2.72/1.38  % (500207)------------------------------
% 2.72/1.38  % (500207)------------------------------
% 2.72/1.38  % (500098)Success in time 0.301 s
% 2.72/1.38  % Vampire exiting
%------------------------------------------------------------------------------