↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 12.83s 9.26s
% Output   : CNFRefutation 12.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  13 unt;   0 def)
%            Number of atoms       :   39 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (   8   ~;   6   |;   2   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  16   !;   0   ?)

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

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

fof(symmetry_r1_xboole_0,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
     => disjoint(X1,X0) ) ).

fof(t26_xboole_1,lemma,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2)) ) ).

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

fof(t63_xboole_1,conjecture,
    ! [X0,X1,X2] :
      ( ( disjoint(X1,X2)
        & subset(X0,X1) )
     => disjoint(X0,X2) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( disjoint(X1,X2)
          & subset(X0,X1) )
       => disjoint(X0,X2) ),
    inference(negate_conjecture,[status(cth)],[t63_xboole_1]) ).

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

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

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

cnf(c52,plain,
    ( disjoint(X1,X0)
    | ~ disjoint(X0,X1) ),
    inference(clausification,[status(esa)],[symmetry_r1_xboole_0]) ).

cnf(c58,plain,
    ( subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2))
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[t26_xboole_1]) ).

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

cnf(c88,plain,
    disjoint(sK117,sK118),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c89,plain,
    subset(sK116,sK117),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c90,plain,
    ~ disjoint(sK116,sK118),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    subset('set$uintersection2'(sK116,X0),'set$uintersection2'(sK117,X0)),
    inference(resolution,[status(thm)],[c58,c89]) ).

cnf(d1,plain,
    'set$uintersection2'(sK117,sK118) = 'empty$uset',
    inference(resolution,[status(thm)],[c36,c88]) ).

cnf(d2,plain,
    subset('set$uintersection2'(sK116,sK118),'empty$uset'),
    inference(superposition,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    subset('set$uintersection2'(sK118,sK116),'empty$uset'),
    inference(demodulation,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    'set$uintersection2'(sK118,sK116) = 'empty$uset',
    inference(resolution,[status(thm)],[d3,c75]) ).

cnf(d5,plain,
    ( disjoint(sK118,sK116)
    | 'empty$uset' != 'empty$uset' ),
    inference(superposition,[status(thm)],[d4,c37]) ).

cnf(d6,plain,
    disjoint(sK118,sK116),
    inference(equality_resolution,[status(thm)],[d5]) ).

cnf(d7,plain,
    disjoint(sK116,sK118),
    inference(resolution,[status(thm)],[d6,c52]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36  % Computer : n012.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Sat Sep 26 08:39:55 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.83/9.26  % SZS status Theorem for theBenchmark.p
% 12.83/9.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------