↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET976+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 : n019.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:33:40 AM UTC 2026

% Result   : Theorem 9.23s 1.76s
% Output   : CNFRefutation 9.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (   4 unt;   0 def)
%            Number of atoms       :   54 (  18 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   53 (  24   ~;  21   |;   3   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   38 (   4 sgn  15   !;   0   ?)

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

fof(l55_zfmisc_1,axiom,
    ! [X0,X1,X2,X3] :
      ( in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3))
    <=> ( in(X1,X3)
        & in(X0,X2) ) ) ).

fof(t129_zfmisc_1,conjecture,
    ! [X0,X1,X2,X3] :
      ( in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,singleton(X3)))
    <=> ( X1 = X3
        & in(X0,X2) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,singleton(X3)))
      <=> ( X1 = X3
          & in(X0,X2) ) ),
    inference(negate_conjecture,[status(cth)],[t129_zfmisc_1]) ).

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

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

cnf(c10,plain,
    ( in(X0,X2)
    | ~ in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3)) ),
    inference(clausification,[status(esa)],[l55_zfmisc_1]) ).

cnf(c11,plain,
    ( in(X1,X3)
    | ~ in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3)) ),
    inference(clausification,[status(esa)],[l55_zfmisc_1]) ).

cnf(c12,plain,
    ( ~ in(X1,X3)
    | ~ in(X0,X2)
    | in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3)) ),
    inference(clausification,[status(esa)],[l55_zfmisc_1]) ).

cnf(c16,plain,
    ( in(sK18,sK20)
    | in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK21))) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c17,plain,
    ( sK19 = sK21
    | in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK21))) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c18,plain,
    ( ~ in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK21)))
    | sK19 != sK21
    | ~ in(sK18,sK20) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d1,plain,
    ( sK19 = sK21
    | in(sK19,singleton(sK21)) ),
    inference(resolution,[status(thm)],[c11,c17]) ).

cnf(d2,plain,
    ( sK19 = sK21
    | sK19 = sK21 ),
    inference(resolution,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    ( in(sK18,sK20)
    | in(sK18,sK20) ),
    inference(resolution,[status(thm)],[c10,c16]) ).

cnf(d4,plain,
    ( ~ in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK21)))
    | sK19 != sK21 ),
    inference(resolution,[status(thm)],[d3,c18]) ).

cnf(d5,plain,
    ( ~ in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK21)))
    | sK19 != sK19 ),
    inference(demodulation,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    ( ~ in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK19)))
    | sK19 != sK19 ),
    inference(demodulation,[status(thm)],[d5,d2]) ).

cnf(d7,plain,
    ~ in('ordered$upair'(sK18,sK19),'cartesian$uproduct2'(sK20,singleton(sK19))),
    inference(equality_resolution,[status(thm)],[d6]) ).

cnf(d8,plain,
    ( ~ in(sK19,singleton(sK19))
    | ~ in(sK18,sK20) ),
    inference(resolution,[status(thm)],[d7,c12]) ).

cnf(d9,plain,
    ~ in(sK19,singleton(sK19)),
    inference(resolution,[status(thm)],[d3,d8]) ).

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

cnf(d11,plain,
    in(X0,singleton(X0)),
    inference(equality_resolution,[status(thm)],[d10]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[d11,d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET976+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.09/0.35  % Computer : n019.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 08:29:19 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.23/1.76  % SZS status Theorem for theBenchmark.p
% 9.23/1.76  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------