↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n019.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:54 AM UTC 2026

% Result   : Theorem 10.86s 2.28s
% Output   : CNFRefutation 10.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   4 unt;   0 def)
%            Number of atoms       :   36 (  10 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   38 (  20   ~;  10   |;   6   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   21 (   3 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_xboole_0,axiom,
    ! [X0] :
      ( X0 = 'empty$uset'
    <=> ! [X1] : ~ in(X1,X0) ) ).

fof(d7_xboole_0,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> 'set$uintersection2'(X0,X1) = 'empty$uset' ) ).

fof(t4_xboole_0,conjecture,
    ! [X0,X1] :
      ( ~ ( disjoint(X0,X1)
          & ? [X2] : in(X2,'set$uintersection2'(X0,X1)) )
      & ~ ( ! [X2] : ~ in(X2,'set$uintersection2'(X0,X1))
          & ~ disjoint(X0,X1) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( ~ ( disjoint(X0,X1)
            & ? [X2] : in(X2,'set$uintersection2'(X0,X1)) )
        & ~ ( ! [X2] : ~ in(X2,'set$uintersection2'(X0,X1))
            & ~ disjoint(X0,X1) ) ),
    inference(negate_conjecture,[status(cth)],[t4_xboole_0]) ).

cnf(c2,plain,
    ( ~ in(X1,X0)
    | X0 != 'empty$uset' ),
    inference(clausification,[status(esa)],[d1_xboole_0]) ).

cnf(c3,plain,
    ( in(sK6(X0),X0)
    | X0 = 'empty$uset' ),
    inference(clausification,[status(esa)],[d1_xboole_0]) ).

cnf(c4,plain,
    ( 'set$uintersection2'(X0,X1) = 'empty$uset'
    | ~ disjoint(X0,X1) ),
    inference(clausification,[status(esa)],[d7_xboole_0]) ).

cnf(c5,plain,
    ( 'set$uintersection2'(X0,X1) != 'empty$uset'
    | disjoint(X0,X1) ),
    inference(clausification,[status(esa)],[d7_xboole_0]) ).

cnf(c11,plain,
    ( in(sK18,'set$uintersection2'(sK15,sK16))
    | ~ disjoint(sK15,sK16) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c14,plain,
    ( disjoint(sK15,sK16)
    | ~ in(X0,'set$uintersection2'(sK15,sK16)) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( disjoint(sK15,sK16)
    | 'set$uintersection2'(sK15,sK16) = 'empty$uset' ),
    inference(resolution,[status(thm)],[c3,c14]) ).

cnf(d1,plain,
    ( 'set$uintersection2'(sK15,sK16) = 'empty$uset'
    | 'set$uintersection2'(sK15,sK16) = 'empty$uset' ),
    inference(resolution,[status(thm)],[d0,c4]) ).

cnf(d2,plain,
    ( ~ disjoint(sK15,sK16)
    | in(sK18,'empty$uset') ),
    inference(demodulation,[status(thm)],[c11,d1]) ).

cnf(d3,plain,
    ~ in(X0,'empty$uset'),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d4,plain,
    ~ disjoint(sK15,sK16),
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ( disjoint(sK15,sK16)
    | 'empty$uset' != 'empty$uset' ),
    inference(superposition,[status(thm)],[d1,c5]) ).

cnf(d6,plain,
    disjoint(sK15,sK16),
    inference(equality_resolution,[status(thm)],[d5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n019.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.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 08:37:33 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.86/2.28  % SZS status Theorem for theBenchmark.p
% 10.86/2.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------