↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n009.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:45 AM UTC 2026

% Result   : Theorem 8.40s 6.86s
% Output   : CNFRefutation 8.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   30 (   4 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   90 (  30   ~;  56   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 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   :   42 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel43_1,axiom,
    ! [X0,X1] :
      ( 'set$uequal'(X0,X1)
    <=> ! [X2] :
          ( element(X2,X0)
        <=> element(X2,X1) ) ) ).

fof(pel43,conjecture,
    ! [X0,X1] :
      ( 'set$uequal'(X0,X1)
    <=> 'set$uequal'(X1,X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( 'set$uequal'(X0,X1)
      <=> 'set$uequal'(X1,X0) ),
    inference(negate_conjecture,[status(cth)],[pel43]) ).

cnf(c0,plain,
    ( element(X2,X1)
    | ~ element(X2,X0)
    | ~ 'set$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[pel43_1]) ).

cnf(c1,plain,
    ( ~ element(X2,X1)
    | element(X2,X0)
    | ~ 'set$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[pel43_1]) ).

cnf(c3,plain,
    ( element(sK3(X0,X1),X1)
    | element(sK3(X0,X1),X0)
    | 'set$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[pel43_1]) ).

cnf(c4,plain,
    ( ~ element(sK3(X0,X1),X0)
    | ~ element(sK3(X0,X1),X1)
    | 'set$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[pel43_1]) ).

cnf(c7,plain,
    ( 'set$uequal'(sK5,sK4)
    | 'set$uequal'(sK4,sK5) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c8,plain,
    ( ~ 'set$uequal'(sK4,sK5)
    | ~ 'set$uequal'(sK5,sK4) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( element(sK3(X0,X1),X2)
    | ~ 'set$uequal'(X2,X0)
    | element(sK3(X0,X1),X1)
    | 'set$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[c3,c1]) ).

cnf(d1,plain,
    ( element(sK3(X1,X0),X0)
    | 'set$uequal'(X1,X0)
    | ~ 'set$uequal'(X0,X1) ),
    inference(factoring,[status(thm)],[d0]) ).

cnf(d2,plain,
    ( element(sK3(X0,X1),X2)
    | ~ 'set$uequal'(X1,X2)
    | element(sK3(X0,X1),X0)
    | 'set$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[c3,c0]) ).

cnf(d3,plain,
    ( element(sK3(X2,X0),X3)
    | ~ 'set$uequal'(X3,X1)
    | element(sK3(X2,X0),X2)
    | 'set$uequal'(X2,X0)
    | ~ 'set$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[d2,c1]) ).

cnf(d4,plain,
    ( 'set$uequal'(sK4,sK5)
    | element(sK3(X1,sK5),X1)
    | element(sK3(X1,sK5),X0)
    | 'set$uequal'(X1,sK5)
    | ~ 'set$uequal'(X0,sK4) ),
    inference(resolution,[status(thm)],[d3,c7]) ).

cnf(d5,plain,
    ( element(sK3(X0,sK5),X0)
    | 'set$uequal'(sK4,sK5)
    | ~ 'set$uequal'(X0,sK4)
    | 'set$uequal'(X0,sK5) ),
    inference(factoring,[status(thm)],[d4]) ).

cnf(d6,plain,
    ( ~ element(sK3(X0,sK5),sK5)
    | 'set$uequal'(X0,sK5)
    | 'set$uequal'(sK4,sK5)
    | 'set$uequal'(X0,sK5)
    | ~ 'set$uequal'(X0,sK4) ),
    inference(resolution,[status(thm)],[d5,c4]) ).

cnf(d7,plain,
    ( ~ 'set$uequal'(sK5,X0)
    | 'set$uequal'(X0,sK5)
    | 'set$uequal'(sK4,sK5)
    | 'set$uequal'(X0,sK5)
    | ~ 'set$uequal'(X0,sK4) ),
    inference(resolution,[status(thm)],[d6,d1]) ).

cnf(d8,plain,
    ( 'set$uequal'(sK4,sK5)
    | 'set$uequal'(sK4,sK5)
    | 'set$uequal'(sK4,sK5)
    | ~ 'set$uequal'(sK4,sK4) ),
    inference(resolution,[status(thm)],[d7,c7]) ).

cnf(d9,plain,
    ( element(sK3(X0,X0),X0)
    | 'set$uequal'(X0,X0) ),
    inference(factoring,[status(thm)],[c3]) ).

cnf(d10,plain,
    ( ~ element(sK3(X0,X0),X0)
    | 'set$uequal'(X0,X0)
    | 'set$uequal'(X0,X0) ),
    inference(resolution,[status(thm)],[d9,c4]) ).

cnf(d11,plain,
    ( 'set$uequal'(X0,X0)
    | 'set$uequal'(X0,X0) ),
    inference(resolution,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    'set$uequal'(sK4,sK5),
    inference(resolution,[status(thm)],[d11,d8]) ).

cnf(d13,plain,
    ( element(sK3(X1,sK4),X1)
    | element(sK3(X1,sK4),X0)
    | 'set$uequal'(X1,sK4)
    | ~ 'set$uequal'(X0,sK5) ),
    inference(resolution,[status(thm)],[d12,d3]) ).

cnf(d14,plain,
    ( element(sK3(X0,sK4),X0)
    | ~ 'set$uequal'(X0,sK5)
    | 'set$uequal'(X0,sK4) ),
    inference(factoring,[status(thm)],[d13]) ).

cnf(d15,plain,
    ( ~ element(sK3(X0,sK4),sK4)
    | 'set$uequal'(X0,sK4)
    | ~ 'set$uequal'(X0,sK5)
    | 'set$uequal'(X0,sK4) ),
    inference(resolution,[status(thm)],[d14,c4]) ).

cnf(d16,plain,
    ( ~ 'set$uequal'(sK4,X0)
    | 'set$uequal'(X0,sK4)
    | ~ 'set$uequal'(X0,sK5)
    | 'set$uequal'(X0,sK4) ),
    inference(resolution,[status(thm)],[d15,d1]) ).

cnf(d17,plain,
    ( ~ 'set$uequal'(sK5,sK5)
    | 'set$uequal'(sK5,sK4) ),
    inference(resolution,[status(thm)],[d16,d12]) ).

cnf(d18,plain,
    'set$uequal'(sK5,sK4),
    inference(resolution,[status(thm)],[d11,d17]) ).

cnf(d19,plain,
    ~ 'set$uequal'(sK5,sK4),
    inference(resolution,[status(thm)],[d12,c8]) ).

cnf(d20,plain,
    $false,
    inference(resolution,[status(thm)],[d19,d18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/5.37  % Computer : n009.cluster.edu
% 0.12/5.37  % Model    : x86_64 x86_64
% 0.12/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37  % Memory   : 8046.5625MB
% 0.12/5.37  % OS       : Linux 6.8.0-71-generic
% 0.12/5.37  % CPULimit : 300
% 0.12/5.37  % WCLimit  : 300
% 0.12/5.37  % DateTime : Sat Sep 26 06:59:49 UTC 2026
% 0.12/5.37  % CPUTime  : 
% 0.12/5.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.40/6.86  % SZS status Theorem for theBenchmark.p
% 8.40/6.86  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------