↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET076+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:31:55 AM UTC 2026

% Result   : Theorem 42.96s 20.23s
% Output   : CNFRefutation 42.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   38 (  11 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   26 (   6   ~;  12   |;   3   &)
%                                         (   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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  12   !;   0   ?)

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

fof(unordered_pair_defn,axiom,
    ! [X0,X1,X2] :
      ( member(X0,'unordered$upair'(X1,X2))
    <=> ( ( X0 = X2
          | X0 = X1 )
        & member(X0,'universal$uclass') ) ) ).

fof(unordered_pair_is_subset,conjecture,
    ! [X0,X1,X2] :
      ( ( member(X1,X2)
        & member(X0,X2) )
     => subclass('unordered$upair'(X0,X1),X2) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( member(X1,X2)
          & member(X0,X2) )
       => subclass('unordered$upair'(X0,X1),X2) ),
    inference(negate_conjecture,[status(cth)],[unordered_pair_is_subset]) ).

cnf(c1,plain,
    ( member(sK3(X0,X1),X0)
    | subclass(X0,X1) ),
    inference(clausification,[status(esa)],[subclass_defn]) ).

cnf(c2,plain,
    ( ~ member(sK3(X0,X1),X1)
    | subclass(X0,X1) ),
    inference(clausification,[status(esa)],[subclass_defn]) ).

cnf(c8,plain,
    ( X0 = X2
    | X0 = X1
    | ~ member(X0,'unordered$upair'(X1,X2)) ),
    inference(clausification,[status(esa)],[unordered_pair_defn]) ).

cnf(c89,plain,
    member(sK90,sK92),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c90,plain,
    member(sK91,sK92),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c91,plain,
    ~ subclass('unordered$upair'(sK90,sK91),sK92),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( subclass('unordered$upair'(X0,X1),X2)
    | sK3('unordered$upair'(X0,X1),X2) = X0
    | sK3('unordered$upair'(X0,X1),X2) = X1 ),
    inference(resolution,[status(thm)],[c8,c1]) ).

cnf(d1,plain,
    ( sK3('unordered$upair'(sK90,sK91),sK92) = sK90
    | sK3('unordered$upair'(sK90,sK91),sK92) = sK91 ),
    inference(resolution,[status(thm)],[d0,c91]) ).

cnf(d2,plain,
    ( sK3('unordered$upair'(sK90,sK91),sK92) = sK90
    | subclass('unordered$upair'(sK90,sK91),sK92)
    | ~ member(sK91,sK92) ),
    inference(superposition,[status(thm)],[d1,c2]) ).

cnf(d3,plain,
    ( subclass('unordered$upair'(sK90,sK91),sK92)
    | sK3('unordered$upair'(sK90,sK91),sK92) = sK90 ),
    inference(resolution,[status(thm)],[c90,d2]) ).

cnf(d4,plain,
    sK3('unordered$upair'(sK90,sK91),sK92) = sK90,
    inference(resolution,[status(thm)],[c91,d3]) ).

cnf(d5,plain,
    ( subclass('unordered$upair'(sK90,sK91),sK92)
    | ~ member(sK90,sK92) ),
    inference(superposition,[status(thm)],[d4,c2]) ).

cnf(d6,plain,
    subclass('unordered$upair'(sK90,sK91),sK92),
    inference(resolution,[status(thm)],[c89,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c91,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET076+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n005.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sat Sep 26 07:03:16 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 42.96/20.23  % SZS status Theorem for theBenchmark.p
% 42.96/20.23  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------