↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUN059+2 : TPTP v9.3.1. Bugfixed v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:18:52 AM UTC 2026

% Result   : Theorem 11.28s 1.84s
% Output   : CNFRefutation 11.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  18 unt;   0 def)
%            Number of atoms       :   60 (  15 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   50 (  19   ~;  12   |;  19   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   69 (   8 sgn   5   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( X1 = X0
        & r1(X1) )
      | ( X1 != X0
        & ~ r1(X1) ) ) ).

fof(axiom_2a,axiom,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X5] :
          ( r4(X0,X1,X5)
          & r3(X5,X0,X2) )
      & ? [X3] :
          ( X3 = X2
          & ? [X4] :
              ( r4(X0,X4,X3)
              & r2(X1,X4) ) ) ) ).

fof(axiom_4a,axiom,
    ! [X0] :
    ? [X1] :
      ( X1 = X0
      & ? [X2] :
          ( r3(X0,X2,X1)
          & r1(X2) ) ) ).

fof(axiom_5a,axiom,
    ! [X0] :
    ? [X1] :
      ( ? [X3] :
          ( X1 = X3
          & r1(X3) )
      & ? [X2] :
          ( r4(X0,X2,X1)
          & r1(X2) ) ) ).

fof(fermattothepoweroftwo,conjecture,
    ? [X0,X1,X2,X3] :
      ( ? [X5] :
          ( ? [X6] :
              ( r3(X6,X5,X3)
              & r4(X0,X0,X6) )
          & r4(X1,X1,X5) )
      & ? [X4] :
          ( X3 = X4
          & r4(X2,X2,X4) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0,X1,X2,X3] :
        ( ? [X5] :
            ( ? [X6] :
                ( r3(X6,X5,X3)
                & r4(X0,X0,X6) )
            & r4(X1,X1,X5) )
        & ? [X4] :
            ( X3 = X4
            & r4(X2,X2,X4) ) ),
    inference(negate_conjecture,[status(cth)],[fermattothepoweroftwo]) ).

cnf(c1,plain,
    ( X0 = sK0
    | ~ r1(X0) ),
    inference(clausification,[status(esa)],[axiom_1]) ).

cnf(c25,plain,
    r4(X0,X1,sK24(X0,X1)),
    inference(clausification,[status(esa)],[axiom_2a]) ).

cnf(c27,plain,
    r1(sK31(X0)),
    inference(clausification,[status(esa)],[axiom_4a]) ).

cnf(c28,plain,
    r3(X0,sK31(X0),sK30(X0)),
    inference(clausification,[status(esa)],[axiom_4a]) ).

cnf(c29,plain,
    sK30(X0) = X0,
    inference(clausification,[status(esa)],[axiom_4a]) ).

cnf(c30,plain,
    r1(sK34(X0)),
    inference(clausification,[status(esa)],[axiom_5a]) ).

cnf(c31,plain,
    r4(X0,sK34(X0),sK33(X0)),
    inference(clausification,[status(esa)],[axiom_5a]) ).

cnf(c32,plain,
    r1(sK35(X0)),
    inference(clausification,[status(esa)],[axiom_5a]) ).

cnf(c33,plain,
    sK33(X0) = sK35(X0),
    inference(clausification,[status(esa)],[axiom_5a]) ).

cnf(c39,plain,
    ( ~ r4(X6,X6,X5)
    | ~ r3(X3,X1,X4)
    | X4 != X5
    | ~ r4(X2,X2,X3)
    | ~ r4(X0,X0,X1) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    sK35(X0) = sK0,
    inference(resolution,[status(thm)],[c32,c1]) ).

cnf(d1,plain,
    sK33(X0) = sK0,
    inference(demodulation,[status(thm)],[c33,d0]) ).

cnf(d2,plain,
    sK34(X0) = sK0,
    inference(resolution,[status(thm)],[c30,c1]) ).

cnf(d3,plain,
    r4(X0,sK0,sK33(X0)),
    inference(demodulation,[status(thm)],[c31,d2]) ).

cnf(d4,plain,
    r4(X0,sK0,sK0),
    inference(demodulation,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    ( ~ r4(X5,X5,X2)
    | ~ r4(X4,X4,X1)
    | ~ r4(X3,X3,X0)
    | ~ r3(X0,X1,X2) ),
    inference(equality_resolution,[status(thm)],[c39]) ).

cnf(d6,plain,
    ( ~ r4(X4,X4,X1)
    | ~ r4(X3,X3,X2)
    | ~ r3(sK24(X0,X0),X1,X2) ),
    inference(resolution,[status(thm)],[c25,d5]) ).

cnf(d7,plain,
    sK31(X0) = sK0,
    inference(resolution,[status(thm)],[c27,c1]) ).

cnf(d8,plain,
    r3(X0,sK0,sK30(X0)),
    inference(demodulation,[status(thm)],[c28,d7]) ).

cnf(d9,plain,
    r3(X0,sK0,X0),
    inference(demodulation,[status(thm)],[d8,c29]) ).

cnf(d10,plain,
    ( ~ r4(X1,X1,sK24(X2,X2))
    | ~ r4(X0,X0,sK0) ),
    inference(resolution,[status(thm)],[d9,d6]) ).

cnf(d11,plain,
    ~ r4(X0,X0,sK0),
    inference(resolution,[status(thm)],[d10,c25]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[d11,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUN059+2 : TPTP v9.3.1. Bugfixed v7.4.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n002.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep 26 04:31:06 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.28/1.84  % SZS status Theorem for theBenchmark.p
% 11.28/1.84  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------