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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GEO498+1 : TPTP v8.1.2. Released v7.0.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 : n010.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 : Sun May  5 05:11:50 EDT 2024

% Result   : Theorem 0.60s 0.76s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  10 unt;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   28 (  13   ~;   6   |;   8   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (  18   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f207,plain,
    $false,
    inference(subsumption_resolution,[],[f206,f154]) ).

fof(f154,plain,
    sK1 != sK3,
    inference(cnf_transformation,[],[f151]) ).

fof(f151,plain,
    ( sK1 != sK3
    & sK2 = s(sK0,sK3)
    & sK2 = s(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f149,f150]) ).

fof(f150,plain,
    ( ? [X0,X1,X2,X3] :
        ( X1 != X3
        & s(X0,X3) = X2
        & s(X0,X1) = X2 )
   => ( sK1 != sK3
      & sK2 = s(sK0,sK3)
      & sK2 = s(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f149,plain,
    ? [X0,X1,X2,X3] :
      ( X1 != X3
      & s(X0,X3) = X2
      & s(X0,X1) = X2 ),
    inference(ennf_transformation,[],[f112]) ).

fof(f112,plain,
    ~ ! [X0,X1,X2,X3] :
        ( X1 = X3
        | s(X0,X3) != X2
        | s(X0,X1) != X2 ),
    inference(rectify,[],[f101]) ).

fof(f101,negated_conjecture,
    ~ ! [X11,X12,X26,X15] :
        ( X12 = X15
        | s(X11,X15) != X26
        | s(X11,X12) != X26 ),
    inference(negated_conjecture,[],[f100]) ).

fof(f100,conjecture,
    ! [X11,X12,X26,X15] :
      ( X12 = X15
      | s(X11,X15) != X26
      | s(X11,X12) != X26 ),
    file('/export/starexec/sandbox/tmp/tmp.EmG1oj5h9O/Vampire---4.8_26196',aSatz7_8) ).

fof(f206,plain,
    sK1 = sK3,
    inference(forward_demodulation,[],[f205,f162]) ).

fof(f162,plain,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    inference(cnf_transformation,[],[f119]) ).

fof(f119,plain,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    inference(rectify,[],[f99]) ).

fof(f99,axiom,
    ! [X11,X12] : s(X11,s(X11,X12)) = X12,
    file('/export/starexec/sandbox/tmp/tmp.EmG1oj5h9O/Vampire---4.8_26196',aSatz7_7) ).

fof(f205,plain,
    sK3 = s(sK0,s(sK0,sK1)),
    inference(forward_demodulation,[],[f201,f152]) ).

fof(f152,plain,
    sK2 = s(sK0,sK1),
    inference(cnf_transformation,[],[f151]) ).

fof(f201,plain,
    sK3 = s(sK0,sK2),
    inference(superposition,[],[f162,f153]) ).

fof(f153,plain,
    sK2 = s(sK0,sK3),
    inference(cnf_transformation,[],[f151]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GEO498+1 : TPTP v8.1.2. Released v7.0.0.
% 0.03/0.15  % 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.15/0.36  % Computer : n010.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 22:04:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.EmG1oj5h9O/Vampire---4.8_26196
% 0.59/0.75  % (26581)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 (2996ds/56Mi)
% 0.59/0.75  % (26573)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 (2996ds/34Mi)
% 0.59/0.75  % (26575)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75  % (26574)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 (2996ds/51Mi)
% 0.59/0.75  % (26577)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 (2996ds/34Mi)
% 0.59/0.75  % (26576)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75  % (26578)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75  % (26580)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 (2996ds/83Mi)
% 0.60/0.76  % (26576)Refutation not found, incomplete strategy% (26576)------------------------------
% 0.60/0.76  % (26576)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (26576)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76  
% 0.60/0.76  % (26576)Memory used [KB]: 1144
% 0.60/0.76  % (26576)Time elapsed: 0.004 s
% 0.60/0.76  % (26576)Instructions burned: 4 (million)
% 0.60/0.76  % (26578)First to succeed.
% 0.60/0.76  % (26576)------------------------------
% 0.60/0.76  % (26576)------------------------------
% 0.60/0.76  % (26578)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26447"
% 0.60/0.76  % (26575)Also succeeded, but the first one will report.
% 0.60/0.76  % (26578)Refutation found. Thanks to Tanya!
% 0.60/0.76  % SZS status Theorem for Vampire---4
% 0.60/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76  % (26578)------------------------------
% 0.60/0.76  % (26578)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (26578)Termination reason: Refutation
% 0.60/0.76  
% 0.60/0.76  % (26578)Memory used [KB]: 1168
% 0.60/0.76  % (26578)Time elapsed: 0.004 s
% 0.60/0.76  % (26578)Instructions burned: 5 (million)
% 0.60/0.76  % (26447)Success in time 0.388 s
% 0.60/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------