↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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:15 PM UTC 2026

% Result   : Theorem 3.62s 1.21s
% Output   : Refutation 3.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   40 (  16 unt;   0 def)
%            Number of atoms       :   80 (  19 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   72 (  32   ~;  23   |;  11   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-3 aty)
%            Number of variables   :   40 (  38   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).

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

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

fof(f13,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> gt(succ(X1),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).

fof(f28,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).

fof(f30,axiom,
    ! [X0] : plus(n1,X0) = succ(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).

fof(f53,conjecture,
    ! [X0] :
      ( ( leq(n0,X0)
        & leq(X0,tptp_minus_1) )
     => sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0002) ).

fof(f54,negated_conjecture,
    ~ ! [X0] :
        ( ( leq(n0,X0)
          & leq(X0,tptp_minus_1) )
       => sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f58,axiom,
    gt(n0,tptp_minus_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).

fof(f78,axiom,
    ! [X0] :
      ( ( leq(n0,X0)
        & leq(X0,n0) )
     => X0 = n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).

fof(f87,plain,
    ? [X0] :
      ( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
      & leq(n0,X0)
      & leq(X0,tptp_minus_1) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f88,plain,
    ? [X0] :
      ( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
      & leq(n0,X0)
      & leq(X0,tptp_minus_1) ),
    inference(flattening,[],[f87]) ).

fof(f89,plain,
    ! [X0] :
      ( X0 = n0
      | ~ leq(n0,X0)
      | ~ leq(X0,n0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f90,plain,
    ! [X0] :
      ( X0 = n0
      | ~ leq(n0,X0)
      | ~ leq(X0,n0) ),
    inference(flattening,[],[f89]) ).

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(f99,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f110,plain,
    ( n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index))
    & leq(n0,sK0)
    & leq(sK0,tptp_minus_1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f88]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ~ gt(succ(X1),X0) )
      & ( gt(succ(X1),X0)
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f113,plain,
    leq(sK0,tptp_minus_1),
    inference(cnf_transformation,[],[f110]) ).

fof(f114,plain,
    leq(n0,sK0),
    inference(cnf_transformation,[],[f110]) ).

fof(f116,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | n0 = X0
      | ~ leq(X0,n0) ),
    inference(cnf_transformation,[],[f90]) ).

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

fof(f122,plain,
    gt(n0,tptp_minus_1),
    inference(cnf_transformation,[],[f58]) ).

fof(f125,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

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

fof(f138,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f162,plain,
    ! [X0,X1] :
      ( gt(succ(X1),X0)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f112]) ).

fof(f172,plain,
    ! [X0] : succ(X0) = plus(n1,X0),
    inference(cnf_transformation,[],[f30]) ).

fof(f174,plain,
    n0 = plus(n1,tptp_minus_1),
    inference(definition_unfolding,[],[f125,f172]) ).

fof(f186,plain,
    ! [X0,X1] :
      ( gt(plus(n1,X1),X0)
      | ~ leq(X0,X1) ),
    inference(definition_unfolding,[],[f162,f172]) ).

fof(f222,plain,
    ! [X0] : ~ leq(plus(n1,X0),X0),
    inference(resolution,[],[f186,f138]) ).

fof(f230,plain,
    ~ leq(n0,tptp_minus_1),
    inference(superposition,[],[f222,f174]) ).

fof(f240,plain,
    ( ~ leq(sK0,n0)
    | n0 = sK0 ),
    inference(resolution,[],[f116,f114]) ).

fof(f251,plain,
    ! [X0] :
      ( ~ leq(sK0,X0)
      | ~ leq(X0,n0)
      | n0 = sK0 ),
    inference(resolution,[],[f117,f240]) ).

fof(f252,plain,
    ( ~ leq(tptp_minus_1,n0)
    | n0 = sK0 ),
    inference(resolution,[],[f251,f113]) ).

fof(f262,plain,
    ( n0 = sK0
    | ~ gt(n0,tptp_minus_1) ),
    inference(resolution,[],[f252,f137]) ).

fof(f263,plain,
    n0 = sK0,
    inference(forward_subsumption_resolution,[],[f262,f122]) ).

fof(f280,plain,
    ~ leq(sK0,tptp_minus_1),
    inference(superposition,[],[f230,f263]) ).

fof(f281,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f280,f113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV152+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  % Computer : n008.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Mon Sep 28 10:02:54 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.24  Running first-order theorem proving
% 0.10/0.24  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
% 3.62/1.21  % (2146394)Detected formulas, will run a generic FOF schedule.
% 3.62/1.21  % (2146401)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=2588446933:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.62/1.21  % (2146402)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=35730581:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.62/1.21  % (2146399)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=3150630118:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.62/1.21  % (2146405)dis-21_1_sil=8000:lcm=predicate:random_seed=2616029268: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.62/1.21  % (2146400)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=1898050055:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.62/1.21  % (2146403)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2760617316:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.62/1.21  % (2146404)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=637443128:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.62/1.21  % (2146402)Refutation not found, incomplete strategy
% 3.62/1.21  % (2146402)------------------------------
% 3.62/1.21  % (2146402)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.21  % (2146402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.21  % (2146402)CaDiCaL version: 2.1.3
% 3.62/1.21  % (2146402)Termination reason: Refutation not found, incomplete strategy
% 3.62/1.21  % (2146402)Time elapsed: 0.003 s
% 3.62/1.21  % (2146402)Peak memory usage: 89 MB
% 3.62/1.21  % (2146402)Instructions burned: 2 (million)
% 3.62/1.21  % (2146403)First to succeed.
% 3.62/1.21  % (2146403)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2146394"
% 3.62/1.21  % (2146404)Also succeeded, but the first one will report.
% 3.62/1.21  % (2146405)Instruction limit reached! 
% 3.62/1.21  % (2146405)------------------------------
% 3.62/1.21  % (2146405)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.21  % (2146405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.21  % (2146405)CaDiCaL version: 2.1.3
% 3.62/1.21  % (2146405)Termination reason: Instruction limit
% 3.62/1.21  % (2146405)Termination phase: Saturation
% 3.62/1.21  % (2146405)Time elapsed: 0.068 s
% 3.62/1.21  % (2146405)Peak memory usage: 88 MB
% 3.62/1.21  % (2146405)Instructions burned: 129 (million)
% 3.62/1.21  % (2146413)lrs+10_1_sil=8000:sp=occurrence:random_seed=1396766972:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.62/1.21  % (2146413)Also succeeded, but the first one will report.
% 3.62/1.21  % (2146402)------------------------------
% 3.62/1.21  % (2146402)------------------------------
% 3.62/1.21  % (2146403)Refutation found. Thanks to Tanya!
% 3.62/1.21  % SZS status Theorem for theBenchmark
% 3.62/1.21  % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.21  % (2146403)------------------------------
% 3.62/1.21  % (2146403)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.21  % (2146403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.21  % (2146403)CaDiCaL version: 2.1.3
% 3.62/1.21  % (2146403)Termination reason: Refutation
% 3.62/1.21  % (2146403)Time elapsed: 0.005 s
% 3.62/1.21  % (2146403)Peak memory usage: 88 MB
% 3.62/1.21  % (2146403)Instructions burned: 6 (million)
% 3.62/1.21  % (2146403)------------------------------
% 3.62/1.21  % (2146403)------------------------------
% 3.62/1.21  % (2146394)Success in time 0.433 s
% 3.62/1.21  % Vampire exiting
%------------------------------------------------------------------------------