↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWB006+2 : TPTP v9.3.1. Released v5.2.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:50:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
    ! [X0,X1] :
      ( iext('uri$uowl$usameAs',X0,X1)
    <=> X0 = X1 ) ).

fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
    ? [X0] :
      ( iext('uri$uowl$usameAs',X0,'uri$uex$uw')
      & iext('uri$uowl$usameAs',X0,'literal$uplain'('dat$ustr$uabc'))
      & iext('uri$uowl$usameAs','uri$uex$uu','literal$uplain'('dat$ustr$uabc')) ) ).

fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
    iext('uri$uowl$usameAs','uri$uex$uu','uri$uex$uw') ).

fof(negated_conjecture,negated_conjecture,
    ~ iext('uri$uowl$usameAs','uri$uex$uu','uri$uex$uw'),
    inference(negate_conjecture,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c0,plain,
    ( X0 = X1
    | ~ iext('uri$uowl$usameAs',X0,X1) ),
    inference(clausification,[status(esa)],[owl_eqdis_sameas]) ).

cnf(c1,plain,
    ( X0 != X1
    | iext('uri$uowl$usameAs',X0,X1) ),
    inference(clausification,[status(esa)],[owl_eqdis_sameas]) ).

cnf(c2,plain,
    iext('uri$uowl$usameAs','uri$uex$uu','literal$uplain'('dat$ustr$uabc')),
    inference(clausification,[status(esa)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c3,plain,
    iext('uri$uowl$usameAs',sK2,'literal$uplain'('dat$ustr$uabc')),
    inference(clausification,[status(esa)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c4,plain,
    iext('uri$uowl$usameAs',sK2,'uri$uex$uw'),
    inference(clausification,[status(esa)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c5,plain,
    ~ iext('uri$uowl$usameAs','uri$uex$uu','uri$uex$uw'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    'uri$uex$uu' = 'literal$uplain'('dat$ustr$uabc'),
    inference(resolution,[status(thm)],[c2,c0]) ).

cnf(d1,plain,
    sK2 = 'literal$uplain'('dat$ustr$uabc'),
    inference(resolution,[status(thm)],[c3,c0]) ).

cnf(d2,plain,
    sK2 = 'uri$uex$uu',
    inference(demodulation,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    sK2 = 'uri$uex$uw',
    inference(resolution,[status(thm)],[c4,c0]) ).

cnf(d4,plain,
    ~ iext('uri$uowl$usameAs','uri$uex$uu',sK2),
    inference(demodulation,[status(thm)],[c5,d3]) ).

cnf(d5,plain,
    ~ iext('uri$uowl$usameAs','uri$uex$uu','uri$uex$uu'),
    inference(demodulation,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    iext('uri$uowl$usameAs',X0,X0),
    inference(equality_resolution,[status(thm)],[c1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB006+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n005.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % 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 11:40:31 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.64/1.70  % SZS status Theorem for theBenchmark.p
% 9.64/1.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------