TSTP Solution File: SWC102+1 by PyRes---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n029.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 : Thu May  9 17:43:17 EDT 2024

% Result   : Theorem 18.28s 18.49s
% Output   : Refutation 18.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  15 unt;   0 def)
%            Number of atoms       :  112 (  45 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  119 (  43   ~;  36   |;  27   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   46 (   0 sgn  15   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | X != W
                    | ~ neq(V,nil)
                    | ( neq(U,nil)
                      & frontsegP(V,U) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(c23,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | X != W
                      | ~ neq(V,nil)
                      | ( neq(U,nil)
                        & frontsegP(V,U) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c24,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | X != W
                      | ~ neq(V,nil)
                      | ( neq(U,nil)
                        & frontsegP(V,U) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c23]) ).

fof(c25,negated_conjecture,
    ? [U] :
      ( ssList(U)
      & ? [V] :
          ( ssList(V)
          & ? [W] :
              ( ssList(W)
              & ? [X] :
                  ( ssList(X)
                  & V = X
                  & U = W
                  & X = W
                  & neq(V,nil)
                  & ( ~ neq(U,nil)
                    | ~ frontsegP(V,U) ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c24]) ).

fof(c26,negated_conjecture,
    ? [X2] :
      ( ssList(X2)
      & ? [X3] :
          ( ssList(X3)
          & ? [X4] :
              ( ssList(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & X3 = X5
                  & X2 = X4
                  & X5 = X4
                  & neq(X3,nil)
                  & ( ~ neq(X2,nil)
                    | ~ frontsegP(X3,X2) ) ) ) ) ),
    inference(variable_rename,[status(thm)],[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & skolem0004 = skolem0003
    & neq(skolem0002,nil)
    & ( ~ neq(skolem0001,nil)
      | ~ frontsegP(skolem0002,skolem0001) ) ),
    inference(skolemize,[status(esa)],[c26]) ).

cnf(c32,negated_conjecture,
    skolem0002 = skolem0004,
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(transitivity,axiom,
    ( X255 != X254
    | X254 != X253
    | X255 = X253 ),
    theory(equality) ).

cnf(c34,negated_conjecture,
    skolem0004 = skolem0003,
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c518,plain,
    ( X382 != skolem0004
    | X382 = skolem0003 ),
    inference(resolution,[status(thm)],[c34,transitivity]) ).

cnf(c723,plain,
    skolem0002 = skolem0003,
    inference(resolution,[status(thm)],[c518,c32]) ).

cnf(symmetry,axiom,
    ( X252 != X251
    | X251 = X252 ),
    theory(equality) ).

cnf(c33,negated_conjecture,
    skolem0001 = skolem0003,
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c516,plain,
    skolem0003 = skolem0001,
    inference(resolution,[status(thm)],[c33,symmetry]) ).

cnf(c531,plain,
    ( X395 != skolem0003
    | X395 = skolem0001 ),
    inference(resolution,[status(thm)],[c516,transitivity]) ).

cnf(c784,plain,
    skolem0002 = skolem0001,
    inference(resolution,[status(thm)],[c531,c723]) ).

cnf(reflexivity,axiom,
    X250 = X250,
    theory(equality) ).

cnf(c35,negated_conjecture,
    neq(skolem0002,nil),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c5,axiom,
    ( X277 != X279
    | X278 != X276
    | ~ neq(X277,X278)
    | neq(X279,X276) ),
    theory(equality) ).

cnf(c570,plain,
    ( skolem0002 != X740
    | nil != X741
    | neq(X740,X741) ),
    inference(resolution,[status(thm)],[c5,c35]) ).

cnf(c22761,plain,
    ( skolem0002 != X901
    | neq(X901,nil) ),
    inference(resolution,[status(thm)],[c570,reflexivity]) ).

cnf(c43764,plain,
    neq(skolem0001,nil),
    inference(resolution,[status(thm)],[c22761,c784]) ).

cnf(c36,negated_conjecture,
    ( ~ neq(skolem0001,nil)
    | ~ frontsegP(skolem0002,skolem0001) ),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c809,plain,
    skolem0001 = skolem0002,
    inference(resolution,[status(thm)],[c784,symmetry]) ).

cnf(c28,negated_conjecture,
    ssList(skolem0001),
    inference(split_conjunct,[status(thm)],[c27]) ).

fof(ax42,axiom,
    ! [U] :
      ( ssList(U)
     => frontsegP(U,U) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).

fof(c240,plain,
    ! [U] :
      ( ~ ssList(U)
      | frontsegP(U,U) ),
    inference(fof_nnf,[status(thm)],[ax42]) ).

fof(c241,plain,
    ! [X93] :
      ( ~ ssList(X93)
      | frontsegP(X93,X93) ),
    inference(variable_rename,[status(thm)],[c240]) ).

cnf(c242,plain,
    ( ~ ssList(X283)
    | frontsegP(X283,X283) ),
    inference(split_conjunct,[status(thm)],[c241]) ).

cnf(c579,plain,
    frontsegP(skolem0001,skolem0001),
    inference(resolution,[status(thm)],[c242,c28]) ).

cnf(c9,axiom,
    ( X294 != X296
    | X295 != X293
    | ~ frontsegP(X294,X295)
    | frontsegP(X296,X293) ),
    theory(equality) ).

cnf(c597,plain,
    ( skolem0001 != X743
    | skolem0001 != X742
    | frontsegP(X743,X742) ),
    inference(resolution,[status(thm)],[c9,c579]) ).

cnf(c22774,plain,
    ( skolem0001 != X906
    | frontsegP(X906,skolem0001) ),
    inference(resolution,[status(thm)],[c597,reflexivity]) ).

cnf(c43876,plain,
    frontsegP(skolem0002,skolem0001),
    inference(resolution,[status(thm)],[c22774,c809]) ).

cnf(c43886,plain,
    ~ neq(skolem0001,nil),
    inference(resolution,[status(thm)],[c43876,c36]) ).

cnf(c43960,plain,
    $false,
    inference(resolution,[status(thm)],[c43886,c43764]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36  % Computer : n029.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 : Thu May  9 02:44:23 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 18.28/18.49  % Version:  1.5
% 18.28/18.49  % SZS status Theorem
% 18.28/18.49  % SZS output start CNFRefutation
% See solution above
% 18.28/18.49  
% 18.28/18.49  % Initial clauses    : 225
% 18.28/18.49  % Processed clauses  : 1292
% 18.28/18.49  % Factors computed   : 51
% 18.28/18.49  % Resolvents computed: 43404
% 18.28/18.49  % Tautologies deleted: 18
% 18.28/18.49  % Forward subsumed   : 840
% 18.28/18.49  % Backward subsumed  : 1
% 18.28/18.49  % -------- CPU Time ---------
% 18.28/18.49  % User time          : 18.045 s
% 18.28/18.49  % System time        : 0.080 s
% 18.28/18.49  % Total time         : 18.125 s
%------------------------------------------------------------------------------