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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC291+1 : TPTP v8.1.2. Released v2.4.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 : n026.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:01:10 EDT 2024

% Result   : Theorem 0.57s 0.75s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   5 unt;   0 def)
%            Number of atoms       :   61 (   9 equ)
%            Maximal formula atoms :   14 (   6 avg)
%            Number of connectives :   75 (  23   ~;  18   |;  26   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (  10   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f268,plain,
    $false,
    inference(subsumption_resolution,[],[f172,f254]) ).

fof(f254,plain,
    ~ strictorderedP(sK2),
    inference(definition_unfolding,[],[f173,f170]) ).

fof(f170,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f99]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ strictorderedP(X0)
                  & ! [X4] :
                      ( ~ strictorderedP(X4)
                      | ~ segmentP(X4,X2)
                      | ~ segmentP(X3,X4)
                      | ~ neq(X2,X4)
                      | ~ ssList(X4) )
                  & strictorderedP(X2)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ strictorderedP(X0)
                  & ! [X4] :
                      ( ~ strictorderedP(X4)
                      | ~ segmentP(X4,X2)
                      | ~ segmentP(X3,X4)
                      | ~ neq(X2,X4)
                      | ~ ssList(X4) )
                  & strictorderedP(X2)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( strictorderedP(X0)
                      | ? [X4] :
                          ( strictorderedP(X4)
                          & segmentP(X4,X2)
                          & segmentP(X3,X4)
                          & neq(X2,X4)
                          & ssList(X4) )
                      | ~ strictorderedP(X2)
                      | ~ segmentP(X3,X2)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( strictorderedP(X0)
                    | ? [X4] :
                        ( strictorderedP(X4)
                        & segmentP(X4,X2)
                        & segmentP(X3,X4)
                        & neq(X2,X4)
                        & ssList(X4) )
                    | ~ strictorderedP(X2)
                    | ~ segmentP(X3,X2)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.I1CO8xLhLP/Vampire---4.8_31363',co1) ).

fof(f173,plain,
    ~ strictorderedP(sK0),
    inference(cnf_transformation,[],[f99]) ).

fof(f172,plain,
    strictorderedP(sK2),
    inference(cnf_transformation,[],[f99]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SWC291+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/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 : n026.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   : Tue Apr 30 18:40:49 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.I1CO8xLhLP/Vampire---4.8_31363
% 0.57/0.74  % (31628)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.57/0.75  % (31621)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.57/0.75  % (31625)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.57/0.75  % (31624)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.57/0.75  % (31622)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.57/0.75  % (31627)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.57/0.75  % (31629)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.57/0.75  % (31628)First to succeed.
% 0.57/0.75  % (31625)Also succeeded, but the first one will report.
% 0.57/0.75  % (31628)Refutation found. Thanks to Tanya!
% 0.57/0.75  % SZS status Theorem for Vampire---4
% 0.57/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75  % (31628)------------------------------
% 0.57/0.75  % (31628)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75  % (31628)Termination reason: Refutation
% 0.57/0.75  
% 0.57/0.75  % (31628)Memory used [KB]: 1139
% 0.57/0.75  % (31628)Time elapsed: 0.004 s
% 0.57/0.75  % (31628)Instructions burned: 8 (million)
% 0.57/0.75  % (31628)------------------------------
% 0.57/0.75  % (31628)------------------------------
% 0.57/0.75  % (31617)Success in time 0.379 s
% 0.57/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------