↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n006.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:26:43 PM UTC 2026

% Result   : Theorem 3.91s 1.66s
% Output   : Refutation 3.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (   6 unt;   3 def)
%            Number of atoms       :   98 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  126 (  58   ~;  41   |;  24   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   0 con; 1-2 aty)
%            Number of variables   :   76 (  58   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X3] :
          ( id(X3,X2)
          & ? [X4] :
              ( r2(X1,X4)
              & r3(X0,X4,X3) ) )
      & ? [X5] :
          ( r2(X5,X2)
          & r3(X0,X1,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1a) ).

fof(f15,axiom,
    ! [X0] :
    ? [X1] :
      ( id(X1,X0)
      & ? [X2] :
          ( r1(X2)
          & r3(X0,X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4a) ).

fof(f19,conjecture,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( r1(X2)
              & r3(X1,X2,X0) )
          & ? [X3] :
              ( r1(X3)
              & r2(X3,X1) ) )
      & ? [X4] :
          ( id(X0,X4)
          & ? [X5] :
              ( r1(X5)
              & r2(X5,X4) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',onepluszeroidone) ).

fof(f20,negated_conjecture,
    ~ ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( r1(X2)
                & r3(X1,X2,X0) )
            & ? [X3] :
                ( r1(X3)
                & r2(X3,X1) ) )
        & ? [X4] :
            ( id(X0,X4)
            & ? [X5] :
                ( r1(X5)
                & r2(X5,X4) ) ) ),
    inference(negated_conjecture,[status(cth)],[f19]) ).

fof(f21,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ~ r1(X2)
              | ~ r3(X1,X2,X0) )
          | ! [X3] :
              ( ~ r1(X3)
              | ~ r2(X3,X1) ) )
      | ! [X4] :
          ( ~ id(X0,X4)
          | ! [X5] :
              ( ~ r1(X5)
              | ~ r2(X5,X4) ) ) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f25,plain,
    ! [X0] :
      ( id(sK5(X0),X0)
      & r1(sK6(X0))
      & r3(X0,sK6(X0),sK5(X0)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X1,sK5(X0)),skolemize(X2,sK6(X0))],[f15]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( id(sK8(X0,X1),sK7(X0,X1))
      & r2(X1,sK9(X0,X1))
      & r3(X0,sK9(X0,X1),sK8(X0,X1))
      & r2(sK10(X0,X1),sK7(X0,X1))
      & r3(X0,X1,sK10(X0,X1)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10]),skolemize(X2,sK7(X0,X1)),skolemize(X3,sK8(X0,X1)),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f12]) ).

fof(f28,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ r1(X2)
      | ~ r3(X1,X2,X0)
      | ~ r1(X3)
      | ~ r2(X3,X1)
      | ~ id(X0,X4)
      | ~ r1(X5)
      | ~ r2(X5,X4) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f54,plain,
    ! [X0] : r3(X0,sK6(X0),sK5(X0)),
    inference(cnf_transformation,[],[f25]) ).

fof(f55,plain,
    ! [X0] : r1(sK6(X0)),
    inference(cnf_transformation,[],[f25]) ).

fof(f56,plain,
    ! [X0] : id(sK5(X0),X0),
    inference(cnf_transformation,[],[f25]) ).

fof(f60,plain,
    ! [X0,X1] : r2(X1,sK9(X0,X1)),
    inference(cnf_transformation,[],[f26]) ).

fof(f70,plain,
    ! [X3,X1] :
      ( ~ r2(X3,X1)
      | ~ r1(X3)
      | sP12(X1) ),
    inference(cnf_transformation,[],[f70_D]) ).

fof(f70_D,definition,
    ! [X1] :
      ( ! [X3] :
          ( ~ r2(X3,X1)
          | ~ r1(X3) )
    <=> ~ sP12(X1) ),
    introduced(definition,[new_symbols(definition,[sP12])],[general_splitting_component_introduction]) ).

fof(f71,plain,
    ! [X2,X0,X1,X4,X5] :
      ( ~ r1(X2)
      | ~ r3(X1,X2,X0)
      | ~ id(X0,X4)
      | ~ r1(X5)
      | ~ r2(X5,X4)
      | ~ sP12(X1) ),
    inference(general_splitting,[],[f28,f70_D]) ).

fof(f72,plain,
    ! [X4,X5] :
      ( ~ r2(X5,X4)
      | ~ r1(X5)
      | sP13(X4) ),
    inference(cnf_transformation,[],[f72_D]) ).

fof(f72_D,definition,
    ! [X4] :
      ( ! [X5] :
          ( ~ r2(X5,X4)
          | ~ r1(X5) )
    <=> ~ sP13(X4) ),
    introduced(definition,[new_symbols(definition,[sP13])],[general_splitting_component_introduction]) ).

fof(f73,plain,
    ! [X2,X0,X1,X4] :
      ( ~ r1(X2)
      | ~ r3(X1,X2,X0)
      | ~ id(X0,X4)
      | ~ sP12(X1)
      | ~ sP13(X4) ),
    inference(general_splitting,[],[f71,f72_D]) ).

fof(f74,plain,
    ! [X0,X4] :
      ( ~ id(X0,X4)
      | ~ sP13(X4)
      | sP14(X0) ),
    inference(cnf_transformation,[],[f74_D]) ).

fof(f74_D,definition,
    ! [X0] :
      ( ! [X4] :
          ( ~ id(X0,X4)
          | ~ sP13(X4) )
    <=> ~ sP14(X0) ),
    introduced(definition,[new_symbols(definition,[sP14])],[general_splitting_component_introduction]) ).

fof(f75,plain,
    ! [X2,X0,X1] :
      ( ~ r3(X1,X2,X0)
      | ~ r1(X2)
      | ~ sP12(X1)
      | ~ sP14(X0) ),
    inference(general_splitting,[],[f73,f74_D]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( sP12(sK9(X1,X0))
      | ~ r1(X0) ),
    inference(resolution,[],[f70,f60]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( sP13(sK9(X1,X0))
      | ~ r1(X0) ),
    inference(resolution,[],[f72,f60]) ).

fof(f126,plain,
    ! [X0] :
      ( sP14(sK5(X0))
      | ~ sP13(X0) ),
    inference(resolution,[],[f74,f56]) ).

fof(f136,plain,
    ! [X0] :
      ( ~ r1(sK6(X0))
      | ~ sP12(X0)
      | ~ sP14(sK5(X0)) ),
    inference(resolution,[],[f75,f54]) ).

fof(f139,plain,
    ! [X0] :
      ( ~ sP14(sK5(X0))
      | ~ sP12(X0) ),
    inference(forward_subsumption_resolution,[],[f136,f55]) ).

fof(f140,plain,
    ! [X0] :
      ( ~ sP13(X0)
      | ~ sP12(X0) ),
    inference(resolution,[],[f139,f126]) ).

fof(f142,plain,
    ! [X0,X1] :
      ( ~ sP12(sK9(X0,X1))
      | ~ r1(X1) ),
    inference(resolution,[],[f140,f118]) ).

fof(f143,plain,
    ! [X1] : ~ r1(X1),
    inference(forward_subsumption_resolution,[],[f142,f114]) ).

fof(f144,plain,
    $false,
    inference(resolution,[],[f143,f55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN070+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  % Computer : n006.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sun Sep 27 21:52:39 UTC 2026
% 0.14/0.41  % CPUTime  : 
% 0.14/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.46  Running first-order theorem proving
% 0.14/0.47  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
% 3.91/1.66  % (3358512)Detected formulas, will run a generic FOF schedule.
% 3.91/1.66  % (3358522)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3960495672:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.91/1.66  % (3358522)First to succeed.
% 3.91/1.66  % (3358522)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3358512"
% 3.91/1.66  % (3358525)dis-21_1_sil=8000:lcm=predicate:random_seed=3807077139: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)
% 3.91/1.66  % (3358525)Also succeeded, but the first one will report.
% 3.91/1.66  % (3358520)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=3944828668:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.91/1.66  % (3358521)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=1623600977:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.91/1.66  % (3358519)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=2993082557:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.91/1.66  % (3358523)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=858382696:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.91/1.66  % (3358523)Also succeeded, but the first one will report.
% 3.91/1.66  % (3358524)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2254041:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.91/1.66  % (3358524)Also succeeded, but the first one will report.
% 3.91/1.66  % (3358522)Refutation found. Thanks to Tanya!
% 3.91/1.66  % SZS status Theorem for theBenchmark
% 3.91/1.66  % SZS output start Proof for theBenchmark
% See solution above
% 3.91/1.66  % (3358522)------------------------------
% 3.91/1.66  % (3358522)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.91/1.66  % (3358522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.91/1.66  % (3358522)CaDiCaL version: 2.1.3
% 3.91/1.66  % (3358522)Termination reason: Refutation
% 3.91/1.66  % (3358522)Time elapsed: 0.004 s
% 3.91/1.66  % (3358522)Peak memory usage: 88 MB
% 3.91/1.66  % (3358522)Instructions burned: 5 (million)
% 3.91/1.66  % (3358522)------------------------------
% 3.91/1.66  % (3358522)------------------------------
% 3.91/1.66  % (3358512)Success in time 0.45 s
% 3.91/1.66  % Vampire exiting
%------------------------------------------------------------------------------