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

View Problem - Process Solution

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

% Computer : n012.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:29 EDT 2023

% Result   : Theorem 1.28s 1.15s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   36 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  16   ~;   7   |;  11   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   16 (   1 sgn;  12   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f284,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( X0 != X1
        & ~ less(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

fof(f402,conjecture,
    ? [X0] :
      ( ( less(X0,n1)
        & less(nn1,X0) )
     => sum(n21,X0,n21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_something_n0_samething) ).

fof(f403,negated_conjecture,
    ~ ? [X0] :
        ( ( less(X0,n1)
          & less(nn1,X0) )
       => sum(n21,X0,n21) ),
    inference(negated_conjecture,[],[f402]) ).

fof(f471,plain,
    ! [X0] :
      ( ~ sum(n21,X0,n21)
      & less(X0,n1)
      & less(nn1,X0) ),
    inference(ennf_transformation,[],[f403]) ).

fof(f472,plain,
    ! [X0] :
      ( ~ sum(n21,X0,n21)
      & less(X0,n1)
      & less(nn1,X0) ),
    inference(flattening,[],[f471]) ).

fof(f473,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(nnf_transformation,[],[f284]) ).

fof(f474,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(flattening,[],[f473]) ).

fof(f760,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f474]) ).

fof(f881,plain,
    ! [X0] : less(X0,n1),
    inference(cnf_transformation,[],[f472]) ).

fof(f883,plain,
    ! [X1] : ~ less(X1,X1),
    inference(equality_resolution,[],[f760]) ).

cnf(c_333,plain,
    ~ less(X0,X0),
    inference(cnf_transformation,[],[f883]) ).

cnf(c_454,negated_conjecture,
    less(X0,n1),
    inference(cnf_transformation,[],[f881]) ).

cnf(c_457,plain,
    less(n1,n1),
    inference(instantiation,[status(thm)],[c_454]) ).

cnf(c_458,plain,
    ~ less(n1,n1),
    inference(instantiation,[status(thm)],[c_333]) ).

cnf(c_459,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_458,c_457]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM343+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n012.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 : Fri Aug 25 11:40:56 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.28/1.15  % SZS status Started for theBenchmark.p
% 1.28/1.15  % SZS status Theorem for theBenchmark.p
% 1.28/1.15  
% 1.28/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.28/1.15  
% 1.28/1.15  ------  iProver source info
% 1.28/1.15  
% 1.28/1.15  git: date: 2023-05-31 18:12:56 +0000
% 1.28/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.28/1.15  git: non_committed_changes: false
% 1.28/1.15  git: last_make_outside_of_git: false
% 1.28/1.15  
% 1.28/1.15  ------ Parsing...
% 1.28/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.28/1.15  
% 1.28/1.15  ------ Preprocessing...
% 1.28/1.15  
% 1.28/1.15  % SZS status Theorem for theBenchmark.p
% 1.28/1.15  
% 1.28/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.28/1.15  
% 1.28/1.15  
%------------------------------------------------------------------------------