↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWB018+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n004.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 : Fri Sep 25 03:04:27 PM UTC 2026

% Result   : Theorem 1.58s 1.27s
% Output   : CNFRefutation 1.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  12 unt;   0 def)
%            Number of atoms       :   57 (   6 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   54 (  26   ~;  21   |;   3   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   51 (   0 sgn  51   !;   0   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( iext(uri_rdf_type,X0,X1)
    <=> icext(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).

fof(f2,axiom,
    ! [X0,X1,X2,X3] :
      ( ( iext(X0,X2,X3)
        & iext(uri_rdfs_domain,X0,X1) )
     => icext(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_domain_main) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( iext(uri_owl_sameAs,X0,X1)
    <=> X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_sameas) ).

fof(f4,conjecture,
    iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics) ).

fof(f5,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,axiom,
    ( iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
    & iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics) ).

fof(f7,plain,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(flattening,[],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( icext(X1,X0)
     => iext(uri_rdf_type,X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ icext(X1,X0)
      | iext(uri_rdf_type,X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f10,plain,
    ! [X0,X1,X2,X3] :
      ( ~ iext(X0,X2,X3)
      | ~ iext(uri_rdfs_domain,X0,X1)
      | icext(X1,X2) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3] :
      ( ~ iext(X0,X2,X3)
      | ~ iext(uri_rdfs_domain,X0,X1)
      | icext(X1,X2) ),
    inference(flattening,[],[f10]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ( ~ iext(uri_owl_sameAs,X0,X1)
        | X0 = X1 )
      & ( X0 != X1
        | iext(uri_owl_sameAs,X0,X1) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ icext(X1,X0)
      | iext(uri_rdf_type,X0,X1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f14,plain,
    ! [X2,X3,X0,X1] :
      ( ~ iext(X0,X2,X3)
      | ~ iext(uri_rdfs_domain,X0,X1)
      | icext(X1,X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( X0 != X1
      | iext(uri_owl_sameAs,X0,X1) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f17,plain,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(cnf_transformation,[],[f7]) ).

fof(f19,plain,
    iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person),
    inference(cnf_transformation,[],[f6]) ).

fof(f20,plain,
    ! [X1] : iext(uri_owl_sameAs,X1,X1),
    inference(equality_resolution,[],[f16]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] :
      ( iext(uri_rdf_type,X1,X0)
      | ~ icext(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( icext(X3,X1)
      | ~ iext(uri_rdfs_domain,X0,X3)
      | ~ iext(X0,X1,X2) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_51,plain,
    ! [X0: $i] : iext(uri_owl_sameAs,X0,X0),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_53,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_54,plain,
    iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_98,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( iext(uri_rdf_type,X2,X0)
      | ~ iext(uri_rdfs_domain,X4,X1)
      | ~ iext(X4,X3,X5)
      | ( X2 != X3 )
      | ( X0 != X1 ) ),
    inference(resolution_lifted,[status(thm)],[c_49,c_50]) ).

tcf(c_99,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( iext(uri_rdf_type,X1,X3)
      | ~ iext(uri_rdfs_domain,X0,X3)
      | ~ iext(X0,X1,X2) ),
    inference(unflattening,[status(thm)],[c_98]) ).

tcf(c_143,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(demodulation,[status(thm)],[c_53]) ).

tcf(c_235,plain,
    ! [X0: $i,X1: $i] :
      ( iext(uri_rdf_type,X1,X0)
      | ~ iext(uri_rdfs_domain,uri_owl_sameAs,X0) ),
    inference(superposition,[status(thm)],[c_51,c_99]) ).

tcf(c_247,plain,
    ! [X0: $i] : iext(uri_rdf_type,X0,uri_ex_Person),
    inference(superposition,[status(thm)],[c_54,c_235]) ).

tcf(c_248,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_143,c_247]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB018+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37  % Computer : n004.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 : Thu Sep 24 15:29:05 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 1.58/1.27  % SZS status Started for theBenchmark.p
% 1.58/1.27  % SZS status Theorem for theBenchmark.p
% 1.58/1.27  
% 1.58/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.58/1.27  
% 1.58/1.27  % ------  iProver source info
% 1.58/1.27  
% 1.58/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 1.58/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.58/1.27  % git: non_committed_changes: false
% 1.58/1.27  
% 1.58/1.27  % ------ Parsing...
% 1.58/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.58/1.27  
% 1.58/1.27  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.58/1.27  
% 1.58/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.58/1.27  
% 1.58/1.27  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.58/1.27  % ------ Proving...
% 1.58/1.27  % ------ Problem Properties 
% 1.58/1.27  
% 1.58/1.27  % 
% 1.58/1.27  % clauses                               6
% 1.58/1.27  % conjectures                           1
% 1.58/1.27  % EPR                                   6
% 1.58/1.27  % Horn                                  6
% 1.58/1.27  % unary                                 4
% 1.58/1.27  % binary                                1
% 1.58/1.27  % lits                                  9
% 1.58/1.27  % lits eq                               1
% 1.58/1.27  % fd_pure                               0
% 1.58/1.27  % fd_pseudo                             0
% 1.58/1.27  % fd_cond                               0
% 1.58/1.27  % fd_pseudo_cond                        1
% 1.58/1.27  % AC symbols                            0
% 1.58/1.27  
% 1.58/1.27  % ------ Schedule dynamic 5 is on 
% 1.58/1.27  
% 1.58/1.27  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/1.27  
% 1.58/1.27  
% 1.58/1.27  % ------ 
% 1.58/1.27  % Current options:
% 1.58/1.27  % ------ 
% 1.58/1.27  
% 1.58/1.27  
% 1.58/1.27  % 
% 1.58/1.27  
% 1.58/1.27  % ------ Proving...
% 1.58/1.27  % 
% 1.58/1.27  
% 1.58/1.27  % SZS status Theorem for theBenchmark.p
% 1.58/1.27  
% 1.58/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.27  
% 1.58/1.27  
%------------------------------------------------------------------------------