↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU186+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 : n004.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:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(d1_relat_1,axiom,
    ! [X0] :
      ( relation(X0)
    <=> ! [X1] :
          ~ ( ! [X2,X3] : X1 != 'ordered$upair'(X2,X3)
            & in(X1,X0) ) ) ).

fof(existence_m1_subset_1,axiom,
    ! [X0] :
    ? [X1] : element(X1,X0) ).

fof(t2_subset,axiom,
    ! [X0,X1] :
      ( element(X0,X1)
     => ( in(X0,X1)
        | empty(X1) ) ) ).

fof(t6_boole,axiom,
    ! [X0] :
      ( empty(X0)
     => X0 = 'empty$uset' ) ).

fof(t56_relat_1,conjecture,
    ! [X0] :
      ( relation(X0)
     => ( ! [X1,X2] : ~ in('ordered$upair'(X1,X2),X0)
       => X0 = 'empty$uset' ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( relation(X0)
       => ( ! [X1,X2] : ~ in('ordered$upair'(X1,X2),X0)
         => X0 = 'empty$uset' ) ),
    inference(negate_conjecture,[status(cth)],[t56_relat_1]) ).

cnf(c3,plain,
    ( X1 = 'ordered$upair'(sK7(X1),sK8(X1))
    | ~ in(X1,X0)
    | ~ relation(X0) ),
    inference(clausification,[status(esa)],[d1_relat_1]) ).

cnf(c7,plain,
    element(sK15(X0),X0),
    inference(clausification,[status(esa)],[existence_m1_subset_1]) ).

cnf(c21,plain,
    ( in(X0,X1)
    | empty(X1)
    | ~ element(X0,X1) ),
    inference(clausification,[status(esa)],[t2_subset]) ).

cnf(c22,plain,
    ( X0 = 'empty$uset'
    | ~ empty(X0) ),
    inference(clausification,[status(esa)],[t6_boole]) ).

cnf(c25,plain,
    relation(sK34),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c26,plain,
    ~ in('ordered$upair'(X0,X1),sK34),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c27,plain,
    sK34 != 'empty$uset',
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( empty(X0)
    | in(sK15(X0),X0) ),
    inference(resolution,[status(thm)],[c21,c7]) ).

cnf(d1,plain,
    ( ~ relation(X0)
    | sK15(X0) = 'ordered$upair'(sK7(sK15(X0)),sK8(sK15(X0)))
    | empty(X0) ),
    inference(resolution,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    ( empty(sK34)
    | sK15(sK34) = 'ordered$upair'(sK7(sK15(sK34)),sK8(sK15(sK34))) ),
    inference(resolution,[status(thm)],[d1,c25]) ).

cnf(d3,plain,
    ( sK34 = 'empty$uset'
    | sK15(sK34) = 'ordered$upair'(sK7(sK15(sK34)),sK8(sK15(sK34))) ),
    inference(resolution,[status(thm)],[d2,c22]) ).

cnf(d4,plain,
    sK15(sK34) = 'ordered$upair'(sK7(sK15(sK34)),sK8(sK15(sK34))),
    inference(resolution,[status(thm)],[c27,d3]) ).

cnf(d5,plain,
    ~ in(sK15(sK34),sK34),
    inference(superposition,[status(thm)],[d4,c26]) ).

cnf(d6,plain,
    empty(sK34),
    inference(resolution,[status(thm)],[d5,d0]) ).

cnf(d7,plain,
    sK34 = 'empty$uset',
    inference(resolution,[status(thm)],[d6,c22]) ).

cnf(d8,plain,
    $false,
    inference(resolution,[status(thm)],[c27,d7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU186+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.10/0.38  % Computer : n004.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep 26 08:46:51 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.05/2.30  % SZS status Theorem for theBenchmark.p
% 15.05/2.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------