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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWV165+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n025.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:44:21 EDT 2024

% Result   : Theorem 43.13s 43.31s
% Output   : Refutation 43.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  18 unt;   0 def)
%            Number of atoms       :   71 (  17 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   60 (  27   ~;  18   |;  11   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   46 (   0 sgn  22   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

fof(c452,plain,
    ! [X] : ~ gt(X,X),
    inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).

fof(c453,plain,
    ! [X175] : ~ gt(X175,X175),
    inference(variable_rename,[status(thm)],[c452]) ).

cnf(c454,plain,
    ~ gt(X183,X183),
    inference(split_conjunct,[status(thm)],[c453]) ).

fof(leq_succ_gt,axiom,
    ! [X,Y] :
      ( leq(succ(X),Y)
     => gt(Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).

fof(c109,plain,
    ! [X,Y] :
      ( ~ leq(succ(X),Y)
      | gt(Y,X) ),
    inference(fof_nnf,[status(thm)],[leq_succ_gt]) ).

fof(c110,plain,
    ! [X43,X44] :
      ( ~ leq(succ(X43),X44)
      | gt(X44,X43) ),
    inference(variable_rename,[status(thm)],[c109]) ).

cnf(c111,plain,
    ( ~ leq(succ(X319),X320)
    | gt(X320,X319) ),
    inference(split_conjunct,[status(thm)],[c110]) ).

fof(cl5_nebula_init_0001,conjecture,
    ! [A] :
      ( ( leq(n0,A)
        & leq(A,tptp_minus_1) )
     => uninit = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).

fof(c66,negated_conjecture,
    ~ ! [A] :
        ( ( leq(n0,A)
          & leq(A,tptp_minus_1) )
       => uninit = init ),
    inference(assume_negation,[status(cth)],[cl5_nebula_init_0001]) ).

fof(c67,negated_conjecture,
    ? [A] :
      ( leq(n0,A)
      & leq(A,tptp_minus_1)
      & uninit != init ),
    inference(fof_nnf,[status(thm)],[c66]) ).

fof(c68,negated_conjecture,
    ( ? [A] :
        ( leq(n0,A)
        & leq(A,tptp_minus_1) )
    & uninit != init ),
    inference(shift_quantors,[status(thm)],[c67]) ).

fof(c69,negated_conjecture,
    ( ? [X8] :
        ( leq(n0,X8)
        & leq(X8,tptp_minus_1) )
    & uninit != init ),
    inference(variable_rename,[status(thm)],[c68]) ).

fof(c70,negated_conjecture,
    ( leq(n0,skolem0001)
    & leq(skolem0001,tptp_minus_1)
    & uninit != init ),
    inference(skolemize,[status(esa)],[c69]) ).

cnf(c72,negated_conjecture,
    leq(skolem0001,tptp_minus_1),
    inference(split_conjunct,[status(thm)],[c70]) ).

fof(transitivity_leq,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & leq(Y,Z) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

fof(c447,plain,
    ! [X,Y,Z] :
      ( ~ leq(X,Y)
      | ~ leq(Y,Z)
      | leq(X,Z) ),
    inference(fof_nnf,[status(thm)],[transitivity_leq]) ).

fof(c448,plain,
    ! [X171,X172,X173] :
      ( ~ leq(X171,X172)
      | ~ leq(X172,X173)
      | leq(X171,X173) ),
    inference(variable_rename,[status(thm)],[c447]) ).

cnf(c449,plain,
    ( ~ leq(X2176,X2175)
    | ~ leq(X2175,X2177)
    | leq(X2176,X2177) ),
    inference(split_conjunct,[status(thm)],[c448]) ).

cnf(c24846,plain,
    ( ~ leq(X2434,skolem0001)
    | leq(X2434,tptp_minus_1) ),
    inference(resolution,[status(thm)],[c449,c72]) ).

cnf(c71,negated_conjecture,
    leq(n0,skolem0001),
    inference(split_conjunct,[status(thm)],[c70]) ).

cnf(c24819,plain,
    ( ~ leq(X2352,n0)
    | leq(X2352,skolem0001) ),
    inference(resolution,[status(thm)],[c449,c71]) ).

cnf(symmetry,axiom,
    ( X184 != X185
    | X185 = X184 ),
    theory(equality) ).

fof(succ_tptp_minus_1,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).

cnf(c144,plain,
    succ(tptp_minus_1) = n0,
    inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).

cnf(c488,plain,
    n0 = succ(tptp_minus_1),
    inference(resolution,[status(thm)],[c144,symmetry]) ).

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

fof(reflexivity_leq,axiom,
    ! [X] : leq(X,X),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).

fof(c450,plain,
    ! [X174] : leq(X174,X174),
    inference(variable_rename,[status(thm)],[reflexivity_leq]) ).

cnf(c451,plain,
    leq(X182,X182),
    inference(split_conjunct,[status(thm)],[c450]) ).

cnf(c19,axiom,
    ( X286 != X285
    | X284 != X287
    | ~ leq(X286,X284)
    | leq(X285,X287) ),
    theory(equality) ).

cnf(c699,plain,
    ( X2958 != X2959
    | X2958 != X2957
    | leq(X2959,X2957) ),
    inference(resolution,[status(thm)],[c19,c451]) ).

cnf(c49974,plain,
    ( X2964 != X2965
    | leq(X2965,X2964) ),
    inference(resolution,[status(thm)],[c699,reflexivity]) ).

cnf(c50037,plain,
    leq(succ(tptp_minus_1),n0),
    inference(resolution,[status(thm)],[c49974,c488]) ).

cnf(c50727,plain,
    leq(succ(tptp_minus_1),skolem0001),
    inference(resolution,[status(thm)],[c50037,c24819]) ).

cnf(c51909,plain,
    leq(succ(tptp_minus_1),tptp_minus_1),
    inference(resolution,[status(thm)],[c50727,c24846]) ).

cnf(c52251,plain,
    gt(tptp_minus_1,tptp_minus_1),
    inference(resolution,[status(thm)],[c51909,c111]) ).

cnf(c52351,plain,
    $false,
    inference(resolution,[status(thm)],[c52251,c454]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV165+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May  9 05:54:53 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 43.13/43.31  % Version:  1.5
% 43.13/43.31  % SZS status Theorem
% 43.13/43.31  % SZS output start CNFRefutation
% See solution above
% 43.13/43.31  
% 43.13/43.31  % Initial clauses    : 315
% 43.13/43.31  % Processed clauses  : 1421
% 43.13/43.31  % Factors computed   : 445
% 43.13/43.31  % Resolvents computed: 51447
% 43.13/43.31  % Tautologies deleted: 5
% 43.13/43.31  % Forward subsumed   : 1191
% 43.13/43.31  % Backward subsumed  : 0
% 43.13/43.31  % -------- CPU Time ---------
% 43.13/43.31  % User time          : 42.718 s
% 43.13/43.31  % System time        : 0.223 s
% 43.13/43.31  % Total time         : 42.941 s
%------------------------------------------------------------------------------