↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 10.57s 1.96s
% Output   : CNFRefutation 10.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   58 (  22   ~;  26   |;   2   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(connectedness_r1_ordinal1,axiom,
    ! [X0,X1] :
      ( ( ordinal(X1)
        & ordinal(X0) )
     => ( 'ordinal$usubset'(X1,X0)
        | 'ordinal$usubset'(X0,X1) ) ) ).

fof(d9_xboole_0,axiom,
    ! [X0,X1] :
      ( 'inclusion$ucomparable'(X0,X1)
    <=> ( subset(X1,X0)
        | subset(X0,X1) ) ) ).

fof(redefinition_r1_ordinal1,axiom,
    ! [X0,X1] :
      ( ( ordinal(X1)
        & ordinal(X0) )
     => ( 'ordinal$usubset'(X0,X1)
      <=> subset(X0,X1) ) ) ).

fof(t25_ordinal1,conjecture,
    ! [X0] :
      ( ordinal(X0)
     => ! [X1] :
          ( ordinal(X1)
         => 'inclusion$ucomparable'(X0,X1) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ordinal(X0)
       => ! [X1] :
            ( ordinal(X1)
           => 'inclusion$ucomparable'(X0,X1) ) ),
    inference(negate_conjecture,[status(cth)],[t25_ordinal1]) ).

cnf(c9,plain,
    ( 'ordinal$usubset'(X1,X0)
    | 'ordinal$usubset'(X0,X1)
    | ~ ordinal(X1)
    | ~ ordinal(X0) ),
    inference(clausification,[status(esa)],[connectedness_r1_ordinal1]) ).

cnf(c11,plain,
    ( ~ subset(X0,X1)
    | 'inclusion$ucomparable'(X0,X1) ),
    inference(clausification,[status(esa)],[d9_xboole_0]) ).

cnf(c12,plain,
    ( ~ subset(X1,X0)
    | 'inclusion$ucomparable'(X0,X1) ),
    inference(clausification,[status(esa)],[d9_xboole_0]) ).

cnf(c45,plain,
    ( subset(X0,X1)
    | ~ 'ordinal$usubset'(X0,X1)
    | ~ ordinal(X1)
    | ~ ordinal(X0) ),
    inference(clausification,[status(esa)],[redefinition_r1_ordinal1]) ).

cnf(c60,plain,
    ordinal(sK51),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c61,plain,
    ordinal(sK52),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c62,plain,
    ~ 'inclusion$ucomparable'(sK51,sK52),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'ordinal$usubset'(X0,X1)
    | ~ ordinal(X0)
    | ~ ordinal(X1)
    | subset(X1,X0)
    | ~ ordinal(X1)
    | ~ ordinal(X0) ),
    inference(resolution,[status(thm)],[c45,c9]) ).

cnf(d1,plain,
    ( subset(X1,X0)
    | ~ ordinal(X1)
    | ~ ordinal(X0)
    | subset(X0,X1)
    | ~ ordinal(X1)
    | ~ ordinal(X0) ),
    inference(resolution,[status(thm)],[d0,c45]) ).

cnf(d2,plain,
    ( 'inclusion$ucomparable'(X0,X1)
    | subset(X1,X0)
    | ~ ordinal(X1)
    | ~ ordinal(X0) ),
    inference(resolution,[status(thm)],[d1,c11]) ).

cnf(d3,plain,
    ( subset(sK52,sK51)
    | ~ ordinal(sK51)
    | ~ ordinal(sK52) ),
    inference(resolution,[status(thm)],[d2,c62]) ).

cnf(d4,plain,
    ( subset(sK52,sK51)
    | ~ ordinal(sK52) ),
    inference(resolution,[status(thm)],[c60,d3]) ).

cnf(d5,plain,
    subset(sK52,sK51),
    inference(resolution,[status(thm)],[c61,d4]) ).

cnf(d6,plain,
    'inclusion$ucomparable'(sK51,sK52),
    inference(resolution,[status(thm)],[d5,c12]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c62,d6]) ).

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