↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n026.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:11:06 AM UTC 2026

% Result   : Theorem 12.80s 2.75s
% Output   : CNFRefutation 12.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   3 unt;   0 def)
%            Number of atoms       :   14 (   2 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   13 (   6   ~;   1   |;   3   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    8 (   1 sgn   2   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(less_property,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( X1 != X0
        & ~ less(X1,X0) ) ) ).

fof(sum_something_n0_samething,conjecture,
    ? [X0] :
      ( ( less(X0,n1)
        & less(nn1,X0) )
     => sum(n21,X0,n21) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] :
        ( ( less(X0,n1)
          & less(nn1,X0) )
       => sum(n21,X0,n21) ),
    inference(negate_conjecture,[status(cth)],[sum_something_n0_samething]) ).

cnf(c284,plain,
    ( X1 != X0
    | ~ less(X0,X1) ),
    inference(clausification,[status(esa)],[less_property]) ).

cnf(c407,plain,
    less(X0,n1),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ less(X0,X0),
    inference(equality_resolution,[status(thm)],[c284]) ).

cnf(d1,plain,
    $false,
    inference(resolution,[status(thm)],[d0,c407]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n026.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 02:31:09 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.80/2.75  % SZS status Theorem for theBenchmark.p
% 12.80/2.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------