TSTP Solution File: NUM292+1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n007.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 : Thu Aug 31 11:29:16 EDT 2023

% Result   : Theorem 7.91s 1.68s
% Output   : CNFRefutation 7.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (  16 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   65 (  32   ~;  24   |;   4   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (   5 sgn;  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn2) ).

fof(f14,axiom,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn13) ).

fof(f257,axiom,
    rdn_non_zero_digit(rdnn(n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit1) ).

fof(f278,axiom,
    ! [X8,X5,X6] :
      ( rdn_non_zero(X6)
     => rdn_positive_less(rdnn(X8),rdn(rdnn(X5),X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_extra_digits_positive_less) ).

fof(f279,axiom,
    ! [X0] :
      ( rdn_non_zero_digit(rdnn(X0))
     => rdn_non_zero(rdnn(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_non_zero_by_digit) ).

fof(f281,axiom,
    ! [X0,X1,X9,X10] :
      ( ( rdn_positive_less(X9,X10)
        & rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X0,rdn_pos(X9)) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_pos_pos) ).

fof(f402,conjecture,
    less(n2,n13),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_less_n13) ).

fof(f403,negated_conjecture,
    ~ less(n2,n13),
    inference(negated_conjecture,[],[f402]) ).

fof(f406,plain,
    ! [X0,X1,X2] :
      ( rdn_non_zero(X2)
     => rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2)) ),
    inference(rectify,[],[f278]) ).

fof(f408,plain,
    ! [X0,X1,X2,X3] :
      ( ( rdn_positive_less(X2,X3)
        & rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X0,rdn_pos(X2)) )
     => less(X0,X1) ),
    inference(rectify,[],[f281]) ).

fof(f425,plain,
    ~ less(n2,n13),
    inference(flattening,[],[f403]) ).

fof(f432,plain,
    ! [X0,X1,X2] :
      ( rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2))
      | ~ rdn_non_zero(X2) ),
    inference(ennf_transformation,[],[f406]) ).

fof(f433,plain,
    ! [X0] :
      ( rdn_non_zero(rdnn(X0))
      | ~ rdn_non_zero_digit(rdnn(X0)) ),
    inference(ennf_transformation,[],[f279]) ).

fof(f435,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_positive_less(X2,X3)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(ennf_transformation,[],[f408]) ).

fof(f436,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_positive_less(X2,X3)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(flattening,[],[f435]) ).

fof(f477,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f3]) ).

fof(f488,plain,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    inference(cnf_transformation,[],[f14]) ).

fof(f731,plain,
    rdn_non_zero_digit(rdnn(n1)),
    inference(cnf_transformation,[],[f257]) ).

fof(f752,plain,
    ! [X2,X0,X1] :
      ( rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2))
      | ~ rdn_non_zero(X2) ),
    inference(cnf_transformation,[],[f432]) ).

fof(f753,plain,
    ! [X0] :
      ( rdn_non_zero(rdnn(X0))
      | ~ rdn_non_zero_digit(rdnn(X0)) ),
    inference(cnf_transformation,[],[f433]) ).

fof(f755,plain,
    ! [X2,X3,X0,X1] :
      ( less(X0,X1)
      | ~ rdn_positive_less(X2,X3)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(cnf_transformation,[],[f436]) ).

fof(f879,plain,
    ~ less(n2,n13),
    inference(cnf_transformation,[],[f425]) ).

cnf(c_51,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f477]) ).

cnf(c_62,plain,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    inference(cnf_transformation,[],[f488]) ).

cnf(c_305,plain,
    rdn_non_zero_digit(rdnn(n1)),
    inference(cnf_transformation,[],[f731]) ).

cnf(c_326,plain,
    ( ~ rdn_non_zero(X0)
    | rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X0)) ),
    inference(cnf_transformation,[],[f752]) ).

cnf(c_327,plain,
    ( ~ rdn_non_zero_digit(rdnn(X0))
    | rdn_non_zero(rdnn(X0)) ),
    inference(cnf_transformation,[],[f753]) ).

cnf(c_329,plain,
    ( ~ rdn_translate(X0,rdn_pos(X1))
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_positive_less(X1,X3)
    | less(X0,X2) ),
    inference(cnf_transformation,[],[f755]) ).

cnf(c_453,negated_conjecture,
    ~ less(n2,n13),
    inference(cnf_transformation,[],[f879]) ).

cnf(c_455,plain,
    ( ~ rdn_non_zero_digit(rdnn(n1))
    | rdn_non_zero(rdnn(n1)) ),
    inference(instantiation,[status(thm)],[c_327]) ).

cnf(c_6008,plain,
    ( ~ rdn_translate(n2,rdn_pos(X0))
    | ~ rdn_translate(n13,rdn_pos(X1))
    | ~ rdn_positive_less(X0,X1) ),
    inference(resolution,[status(thm)],[c_329,c_453]) ).

cnf(c_6114,plain,
    ( ~ rdn_translate(n13,rdn_pos(rdn(rdnn(X0),X1)))
    | ~ rdn_translate(n2,rdn_pos(rdnn(X2)))
    | ~ rdn_non_zero(X1) ),
    inference(resolution,[status(thm)],[c_6008,c_326]) ).

cnf(c_10949,plain,
    ( ~ rdn_translate(n13,rdn_pos(rdn(rdnn(X0),X1)))
    | ~ rdn_non_zero(X1) ),
    inference(resolution,[status(thm)],[c_6114,c_51]) ).

cnf(c_10953,plain,
    ~ rdn_non_zero(rdnn(n1)),
    inference(resolution,[status(thm)],[c_10949,c_62]) ).

cnf(c_10954,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_10953,c_455,c_305]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM292+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug 25 13:14:41 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.18/0.46  Running first-order theorem proving
% 0.18/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.91/1.68  % SZS status Started for theBenchmark.p
% 7.91/1.68  % SZS status Theorem for theBenchmark.p
% 7.91/1.68  
% 7.91/1.68  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.91/1.68  
% 7.91/1.68  ------  iProver source info
% 7.91/1.68  
% 7.91/1.68  git: date: 2023-05-31 18:12:56 +0000
% 7.91/1.68  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.91/1.68  git: non_committed_changes: false
% 7.91/1.68  git: last_make_outside_of_git: false
% 7.91/1.68  
% 7.91/1.68  ------ Parsing...
% 7.91/1.68  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.91/1.68  
% 7.91/1.68  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 7.91/1.68  
% 7.91/1.68  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.91/1.68  
% 7.91/1.68  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.91/1.68  ------ Proving...
% 7.91/1.68  ------ Problem Properties 
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  clauses                                 402
% 7.91/1.68  conjectures                             1
% 7.91/1.68  EPR                                     8
% 7.91/1.68  Horn                                    400
% 7.91/1.68  unary                                   376
% 7.91/1.68  binary                                  6
% 7.91/1.68  lits                                    472
% 7.91/1.68  lits eq                                 5
% 7.91/1.68  fd_pure                                 0
% 7.91/1.68  fd_pseudo                               0
% 7.91/1.68  fd_cond                                 0
% 7.91/1.68  fd_pseudo_cond                          5
% 7.91/1.68  AC symbols                              0
% 7.91/1.68  
% 7.91/1.68  ------ Input Options Time Limit: Unbounded
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  ------ 
% 7.91/1.68  Current options:
% 7.91/1.68  ------ 
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  ------ Proving...
% 7.91/1.68  
% 7.91/1.68  
% 7.91/1.68  % SZS status Theorem for theBenchmark.p
% 7.91/1.68  
% 7.91/1.68  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.91/1.68  
% 7.91/1.68  
%------------------------------------------------------------------------------