↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : KRS105+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 10:08:31 EDT 2024

% Result   : Unsatisfiable 0.17s 0.58s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : KRS105+1 : TPTP v8.2.0. Released v3.1.0.
% 0.10/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32  % Computer : n003.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Wed Jun 19 14:13:08 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.54  start to proof:theBenchmark
% 0.17/0.57  %-------------------------------------------
% 0.17/0.57  % File        :CSE---1.7
% 0.17/0.57  % Problem     :theBenchmark
% 0.17/0.57  % Transform   :cnf
% 0.17/0.57  % Format      :tptp:raw
% 0.17/0.57  % Command     :java -jar mcs_scs.jar %d %s
% 0.17/0.57  
% 0.17/0.57  % Result      :Theorem 0.010000s
% 0.17/0.57  % Output      :CNFRefutation 0.010000s
% 0.17/0.57  %-------------------------------------------
% 0.17/0.57  %------------------------------------------------------------------------------
% 0.17/0.57  % File     : KRS105+1 : TPTP v8.2.0. Released v3.1.0.
% 0.17/0.57  % Domain   : Knowledge Representation (Semantic Web)
% 0.17/0.57  % Problem  : DL Test: fact2.1
% 0.17/0.57  % Version  : Especial.
% 0.17/0.57  % English  :
% 0.17/0.57  
% 0.17/0.57  % Refs     : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.17/0.57  %          : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.17/0.57  % Source   : [Bec03]
% 0.17/0.57  % Names    : inconsistent_description-logic-Manifest602 [Bec03]
% 0.17/0.57  
% 0.17/0.57  % Status   : Unsatisfiable
% 0.17/0.57  % Rating   : 0.00 v6.4.0, 0.25 v6.3.0, 0.00 v6.2.0, 0.25 v6.1.0, 0.00 v3.1.0
% 0.17/0.57  % Syntax   : Number of formulae    :   10 (   1 unt;   0 def)
% 0.17/0.57  %            Number of atoms       :   21 (   0 equ)
% 0.17/0.57  %            Maximal formula atoms :    3 (   2 avg)
% 0.17/0.57  %            Number of connectives :   14 (   3   ~;   0   |;   1   &)
% 0.17/0.57  %                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
% 0.17/0.57  %            Maximal formula depth :    5 (   4 avg)
% 0.17/0.57  %            Maximal term depth    :    1 (   1 avg)
% 0.17/0.57  %            Number of predicates  :   11 (  11 usr;   0 prp; 1-2 aty)
% 0.17/0.57  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.17/0.57  %            Number of variables   :   13 (  11   !;   2   ?)
% 0.17/0.57  % SPC      : FOF_UNS_RFO_NEQ
% 0.17/0.57  
% 0.17/0.57  % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.17/0.57  %            datatypes, so this problem may not be perfect. At least it's
% 0.17/0.57  %            still representative of the type of reasoning required for OWL.
% 0.17/0.57  %------------------------------------------------------------------------------
% 0.17/0.57  %----Thing and Nothing
% 0.17/0.57  fof(axiom_0,axiom,
% 0.17/0.57      ! [X] :
% 0.17/0.57        ( cowlThing(X)
% 0.17/0.57        & ~ cowlNothing(X) ) ).
% 0.17/0.57  
% 0.17/0.57  %----String and Integer disjoint
% 0.17/0.57  fof(axiom_1,axiom,
% 0.17/0.57      ! [X] :
% 0.17/0.57        ( xsd_string(X)
% 0.17/0.57      <=> ~ xsd_integer(X) ) ).
% 0.17/0.57  
% 0.17/0.57  %----Super cUnsatisfiable
% 0.17/0.57  fof(axiom_2,axiom,
% 0.17/0.57      ! [X] :
% 0.17/0.57        ( cUnsatisfiable(X)
% 0.17/0.57       => cdxcomp(X) ) ).
% 0.17/0.57  
% 0.17/0.57  %----Super cUnsatisfiable
% 0.17/0.57  fof(axiom_3,axiom,
% 0.17/0.57      ! [X] :
% 0.17/0.57        ( cUnsatisfiable(X)
% 0.17/0.57       => cc(X) ) ).
% 0.17/0.57  
% 0.17/0.57  %----Super cc
% 0.17/0.57  fof(axiom_4,axiom,
% 0.17/0.57      ! [X] :
% 0.17/0.57        ( cc(X)
% 0.17/0.58       => ! [Y] :
% 0.17/0.58            ( rr(X,Y)
% 0.17/0.58           => cc(Y) ) ) ).
% 0.17/0.58  
% 0.17/0.58  %----Equality cd
% 0.17/0.58  fof(axiom_5,axiom,
% 0.17/0.58      ! [X] :
% 0.17/0.58        ( cd(X)
% 0.17/0.58      <=> ~ ? [Y] : ra_Px1(X,Y) ) ).
% 0.17/0.58  
% 0.17/0.58  %----Equality cdxcomp
% 0.17/0.58  fof(axiom_6,axiom,
% 0.17/0.58      ! [X] :
% 0.17/0.58        ( cdxcomp(X)
% 0.17/0.58      <=> ? [Y0] : ra_Px1(X,Y0) ) ).
% 0.17/0.58  
% 0.17/0.58  %----Equality ca_Ax2
% 0.17/0.58  fof(axiom_7,axiom,
% 0.17/0.58      ! [X] :
% 0.17/0.58        ( ca_Ax2(X)
% 0.17/0.58      <=> ! [Y] :
% 0.17/0.58            ( rr(X,Y)
% 0.17/0.58           => cc(Y) ) ) ).
% 0.17/0.58  
% 0.17/0.58  %----Super ca_Ax2
% 0.17/0.58  fof(axiom_8,axiom,
% 0.17/0.58      ! [X] :
% 0.17/0.58        ( ca_Ax2(X)
% 0.17/0.58       => cd(X) ) ).
% 0.17/0.58  
% 0.17/0.58  %----i2003_11_14_17_20_53634
% 0.17/0.58  fof(axiom_9,axiom,
% 0.17/0.58      cUnsatisfiable(i2003_11_14_17_20_53634) ).
% 0.17/0.58  
% 0.17/0.58  %------------------------------------------------------------------------------
% 0.17/0.58  %-------------------------------------------
% 0.17/0.58  % Proof found
% 0.17/0.58  % SZS status Theorem for theBenchmark
% 0.17/0.58  % SZS output start Proof
% 0.17/0.58  %ClaNum:15(EqnAxiom:0)
% 0.17/0.58  %VarNum:36(SingletonVarNum:18)
% 0.17/0.58  %MaxLitNum:3
% 0.17/0.58  %MaxfuncDepth:1
% 0.17/0.58  %SharedTerms:2
% 0.17/0.58  [1]P1(a1)
% 0.17/0.58  [2]~P2(x21)
% 0.17/0.58  [3]P8(x31)+P7(x31)
% 0.17/0.58  [4]~P1(x41)+P3(x41)
% 0.17/0.58  [5]~P1(x51)+P4(x51)
% 0.17/0.58  [6]~P5(x61)+P6(x61)
% 0.17/0.58  [7]~P8(x71)+~P7(x71)
% 0.17/0.58  [8]P5(x81)+~P4(f2(x81))
% 0.17/0.58  [9]P6(x91)+P9(x91,f3(x91))
% 0.17/0.58  [10]P5(x101)+P10(x101,f2(x101))
% 0.17/0.58  [12]~P3(x121)+P9(x121,f4(x121))
% 0.17/0.58  [11]P3(x111)+~P9(x111,x112)
% 0.17/0.58  [13]~P6(x131)+~P9(x131,x132)
% 0.17/0.58  [14]~P10(x142,x141)+P4(x141)+~P4(x142)
% 0.17/0.58  [15]~P10(x152,x151)+P4(x151)+~P5(x152)
% 0.17/0.58  %EqnAxiom
% 0.17/0.58  
% 0.17/0.58  %-------------------------------------------
% 0.17/0.58  cnf(17,plain,
% 0.17/0.58     (P9(a1,f4(a1))),
% 0.17/0.58     inference(scs_inference,[],[1,4,12])).
% 0.17/0.58  cnf(19,plain,
% 0.17/0.58     (~P5(a1)),
% 0.17/0.58     inference(scs_inference,[],[17,6,13])).
% 0.17/0.58  cnf(22,plain,
% 0.17/0.58     (P6(x221)+P10(x221,f2(x221))),
% 0.17/0.58     inference(scs_inference,[],[10,6])).
% 0.17/0.58  cnf(23,plain,
% 0.17/0.58     (P4(f2(x231))+~P4(x231)+P6(x231)),
% 0.17/0.58     inference(scs_inference,[],[22,14])).
% 0.17/0.58  cnf(27,plain,
% 0.17/0.58     (P6(a1)+P4(f2(a1))),
% 0.17/0.58     inference(scs_inference,[],[1,23,5])).
% 0.17/0.58  cnf(28,plain,
% 0.17/0.58     (P6(a1)),
% 0.17/0.58     inference(scs_inference,[],[19,27,8])).
% 0.17/0.58  cnf(29,plain,
% 0.17/0.58     ($false),
% 0.17/0.58     inference(scs_inference,[],[28,17,13]),
% 0.17/0.58     ['proof']).
% 0.17/0.58  % SZS output end Proof
% 0.17/0.58  % Total time :0.010000s
%------------------------------------------------------------------------------