↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUM298+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:01 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(rdn2,axiom,
    'rdn$utranslate'(n2,'rdn$upos'(rdnn(n2))) ).

fof(rdnn2,axiom,
    'rdn$utranslate'(nn2,'rdn$uneg'(rdnn(n2))) ).

fof(less_entry_point_neg_pos,axiom,
    ! [X0,X1,X2,X3] :
      ( ( 'rdn$utranslate'(X1,'rdn$upos'(X3))
        & 'rdn$utranslate'(X0,'rdn$uneg'(X2)) )
     => less(X0,X1) ) ).

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

fof(n2_not_less_nn2,conjecture,
    ~ less(n2,nn2) ).

fof(negated_conjecture,negated_conjecture,
    ~ ~ less(n2,nn2),
    inference(negate_conjecture,[status(cth)],[n2_not_less_nn2]) ).

cnf(c2,plain,
    'rdn$utranslate'(n2,'rdn$upos'(rdnn(n2))),
    inference(clausification,[status(esa)],[rdn2]) ).

cnf(c10,plain,
    'rdn$utranslate'(nn2,'rdn$uneg'(rdnn(n2))),
    inference(clausification,[status(esa)],[rdnn2]) ).

cnf(c27,plain,
    ( less(X0,X2)
    | ~ 'rdn$utranslate'(X2,'rdn$upos'(X3))
    | ~ 'rdn$utranslate'(X0,'rdn$uneg'(X1)) ),
    inference(clausification,[status(esa)],[less_entry_point_neg_pos]) ).

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

cnf(c146,plain,
    less(n2,nn2),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( less(X0,n2)
    | ~ 'rdn$utranslate'(X0,'rdn$uneg'(X1)) ),
    inference(resolution,[status(thm)],[c27,c2]) ).

cnf(d1,plain,
    less(nn2,n2),
    inference(resolution,[status(thm)],[d0,c10]) ).

cnf(d2,plain,
    ~ less(nn2,n2),
    inference(resolution,[status(thm)],[c29,c146]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[d2,d1]) ).

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