↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n011.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:10:51 AM UTC 2026

% Result   : Unsatisfiable 29.45s 4.29s
% Output   : CNFRefutation 29.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   6 unt;   4 nHn;  10 RR)
%            Number of literals    :   22 (   2 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_limit_ordinals_are_ordinals_1,negated_conjecture,
    ~ subclass('limit$uordinals','ordinal$unumbers') ).

cnf(not_subclass_members1,axiom,
    ( subclass(X0,X1)
    | member('not$usubclass$uelement'(X0,X1),X0) ) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X0,X1)
    | ~ member('not$usubclass$uelement'(X0,X1),X1) ) ).

cnf(intersection2,axiom,
    ( member(X0,X2)
    | ~ member(X0,intersection(X1,X2)) ) ).

cnf(limit_ordinals,axiom,
    intersection(complement('kind$u1$uordinals'),'ordinal$unumbers') = 'limit$uordinals' ).

cnf(c0,plain,
    ~ subclass('limit$uordinals','ordinal$unumbers'),
    inference(clausification,[status(esa)],[prove_limit_ordinals_are_ordinals_1]) ).

cnf(c2,plain,
    ( subclass(X0,X1)
    | member('not$usubclass$uelement'(X0,X1),X0) ),
    inference(clausification,[status(esa)],[not_subclass_members1]) ).

cnf(c3,plain,
    ( subclass(X0,X1)
    | ~ member('not$usubclass$uelement'(X0,X1),X1) ),
    inference(clausification,[status(esa)],[not_subclass_members2]) ).

cnf(c22,plain,
    ( member(X0,X2)
    | ~ member(X0,intersection(X1,X2)) ),
    inference(clausification,[status(esa)],[intersection2]) ).

cnf(c139,plain,
    intersection(complement('kind$u1$uordinals'),'ordinal$unumbers') = 'limit$uordinals',
    inference(clausification,[status(esa)],[limit_ordinals]) ).

cnf(d0,plain,
    ( subclass(intersection(X0,X1),X2)
    | member('not$usubclass$uelement'(intersection(X0,X1),X2),X1) ),
    inference(resolution,[status(thm)],[c22,c2]) ).

cnf(d1,plain,
    ( subclass(intersection(X0,X1),X1)
    | subclass(intersection(X0,X1),X1) ),
    inference(resolution,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    subclass('limit$uordinals','ordinal$unumbers'),
    inference(superposition,[status(thm)],[c139,d1]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[c0,d2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM180-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  % Computer : n011.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Sat Sep 26 02:10:45 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 29.45/4.29  % SZS status Unsatisfiable for theBenchmark.p
% 29.45/4.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------