↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET014+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 : n001.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:31:34 AM UTC 2026

% Result   : Theorem 14.21s 12.24s
% Output   : CNFRefutation 14.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :   47 (   2 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   33 (   8   ~;  18   |;   2   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   36 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(union_defn,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X1)
        | member(X2,X0) ) ) ).

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

fof(commutativity_of_union,axiom,
    ! [X0,X1] : union(X0,X1) = union(X1,X0) ).

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

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

cnf(c0,plain,
    ( member(X0,X2)
    | member(X0,X1)
    | ~ member(X0,union(X1,X2)) ),
    inference(clausification,[status(esa)],[union_defn]) ).

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

cnf(c4,plain,
    ( member(sK6(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset_defn]) ).

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

cnf(c6,plain,
    union(X0,X1) = union(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_union]) ).

cnf(c14,plain,
    subset(sK14,sK15),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c15,plain,
    subset(sK16,sK15),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c16,plain,
    ~ subset(union(sK14,sK16),sK15),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ member(X0,sK16)
    | member(X0,sK15) ),
    inference(resolution,[status(thm)],[c3,c15]) ).

cnf(d1,plain,
    ( ~ member(X0,sK14)
    | member(X0,sK15) ),
    inference(resolution,[status(thm)],[c3,c14]) ).

cnf(d2,plain,
    ( member(sK6(union(X0,X1),X2),X0)
    | member(sK6(union(X0,X1),X2),X1)
    | subset(union(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c4,c0]) ).

cnf(d3,plain,
    ( member(sK6(union(X0,sK14),X1),sK15)
    | subset(union(X0,sK14),X1)
    | member(sK6(union(X0,sK14),X1),X0) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ( member(sK6(union(sK16,sK14),X0),sK15)
    | subset(union(sK16,sK14),X0)
    | member(sK6(union(sK16,sK14),X0),sK15) ),
    inference(resolution,[status(thm)],[d3,d0]) ).

cnf(d5,plain,
    ( subset(union(sK16,sK14),X0)
    | member(sK6(union(sK14,sK16),X0),sK15) ),
    inference(demodulation,[status(thm)],[d4,c6]) ).

cnf(d6,plain,
    ( subset(union(sK14,sK16),X0)
    | member(sK6(union(sK14,sK16),X0),sK15) ),
    inference(demodulation,[status(thm)],[d5,c6]) ).

cnf(d7,plain,
    ( subset(union(sK14,sK16),sK15)
    | subset(union(sK14,sK16),sK15) ),
    inference(resolution,[status(thm)],[d6,c5]) ).

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

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