↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 3.49s 1.28s
% Output   : Refutation 3.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   26 (  18 unt;   0 def)
%            Number of atoms       :   72 (  38 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   77 (  31   ~;  18   |;  22   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-3 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] : sum(n0,tptp_minus_1,X0) = n0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_plus_base) ).

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

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

fof(f53,conjecture,
    ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
      & leq(n0,pv35)
      & leq(pv35,minus(n5,n1)) )
   => ( ( n0 != pv78
       => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & leq(n0,pv35)
          & leq(pv35,minus(n5,n1)) ) )
      & ( n0 = pv78
       => true ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).

fof(f54,negated_conjecture,
    ~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
        & leq(n0,pv35)
        & leq(pv35,minus(n5,n1)) )
     => ( ( n0 != pv78
         => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & leq(n0,pv35)
            & leq(pv35,minus(n5,n1)) ) )
        & ( n0 = pv78
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f94,plain,
    ( ( ( ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | ~ leq(n0,pv35)
          | ~ leq(pv35,minus(n5,n1)) )
        & n0 != pv78 )
      | ( ~ true
        & n0 = pv78 ) )
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f95,plain,
    ( ( ( ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | ~ leq(n0,pv35)
          | ~ leq(pv35,minus(n5,n1)) )
        & n0 != pv78 )
      | ( ~ true
        & n0 = pv78 ) )
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1)) ),
    inference(flattening,[],[f94]) ).

fof(f121,plain,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[],[f95]) ).

fof(f122,plain,
    leq(n0,pv35),
    inference(cnf_transformation,[],[f95]) ).

fof(f123,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[],[f95]) ).

fof(f127,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1))
    | ~ true ),
    inference(cnf_transformation,[],[f95]) ).

fof(f133,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f134,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(cnf_transformation,[],[f26]) ).

fof(f146,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

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

fof(f187,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f191,plain,
    ! [X0] : minus(succ(X0),n1) = X0,
    inference(definition_unfolding,[],[f187,f146]) ).

fof(f194,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1))
    | ~ true ),
    inference(forward_subsumption_resolution,[],[f127,f123]) ).

fof(f195,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | ~ leq(pv35,minus(n5,n1))
    | ~ true ),
    inference(forward_subsumption_resolution,[],[f194,f122]) ).

fof(f196,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | ~ true ),
    inference(forward_subsumption_resolution,[],[f195,f121]) ).

fof(f197,plain,
    n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))),
    inference(forward_subsumption_resolution,[],[f196,f133]) ).

fof(f207,plain,
    tptp_minus_1 = minus(n0,n1),
    inference(superposition,[],[f191,f163]) ).

fof(f220,plain,
    n0 != sum(n0,tptp_minus_1,times(a_select3(q,pv81,pv35),a_select2(x,pv81))),
    inference(superposition,[],[f197,f207]) ).

fof(f223,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f220,f134]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV048+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.13/0.19  % Computer : n016.cluster.edu
% 0.13/0.19  % Model    : x86_64 x86_64
% 0.13/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.19  % Memory   : 8046.5625MB
% 0.13/0.19  % OS       : Linux 6.8.0-71-generic
% 0.13/0.19  % CPULimit : 300
% 0.13/0.19  % WCLimit  : 300
% 0.13/0.19  % DateTime : Mon Sep 28 09:52:33 UTC 2026
% 0.13/0.19  % CPUTime  : 
% 0.13/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.22  Running first-order theorem proving
% 0.13/0.22  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.49/1.28  % (3521657)Detected formulas, will run a generic FOF schedule.
% 3.49/1.28  % (3521662)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=3325866084:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.49/1.28  % (3521665)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1862639816:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.49/1.28  % (3521667)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1356519921:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.49/1.28  % (3521666)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=368605541:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.49/1.28  % (3521663)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=1949449646:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.49/1.28  % (3521664)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=619040201:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.49/1.28  % (3521666)First to succeed.
% 3.49/1.28  % (3521666)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3521657"
% 3.49/1.28  % (3521667)Also succeeded, but the first one will report.
% 3.49/1.28  % (3521668)dis-21_1_sil=8000:lcm=predicate:random_seed=3102836002: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.49/1.28  % (3521665)Instruction limit reached! 
% 3.49/1.28  % (3521665)------------------------------
% 3.49/1.28  % (3521665)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.28  % (3521665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.28  % (3521665)CaDiCaL version: 2.1.3
% 3.49/1.28  % (3521665)Termination reason: Instruction limit
% 3.49/1.28  % (3521665)Termination phase: Saturation
% 3.49/1.28  % (3521665)Time elapsed: 0.047 s
% 3.49/1.28  % (3521665)Peak memory usage: 88 MB
% 3.49/1.28  % (3521665)Instructions burned: 111 (million)
% 3.49/1.28  % (3521668)Instruction limit reached! 
% 3.49/1.28  % (3521668)------------------------------
% 3.49/1.28  % (3521668)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.28  % (3521668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.28  % (3521668)CaDiCaL version: 2.1.3
% 3.49/1.28  % (3521668)Termination reason: Instruction limit
% 3.49/1.28  % (3521668)Termination phase: Saturation
% 3.49/1.28  % (3521668)Time elapsed: 0.069 s
% 3.49/1.28  % (3521668)Peak memory usage: 88 MB
% 3.49/1.28  % (3521668)Instructions burned: 129 (million)
% 3.49/1.28  % (3521676)lrs+10_1_sil=8000:sp=occurrence:random_seed=622461581:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.49/1.28  % (3521676)Also succeeded, but the first one will report.
% 3.49/1.28  % (3521677)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2212318233:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.49/1.28  % (3521666)Refutation found. Thanks to Tanya!
% 3.49/1.28  % SZS status Theorem for theBenchmark
% 3.49/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 3.49/1.28  % (3521666)------------------------------
% 3.49/1.28  % (3521666)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.28  % (3521666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.28  % (3521666)CaDiCaL version: 2.1.3
% 3.49/1.28  % (3521666)Termination reason: Refutation
% 3.49/1.28  % (3521666)Time elapsed: 0.004 s
% 3.49/1.28  % (3521666)Peak memory usage: 88 MB
% 3.49/1.28  % (3521666)Instructions burned: 5 (million)
% 3.49/1.28  % (3521666)------------------------------
% 3.49/1.28  % (3521666)------------------------------
% 3.49/1.28  % (3521657)Success in time 0.412 s
% 3.49/1.28  % Vampire exiting
%------------------------------------------------------------------------------