↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET767+4 : 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 : n017.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:33:12 AM UTC 2026

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

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

fof(equivalence_class,axiom,
    ! [X0,X1,X2,X3] :
      ( member(X3,'equivalence$uclass'(X2,X1,X0))
    <=> ( apply(X0,X2,X3)
        & member(X3,X1) ) ) ).

fof(thIII03,conjecture,
    ! [X0,X1,X2] :
      ( equivalence(X1,X0)
     => subset('equivalence$uclass'(X2,X0,X1),X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( equivalence(X1,X0)
       => subset('equivalence$uclass'(X2,X0,X1),X0) ),
    inference(negate_conjecture,[status(cth)],[thIII03]) ).

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

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

cnf(c60,plain,
    ( member(X0,X2)
    | ~ member(X0,'equivalence$uclass'(X1,X2,X3)) ),
    inference(clausification,[status(esa)],[equivalence_class]) ).

cnf(c74,plain,
    ~ subset('equivalence$uclass'(sK83,sK81,sK82),sK81),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    member(sK3('equivalence$uclass'(sK83,sK81,sK82),sK81),'equivalence$uclass'(sK83,sK81,sK82)),
    inference(resolution,[status(thm)],[c1,c74]) ).

cnf(d1,plain,
    member(sK3('equivalence$uclass'(sK83,sK81,sK82),sK81),sK81),
    inference(resolution,[status(thm)],[c60,d0]) ).

cnf(d2,plain,
    subset('equivalence$uclass'(sK83,sK81,sK82),sK81),
    inference(resolution,[status(thm)],[d1,c2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET767+4 : 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.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 08:09:18 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.30/5.95  % SZS status Theorem for theBenchmark.p
% 22.30/5.95  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------