↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n008.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 01:19:50 PM UTC 2026

% Result   : Theorem 3.65s 6.28s
% Output   : CNFRefutation 3.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   31 (   6 unt;   0 def)
%            Number of atoms       :   71 (  17 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   75 (  35   ~;  26   |;   9   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   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-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn  35   !;  10   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0] :
      ( open(X0)
    <=> ? [X1] : end_point(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',open_defn) ).

fof(f13,axiom,
    ! [X0,X1] :
      ( end_point(X1,X0)
     => ? [X2] :
          ( X1 != X2
          & end_point(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',c6) ).

fof(f17,conjecture,
    ! [X0] :
      ( open(X0)
     => ? [X1,X2] :
          ( end_point(X2,X0)
          & end_point(X1,X0)
          & X1 != X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_1) ).

fof(f18,negated_conjecture,
    ~ ! [X0] :
        ( open(X0)
       => ? [X1,X2] :
            ( end_point(X2,X0)
            & end_point(X1,X0)
            & X1 != X2 ) ),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f19,plain,
    ! [X0] :
      ( open(X0)
     => ? [X1] : end_point(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f7]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ open(X0)
      | ? [X1] : end_point(X1,X0) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ~ end_point(X1,X0)
      | ? [X2] :
          ( X1 != X2
          & end_point(X2,X0) ) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f40,plain,
    ? [X0] :
      ( open(X0)
      & ! [X1,X2] :
          ( ~ end_point(X2,X0)
          | ~ end_point(X1,X0)
          | X1 = X2 ) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f59,plain,
    ! [X0] :
      ( ~ open(X0)
      | end_point(sK6(X0),X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f27]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ~ end_point(X1,X0)
      | ( sK10(X0,X1) != X1
        & end_point(sK10(X0,X1),X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f35]) ).

fof(f67,plain,
    ( open(sK13)
    & ! [X1,X2] :
        ( ~ end_point(X2,sK13)
        | ~ end_point(X1,sK13)
        | X1 = X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X0,sK13)],[f40]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ open(X0)
      | end_point(sK6(X0),X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f103,plain,
    ! [X0,X1] :
      ( ~ end_point(X1,X0)
      | sK10(X0,X1) != X1 ),
    inference(cnf_transformation,[],[f62]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ~ end_point(X1,X0)
      | end_point(sK10(X0,X1),X0) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f109,plain,
    open(sK13),
    inference(cnf_transformation,[],[f67]) ).

fof(f110,plain,
    ! [X2,X1] :
      ( ~ end_point(X2,sK13)
      | ~ end_point(X1,sK13)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f67]) ).

tcf(c_77,plain,
    ! [X0: $i] :
      ( end_point(sK6(X0),X0)
      | ~ open(X0) ),
    inference(cnf_transformation,[],[f96]) ).

tcf(c_84,plain,
    ! [X0: $i,X1: $i] :
      ( end_point(sK10(X1,X0),X1)
      | ~ end_point(X0,X1) ),
    inference(cnf_transformation,[],[f104]) ).

tcf(c_85,plain,
    ! [X0: $i,X1: $i] :
      ( ~ end_point(X1,X0)
      | ( sK10(X0,X1) != X1 ) ),
    inference(cnf_transformation,[],[f103]) ).

tcf(c_90,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ end_point(X1,sK13)
      | ~ end_point(X0,sK13) ),
    inference(cnf_transformation,[],[f110]) ).

tcf(c_91,negated_conjecture,
    open(sK13),
    inference(cnf_transformation,[],[f109]) ).

tcf(c_94,plain,
    ( end_point(sK6(sK13),sK13)
    | ~ open(sK13) ),
    inference(instantiation,[status(thm)],[c_77]) ).

tcf(c_761,negated_conjecture,
    open(sK13),
    inference(demodulation,[status(thm)],[c_91]) ).

tcf(c_762,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ end_point(X1,sK13)
      | ~ end_point(X0,sK13) ),
    inference(demodulation,[status(thm)],[c_90]) ).

tcf(c_1487,plain,
    ! [X0: $i] :
      ( ( sK6(sK13) = X0 )
      | ~ open(sK13)
      | ~ end_point(X0,sK13) ),
    inference(superposition,[status(thm)],[c_77,c_762]) ).

tcf(c_1493,plain,
    ! [X0: $i] :
      ( ( sK6(sK13) = X0 )
      | ~ end_point(X0,sK13) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_1487,c_761]) ).

tcf(c_1572,plain,
    ! [X0: $i] :
      ( ( sK10(sK13,X0) = sK6(sK13) )
      | ~ end_point(X0,sK13) ),
    inference(superposition,[status(thm)],[c_84,c_1493]) ).

tcf(c_1597,plain,
    ( ( sK10(sK13,sK6(sK13)) = sK6(sK13) )
    | ~ open(sK13) ),
    inference(superposition,[status(thm)],[c_77,c_1572]) ).

tcf(c_1601,plain,
    sK10(sK13,sK6(sK13)) = sK6(sK13),
    inference(forward_subsumption_resolution,[status(thm)],[c_1597,c_761]) ).

tcf(c_1693,plain,
    ~ end_point(sK6(sK13),sK13),
    inference(superposition,[status(thm)],[c_1601,c_85]) ).

tcf(c_1694,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1693,c_94,c_91]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.36  % Computer : n008.cluster.edu
% 0.10/5.36  % Model    : x86_64 x86_64
% 0.10/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36  % Memory   : 8046.5625MB
% 0.10/5.36  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Wed Sep 23 10:47:32 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41  Running first-order theorem proving
% 0.14/5.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.14/5.42  
% 0.14/5.42  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42  
% 0.14/5.42  % Detected problem language: tptp
% 0.14/5.43  % Proving...
% 3.65/6.28  % SZS status Started for theBenchmark.p
% 3.65/6.28  % SZS status Theorem for theBenchmark.p
% 3.65/6.28  
% 3.65/6.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.65/6.28  
% 3.65/6.28  % ------  iProver source info
% 3.65/6.28  
% 3.65/6.28  % git: date: 2026-07-19 20:42:38 +0200
% 3.65/6.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.65/6.28  % git: non_committed_changes: false
% 3.65/6.28  
% 3.65/6.28  % ------ Parsing...
% 3.65/6.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.65/6.28  
% 3.65/6.28  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.65/6.28  
% 3.65/6.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.65/6.28  
% 3.65/6.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.65/6.28  % ------ Proving...
% 3.65/6.28  % ------ Problem Properties 
% 3.65/6.28  
% 3.65/6.28  % 
% 3.65/6.28  % clauses                               43
% 3.65/6.28  % conjectures                           2
% 3.65/6.28  % EPR                                   15
% 3.65/6.28  % Horn                                  27
% 3.65/6.28  % unary                                 2
% 3.65/6.28  % binary                                16
% 3.65/6.28  % lits                                  133
% 3.65/6.28  % lits eq                               13
% 3.65/6.28  % fd_pure                               0
% 3.65/6.28  % fd_pseudo                             0
% 3.65/6.28  % fd_cond                               0
% 3.65/6.28  % fd_pseudo_cond                        8
% 3.65/6.28  % AC symbols                            0
% 3.65/6.28  
% 3.65/6.28  % ------ Schedule dynamic 5 is on 
% 3.65/6.28  
% 3.65/6.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.65/6.28  
% 3.65/6.28  
% 3.65/6.28  % ------ 
% 3.65/6.28  % Current options:
% 3.65/6.28  % ------ 
% 3.65/6.28  
% 3.65/6.28  
% 3.65/6.28  % 
% 3.65/6.28  
% 3.65/6.28  % ------ Proving...
% 3.65/6.28  % 
% 3.65/6.28  
% 3.65/6.28  % SZS status Theorem for theBenchmark.p
% 3.65/6.28  
% 3.65/6.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/6.28  
% 3.65/6.28  
%------------------------------------------------------------------------------