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

% Computer : n031.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 05:31:35 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).

fof(f13,conjecture,
    ( ! [X3] : addition(X3,X3) = X3
  <=> one = addition(one,one) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f14,negated_conjecture,
    ~ ( ! [X3] : addition(X3,X3) = X3
    <=> one = addition(one,one) ),
    inference(negated_conjecture,[],[f13]) ).

fof(f16,plain,
    ~ ( ! [X0] : addition(X0,X0) = X0
    <=> one = addition(one,one) ),
    inference(rectify,[],[f14]) ).

fof(f17,plain,
    ( ! [X0] : addition(X0,X0) = X0
  <~> one = addition(one,one) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f18,plain,
    ( ( one != addition(one,one)
      | ? [X0] : addition(X0,X0) != X0 )
    & ( one = addition(one,one)
      | ! [X0] : addition(X0,X0) = X0 ) ),
    inference(nnf_transformation,[],[f17]) ).

fof(f19,plain,
    ( ( one != addition(one,one)
      | ? [X0] : addition(X0,X0) != X0 )
    & ( one = addition(one,one)
      | ! [X1] : addition(X1,X1) = X1 ) ),
    inference(rectify,[],[f18]) ).

fof(f20,plain,
    ( ? [X0] : addition(X0,X0) != X0
   => sK0 != addition(sK0,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ( ( one != addition(one,one)
      | sK0 != addition(sK0,sK0) )
    & ( one = addition(one,one)
      | ! [X1] : addition(X1,X1) = X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).

fof(f25,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f34,plain,
    ( one != addition(one,one)
    | sK0 != addition(sK0,sK0) ),
    inference(cnf_transformation,[],[f21]) ).

cnf(c_52,plain,
    addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f25]) ).

cnf(c_60,negated_conjecture,
    ( addition(one,one) != one
    | addition(sK0,sK0) != sK0 ),
    inference(cnf_transformation,[],[f34]) ).

cnf(c_65,plain,
    addition(one,one) = one,
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_74,negated_conjecture,
    addition(sK0,sK0) != sK0,
    inference(global_subsumption_just,[status(thm)],[c_60,c_65,c_60]) ).

cnf(c_80,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_74,c_52]) ).


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