↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CSR218+1 : TPTP v9.3.1. Released v7.3.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 07:05:08 AM UTC 2026

% Result   : Theorem 61.40s 9.50s
% Output   : CNFRefutation 61.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  18 unt;   0 def)
%            Number of atoms       :  111 (   3 equ)
%            Maximal formula atoms :   40 (   3 avg)
%            Number of connectives :   97 (  19   ~;  12   |;  50   &)
%                                         (  11 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   21 (  19 usr;   1 prp; 0-7 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :   79 (   1 sgn  60   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(predefinitionsA12,axiom,
    ! [X0,X1,X2] :
      ( ( 'p$u$ud$u$usubclass'(X1,X2)
        & 'p$u$ud$u$uinstance'(X0,X1) )
     => 'p$u$ud$u$uinstance'(X0,X2) ) ).

fof(predefinitionsA15,axiom,
    ! [X0,X1] :
      ( 'p$u$ud$u$udisjoint'(X0,X1)
    <=> ! [X2] :
          ( ~ 'p$u$ud$u$uinstance'(X2,X1)
          | ~ 'p$u$ud$u$uinstance'(X2,X0) ) ) ).

fof(predefinitionsA18,axiom,
    ( ! [X0,X1,X2,X3,X4,X5,X6] :
        ( 'p$u$ud$u$upartition7'(X0,X1,X2,X3,X4,X5,X6)
      <=> ( 'p$u$ud$u$udisjointDecomposition7'(X0,X1,X2,X3,X4,X5,X6)
          & 'p$u$ud$u$uexhaustiveDecomposition7'(X0,X1,X2,X3,X4,X5,X6) ) )
    & ! [X0,X1,X2,X3,X4,X5] :
        ( 'p$u$ud$u$upartition6'(X0,X1,X2,X3,X4,X5)
      <=> ( 'p$u$ud$u$udisjointDecomposition6'(X0,X1,X2,X3,X4,X5)
          & 'p$u$ud$u$uexhaustiveDecomposition6'(X0,X1,X2,X3,X4,X5) ) )
    & ! [X0,X1,X2,X3,X4] :
        ( 'p$u$ud$u$upartition5'(X0,X1,X2,X3,X4)
      <=> ( 'p$u$ud$u$udisjointDecomposition5'(X0,X1,X2,X3,X4)
          & 'p$u$ud$u$uexhaustiveDecomposition5'(X0,X1,X2,X3,X4) ) )
    & ! [X0,X1,X2,X3] :
        ( 'p$u$ud$u$upartition4'(X0,X1,X2,X3)
      <=> ( 'p$u$ud$u$udisjointDecomposition4'(X0,X1,X2,X3)
          & 'p$u$ud$u$uexhaustiveDecomposition4'(X0,X1,X2,X3) ) )
    & ! [X0,X1,X2] :
        ( 'p$u$ud$u$upartition3'(X0,X1,X2)
      <=> ( 'p$u$ud$u$udisjointDecomposition3'(X0,X1,X2)
          & 'p$u$ud$u$uexhaustiveDecomposition3'(X0,X1,X2) ) ) ) ).

fof(predefinitionsA24,axiom,
    ( ! [X0,X1,X2,X3,X4,X5,X6] :
        ( 'p$u$ud$u$udisjointDecomposition7'(X0,X1,X2,X3,X4,X5,X6)
      <=> ( 'p$u$ud$u$udisjoint'(X5,X6)
          & 'p$u$ud$u$udisjoint'(X4,X6)
          & 'p$u$ud$u$udisjoint'(X4,X5)
          & 'p$u$ud$u$udisjoint'(X3,X6)
          & 'p$u$ud$u$udisjoint'(X3,X5)
          & 'p$u$ud$u$udisjoint'(X3,X4)
          & 'p$u$ud$u$udisjoint'(X2,X6)
          & 'p$u$ud$u$udisjoint'(X2,X5)
          & 'p$u$ud$u$udisjoint'(X2,X4)
          & 'p$u$ud$u$udisjoint'(X2,X3)
          & 'p$u$ud$u$udisjoint'(X1,X6)
          & 'p$u$ud$u$udisjoint'(X1,X5)
          & 'p$u$ud$u$udisjoint'(X1,X4)
          & 'p$u$ud$u$udisjoint'(X1,X3)
          & 'p$u$ud$u$udisjoint'(X1,X2) ) )
    & ! [X0,X1,X2,X3,X4,X5] :
        ( 'p$u$ud$u$udisjointDecomposition6'(X0,X1,X2,X3,X4,X5)
      <=> ( 'p$u$ud$u$udisjoint'(X4,X5)
          & 'p$u$ud$u$udisjoint'(X3,X5)
          & 'p$u$ud$u$udisjoint'(X3,X4)
          & 'p$u$ud$u$udisjoint'(X2,X5)
          & 'p$u$ud$u$udisjoint'(X2,X4)
          & 'p$u$ud$u$udisjoint'(X2,X3)
          & 'p$u$ud$u$udisjoint'(X1,X5)
          & 'p$u$ud$u$udisjoint'(X1,X4)
          & 'p$u$ud$u$udisjoint'(X1,X3)
          & 'p$u$ud$u$udisjoint'(X1,X2) ) )
    & ! [X0,X1,X2,X3,X4] :
        ( 'p$u$ud$u$udisjointDecomposition5'(X0,X1,X2,X3,X4)
      <=> ( 'p$u$ud$u$udisjoint'(X3,X4)
          & 'p$u$ud$u$udisjoint'(X2,X4)
          & 'p$u$ud$u$udisjoint'(X2,X3)
          & 'p$u$ud$u$udisjoint'(X1,X4)
          & 'p$u$ud$u$udisjoint'(X1,X3)
          & 'p$u$ud$u$udisjoint'(X1,X2) ) )
    & ! [X0,X1,X2,X3] :
        ( 'p$u$ud$u$udisjointDecomposition4'(X0,X1,X2,X3)
      <=> ( 'p$u$ud$u$udisjoint'(X2,X3)
          & 'p$u$ud$u$udisjoint'(X1,X3)
          & 'p$u$ud$u$udisjoint'(X1,X2) ) )
    & ! [X0,X1,X2] :
        ( 'p$u$ud$u$udisjointDecomposition3'(X0,X1,X2)
      <=> 'p$u$ud$u$udisjoint'(X1,X2) ) ) ).

fof(mergeA173,axiom,
    'p$u$ud$u$upartition3'('c$u$uEntity','c$u$uPhysical','c$u$uAbstract') ).

fof(mergeA181,axiom,
    'p$u$ud$u$usubclass'('c$u$uObject','c$u$uPhysical') ).

fof(mergeA332,axiom,
    'p$u$ud$u$usubclass'('c$u$uQuantity','c$u$uAbstract') ).

fof(mergeA354,axiom,
    'p$u$ud$u$usubclass'('c$u$uNumber','c$u$uQuantity') ).

fof(antonymPattern10066,conjecture,
    ! [X0,X1] :
      ( 'p$u$ud$u$uinstance'(X1,'c$u$uObject')
     => ( ( ? [X2] :
              ( 'p$u$uattribute'(X1,X2)
              & 'p$u$ud$u$uinstance'(X2,'c$u$uAttribute')
              & 'p$u$ud$u$uinstance'(X2,'c$u$uAttribute') )
          & 'p$u$ud$u$uinstance'(X0,'c$u$uNumber') )
       => X0 != X1 ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( 'p$u$ud$u$uinstance'(X1,'c$u$uObject')
       => ( ( ? [X2] :
                ( 'p$u$uattribute'(X1,X2)
                & 'p$u$ud$u$uinstance'(X2,'c$u$uAttribute')
                & 'p$u$ud$u$uinstance'(X2,'c$u$uAttribute') )
            & 'p$u$ud$u$uinstance'(X0,'c$u$uNumber') )
         => X0 != X1 ) ),
    inference(negate_conjecture,[status(cth)],[antonymPattern10066]) ).

cnf(c3,plain,
    ( 'p$u$ud$u$uinstance'(X0,X2)
    | ~ 'p$u$ud$u$usubclass'(X1,X2)
    | ~ 'p$u$ud$u$uinstance'(X0,X1) ),
    inference(clausification,[status(esa)],[predefinitionsA12]) ).

cnf(c4,plain,
    ( ~ 'p$u$ud$u$uinstance'(X2,X1)
    | ~ 'p$u$ud$u$uinstance'(X2,X0)
    | ~ 'p$u$ud$u$udisjoint'(X0,X1) ),
    inference(clausification,[status(esa)],[predefinitionsA15]) ).

cnf(c8,plain,
    ( 'p$u$ud$u$udisjointDecomposition3'(X0,X1,X2)
    | ~ 'p$u$ud$u$upartition3'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[predefinitionsA18]) ).

cnf(c22,plain,
    ( 'p$u$ud$u$udisjoint'(X1,X2)
    | ~ 'p$u$ud$u$udisjointDecomposition3'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[predefinitionsA24]) ).

cnf(c71,plain,
    'p$u$ud$u$upartition3'('c$u$uEntity','c$u$uPhysical','c$u$uAbstract'),
    inference(clausification,[status(esa)],[mergeA173]) ).

cnf(c79,plain,
    'p$u$ud$u$usubclass'('c$u$uObject','c$u$uPhysical'),
    inference(clausification,[status(esa)],[mergeA181]) ).

cnf(c112,plain,
    'p$u$ud$u$usubclass'('c$u$uQuantity','c$u$uAbstract'),
    inference(clausification,[status(esa)],[mergeA332]) ).

cnf(c117,plain,
    'p$u$ud$u$usubclass'('c$u$uNumber','c$u$uQuantity'),
    inference(clausification,[status(esa)],[mergeA354]) ).

cnf(c289,plain,
    'p$u$ud$u$uinstance'(sK191,'c$u$uObject'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c290,plain,
    'p$u$ud$u$uinstance'(sK190,'c$u$uNumber'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c294,plain,
    sK190 = sK191,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'p$u$ud$u$uinstance'(sK190,X0)
    | ~ 'p$u$ud$u$usubclass'('c$u$uNumber',X0) ),
    inference(resolution,[status(thm)],[c3,c290]) ).

cnf(d1,plain,
    ( 'p$u$ud$u$uinstance'(sK191,X0)
    | ~ 'p$u$ud$u$usubclass'('c$u$uNumber',X0) ),
    inference(demodulation,[status(thm)],[d0,c294]) ).

cnf(d2,plain,
    'p$u$ud$u$uinstance'(sK191,'c$u$uQuantity'),
    inference(resolution,[status(thm)],[c117,d1]) ).

cnf(d3,plain,
    ( 'p$u$ud$u$uinstance'(sK191,X0)
    | ~ 'p$u$ud$u$usubclass'('c$u$uQuantity',X0) ),
    inference(resolution,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    'p$u$ud$u$uinstance'(sK191,'c$u$uAbstract'),
    inference(resolution,[status(thm)],[d3,c112]) ).

cnf(d5,plain,
    'p$u$ud$u$udisjointDecomposition3'('c$u$uEntity','c$u$uPhysical','c$u$uAbstract'),
    inference(resolution,[status(thm)],[c71,c8]) ).

cnf(d6,plain,
    'p$u$ud$u$udisjoint'('c$u$uPhysical','c$u$uAbstract'),
    inference(resolution,[status(thm)],[d5,c22]) ).

cnf(d7,plain,
    ( ~ 'p$u$ud$u$uinstance'(X0,'c$u$uPhysical')
    | ~ 'p$u$ud$u$uinstance'(X0,'c$u$uAbstract') ),
    inference(resolution,[status(thm)],[d6,c4]) ).

cnf(d8,plain,
    ~ 'p$u$ud$u$uinstance'(sK191,'c$u$uPhysical'),
    inference(resolution,[status(thm)],[d7,d4]) ).

cnf(d9,plain,
    ( 'p$u$ud$u$uinstance'(sK191,X0)
    | ~ 'p$u$ud$u$usubclass'('c$u$uObject',X0) ),
    inference(resolution,[status(thm)],[c3,c289]) ).

cnf(d10,plain,
    'p$u$ud$u$uinstance'(sK191,'c$u$uPhysical'),
    inference(resolution,[status(thm)],[c79,d9]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[d10,d8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR218+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n002.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 : Sun Sep 27 01:35:36 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 61.40/9.50  % SZS status Theorem for theBenchmark.p
% 61.40/9.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------