↑ Up

LisaST---0.9.THM-CRf.s

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

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

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

fof(l2_zfmisc_1,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ) ).

fof(l3_zfmisc_1,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( subset(X0,'set$udifference'(X1,singleton(X2)))
        | in(X2,X0) ) ) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X0,X1] : subset(X0,X0) ).

fof(t2_xboole_1,axiom,
    ! [X0] : subset('empty$uset',X0) ).

fof(t37_xboole_1,axiom,
    ! [X0,X1] :
      ( 'set$udifference'(X0,X1) = 'empty$uset'
    <=> subset(X0,X1) ) ).

fof(t3_xboole_1,axiom,
    ! [X0] :
      ( subset(X0,'empty$uset')
     => X0 = 'empty$uset' ) ).

fof(l4_zfmisc_1,conjecture,
    ! [X0,X1] :
      ( subset(X0,singleton(X1))
    <=> ( X0 = singleton(X1)
        | X0 = 'empty$uset' ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,singleton(X1))
      <=> ( X0 = singleton(X1)
          | X0 = 'empty$uset' ) ),
    inference(negate_conjecture,[status(cth)],[l4_zfmisc_1]) ).

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

cnf(c5,plain,
    ( in(X0,X1)
    | ~ subset(singleton(X0),X1) ),
    inference(clausification,[status(esa)],[l2_zfmisc_1]) ).

cnf(c6,plain,
    ( ~ in(X0,X1)
    | subset(singleton(X0),X1) ),
    inference(clausification,[status(esa)],[l2_zfmisc_1]) ).

cnf(c7,plain,
    ( subset(X0,'set$udifference'(X1,singleton(X2)))
    | in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[l3_zfmisc_1]) ).

cnf(c10,plain,
    subset(X0,X0),
    inference(clausification,[status(esa)],[reflexivity_r1_tarski]) ).

cnf(c11,plain,
    subset('empty$uset',X0),
    inference(clausification,[status(esa)],[t2_xboole_1]) ).

cnf(c13,plain,
    ( ~ subset(X0,X1)
    | 'set$udifference'(X0,X1) = 'empty$uset' ),
    inference(clausification,[status(esa)],[t37_xboole_1]) ).

cnf(c14,plain,
    ( X0 = 'empty$uset'
    | ~ subset(X0,'empty$uset') ),
    inference(clausification,[status(esa)],[t3_xboole_1]) ).

cnf(c16,plain,
    ( sK17 = singleton(sK18)
    | sK17 = 'empty$uset'
    | subset(sK17,singleton(sK18)) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c17,plain,
    ( ~ subset(sK17,singleton(sK18))
    | sK17 != 'empty$uset' ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c19,plain,
    ( ~ subset(sK17,singleton(sK18))
    | sK17 != singleton(sK18) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    in(X0,singleton(X0)),
    inference(resolution,[status(thm)],[c10,c5]) ).

cnf(d1,plain,
    ( ~ subset(X1,singleton(X0))
    | X1 = singleton(X0)
    | ~ in(X0,X1) ),
    inference(resolution,[status(thm)],[c6,c3]) ).

cnf(d2,plain,
    ( sK17 = singleton(sK18)
    | sK17 = 'empty$uset'
    | ~ in(sK18,sK17)
    | sK17 = singleton(sK18) ),
    inference(resolution,[status(thm)],[d1,c16]) ).

cnf(d3,plain,
    ( sK17 = singleton(sK18)
    | sK17 = 'empty$uset'
    | 'set$udifference'(sK17,singleton(sK18)) = 'empty$uset' ),
    inference(resolution,[status(thm)],[c13,c16]) ).

cnf(d4,plain,
    ( sK17 = singleton(sK18)
    | sK17 = 'empty$uset'
    | ~ subset(X0,sK17)
    | in(sK18,X0)
    | subset(X0,'empty$uset') ),
    inference(superposition,[status(thm)],[d3,c7]) ).

cnf(d5,plain,
    ( subset(sK17,'empty$uset')
    | in(sK18,sK17)
    | sK17 = singleton(sK18)
    | sK17 = 'empty$uset' ),
    inference(resolution,[status(thm)],[d4,c10]) ).

cnf(d6,plain,
    ( sK17 = singleton(sK18)
    | sK17 = 'empty$uset'
    | subset(sK17,'empty$uset')
    | sK17 = singleton(sK18)
    | sK17 = 'empty$uset' ),
    inference(resolution,[status(thm)],[d5,d2]) ).

cnf(d7,plain,
    ( sK17 = 'empty$uset'
    | sK17 = singleton(sK18)
    | sK17 = 'empty$uset' ),
    inference(resolution,[status(thm)],[d6,c14]) ).

cnf(d8,plain,
    ( sK17 = 'empty$uset'
    | ~ in(sK18,X0)
    | subset(sK17,X0) ),
    inference(superposition,[status(thm)],[d7,c6]) ).

cnf(d9,plain,
    ( subset(sK17,singleton(sK18))
    | sK17 = 'empty$uset' ),
    inference(resolution,[status(thm)],[d8,d0]) ).

cnf(d10,plain,
    ( sK17 = 'empty$uset'
    | ~ subset(sK17,singleton(sK18))
    | sK17 != sK17 ),
    inference(superposition,[status(thm)],[d7,c19]) ).

cnf(d11,plain,
    ( ~ subset(sK17,singleton(sK18))
    | sK17 = 'empty$uset' ),
    inference(equality_resolution,[status(thm)],[d10]) ).

cnf(d12,plain,
    ( sK17 = 'empty$uset'
    | sK17 = 'empty$uset' ),
    inference(resolution,[status(thm)],[d11,d9]) ).

cnf(d13,plain,
    ~ subset(sK17,singleton(sK18)),
    inference(resolution,[status(thm)],[d12,c17]) ).

cnf(d14,plain,
    subset(sK17,X0),
    inference(demodulation,[status(thm)],[c11,d12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU146+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  % Computer : n010.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sat Sep 26 08:40:45 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.36/1.91  % SZS status Theorem for theBenchmark.p
% 10.36/1.91  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------