TSTP Solution File: SWV135+1 by PyRes---1.3

View Problem - Process Solution

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

% Computer : n012.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  : 600s
% DateTime : Wed Jul 20 21:15:56 EDT 2022

% Result   : Theorem 35.51s 35.72s
% Output   : Refutation 35.51s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(gauss_array_0005,conjecture,
    ( ( leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n2,pv1325)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv1325,n3) )
   => leq(n0,pv1325) ),
    input ).

fof(c66,negated_conjecture,
    ~ ( ( leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n2,pv1325)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv1325,n3) )
     => leq(n0,pv1325) ),
    inference(assume_negation,status(cth),[gauss_array_0005]) ).

fof(c67,negated_conjecture,
    ( leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n2,pv1325)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv1325,n3)
    & ~ leq(n0,pv1325) ),
    inference(fof_nnf,status(thm),[c66]) ).

cnf(c76,negated_conjecture,
    ~ leq(n0,pv1325),
    inference(split_conjunct,status(thm),[c67]) ).

fof(gt_2_0,axiom,
    gt(n2,n0),
    input ).

cnf(c55,axiom,
    gt(n2,n0),
    inference(split_conjunct,status(thm),[gt_2_0]) ).

fof(leq_gt1,axiom,
    ! [X,Y] :
      ( gt(Y,X)
     => leq(X,Y) ),
    input ).

fof(c435,axiom,
    ! [X,Y] :
      ( ~ gt(Y,X)
      | leq(X,Y) ),
    inference(fof_nnf,status(thm),[leq_gt1]) ).

fof(c436,axiom,
    ! [X160,X161] :
      ( ~ gt(X161,X160)
      | leq(X160,X161) ),
    inference(variable_rename,status(thm),[c435]) ).

cnf(c437,axiom,
    ( ~ gt(X212,X213)
    | leq(X213,X212) ),
    inference(split_conjunct,status(thm),[c436]) ).

cnf(c505,plain,
    leq(n0,n2),
    inference(resolution,status(thm),[c437,c55]) ).

cnf(c71,negated_conjecture,
    leq(n2,pv1325),
    inference(split_conjunct,status(thm),[c67]) ).

fof(transitivity_leq,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & leq(Y,Z) )
     => leq(X,Z) ),
    input ).

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

fof(c451,axiom,
    ! [X170,X171,X172] :
      ( ~ leq(X170,X171)
      | ~ leq(X171,X172)
      | leq(X170,X172) ),
    inference(variable_rename,status(thm),[c450]) ).

cnf(c452,axiom,
    ( ~ leq(X2201,X2200)
    | ~ leq(X2200,X2199)
    | leq(X2201,X2199) ),
    inference(split_conjunct,status(thm),[c451]) ).

cnf(c30620,plain,
    ( ~ leq(X2650,n2)
    | leq(X2650,pv1325) ),
    inference(resolution,status(thm),[c452,c71]) ).

cnf(c46756,plain,
    leq(n0,pv1325),
    inference(resolution,status(thm),[c30620,c505]) ).

cnf(c46868,plain,
    $false,
    inference(resolution,status(thm),[c46756,c76]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV135+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 17:17:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 35.51/35.72  # Version:  1.3
% 35.51/35.72  # SZS status Theorem
% 35.51/35.72  # SZS output start CNFRefutation
% See solution above
% 35.51/35.72  
% 35.51/35.72  # Initial clauses    : 321
% 35.51/35.72  # Processed clauses  : 1268
% 35.51/35.72  # Factors computed   : 1
% 35.51/35.72  # Resolvents computed: 46456
% 35.51/35.72  # Tautologies deleted: 2
% 35.51/35.72  # Forward subsumed   : 938
% 35.51/35.72  # Backward subsumed  : 0
% 35.51/35.72  # -------- CPU Time ---------
% 35.51/35.72  # User time          : 35.156 s
% 35.51/35.72  # System time        : 0.193 s
% 35.51/35.72  # Total time         : 35.349 s
%------------------------------------------------------------------------------