↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN352+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 : n001.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:20 PM UTC 2026

% Result   : Theorem 2.62s 0.92s
% Output   : Refutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   3 unt;   0 def)
%            Number of atoms       :  107 (   0 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :  124 (  33   ~;  43   |;  28   &)
%                                         (   4 <=>;  12  =>;   0  <=;   4 <~>)
%            Maximal formula depth :   14 (   8 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   44 (  28   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1] :
    ? [X2,X3] :
    ! [X4] :
      ( big_f(X0,X1)
     => ( ( big_f(X2,X3)
         => ( big_f(X1,X4)
            | big_f(X3,X4) ) )
       => ( ( ( big_f(X2,X3)
             => ( big_f(X1,X4)
              <=> big_f(X2,X4) ) )
           => big_f(X4,X4) )
         => ( big_f(X2,X3)
            & ( big_f(X2,X4)
            <=> big_f(X3,X4) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_18_4) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
      ? [X2,X3] :
      ! [X4] :
        ( big_f(X0,X1)
       => ( ( big_f(X2,X3)
           => ( big_f(X1,X4)
              | big_f(X3,X4) ) )
         => ( ( ( big_f(X2,X3)
               => ( big_f(X1,X4)
                <=> big_f(X2,X4) ) )
             => big_f(X4,X4) )
           => ( big_f(X2,X3)
              & ( big_f(X2,X4)
              <=> big_f(X3,X4) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ~ big_f(X2,X3)
        | ( big_f(X2,X4)
        <~> big_f(X3,X4) ) )
      & ( big_f(X4,X4)
        | ( ( big_f(X1,X4)
          <~> big_f(X2,X4) )
          & big_f(X2,X3) ) )
      & ( big_f(X1,X4)
        | big_f(X3,X4)
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ~ big_f(X2,X3)
        | ( big_f(X2,X4)
        <~> big_f(X3,X4) ) )
      & ( big_f(X4,X4)
        | ( ( big_f(X1,X4)
          <~> big_f(X2,X4) )
          & big_f(X2,X3) ) )
      & ( big_f(X1,X4)
        | big_f(X3,X4)
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ~ big_f(X2,X3)
        | ( ( ~ big_f(X3,X4)
            | ~ big_f(X2,X4) )
          & ( big_f(X3,X4)
            | big_f(X2,X4) ) ) )
      & ( big_f(X4,X4)
        | ( ( ~ big_f(X2,X4)
            | ~ big_f(X1,X4) )
          & ( big_f(X2,X4)
            | big_f(X1,X4) )
          & big_f(X2,X3) ) )
      & ( big_f(X1,X4)
        | big_f(X3,X4)
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ~ big_f(X2,X3)
        | ( ( ~ big_f(X3,X4)
            | ~ big_f(X2,X4) )
          & ( big_f(X3,X4)
            | big_f(X2,X4) ) ) )
      & ( big_f(X4,X4)
        | ( ( ~ big_f(X2,X4)
            | ~ big_f(X1,X4) )
          & ( big_f(X2,X4)
            | big_f(X1,X4) )
          & big_f(X2,X3) ) )
      & ( big_f(X1,X4)
        | big_f(X3,X4)
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(flattening,[],[f5]) ).

fof(f7,plain,
    ! [X2,X3] :
      ( ( ~ big_f(X2,X3)
        | ( ( ~ big_f(X3,sK2(X2,X3))
            | ~ big_f(X2,sK2(X2,X3)) )
          & ( big_f(X3,sK2(X2,X3))
            | big_f(X2,sK2(X2,X3)) ) ) )
      & ( big_f(sK2(X2,X3),sK2(X2,X3))
        | ( ( ~ big_f(X2,sK2(X2,X3))
            | ~ big_f(sK1,sK2(X2,X3)) )
          & ( big_f(X2,sK2(X2,X3))
            | big_f(sK1,sK2(X2,X3)) )
          & big_f(X2,X3) ) )
      & ( big_f(sK1,sK2(X2,X3))
        | big_f(X3,sK2(X2,X3))
        | ~ big_f(X2,X3) )
      & big_f(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X4,sK2(X2,X3))],[f6]) ).

fof(f10,plain,
    ! [X2,X3] :
      ( big_f(sK2(X2,X3),sK2(X2,X3))
      | big_f(X2,X3) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X2,X3] :
      ( big_f(X3,sK2(X2,X3))
      | ~ big_f(X2,X3)
      | big_f(X2,sK2(X2,X3)) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    ! [X2,X3] :
      ( ~ big_f(X3,sK2(X2,X3))
      | ~ big_f(X2,X3)
      | ~ big_f(X2,sK2(X2,X3)) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ big_f(X0,sK2(X0,X0))
      | ~ big_f(X0,X0) ),
    inference(factoring,[],[f14]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ big_f(X0,X0)
      | ~ big_f(X0,X0)
      | big_f(X0,sK2(X0,X0)) ),
    inference(resolution,[],[f17,f13]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ big_f(X0,X0)
      | big_f(X0,sK2(X0,X0)) ),
    inference(duplicate_literal_removal,[],[f21]) ).

fof(f26,plain,
    ! [X0] : ~ big_f(X0,X0),
    inference(forward_subsumption_resolution,[],[f24,f17]) ).

fof(f30,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(resolution,[],[f26,f10]) ).

fof(f37,plain,
    $false,
    inference(resolution,[],[f30,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN352+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n001.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 15:53:03 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running first-order theorem proving
% 0.08/0.21  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.62/0.92  % (449348)Detected formulas, will run a generic FOF schedule.
% 2.62/0.92  % (449358)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1714904744:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.62/0.92  % (449358)First to succeed.
% 2.62/0.92  % (449358)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-449348"
% 2.62/0.92  % (449355)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=3074583809:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.62/0.92  % (449357)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=812799193:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.62/0.92  % (449353)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=1467448223:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.62/0.92  % (449356)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4066151996:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.62/0.92  % (449359)dis-21_1_sil=8000:lcm=predicate:random_seed=2996877207: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.62/0.92  % (449354)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=98628607:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.62/0.92  % (449357)Also succeeded, but the first one will report.
% 2.62/0.92  % (449359)Also succeeded, but the first one will report.
% 2.62/0.92  % (449356)Also succeeded, but the first one will report.
% 2.62/0.92  % (449358)Refutation found. Thanks to Tanya!
% 2.62/0.92  % SZS status Theorem for theBenchmark
% 2.62/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 2.62/0.92  % (449358)------------------------------
% 2.62/0.92  % (449358)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/0.92  % (449358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.92  % (449358)CaDiCaL version: 2.1.3
% 2.62/0.92  % (449358)Termination reason: Refutation
% 2.62/0.92  % (449358)Time elapsed: 0.001 s
% 2.62/0.92  % (449358)Peak memory usage: 88 MB
% 2.62/0.92  % (449358)Instructions burned: 1 (million)
% 2.62/0.92  % (449358)------------------------------
% 2.62/0.92  % (449358)------------------------------
% 2.62/0.92  % (449348)Success in time 0.313 s
% 2.62/0.92  % Vampire exiting
%------------------------------------------------------------------------------