↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU188+1 : TPTP v9.3.1. Released v3.3.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:41:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(fc1_xboole_0,axiom,
    empty('empty$uset') ).

fof(fc5_relat_1,axiom,
    ! [X0] :
      ( ( relation(X0)
        & ~ empty(X0) )
     => ~ empty('relation$udom'(X0)) ) ).

fof(fc6_relat_1,axiom,
    ! [X0] :
      ( ( relation(X0)
        & ~ empty(X0) )
     => ~ empty('relation$urng'(X0)) ) ).

fof(t6_boole,axiom,
    ! [X0] :
      ( empty(X0)
     => X0 = 'empty$uset' ) ).

fof(t64_relat_1,conjecture,
    ! [X0] :
      ( relation(X0)
     => ( ( 'relation$urng'(X0) = 'empty$uset'
          | 'relation$udom'(X0) = 'empty$uset' )
       => X0 = 'empty$uset' ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( relation(X0)
       => ( ( 'relation$urng'(X0) = 'empty$uset'
            | 'relation$udom'(X0) = 'empty$uset' )
         => X0 = 'empty$uset' ) ),
    inference(negate_conjecture,[status(cth)],[t64_relat_1]) ).

cnf(c17,plain,
    empty('empty$uset'),
    inference(clausification,[status(esa)],[fc1_xboole_0]) ).

cnf(c23,plain,
    ( ~ empty('relation$udom'(X0))
    | ~ relation(X0)
    | empty(X0) ),
    inference(clausification,[status(esa)],[fc5_relat_1]) ).

cnf(c24,plain,
    ( ~ empty('relation$urng'(X0))
    | ~ relation(X0)
    | empty(X0) ),
    inference(clausification,[status(esa)],[fc6_relat_1]) ).

cnf(c38,plain,
    ( X0 = 'empty$uset'
    | ~ empty(X0) ),
    inference(clausification,[status(esa)],[t6_boole]) ).

cnf(c41,plain,
    relation(sK50),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c42,plain,
    ( 'relation$urng'(sK50) = 'empty$uset'
    | 'relation$udom'(sK50) = 'empty$uset' ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c43,plain,
    sK50 != 'empty$uset',
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'relation$udom'(sK50) = 'empty$uset'
    | ~ relation(sK50)
    | empty(sK50)
    | ~ empty('empty$uset') ),
    inference(superposition,[status(thm)],[c42,c24]) ).

cnf(d1,plain,
    ( empty(sK50)
    | ~ empty('empty$uset')
    | 'relation$udom'(sK50) = 'empty$uset' ),
    inference(resolution,[status(thm)],[c41,d0]) ).

cnf(d2,plain,
    ( empty(sK50)
    | 'relation$udom'(sK50) = 'empty$uset' ),
    inference(resolution,[status(thm)],[c17,d1]) ).

cnf(d3,plain,
    ( 'relation$udom'(sK50) = 'empty$uset'
    | sK50 = 'empty$uset' ),
    inference(resolution,[status(thm)],[c38,d2]) ).

cnf(d4,plain,
    'relation$udom'(sK50) = 'empty$uset',
    inference(resolution,[status(thm)],[c43,d3]) ).

cnf(d5,plain,
    ( ~ relation(sK50)
    | empty(sK50)
    | ~ empty('empty$uset') ),
    inference(superposition,[status(thm)],[d4,c23]) ).

cnf(d6,plain,
    ( empty(sK50)
    | ~ empty('empty$uset') ),
    inference(resolution,[status(thm)],[c41,d5]) ).

cnf(d7,plain,
    empty(sK50),
    inference(resolution,[status(thm)],[c17,d6]) ).

cnf(d8,plain,
    sK50 = 'empty$uset',
    inference(resolution,[status(thm)],[d7,c38]) ).

cnf(d9,plain,
    $false,
    inference(resolution,[status(thm)],[c43,d8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU188+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n001.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 08:52:42 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.53/2.26  % SZS status Theorem for theBenchmark.p
% 13.53/2.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------