↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n017.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 22.19s 21.27s
% Output   : CNFRefutation 22.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  13 unt;   5 nHn;  20 RR)
%            Number of literals    :   45 (   2 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_ordinals_are_kind_1_or_limit_1,negated_conjecture,
    member(x,'ordinal$unumbers') ).

cnf(prove_ordinals_are_kind_1_or_limit_2,negated_conjecture,
    ~ member(x,'kind$u1$uordinals') ).

cnf(prove_ordinals_are_kind_1_or_limit_3,negated_conjecture,
    ~ member(x,'limit$uordinals') ).

cnf(subclass_members,axiom,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | ~ subclass(X0,X1) ) ).

cnf(class_elements_are_sets,axiom,
    subclass(X0,'universal$uclass') ).

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

cnf(complement2,axiom,
    ( member(X0,X1)
    | member(X0,complement(X1))
    | ~ member(X0,'universal$uclass') ) ).

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

cnf(c0,plain,
    member(x,'ordinal$unumbers'),
    inference(clausification,[status(esa)],[prove_ordinals_are_kind_1_or_limit_1]) ).

cnf(c1,plain,
    ~ member(x,'kind$u1$uordinals'),
    inference(clausification,[status(esa)],[prove_ordinals_are_kind_1_or_limit_2]) ).

cnf(c2,plain,
    ~ member(x,'limit$uordinals'),
    inference(clausification,[status(esa)],[prove_ordinals_are_kind_1_or_limit_3]) ).

cnf(c3,plain,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | ~ subclass(X0,X1) ),
    inference(clausification,[status(esa)],[subclass_members]) ).

cnf(c6,plain,
    subclass(X0,'universal$uclass'),
    inference(clausification,[status(esa)],[class_elements_are_sets]) ).

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

cnf(c27,plain,
    ( member(X0,X1)
    | member(X0,complement(X1))
    | ~ member(X0,'universal$uclass') ),
    inference(clausification,[status(esa)],[complement2]) ).

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

cnf(d0,plain,
    ( ~ member(X0,X1)
    | member(X0,'universal$uclass') ),
    inference(resolution,[status(thm)],[c3,c6]) ).

cnf(d1,plain,
    member(x,'universal$uclass'),
    inference(resolution,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    ( ~ member(X0,'ordinal$unumbers')
    | ~ member(X0,complement('kind$u1$uordinals'))
    | member(X0,'limit$uordinals') ),
    inference(superposition,[status(thm)],[c141,c25]) ).

cnf(d3,plain,
    ( ~ member(X0,'universal$uclass')
    | member(X0,'kind$u1$uordinals')
    | member(X0,'limit$uordinals')
    | ~ member(X0,'ordinal$unumbers') ),
    inference(resolution,[status(thm)],[d2,c27]) ).

cnf(d4,plain,
    ( member(x,'limit$uordinals')
    | member(x,'kind$u1$uordinals')
    | ~ member(x,'ordinal$unumbers') ),
    inference(resolution,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    ( member(x,'limit$uordinals')
    | member(x,'kind$u1$uordinals') ),
    inference(resolution,[status(thm)],[c0,d4]) ).

cnf(d6,plain,
    member(x,'limit$uordinals'),
    inference(resolution,[status(thm)],[c1,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c2,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM183-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/10.42  % Computer : n017.cluster.edu
% 0.16/10.42  % Model    : x86_64 x86_64
% 0.16/10.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/10.42  % Memory   : 8046.5625MB
% 0.16/10.42  % OS       : Linux 6.8.0-71-generic
% 0.16/10.42  % CPULimit : 300
% 0.16/10.42  % WCLimit  : 300
% 0.16/10.42  % DateTime : Sat Sep 26 02:06:15 UTC 2026
% 0.16/10.43  % CPUTime  : 
% 0.16/10.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.19/21.27  % SZS status Unsatisfiable for theBenchmark.p
% 22.19/21.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------