↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 2.25s 24.69s
% Output   : CNFRefutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   7 unt;   0 def)
%            Number of atoms       :   50 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   43 (  16   ~;  18   |;   3   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   39 (   0 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(commutativity_k3_xboole_0,axiom,
    ! [X0,X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0) ).

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

fof(d3_xboole_0,axiom,
    ! [X0,X1,X2] :
      ( X2 = 'set$uintersection2'(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            & in(X3,X0) ) ) ) ).

fof(t19_xboole_1,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X0,X2)
        & subset(X0,X1) )
     => subset(X0,'set$uintersection2'(X1,X2)) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X0,X2)
          & subset(X0,X1) )
       => subset(X0,'set$uintersection2'(X1,X2)) ),
    inference(negate_conjecture,[status(cth)],[t19_xboole_1]) ).

cnf(c2,plain,
    'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0),
    inference(clausification,[status(esa)],[commutativity_k3_xboole_0]) ).

cnf(c16,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c17,plain,
    ( in(sK20(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c18,plain,
    ( ~ in(sK20(X0,X1),X1)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c21,plain,
    ( ~ in(X3,X0)
    | ~ in(X3,X1)
    | in(X3,X2)
    | 'set$uintersection2'(X0,X1) != X2 ),
    inference(clausification,[status(esa)],[d3_xboole_0]) ).

cnf(c55,plain,
    subset(sK72,sK74),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c56,plain,
    subset(sK72,sK73),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c57,plain,
    ~ subset(sK72,'set$uintersection2'(sK73,sK74)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ in(X0,sK72)
    | in(X0,sK73) ),
    inference(resolution,[status(thm)],[c56,c16]) ).

cnf(d1,plain,
    ( subset(sK72,X0)
    | in(sK20(sK72,X0),sK73) ),
    inference(resolution,[status(thm)],[d0,c17]) ).

cnf(d2,plain,
    ( ~ in(X0,X1)
    | ~ in(X0,X2)
    | in(X0,'set$uintersection2'(X1,X2)) ),
    inference(equality_resolution,[status(thm)],[c21]) ).

cnf(d3,plain,
    ( subset(X0,'set$uintersection2'(X1,X2))
    | ~ in(sK20(X0,'set$uintersection2'(X1,X2)),X1)
    | ~ in(sK20(X0,'set$uintersection2'(X1,X2)),X2) ),
    inference(resolution,[status(thm)],[d2,c18]) ).

cnf(d4,plain,
    ( ~ in(X0,sK72)
    | in(X0,sK74) ),
    inference(resolution,[status(thm)],[c55,c16]) ).

cnf(d5,plain,
    ( subset(sK72,X0)
    | in(sK20(sK72,X0),sK74) ),
    inference(resolution,[status(thm)],[d4,c17]) ).

cnf(d6,plain,
    ( subset(sK72,'set$uintersection2'(sK74,X0))
    | ~ in(sK20(sK72,'set$uintersection2'(sK74,X0)),X0)
    | subset(sK72,'set$uintersection2'(sK74,X0)) ),
    inference(resolution,[status(thm)],[d5,d3]) ).

cnf(d7,plain,
    ( subset(sK72,'set$uintersection2'(sK74,sK73))
    | subset(sK72,'set$uintersection2'(sK74,sK73)) ),
    inference(resolution,[status(thm)],[d6,d1]) ).

cnf(d8,plain,
    ~ subset(sK72,'set$uintersection2'(sK74,sK73)),
    inference(demodulation,[status(thm)],[c57,c2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU128+2 : 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.10/10.58  % Computer : n017.cluster.edu
% 0.10/10.58  % Model    : x86_64 x86_64
% 0.10/10.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.58  % Memory   : 8046.5625MB
% 0.10/10.58  % OS       : Linux 6.8.0-71-generic
% 0.10/10.58  % CPULimit : 300
% 0.10/10.58  % WCLimit  : 300
% 0.10/10.58  % DateTime : Sat Sep 26 08:33:45 UTC 2026
% 0.10/10.58  % CPUTime  : 
% 0.10/10.58  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.25/24.69  % SZS status Theorem for theBenchmark.p
% 2.25/24.69  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------