↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU134+2 : 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 : 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:40:58 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(l32_xboole_1,lemma,
    ! [X0,X1] :
      ( 'set$udifference'(X0,X1) = 'empty$uset'
    <=> subset(X0,X1) ) ).

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

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

cnf(c51,plain,
    ( subset(X0,X1)
    | 'set$udifference'(X0,X1) != 'empty$uset' ),
    inference(clausification,[status(esa)],[l32_xboole_1]) ).

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

cnf(c86,plain,
    ( subset(sK98,sK99)
    | 'set$udifference'(sK98,sK99) = 'empty$uset' ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c87,plain,
    ( 'set$udifference'(sK98,sK99) != 'empty$uset'
    | ~ subset(sK98,sK99) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'set$udifference'(sK98,sK99) = 'empty$uset'
    | 'set$udifference'(sK98,sK99) = 'empty$uset' ),
    inference(resolution,[status(thm)],[c52,c86]) ).

cnf(d1,plain,
    ( subset(sK98,sK99)
    | 'empty$uset' != 'empty$uset' ),
    inference(superposition,[status(thm)],[d0,c51]) ).

cnf(d2,plain,
    ~ subset(sK98,sK99),
    inference(resolution,[status(thm)],[d0,c87]) ).

cnf(d3,plain,
    'empty$uset' != 'empty$uset',
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU134+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n011.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 08:38:29 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.94/3.18  % SZS status Theorem for theBenchmark.p
% 20.94/3.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------