↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU102+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:40:52 AM UTC 2026

% Result   : Theorem 11.89s 2.75s
% Output   : CNFRefutation 11.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   30 (  13 unt;   0 def)
%            Number of atoms       :   80 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   87 (  37   ~;  34   |;  10   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   25 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(dt_k2_finsub_1,axiom,
    ! [X0,X1,X2] :
      ( ( element(X2,X0)
        & element(X1,X0)
        & preboolean(X0)
        & ~ empty(X0) )
     => element('prebool$udifference'(X0,X1,X2),X0) ) ).

fof(redefinition_k2_finsub_1,axiom,
    ! [X0,X1,X2] :
      ( ( element(X2,X0)
        & element(X1,X0)
        & preboolean(X0)
        & ~ empty(X0) )
     => 'prebool$udifference'(X0,X1,X2) = 'set$udifference'(X1,X2) ) ).

fof(t48_xboole_1,axiom,
    ! [X0,X1] : 'set$udifference'(X0,'set$udifference'(X0,X1)) = 'set$uintersection2'(X0,X1) ).

fof(t13_finsub_1,conjecture,
    ! [X0,X1,X2] :
      ( ( preboolean(X2)
        & ~ empty(X2) )
     => ( ( element(X1,X2)
          & element(X0,X2) )
       => element('set$uintersection2'(X0,X1),X2) ) ) ).

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

cnf(c7,plain,
    ( empty(X0)
    | element('prebool$udifference'(X0,X2,X1),X0)
    | ~ element(X2,X0)
    | ~ element(X1,X0)
    | ~ preboolean(X0) ),
    inference(clausification,[status(esa)],[dt_k2_finsub_1]) ).

cnf(c44,plain,
    ( ~ element(X2,X0)
    | ~ element(X1,X0)
    | ~ preboolean(X0)
    | empty(X0)
    | 'prebool$udifference'(X0,X1,X2) = 'set$udifference'(X1,X2) ),
    inference(clausification,[status(esa)],[redefinition_k2_finsub_1]) ).

cnf(c52,plain,
    'set$udifference'(X0,'set$udifference'(X0,X1)) = 'set$uintersection2'(X0,X1),
    inference(clausification,[status(esa)],[t48_xboole_1]) ).

cnf(c59,plain,
    ~ empty(sK66),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c60,plain,
    preboolean(sK66),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c61,plain,
    element(sK64,sK66),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c62,plain,
    element(sK65,sK66),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c63,plain,
    ~ element('set$uintersection2'(sK64,sK65),sK66),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ element(X0,sK66)
    | ~ preboolean(sK66)
    | empty(sK66)
    | 'prebool$udifference'(sK66,sK64,X0) = 'set$udifference'(sK64,X0) ),
    inference(resolution,[status(thm)],[c44,c61]) ).

cnf(d1,plain,
    ( ~ element(X0,sK66)
    | ~ preboolean(sK66)
    | 'prebool$udifference'(sK66,sK64,X0) = 'set$udifference'(sK64,X0) ),
    inference(resolution,[status(thm)],[c59,d0]) ).

cnf(d2,plain,
    ( ~ element(X0,sK66)
    | 'prebool$udifference'(sK66,sK64,X0) = 'set$udifference'(sK64,X0) ),
    inference(resolution,[status(thm)],[c60,d1]) ).

cnf(d3,plain,
    'prebool$udifference'(sK66,sK64,sK65) = 'set$udifference'(sK64,sK65),
    inference(resolution,[status(thm)],[d2,c62]) ).

cnf(d4,plain,
    ( ~ element(sK65,sK66)
    | ~ element(sK64,sK66)
    | ~ preboolean(sK66)
    | empty(sK66)
    | element('set$udifference'(sK64,sK65),sK66) ),
    inference(superposition,[status(thm)],[d3,c7]) ).

cnf(d5,plain,
    ( ~ element(sK65,sK66)
    | ~ element(sK64,sK66)
    | element('set$udifference'(sK64,sK65),sK66)
    | ~ preboolean(sK66) ),
    inference(resolution,[status(thm)],[c59,d4]) ).

cnf(d6,plain,
    ( ~ element(sK65,sK66)
    | ~ element(sK64,sK66)
    | element('set$udifference'(sK64,sK65),sK66) ),
    inference(resolution,[status(thm)],[c60,d5]) ).

cnf(d7,plain,
    ( ~ element(sK65,sK66)
    | element('set$udifference'(sK64,sK65),sK66) ),
    inference(resolution,[status(thm)],[c61,d6]) ).

cnf(d8,plain,
    element('set$udifference'(sK64,sK65),sK66),
    inference(resolution,[status(thm)],[c62,d7]) ).

cnf(d9,plain,
    'prebool$udifference'(sK66,sK64,'set$udifference'(sK64,sK65)) = 'set$udifference'(sK64,'set$udifference'(sK64,sK65)),
    inference(resolution,[status(thm)],[d8,d2]) ).

cnf(d10,plain,
    'prebool$udifference'(sK66,sK64,'set$udifference'(sK64,sK65)) = 'set$uintersection2'(sK64,sK65),
    inference(demodulation,[status(thm)],[d9,c52]) ).

cnf(d11,plain,
    ( ~ element('set$udifference'(sK64,sK65),sK66)
    | ~ element(sK64,sK66)
    | ~ preboolean(sK66)
    | empty(sK66)
    | element('set$uintersection2'(sK64,sK65),sK66) ),
    inference(superposition,[status(thm)],[d10,c7]) ).

cnf(d12,plain,
    ( ~ element(sK64,sK66)
    | ~ element('set$udifference'(sK64,sK65),sK66)
    | element('set$uintersection2'(sK64,sK65),sK66)
    | ~ preboolean(sK66) ),
    inference(resolution,[status(thm)],[c59,d11]) ).

cnf(d13,plain,
    ( ~ element(sK64,sK66)
    | ~ element('set$udifference'(sK64,sK65),sK66)
    | element('set$uintersection2'(sK64,sK65),sK66) ),
    inference(resolution,[status(thm)],[c60,d12]) ).

cnf(d14,plain,
    ( ~ element('set$udifference'(sK64,sK65),sK66)
    | element('set$uintersection2'(sK64,sK65),sK66) ),
    inference(resolution,[status(thm)],[c61,d13]) ).

cnf(d15,plain,
    ~ element('set$udifference'(sK64,sK65),sK66),
    inference(resolution,[status(thm)],[c63,d14]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[d8,d15]) ).

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