↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n011.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:09:09 PM UTC 2026

% Result   : Theorem 2.25s 0.86s
% Output   : Refutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   38 (  14   ~;   7   |;  14   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   33 (  25   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,axiom,
    ! [X0,X1,X2,X3] :
      ( ( pair_in_list(X0,X1,X2)
        & strictly_less_than(X2,X3) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_li3839) ).

fof(f20,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( pair_in_list(X0,X1,X2)
        & strictly_less_than(X1,X3)
        & strictly_less_than(X2,X3) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_co) ).

fof(f21,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( pair_in_list(X0,X1,X2)
          & strictly_less_than(X1,X3)
          & strictly_less_than(X2,X3) )
       => pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f30,plain,
    ! [X0,X1,X2,X3] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ pair_in_list(X0,X1,X2)
      | ~ strictly_less_than(X2,X3) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f31,plain,
    ! [X0,X1,X2,X3] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ pair_in_list(X0,X1,X2)
      | ~ strictly_less_than(X2,X3) ),
    inference(flattening,[],[f30]) ).

fof(f32,plain,
    ? [X0,X1,X2,X3] :
      ( ~ pair_in_list(update_slb(X0,X3),X1,X3)
      & pair_in_list(X0,X1,X2)
      & strictly_less_than(X1,X3)
      & strictly_less_than(X2,X3) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f33,plain,
    ? [X0,X1,X2,X3] :
      ( ~ pair_in_list(update_slb(X0,X3),X1,X3)
      & pair_in_list(X0,X1,X2)
      & strictly_less_than(X1,X3)
      & strictly_less_than(X2,X3) ),
    inference(flattening,[],[f32]) ).

fof(f40,plain,
    ( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
    & pair_in_list(sK0,sK1,sK2)
    & strictly_less_than(sK1,sK3)
    & strictly_less_than(sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f33]) ).

fof(f66,plain,
    ! [X2,X3,X0,X1] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ pair_in_list(X0,X1,X2)
      | ~ strictly_less_than(X2,X3) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f67,plain,
    strictly_less_than(sK2,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f69,plain,
    pair_in_list(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f40]) ).

fof(f70,plain,
    ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f81,plain,
    ! [X0] :
      ( ~ pair_in_list(sK0,sK1,X0)
      | ~ strictly_less_than(X0,sK3) ),
    inference(resolution,[],[f66,f70]) ).

fof(f83,plain,
    ~ strictly_less_than(sK2,sK3),
    inference(resolution,[],[f81,f69]) ).

fof(f84,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f83,f67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV412+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n011.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 10:51:16 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  Running first-order theorem proving
% 0.08/0.20  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.25/0.86  % (3316851)Detected formulas, will run a generic FOF schedule.
% 2.25/0.86  % (3316861)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2153207765:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.25/0.86  % (3316861)First to succeed.
% 2.25/0.86  % (3316861)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3316851"
% 2.25/0.86  % (3316859)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4011112612:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.25/0.86  % (3316860)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3780212523:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.25/0.86  % (3316857)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=3764008351:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.25/0.86  % (3316862)dis-21_1_sil=8000:lcm=predicate:random_seed=915629795: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.25/0.86  % (3316858)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=2845800756:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.25/0.86  % (3316856)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=1922979346:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.25/0.86  % (3316859)Also succeeded, but the first one will report.
% 2.25/0.86  % (3316860)Also succeeded, but the first one will report.
% 2.25/0.86  % (3316862)Also succeeded, but the first one will report.
% 2.25/0.86  % (3316861)Refutation found. Thanks to Tanya!
% 2.25/0.86  % SZS status Theorem for theBenchmark
% 2.25/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.86  % (3316861)------------------------------
% 2.25/0.86  % (3316861)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.25/0.86  % (3316861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.86  % (3316861)CaDiCaL version: 2.1.3
% 2.25/0.86  % (3316861)Termination reason: Refutation
% 2.25/0.86  % (3316861)Time elapsed: 0.002 s
% 2.25/0.86  % (3316861)Peak memory usage: 89 MB
% 2.25/0.86  % (3316861)Instructions burned: 2 (million)
% 2.25/0.86  % (3316861)------------------------------
% 2.25/0.86  % (3316861)------------------------------
% 2.25/0.86  % (3316851)Success in time 0.266 s
% 2.25/0.86  % Vampire exiting
%------------------------------------------------------------------------------