↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n026.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:56 AM UTC 2026

% Result   : Theorem 9.69s 1.65s
% Output   : CNFRefutation 9.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   37 (  15   ~;  13   |;   3   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  13   !;   1   ?)

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

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

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

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

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

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(c2,plain,
    ( ~ member(X2,X1)
    | ~ member(X2,X0)
    | intersect(X0,X1) ),
    inference(clausification,[status(esa)],[intersect_defn]) ).

cnf(c3,plain,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset_defn]) ).

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

cnf(c8,plain,
    intersect(sK11,sK12),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c9,plain,
    subset(sK12,sK13),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c10,plain,
    ~ intersect(sK11,sK13),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    intersect(sK12,sK11),
    inference(resolution,[status(thm)],[c6,c8]) ).

cnf(d1,plain,
    ( ~ member(X0,sK12)
    | member(X0,sK13) ),
    inference(resolution,[status(thm)],[c3,c9]) ).

cnf(d2,plain,
    ( ~ intersect(sK12,X0)
    | member(sK2(sK12,X0),sK13) ),
    inference(resolution,[status(thm)],[d1,c0]) ).

cnf(d3,plain,
    ( ~ intersect(X2,X0)
    | ~ member(sK2(X2,X0),X1)
    | intersect(X0,X1) ),
    inference(resolution,[status(thm)],[c2,c1]) ).

cnf(d4,plain,
    ( ~ intersect(sK12,X0)
    | intersect(X0,sK13)
    | ~ intersect(sK12,X0) ),
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    intersect(sK11,sK13),
    inference(resolution,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    $false,
    inference(resolution,[status(thm)],[c10,d5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET625+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n026.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 08:04:10 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.69/1.65  % SZS status Theorem for theBenchmark.p
% 9.69/1.65  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------