TSTP Solution File: SEU200+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n008.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 : Fri May  3 03:04:57 EDT 2024

% Result   : Theorem 2.67s 1.18s
% Output   : CNFRefutation 2.67s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => relation(relation_rng_restriction(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relat_1) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => subset(relation_rng_restriction(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_relat_1) ).

fof(f25,conjecture,
    ! [X0,X1] :
      ( relation(X1)
     => subset(relation_rng(relation_rng_restriction(X0,X1)),relation_rng(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t118_relat_1) ).

fof(f26,negated_conjecture,
    ~ ! [X0,X1] :
        ( relation(X1)
       => subset(relation_rng(relation_rng_restriction(X0,X1)),relation_rng(X1)) ),
    inference(negated_conjecture,[],[f25]) ).

fof(f28,axiom,
    ! [X0] :
      ( relation(X0)
     => ! [X1] :
          ( relation(X1)
         => ( subset(X0,X1)
           => ( subset(relation_rng(X0),relation_rng(X1))
              & subset(relation_dom(X0),relation_dom(X1)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_relat_1) ).

fof(f39,plain,
    ! [X0,X1] :
      ( relation(relation_rng_restriction(X0,X1))
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( subset(relation_rng_restriction(X0,X1),X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f48,plain,
    ? [X0,X1] :
      ( ~ subset(relation_rng(relation_rng_restriction(X0,X1)),relation_rng(X1))
      & relation(X1) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f50,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( subset(relation_rng(X0),relation_rng(X1))
            & subset(relation_dom(X0),relation_dom(X1)) )
          | ~ subset(X0,X1)
          | ~ relation(X1) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f51,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( subset(relation_rng(X0),relation_rng(X1))
            & subset(relation_dom(X0),relation_dom(X1)) )
          | ~ subset(X0,X1)
          | ~ relation(X1) )
      | ~ relation(X0) ),
    inference(flattening,[],[f50]) ).

fof(f74,plain,
    ( ? [X0,X1] :
        ( ~ subset(relation_rng(relation_rng_restriction(X0,X1)),relation_rng(X1))
        & relation(X1) )
   => ( ~ subset(relation_rng(relation_rng_restriction(sK7,sK8)),relation_rng(sK8))
      & relation(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f75,plain,
    ( ~ subset(relation_rng(relation_rng_restriction(sK7,sK8)),relation_rng(sK8))
    & relation(sK8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f48,f74]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( relation(relation_rng_restriction(X0,X1))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f39]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( subset(relation_rng_restriction(X0,X1),X1)
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f103,plain,
    relation(sK8),
    inference(cnf_transformation,[],[f75]) ).

fof(f104,plain,
    ~ subset(relation_rng(relation_rng_restriction(sK7,sK8)),relation_rng(sK8)),
    inference(cnf_transformation,[],[f75]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( subset(relation_rng(X0),relation_rng(X1))
      | ~ subset(X0,X1)
      | ~ relation(X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f51]) ).

cnf(c_51,plain,
    ( ~ relation(X0)
    | relation(relation_rng_restriction(X1,X0)) ),
    inference(cnf_transformation,[],[f79]) ).

cnf(c_74,plain,
    ( ~ relation(X0)
    | subset(relation_rng_restriction(X1,X0),X0) ),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_75,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(sK7,sK8)),relation_rng(sK8)),
    inference(cnf_transformation,[],[f104]) ).

cnf(c_76,negated_conjecture,
    relation(sK8),
    inference(cnf_transformation,[],[f103]) ).

cnf(c_78,plain,
    ( ~ subset(X0,X1)
    | ~ relation(X0)
    | ~ relation(X1)
    | subset(relation_rng(X0),relation_rng(X1)) ),
    inference(cnf_transformation,[],[f107]) ).

cnf(c_1104,plain,
    relation_rng_restriction(sK7,sK8) = sP0_iProver_def,
    definition ).

cnf(c_1105,plain,
    relation_rng(sP0_iProver_def) = sP1_iProver_def,
    definition ).

cnf(c_1106,plain,
    relation_rng(sK8) = sP2_iProver_def,
    definition ).

cnf(c_1107,negated_conjecture,
    relation(sK8),
    inference(demodulation,[status(thm)],[c_76]) ).

cnf(c_1108,negated_conjecture,
    ~ subset(sP1_iProver_def,sP2_iProver_def),
    inference(demodulation,[status(thm)],[c_75,c_1106,c_1104,c_1105]) ).

cnf(c_1812,plain,
    ( ~ relation(sK8)
    | relation(sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_1104,c_51]) ).

cnf(c_1813,plain,
    relation(sP0_iProver_def),
    inference(forward_subsumption_resolution,[status(thm)],[c_1812,c_1107]) ).

cnf(c_1867,plain,
    ( ~ relation(sK8)
    | subset(sP0_iProver_def,sK8) ),
    inference(superposition,[status(thm)],[c_1104,c_74]) ).

cnf(c_1868,plain,
    subset(sP0_iProver_def,sK8),
    inference(forward_subsumption_resolution,[status(thm)],[c_1867,c_1107]) ).

cnf(c_1984,plain,
    ( ~ subset(X0,sK8)
    | ~ relation(X0)
    | ~ relation(sK8)
    | subset(relation_rng(X0),sP2_iProver_def) ),
    inference(superposition,[status(thm)],[c_1106,c_78]) ).

cnf(c_1995,plain,
    ( ~ subset(X0,sK8)
    | ~ relation(X0)
    | subset(relation_rng(X0),sP2_iProver_def) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_1984,c_1107]) ).

cnf(c_2099,plain,
    ( ~ subset(sP0_iProver_def,sK8)
    | ~ relation(sP0_iProver_def)
    | subset(sP1_iProver_def,sP2_iProver_def) ),
    inference(superposition,[status(thm)],[c_1105,c_1995]) ).

cnf(c_2100,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2099,c_1108,c_1813,c_1868]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 17:57:13 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.67/1.18  % SZS status Started for theBenchmark.p
% 2.67/1.18  % SZS status Theorem for theBenchmark.p
% 2.67/1.18  
% 2.67/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.67/1.18  
% 2.67/1.18  ------  iProver source info
% 2.67/1.18  
% 2.67/1.18  git: date: 2024-05-02 19:28:25 +0000
% 2.67/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.67/1.18  git: non_committed_changes: false
% 2.67/1.18  
% 2.67/1.18  ------ Parsing...
% 2.67/1.18  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.67/1.18  
% 2.67/1.18  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 2.67/1.18  
% 2.67/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.67/1.18  
% 2.67/1.18  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.67/1.18  ------ Proving...
% 2.67/1.18  ------ Problem Properties 
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  clauses                                 41
% 2.67/1.18  conjectures                             2
% 2.67/1.18  EPR                                     20
% 2.67/1.18  Horn                                    39
% 2.67/1.18  unary                                   18
% 2.67/1.18  binary                                  15
% 2.67/1.18  lits                                    74
% 2.67/1.18  lits eq                                 5
% 2.67/1.18  fd_pure                                 0
% 2.67/1.18  fd_pseudo                               0
% 2.67/1.18  fd_cond                                 1
% 2.67/1.18  fd_pseudo_cond                          1
% 2.67/1.18  AC symbols                              0
% 2.67/1.18  
% 2.67/1.18  ------ Schedule dynamic 5 is on 
% 2.67/1.18  
% 2.67/1.18  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  ------ 
% 2.67/1.18  Current options:
% 2.67/1.18  ------ 
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  ------ Proving...
% 2.67/1.18  
% 2.67/1.18  
% 2.67/1.18  % SZS status Theorem for theBenchmark.p
% 2.67/1.18  
% 2.67/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.67/1.18  
% 2.67/1.18  
%------------------------------------------------------------------------------