↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n010.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:53 AM UTC 2026

% Result   : Theorem 11.52s 7.16s
% Output   : CNFRefutation 11.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   52 (  22 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   55 (  26   ~;  17   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   54 (  15 sgn  12   !;  12   ?)

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

fof(axiom_2,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( X2 = X1
        & r2(X0,X2) )
      | ( X2 != X1
        & ~ r2(X0,X2) ) ) ).

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

fof(axiom_7a,axiom,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( X2 != X1
          | ~ r1(X2) ) ) ).

fof(infiniteNumbers,conjecture,
    ! [X0] :
    ? [X1,X2] :
      ( ? [X4] :
          ( X4 = X1
          & r3(X0,X2,X4) )
      & ! [X3] :
          ( X2 != X3
          | ~ r1(X3) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
      ? [X1,X2] :
        ( ? [X4] :
            ( X4 = X1
            & r3(X0,X2,X4) )
        & ! [X3] :
            ( X2 != X3
            | ~ r1(X3) ) ),
    inference(negate_conjecture,[status(cth)],[infiniteNumbers]) ).

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

cnf(c6,plain,
    ( r2(X1,X0)
    | X0 != sK3(X1) ),
    inference(clausification,[status(esa)],[axiom_2]) ).

cnf(c20,plain,
    r3(X0,X1,sK18(X0,X1)),
    inference(clausification,[status(esa)],[axiom_1a]) ).

cnf(c38,plain,
    ( ~ r2(X2,X1)
    | X0 != X1
    | ~ r1(X0) ),
    inference(clausification,[status(esa)],[axiom_7a]) ).

cnf(c39,plain,
    ( X1 != X2
    | ~ r3(sK43,X0,X1)
    | r1(sK46(X0)) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c40,plain,
    ( X1 != X2
    | ~ r3(sK43,X0,X1)
    | X0 = sK46(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ r3(sK43,X0,X1)
    | X0 = sK46(X0) ),
    inference(equality_resolution,[status(thm)],[c40]) ).

cnf(d1,plain,
    X0 = sK46(X0),
    inference(resolution,[status(thm)],[c20,d0]) ).

cnf(d2,plain,
    ( ~ r3(sK43,X0,X1)
    | r1(sK46(X0)) ),
    inference(equality_resolution,[status(thm)],[c39]) ).

cnf(d3,plain,
    r1(sK46(X0)),
    inference(resolution,[status(thm)],[c20,d2]) ).

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

cnf(d5,plain,
    X0 = sK0,
    inference(resolution,[status(thm)],[d4,c1]) ).

cnf(d6,plain,
    X1 = X0,
    inference(superposition,[status(thm)],[d5,d5]) ).

cnf(d7,plain,
    r2(X0,X1),
    inference(resolution,[status(thm)],[d6,c6]) ).

cnf(d8,plain,
    ( ~ r1(X0)
    | X0 != X1 ),
    inference(resolution,[status(thm)],[d7,c38]) ).

cnf(d9,plain,
    X0 != X1,
    inference(resolution,[status(thm)],[d4,d8]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[d6,d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN062+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.59  % Computer : n010.cluster.edu
% 0.10/5.59  % Model    : x86_64 x86_64
% 0.10/5.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.59  % Memory   : 8046.5625MB
% 0.10/5.59  % OS       : Linux 6.8.0-71-generic
% 0.10/5.59  % CPULimit : 300
% 0.10/5.59  % WCLimit  : 300
% 0.10/5.59  % DateTime : Sat Sep 26 04:29:28 UTC 2026
% 0.10/5.59  % CPUTime  : 
% 0.10/5.59  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.52/7.16  % SZS status Theorem for theBenchmark.p
% 11.52/7.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------