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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : KLE067+1 : TPTP v8.1.2. Released v4.0.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 05:31:58 EDT 2023

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

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

fof(f2,axiom,
    ! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f14,axiom,
    ! [X3,X4] : domain(multiplication(X3,X4)) = domain(multiplication(X3,domain(X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).

fof(f17,axiom,
    ! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).

fof(f18,conjecture,
    ! [X3,X4] : addition(domain(X3),domain(X4)) = domain(addition(domain(X3),domain(X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f19,negated_conjecture,
    ~ ! [X3,X4] : addition(domain(X3),domain(X4)) = domain(addition(domain(X3),domain(X4))),
    inference(negated_conjecture,[],[f18]) ).

fof(f20,plain,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(rectify,[],[f2]) ).

fof(f22,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(rectify,[],[f14]) ).

fof(f24,plain,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(rectify,[],[f17]) ).

fof(f25,plain,
    ~ ! [X0,X1] : addition(domain(X0),domain(X1)) = domain(addition(domain(X0),domain(X1))),
    inference(rectify,[],[f19]) ).

fof(f26,plain,
    ? [X0,X1] : addition(domain(X0),domain(X1)) != domain(addition(domain(X0),domain(X1))),
    inference(ennf_transformation,[],[f25]) ).

fof(f27,plain,
    ( ? [X0,X1] : addition(domain(X0),domain(X1)) != domain(addition(domain(X0),domain(X1)))
   => addition(domain(sK0),domain(sK1)) != domain(addition(domain(sK0),domain(sK1))) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    addition(domain(sK0),domain(sK1)) != domain(addition(domain(sK0),domain(sK1))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f27]) ).

fof(f29,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f30,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f20]) ).

fof(f35,plain,
    ! [X0] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f7]) ).

fof(f41,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f22]) ).

fof(f44,plain,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(cnf_transformation,[],[f24]) ).

fof(f45,plain,
    addition(domain(sK0),domain(sK1)) != domain(addition(domain(sK0),domain(sK1))),
    inference(cnf_transformation,[],[f28]) ).

cnf(c_49,plain,
    addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f29]) ).

cnf(c_50,plain,
    addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f30]) ).

cnf(c_55,plain,
    multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f35]) ).

cnf(c_61,plain,
    domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
    inference(cnf_transformation,[],[f41]) ).

cnf(c_64,plain,
    addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
    inference(cnf_transformation,[],[f44]) ).

cnf(c_65,negated_conjecture,
    domain(addition(domain(sK0),domain(sK1))) != addition(domain(sK0),domain(sK1)),
    inference(cnf_transformation,[],[f45]) ).

cnf(c_115,plain,
    domain(domain(addition(sK0,sK1))) != domain(addition(sK0,sK1)),
    inference(ac_demodulation,[status(thm)],[c_65,c_64,c_64,c_50,c_49]) ).

cnf(c_188,plain,
    addition(domain(domain(sK0)),domain(domain(sK1))) != addition(domain(sK0),domain(sK1)),
    inference(demodulation,[status(thm)],[c_115,c_64]) ).

cnf(c_195,plain,
    domain(multiplication(one,X0)) = domain(domain(X0)),
    inference(superposition,[status(thm)],[c_55,c_61]) ).

cnf(c_201,plain,
    domain(domain(X0)) = domain(X0),
    inference(light_normalisation,[status(thm)],[c_195,c_55]) ).

cnf(c_202,plain,
    addition(domain(sK0),domain(domain(sK1))) != addition(domain(sK0),domain(sK1)),
    inference(demodulation,[status(thm)],[c_188,c_201]) ).

cnf(c_247,plain,
    addition(domain(sK0),domain(sK1)) != addition(domain(sK0),domain(sK1)),
    inference(demodulation,[status(thm)],[c_202,c_201]) ).

cnf(c_248,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_247]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KLE067+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/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 : Tue Aug 29 12:08:13 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
% 2.49/1.16  % SZS status Started for theBenchmark.p
% 2.49/1.16  % SZS status Theorem for theBenchmark.p
% 2.49/1.16  
% 2.49/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.49/1.16  
% 2.49/1.16  ------  iProver source info
% 2.49/1.16  
% 2.49/1.16  git: date: 2023-05-31 18:12:56 +0000
% 2.49/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.49/1.16  git: non_committed_changes: false
% 2.49/1.16  git: last_make_outside_of_git: false
% 2.49/1.16  
% 2.49/1.16  ------ Parsing...
% 2.49/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.49/1.16  
% 2.49/1.16  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.49/1.16  
% 2.49/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.49/1.16  
% 2.49/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.49/1.16  ------ Proving...
% 2.49/1.16  ------ Problem Properties 
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  clauses                                 17
% 2.49/1.16  conjectures                             0
% 2.49/1.16  EPR                                     0
% 2.49/1.16  Horn                                    17
% 2.49/1.16  unary                                   17
% 2.49/1.16  binary                                  0
% 2.49/1.16  lits                                    17
% 2.49/1.16  lits eq                                 17
% 2.49/1.16  fd_pure                                 0
% 2.49/1.16  fd_pseudo                               0
% 2.49/1.16  fd_cond                                 0
% 2.49/1.16  fd_pseudo_cond                          0
% 2.49/1.16  AC symbols                              1
% 2.49/1.16  
% 2.49/1.16  ------ Schedule UEQ
% 2.49/1.16  
% 2.49/1.16  ------ Option_UEQ Time Limit: 10.
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  ------ 
% 2.49/1.16  Current options:
% 2.49/1.16  ------ 
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  ------ Proving...
% 2.49/1.16  
% 2.49/1.16  
% 2.49/1.16  % SZS status Theorem for theBenchmark.p
% 2.49/1.16  
% 2.49/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.49/1.16  
% 2.49/1.16  
%------------------------------------------------------------------------------