↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n008.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:32:32 AM UTC 2026

% Result   : Theorem 12.17s 2.24s
% Output   : CNFRefutation 12.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   8 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   11 (   6   ~;   2   |;   0   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   2 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subset,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ) ).

fof(power_set,axiom,
    ! [X0,X1] :
      ( member(X0,'power$uset'(X1))
    <=> subset(X0,X1) ) ).

fof(empty_set,axiom,
    ! [X0] : ~ member(X0,'empty$uset') ).

fof(thI47,conjecture,
    ! [X0] : member('empty$uset','power$uset'(X0)) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] : member('empty$uset','power$uset'(X0)),
    inference(negate_conjecture,[status(cth)],[thI47]) ).

cnf(c1,plain,
    ( member(sK3(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset]) ).

cnf(c7,plain,
    ( ~ subset(X0,X1)
    | member(X0,'power$uset'(X1)) ),
    inference(clausification,[status(esa)],[power_set]) ).

cnf(c14,plain,
    ~ member(X0,'empty$uset'),
    inference(clausification,[status(esa)],[empty_set]) ).

cnf(c29,plain,
    ~ member('empty$uset','power$uset'(sK31)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ subset('empty$uset',sK31),
    inference(resolution,[status(thm)],[c7,c29]) ).

cnf(d1,plain,
    subset('empty$uset',X0),
    inference(resolution,[status(thm)],[c1,c14]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[d1,d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET366+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Sat Sep 26 07:36:09 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.17/2.24  % SZS status Theorem for theBenchmark.p
% 12.17/2.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------