↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n005.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:32:47 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
    <=> ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ) ).

fof(symmetry_of_intersect,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
     => intersect(X1,X0) ) ).

fof(prove_th15,conjecture,
    ! [X0,X1] :
      ( intersect(X0,X1)
     => ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( intersect(X0,X1)
       => ? [X2] :
            ( member(X2,X1)
            & member(X2,X0) ) ),
    inference(negate_conjecture,[status(cth)],[prove_th15]) ).

cnf(c0,plain,
    ( member(sK2(X0,X1),X0)
    | ~ intersect(X0,X1) ),
    inference(clausification,[status(esa)],[intersect_defn]) ).

cnf(c1,plain,
    ( member(sK2(X0,X1),X1)
    | ~ intersect(X0,X1) ),
    inference(clausification,[status(esa)],[intersect_defn]) ).

cnf(c3,plain,
    ( intersect(X1,X0)
    | ~ intersect(X0,X1) ),
    inference(clausification,[status(esa)],[symmetry_of_intersect]) ).

cnf(c4,plain,
    intersect(sK6,sK7),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c5,plain,
    ( ~ member(X0,sK7)
    | ~ member(X0,sK6) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    intersect(sK7,sK6),
    inference(resolution,[status(thm)],[c3,c4]) ).

cnf(d1,plain,
    ( ~ intersect(sK7,X0)
    | ~ member(sK2(sK7,X0),sK6) ),
    inference(resolution,[status(thm)],[c5,c0]) ).

cnf(d2,plain,
    ( ~ intersect(sK7,sK6)
    | ~ intersect(sK7,sK6) ),
    inference(resolution,[status(thm)],[d1,c1]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[d2,d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET575+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.56  % Computer : n005.cluster.edu
% 0.08/0.56  % Model    : x86_64 x86_64
% 0.08/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.56  % Memory   : 8046.5625MB
% 0.08/0.56  % OS       : Linux 6.8.0-71-generic
% 0.08/0.56  % CPULimit : 300
% 0.08/0.56  % WCLimit  : 300
% 0.08/0.56  % DateTime : Sat Sep 26 07:56:47 UTC 2026
% 0.08/0.56  % CPUTime  : 
% 0.08/0.56  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/1.74  % SZS status Theorem for theBenchmark.p
% 9.24/1.74  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------