TSTP Solution File: SWV135+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May  1 04:02:40 EDT 2024

% Result   : Theorem 0.60s 0.80s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  14 unt;   0 def)
%            Number of atoms       :   62 (   5 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   52 (  14   ~;   4   |;  30   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-1 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f160,plain,
    $false,
    inference(subsumption_resolution,[],[f159,f111]) ).

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

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

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

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

fof(f53,conjecture,
    ( ( leq(pv1325,n3)
      & leq(s_worst7,n3)
      & leq(s_sworst7,n3)
      & leq(s_best7,n3)
      & leq(n2,pv1325)
      & leq(n0,s_worst7)
      & leq(n0,s_sworst7)
      & leq(n0,s_best7) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178',gauss_array_0005) ).

fof(f159,plain,
    ~ leq(n2,pv1325),
    inference(forward_demodulation,[],[f158,f145]) ).

fof(f145,plain,
    n2 = succ(n1),
    inference(backward_demodulation,[],[f120,f136]) ).

fof(f136,plain,
    n1 = succ(n0),
    inference(cnf_transformation,[],[f84]) ).

fof(f84,axiom,
    n1 = succ(n0),
    file('/export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178',successor_1) ).

fof(f120,plain,
    n2 = succ(succ(n0)),
    inference(cnf_transformation,[],[f85]) ).

fof(f85,axiom,
    n2 = succ(succ(n0)),
    file('/export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178',successor_2) ).

fof(f158,plain,
    ~ leq(succ(n1),pv1325),
    inference(resolution,[],[f153,f129]) ).

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

fof(f97,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | ~ leq(succ(X0),X1) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f43,axiom,
    ! [X0,X1] :
      ( leq(succ(X0),X1)
     => gt(X1,X0) ),
    file('/export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178',leq_succ_gt) ).

fof(f153,plain,
    ~ gt(pv1325,n1),
    inference(resolution,[],[f152,f140]) ).

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

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

fof(f8,axiom,
    ! [X0,X1] :
      ( gt(X1,X0)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178',leq_gt1) ).

fof(f152,plain,
    ~ leq(n1,pv1325),
    inference(forward_demodulation,[],[f151,f136]) ).

fof(f151,plain,
    ~ leq(succ(n0),pv1325),
    inference(resolution,[],[f129,f149]) ).

fof(f149,plain,
    ~ gt(pv1325,n0),
    inference(resolution,[],[f140,f116]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31  % Computer : n024.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31  % CPULimit   : 300
% 0.16/0.31  % WCLimit    : 300
% 0.16/0.31  % DateTime   : Tue Apr 30 18:29:06 EDT 2024
% 0.16/0.31  % CPUTime    : 
% 0.16/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.16/0.31  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.BjQx5z9ORU/Vampire---4.8_17178
% 0.60/0.80  % (17289)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.80  % (17290)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.80  % (17291)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.80  % (17288)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.80  % (17292)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.80  % (17293)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.80  % (17294)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.80  % (17287)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.80  % (17289)First to succeed.
% 0.60/0.80  % (17289)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for Vampire---4
% 0.60/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80  % (17289)------------------------------
% 0.60/0.80  % (17289)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80  % (17289)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (17289)Memory used [KB]: 1097
% 0.60/0.80  % (17289)Time elapsed: 0.004 s
% 0.60/0.80  % (17289)Instructions burned: 5 (million)
% 0.60/0.80  % (17289)------------------------------
% 0.60/0.80  % (17289)------------------------------
% 0.60/0.80  % (17285)Success in time 0.483 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------