↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n005.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:41:00 AM UTC 2026

% Result   : Theorem 9.54s 1.66s
% Output   : CNFRefutation 9.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   45 (  10 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   38 (  15   ~;  17   |;   0   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
    ! [X0,X1] :
      ( X1 = singleton(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X2 = X0 ) ) ).

fof(d3_tarski,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ) ).

fof(l2_zfmisc_1,conjecture,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(singleton(X0),X1)
      <=> in(X0,X1) ),
    inference(negate_conjecture,[status(cth)],[l2_zfmisc_1]) ).

cnf(c1,plain,
    ( X2 = X1
    | ~ in(X2,X0)
    | X0 != singleton(X1) ),
    inference(clausification,[status(esa)],[d1_tarski]) ).

cnf(c2,plain,
    ( X2 != X1
    | in(X2,X0)
    | X0 != singleton(X1) ),
    inference(clausification,[status(esa)],[d1_tarski]) ).

cnf(c7,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c8,plain,
    ( in(sK9(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c9,plain,
    ( ~ in(sK9(X0,X1),X1)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c12,plain,
    ( in(sK12,sK13)
    | subset(singleton(sK12),sK13) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c13,plain,
    ( ~ subset(singleton(sK12),sK13)
    | ~ in(sK12,sK13) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( in(X0,singleton(X1))
    | X0 != X1 ),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d1,plain,
    in(X0,singleton(X0)),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    ( in(sK12,sK13)
    | ~ in(X0,singleton(sK12))
    | in(X0,sK13) ),
    inference(resolution,[status(thm)],[c7,c12]) ).

cnf(d3,plain,
    ( in(sK12,sK13)
    | in(sK12,sK13) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ~ subset(singleton(sK12),sK13),
    inference(resolution,[status(thm)],[d3,c13]) ).

cnf(d5,plain,
    ( ~ in(X0,singleton(X1))
    | X0 = X1 ),
    inference(equality_resolution,[status(thm)],[c1]) ).

cnf(d6,plain,
    ( sK9(singleton(X0),X1) = X0
    | subset(singleton(X0),X1) ),
    inference(resolution,[status(thm)],[c8,d5]) ).

cnf(d7,plain,
    sK9(singleton(sK12),sK13) = sK12,
    inference(resolution,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    ( subset(singleton(sK12),sK13)
    | ~ in(sK12,sK13) ),
    inference(superposition,[status(thm)],[d7,c9]) ).

cnf(d9,plain,
    subset(singleton(sK12),sK13),
    inference(resolution,[status(thm)],[d3,d8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU144+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n005.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 26 08:39:32 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.54/1.66  % SZS status Theorem for theBenchmark.p
% 9.54/1.66  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------