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

View Problem - Process Solution

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

% Result   : Theorem 1.07s 1.17s
% Output   : CNFRefutation 1.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  40 unt;   0 def)
%            Number of atoms       :   54 (  53 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   8   ~;   0   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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   :   63 (   4 sgn;  39   !;   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(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).

fof(f13,axiom,
    ! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).

fof(f15,axiom,
    ! [X3] : one = addition(domain(X3),one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).

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] :
      ( domain(X4) = addition(domain(X3),domain(X4))
     => multiplication(domain(X4),X3) = addition(X3,multiplication(domain(X4),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

fof(f21,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(rectify,[],[f13]) ).

fof(f23,plain,
    ! [X0] : one = addition(domain(X0),one),
    inference(rectify,[],[f15]) ).

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

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

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

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

fof(f28,plain,
    ( multiplication(domain(sK1),sK0) != addition(sK0,multiplication(domain(sK1),sK0))
    & domain(sK1) = 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(f37,plain,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f40,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f42,plain,
    ! [X0] : one = addition(domain(X0),one),
    inference(cnf_transformation,[],[f23]) ).

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

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

fof(f46,plain,
    multiplication(domain(sK1),sK0) != addition(sK0,multiplication(domain(sK1),sK0)),
    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_57,plain,
    addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
    inference(cnf_transformation,[],[f37]) ).

cnf(c_60,plain,
    addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(cnf_transformation,[],[f40]) ).

cnf(c_62,plain,
    addition(domain(X0),one) = one,
    inference(cnf_transformation,[],[f42]) ).

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

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

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

cnf(c_80,plain,
    addition(one,domain(X0)) = one,
    inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).

cnf(c_81,negated_conjecture,
    addition(domain(sK1),domain(sK0)) = domain(sK1),
    inference(theory_normalisation,[status(thm)],[c_66,c_50,c_49]) ).

cnf(c_119,plain,
    domain(addition(sK1,sK0)) = domain(sK1),
    inference(demodulation,[status(thm)],[c_81,c_64]) ).

cnf(c_194,plain,
    addition(domain(sK1),domain(sK0)) = domain(sK1),
    inference(demodulation,[status(thm)],[c_119,c_64]) ).

cnf(c_405,plain,
    addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_80,c_57]) ).

cnf(c_406,plain,
    addition(multiplication(domain(sK1),X0),multiplication(domain(sK0),X0)) = multiplication(domain(sK1),X0),
    inference(superposition,[status(thm)],[c_194,c_57]) ).

cnf(c_424,plain,
    addition(X0,multiplication(domain(X1),X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_405,c_55]) ).

cnf(c_426,plain,
    multiplication(domain(X0),X0) = X0,
    inference(demodulation,[status(thm)],[c_60,c_424]) ).

cnf(c_502,plain,
    addition(multiplication(domain(sK1),sK0),sK0) = multiplication(domain(sK1),sK0),
    inference(superposition,[status(thm)],[c_426,c_406]) ).

cnf(c_509,plain,
    addition(sK0,multiplication(domain(sK1),sK0)) = multiplication(domain(sK1),sK0),
    inference(theory_normalisation,[status(thm)],[c_502,c_50,c_49]) ).

cnf(c_1308,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_509,c_65]) ).


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