↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET603+3 : 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 : n005.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:52 AM UTC 2026

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

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

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

fof(equal_defn,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X1,X0)
        & subset(X0,X1) ) ) ).

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

fof(prove_th74,conjecture,
    ! [X0] : difference(X0,'empty$uset') = X0 ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] : difference(X0,'empty$uset') = X0,
    inference(negate_conjecture,[status(cth)],[prove_th74]) ).

cnf(c4,plain,
    ( member(X0,X1)
    | ~ member(X0,difference(X1,X2)) ),
    inference(clausification,[status(esa)],[difference_defn]) ).

cnf(c6,plain,
    ( member(X0,X2)
    | ~ member(X0,X1)
    | member(X0,difference(X1,X2)) ),
    inference(clausification,[status(esa)],[difference_defn]) ).

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

cnf(c10,plain,
    ( ~ subset(X1,X0)
    | ~ subset(X0,X1)
    | X0 = X1 ),
    inference(clausification,[status(esa)],[equal_defn]) ).

cnf(c18,plain,
    ( member(sK16(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset_defn]) ).

cnf(c19,plain,
    ( ~ member(sK16(X0,X1),X1)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset_defn]) ).

cnf(c23,plain,
    difference(sK21,'empty$uset') != sK21,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ member(sK16(X0,difference(X1,X2)),X1)
    | member(sK16(X0,difference(X1,X2)),X2)
    | subset(X0,difference(X1,X2)) ),
    inference(resolution,[status(thm)],[c19,c6]) ).

cnf(d1,plain,
    ( subset(X0,difference(X0,X1))
    | subset(X0,difference(X0,X1))
    | member(sK16(X0,difference(X0,X1)),X1) ),
    inference(resolution,[status(thm)],[d0,c18]) ).

cnf(d2,plain,
    subset(X0,difference(X0,'empty$uset')),
    inference(resolution,[status(thm)],[d1,c7]) ).

cnf(d3,plain,
    ( member(sK16(difference(X0,X1),X2),X0)
    | subset(difference(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c18,c4]) ).

cnf(d4,plain,
    ( subset(difference(X0,X1),X0)
    | subset(difference(X0,X1),X0) ),
    inference(resolution,[status(thm)],[d3,c19]) ).

cnf(d5,plain,
    ( ~ subset(X0,difference(X0,X1))
    | X0 = difference(X0,X1) ),
    inference(resolution,[status(thm)],[d4,c10]) ).

cnf(d6,plain,
    X0 = difference(X0,'empty$uset'),
    inference(resolution,[status(thm)],[d5,d2]) ).

cnf(d7,plain,
    sK21 != sK21,
    inference(demodulation,[status(thm)],[c23,d6]) ).

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

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