↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n013.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:08:13 PM UTC 2026

% Result   : Theorem 2.70s 1.16s
% Output   : Refutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   78 (  21   ~;  10   |;  43   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   20 (  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X0,X1)
        & leq(X1,X2) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( gt(X1,X0)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt1) ).

fof(f53,conjecture,
    ( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
      & leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n2,pv1325)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv1325,n3)
      & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
      & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0004) ).

fof(f54,negated_conjecture,
    ~ ( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
        & leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n2,pv1325)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv1325,n3)
        & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
        & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
     => leq(n0,pv1325) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f65,axiom,
    gt(n2,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_0) ).

fof(f87,plain,
    ( ~ leq(n0,pv1325)
    & ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
    & leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n2,pv1325)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv1325,n3)
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f88,plain,
    ( ~ leq(n0,pv1325)
    & ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
    & leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n2,pv1325)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv1325,n3)
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) ),
    inference(flattening,[],[f87]) ).

fof(f91,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X0,X1)
      | ~ leq(X1,X2) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f92,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X0,X1)
      | ~ leq(X1,X2) ),
    inference(flattening,[],[f91]) ).

fof(f103,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f114,plain,
    leq(n2,pv1325),
    inference(cnf_transformation,[],[f88]) ).

fof(f119,plain,
    ~ leq(n0,pv1325),
    inference(cnf_transformation,[],[f88]) ).

fof(f121,plain,
    ! [X2,X0,X1] :
      ( leq(X0,X2)
      | ~ leq(X0,X1)
      | ~ leq(X1,X2) ),
    inference(cnf_transformation,[],[f92]) ).

fof(f126,plain,
    gt(n2,n0),
    inference(cnf_transformation,[],[f65]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f215,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,pv1325) ),
    inference(resolution,[],[f121,f119]) ).

fof(f234,plain,
    ! [X0] :
      ( ~ leq(X0,pv1325)
      | ~ gt(X0,n0) ),
    inference(resolution,[],[f215,f143]) ).

fof(f307,plain,
    ~ gt(n2,n0),
    inference(resolution,[],[f234,f114]) ).

fof(f311,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f307,f126]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV134+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  % Computer : n013.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Mon Sep 28 09:58:36 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running first-order theorem proving
% 0.09/0.24  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
% 2.70/1.16  % (1069522)Detected formulas, will run a generic FOF schedule.
% 2.70/1.16  % (1069531)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=819184797:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.70/1.16  % (1069531)First to succeed.
% 2.70/1.16  % (1069531)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1069522"
% 2.70/1.16  % (1069533)dis-21_1_sil=8000:lcm=predicate:random_seed=3602787746: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.70/1.16  % (1069530)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=369842475:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.70/1.16  % (1069528)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=3301002239:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.70/1.16  % (1069527)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=140654855:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.70/1.16  % (1069532)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=558279914:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.70/1.16  % (1069529)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=1929169366:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.70/1.16  % (1069533)Also succeeded, but the first one will report.
% 2.70/1.16  % (1069532)Also succeeded, but the first one will report.
% 2.70/1.16  % (1069530)Instruction limit reached! 
% 2.70/1.16  % (1069530)------------------------------
% 2.70/1.16  % (1069530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.16  % (1069530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.16  % (1069530)CaDiCaL version: 2.1.3
% 2.70/1.16  % (1069530)Termination reason: Instruction limit
% 2.70/1.16  % (1069530)Termination phase: Saturation
% 2.70/1.16  % (1069530)Time elapsed: 0.048 s
% 2.70/1.16  % (1069530)Peak memory usage: 88 MB
% 2.70/1.16  % (1069530)Instructions burned: 110 (million)
% 2.70/1.16  % (1069531)Refutation found. Thanks to Tanya!
% 2.70/1.16  % SZS status Theorem for theBenchmark
% 2.70/1.16  % SZS output start Proof for theBenchmark
% See solution above
% 2.70/1.16  % (1069531)------------------------------
% 2.70/1.16  % (1069531)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.16  % (1069531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.16  % (1069531)CaDiCaL version: 2.1.3
% 2.70/1.16  % (1069531)Termination reason: Refutation
% 2.70/1.16  % (1069531)Time elapsed: 0.003 s
% 2.70/1.16  % (1069531)Peak memory usage: 88 MB
% 2.70/1.16  % (1069531)Instructions burned: 7 (million)
% 2.70/1.16  % (1069531)------------------------------
% 2.70/1.16  % (1069531)------------------------------
% 2.70/1.16  % (1069522)Success in time 0.291 s
% 2.70/1.16  % Vampire exiting
%------------------------------------------------------------------------------