↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 2.73s 1.09s
% Output   : Refutation 2.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  15   ~;  11   |;   6   &)
%                                         (   2 <=>;   2  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-3 aty)
%            Number of variables   :   34 (  24   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).

fof(f24,axiom,
    ! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).

fof(f42,conjecture,
    ! [X0,X1] :
      ( check_cpq(triple(X0,create_slb,X1))
    <=> ! [X2,X3] :
          ( pair_in_list(create_slb,X2,X3)
         => less_than(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l41_co) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1] :
        ( check_cpq(triple(X0,create_slb,X1))
      <=> ! [X2,X3] :
            ( pair_in_list(create_slb,X2,X3)
           => less_than(X3,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f47,plain,
    ? [X0,X1] :
      ( check_cpq(triple(X0,create_slb,X1))
    <~> ! [X2,X3] :
          ( less_than(X3,X2)
          | ~ pair_in_list(create_slb,X2,X3) ) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f51,plain,
    ? [X0,X1] :
      ( ( ? [X2,X3] :
            ( ~ less_than(X3,X2)
            & pair_in_list(create_slb,X2,X3) )
        | ~ check_cpq(triple(X0,create_slb,X1)) )
      & ( ! [X2,X3] :
            ( less_than(X3,X2)
            | ~ pair_in_list(create_slb,X2,X3) )
        | check_cpq(triple(X0,create_slb,X1)) ) ),
    inference(nnf_transformation,[],[f47]) ).

fof(f52,plain,
    ? [X0,X1] :
      ( ( ? [X2,X3] :
            ( ~ less_than(X3,X2)
            & pair_in_list(create_slb,X2,X3) )
        | ~ check_cpq(triple(X0,create_slb,X1)) )
      & ( ! [X4,X5] :
            ( less_than(X5,X4)
            | ~ pair_in_list(create_slb,X4,X5) )
        | check_cpq(triple(X0,create_slb,X1)) ) ),
    inference(rectify,[],[f51]) ).

fof(f53,plain,
    ( ( ( ~ less_than(sK3,sK2)
        & pair_in_list(create_slb,sK2,sK3) )
      | ~ check_cpq(triple(sK0,create_slb,sK1)) )
    & ( ! [X4,X5] :
          ( less_than(X5,X4)
          | ~ pair_in_list(create_slb,X4,X5) )
      | check_cpq(triple(sK0,create_slb,sK1)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f52]) ).

fof(f58,plain,
    ( pair_in_list(create_slb,sK2,sK3)
    | ~ check_cpq(triple(sK0,create_slb,sK1)) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f67,plain,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[],[f10]) ).

fof(f70,plain,
    ! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
    inference(cnf_transformation,[],[f24]) ).

fof(f73,plain,
    ~ check_cpq(triple(sK0,create_slb,sK1)),
    inference(forward_subsumption_resolution,[],[f58,f67]) ).

fof(f75,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f73,f70]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV405+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.18  % Computer : n015.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 10:53:47 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/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.73/1.09  % (2540210)Detected formulas, will run a generic FOF schedule.
% 2.73/1.09  % (2540302)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4174162168:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.73/1.09  % (2540302)First to succeed.
% 2.73/1.09  % (2540302)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2540210"
% 2.73/1.09  % (2540304)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3245348608:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.73/1.09  % (2540299)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=880236257:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.73/1.09  % (2540306)dis-21_1_sil=8000:lcm=predicate:random_seed=2174313591: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.73/1.09  % (2540305)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3903053555:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.73/1.09  % (2540301)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=2246048708:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.73/1.09  % (2540300)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=2347119268:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.73/1.09  % (2540304)Also succeeded, but the first one will report.
% 2.73/1.09  % (2540306)Also succeeded, but the first one will report.
% 2.73/1.09  % (2540305)Also succeeded, but the first one will report.
% 2.73/1.09  % (2540302)Refutation found. Thanks to Tanya!
% 2.73/1.09  % SZS status Theorem for theBenchmark
% 2.73/1.09  % SZS output start Proof for theBenchmark
% See solution above
% 2.73/1.09  % (2540302)------------------------------
% 2.73/1.09  % (2540302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.09  % (2540302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.09  % (2540302)CaDiCaL version: 2.1.3
% 2.73/1.09  % (2540302)Termination reason: Refutation
% 2.73/1.09  % (2540302)Time elapsed: 0.001 s
% 2.73/1.09  % (2540302)Peak memory usage: 89 MB
% 2.73/1.09  % (2540302)Instructions burned: 1 (million)
% 2.73/1.09  % (2540302)------------------------------
% 2.73/1.09  % (2540302)------------------------------
% 2.73/1.09  % (2540210)Success in time 0.306 s
% 2.73/1.09  % Vampire exiting
%------------------------------------------------------------------------------