↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 15.26s 2.35s
% Output   : CNFRefutation 15.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  11 unt;   0 def)
%            Number of atoms       :   64 (  38 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   56 (  24   ~;  19   |;   8   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   50 (   8 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(free_g1_orders_2,axiom,
    ! [X0,X1] :
      ( 'relation$uof2'(X1,X0,X0)
     => ! [X2,X3] :
          ( 'rel$ustr$uof'(X0,X1) = 'rel$ustr$uof'(X2,X3)
         => ( X1 = X3
            & X0 = X2 ) ) ) ).

fof(abstractness_v1_orders_2,axiom,
    ! [X0] :
      ( 'rel$ustr'(X0)
     => ( 'strict$urel$ustr'(X0)
       => X0 = 'rel$ustr$uof'('the$ucarrier'(X0),'the$uInternalRel'(X0)) ) ) ).

fof(redefinition_m2_relset_1,axiom,
    ! [X0,X1,X2] :
      ( 'relation$uof2$uas$usubset'(X2,X0,X1)
    <=> 'relation$uof2'(X2,X0,X1) ) ).

fof(dt_k1_yellow_1,axiom,
    ! [X0] :
      ( 'relation$uof2$uas$usubset'('inclusion$uorder'(X0),X0,X0)
      & 'v1$upartfun1'('inclusion$uorder'(X0),X0,X0)
      & transitive('inclusion$uorder'(X0))
      & antisymmetric('inclusion$uorder'(X0))
      & reflexive('inclusion$uorder'(X0)) ) ).

fof(dt_k2_yellow_1,axiom,
    ! [X0] :
      ( 'rel$ustr'('incl$uPOSet'(X0))
      & 'strict$urel$ustr'('incl$uPOSet'(X0)) ) ).

fof(d1_yellow_1,axiom,
    ! [X0] : 'incl$uPOSet'(X0) = 'rel$ustr$uof'(X0,'inclusion$uorder'(X0)) ).

fof(t1_yellow_1,conjecture,
    ! [X0] :
      ( 'the$uInternalRel'('incl$uPOSet'(X0)) = 'inclusion$uorder'(X0)
      & 'the$ucarrier'('incl$uPOSet'(X0)) = X0 ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( 'the$uInternalRel'('incl$uPOSet'(X0)) = 'inclusion$uorder'(X0)
        & 'the$ucarrier'('incl$uPOSet'(X0)) = X0 ),
    inference(negate_conjecture,[status(cth)],[t1_yellow_1]) ).

cnf(c46,plain,
    ( X1 = X2
    | 'rel$ustr$uof'(X1,X0) != 'rel$ustr$uof'(X2,X3)
    | ~ 'relation$uof2'(X0,X1,X1) ),
    inference(clausification,[status(esa)],[free_g1_orders_2]) ).

cnf(c47,plain,
    ( X0 = X3
    | 'rel$ustr$uof'(X1,X0) != 'rel$ustr$uof'(X2,X3)
    | ~ 'relation$uof2'(X0,X1,X1) ),
    inference(clausification,[status(esa)],[free_g1_orders_2]) ).

cnf(c48,plain,
    ( X0 = 'rel$ustr$uof'('the$ucarrier'(X0),'the$uInternalRel'(X0))
    | ~ 'strict$urel$ustr'(X0)
    | ~ 'rel$ustr'(X0) ),
    inference(clausification,[status(esa)],[abstractness_v1_orders_2]) ).

cnf(c52,plain,
    ( 'relation$uof2'(X0,X1,X2)
    | ~ 'relation$uof2$uas$usubset'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[redefinition_m2_relset_1]) ).

cnf(c72,plain,
    'relation$uof2$uas$usubset'('inclusion$uorder'(X0),X0,X0),
    inference(clausification,[status(esa)],[dt_k1_yellow_1]) ).

cnf(c73,plain,
    'strict$urel$ustr'('incl$uPOSet'(X0)),
    inference(clausification,[status(esa)],[dt_k2_yellow_1]) ).

cnf(c74,plain,
    'rel$ustr'('incl$uPOSet'(X0)),
    inference(clausification,[status(esa)],[dt_k2_yellow_1]) ).

cnf(c80,plain,
    'incl$uPOSet'(X0) = 'rel$ustr$uof'(X0,'inclusion$uorder'(X0)),
    inference(clausification,[status(esa)],[d1_yellow_1]) ).

cnf(c81,plain,
    ( 'the$uInternalRel'('incl$uPOSet'(sK78)) != 'inclusion$uorder'(sK78)
    | 'the$ucarrier'('incl$uPOSet'(sK78)) != sK78 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'relation$uof2'('inclusion$uorder'(X0),X0,X0)
    | 'inclusion$uorder'(X0) = X2
    | 'incl$uPOSet'(X0) != 'rel$ustr$uof'(X1,X2) ),
    inference(superposition,[status(thm)],[c80,c47]) ).

cnf(d1,plain,
    'relation$uof2'('inclusion$uorder'(X0),X0,X0),
    inference(resolution,[status(thm)],[c72,c52]) ).

cnf(d2,plain,
    ( 'inclusion$uorder'(X0) = X2
    | 'incl$uPOSet'(X0) != 'rel$ustr$uof'(X1,X2) ),
    inference(resolution,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    ( ~ 'rel$ustr'('incl$uPOSet'(X0))
    | 'incl$uPOSet'(X0) = 'rel$ustr$uof'('the$ucarrier'('incl$uPOSet'(X0)),'the$uInternalRel'('incl$uPOSet'(X0))) ),
    inference(resolution,[status(thm)],[c48,c73]) ).

cnf(d4,plain,
    'incl$uPOSet'(X0) = 'rel$ustr$uof'('the$ucarrier'('incl$uPOSet'(X0)),'the$uInternalRel'('incl$uPOSet'(X0))),
    inference(resolution,[status(thm)],[c74,d3]) ).

cnf(d5,plain,
    ( 'inclusion$uorder'(X1) = 'the$uInternalRel'('incl$uPOSet'(X0))
    | 'incl$uPOSet'(X1) != 'incl$uPOSet'(X0) ),
    inference(superposition,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    'inclusion$uorder'(X0) = 'the$uInternalRel'('incl$uPOSet'(X0)),
    inference(equality_resolution,[status(thm)],[d5]) ).

cnf(d7,plain,
    ( ~ 'relation$uof2'('inclusion$uorder'(X0),X0,X0)
    | X0 = X1
    | 'incl$uPOSet'(X0) != 'rel$ustr$uof'(X1,X2) ),
    inference(superposition,[status(thm)],[c80,c46]) ).

cnf(d8,plain,
    ( 'incl$uPOSet'(X0) != 'rel$ustr$uof'(X1,X2)
    | X0 = X1 ),
    inference(resolution,[status(thm)],[d1,d7]) ).

cnf(d9,plain,
    ( X1 = 'the$ucarrier'('incl$uPOSet'(X0))
    | 'incl$uPOSet'(X1) != 'incl$uPOSet'(X0) ),
    inference(superposition,[status(thm)],[d4,d8]) ).

cnf(d10,plain,
    X0 = 'the$ucarrier'('incl$uPOSet'(X0)),
    inference(equality_resolution,[status(thm)],[d9]) ).

cnf(d11,plain,
    ( 'the$uInternalRel'('incl$uPOSet'(sK78)) != 'inclusion$uorder'(sK78)
    | sK78 != sK78 ),
    inference(demodulation,[status(thm)],[c81,d10]) ).

cnf(d12,plain,
    ( sK78 != sK78
    | 'inclusion$uorder'(sK78) != 'inclusion$uorder'(sK78) ),
    inference(demodulation,[status(thm)],[d11,d6]) ).

cnf(d13,plain,
    sK78 != sK78,
    inference(equality_resolution,[status(thm)],[d12]) ).

cnf(d14,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU368+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n026.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 : Sat Sep 26 09:23:12 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.26/2.35  % SZS status Theorem for theBenchmark.p
% 15.26/2.35  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------