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

View Problem - Process Solution

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

% Computer : n021.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:57 EDT 2023

% Result   : Theorem 7.35s 1.68s
% Output   : CNFRefutation 7.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   77 (  76 unt;   0 def)
%            Number of atoms       :   78 (  77 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    6 (   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   :  144 (  19 sgn;  59   !;   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(f5,axiom,
    ! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).

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

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

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

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

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

fof(f19,negated_conjecture,
    ~ ! [X3,X4] : domain(multiplication(domain(X3),X4)) = multiplication(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(f21,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(rectify,[],[f13]) ).

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

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(multiplication(domain(X0),X1)) = multiplication(domain(X0),domain(X1)),
    inference(rectify,[],[f19]) ).

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

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

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

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

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

fof(f36,plain,
    ! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(cnf_transformation,[],[f8]) ).

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(f41,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f22]) ).

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(multiplication(domain(sK0),sK1)) != multiplication(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_53,plain,
    multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
    inference(cnf_transformation,[],[f33]) ).

cnf(c_54,plain,
    multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f34]) ).

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

cnf(c_56,plain,
    addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f36]) ).

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_61,plain,
    domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
    inference(cnf_transformation,[],[f41]) ).

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,
    multiplication(domain(sK0),domain(sK1)) != domain(multiplication(domain(sK0),sK1)),
    inference(cnf_transformation,[],[f45]) ).

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

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

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

cnf(c_214,plain,
    addition(one,addition(domain(X0),X1)) = addition(one,X1),
    inference(superposition,[status(thm)],[c_79,c_50]) ).

cnf(c_347,plain,
    addition(multiplication(X0,one),multiplication(X0,domain(X1))) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_79,c_56]) ).

cnf(c_366,plain,
    addition(X0,multiplication(X0,domain(X1))) = X0,
    inference(light_normalisation,[status(thm)],[c_347,c_54]) ).

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

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

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

cnf(c_410,plain,
    multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1))) = multiplication(X0,domain(X1)),
    inference(superposition,[status(thm)],[c_61,c_406]) ).

cnf(c_413,plain,
    multiplication(domain(X0),domain(X0)) = domain(X0),
    inference(superposition,[status(thm)],[c_199,c_406]) ).

cnf(c_415,plain,
    multiplication(domain(X0),multiplication(X0,X1)) = multiplication(X0,X1),
    inference(superposition,[status(thm)],[c_406,c_53]) ).

cnf(c_455,plain,
    addition(domain(X0),domain(multiplication(X0,domain(X1)))) = domain(X0),
    inference(superposition,[status(thm)],[c_366,c_64]) ).

cnf(c_460,plain,
    addition(one,multiplication(domain(X0),domain(X1))) = addition(one,domain(X0)),
    inference(superposition,[status(thm)],[c_366,c_214]) ).

cnf(c_465,plain,
    addition(domain(X0),domain(multiplication(X0,X1))) = domain(X0),
    inference(light_normalisation,[status(thm)],[c_455,c_61]) ).

cnf(c_466,plain,
    addition(one,multiplication(domain(X0),domain(X1))) = one,
    inference(light_normalisation,[status(thm)],[c_460,c_79]) ).

cnf(c_483,plain,
    addition(domain(X0),domain(multiplication(domain(X1),X0))) = domain(X0),
    inference(superposition,[status(thm)],[c_402,c_64]) ).

cnf(c_539,plain,
    addition(multiplication(X0,one),multiplication(X0,multiplication(domain(X1),domain(X2)))) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_466,c_56]) ).

cnf(c_543,plain,
    addition(X0,multiplication(X0,multiplication(domain(X1),domain(X2)))) = X0,
    inference(light_normalisation,[status(thm)],[c_539,c_54]) ).

cnf(c_636,plain,
    addition(multiplication(domain(X0),X1),multiplication(domain(multiplication(X0,X2)),X1)) = multiplication(domain(X0),X1),
    inference(superposition,[status(thm)],[c_465,c_57]) ).

cnf(c_862,plain,
    addition(multiplication(X0,domain(X1)),multiplication(X0,domain(multiplication(domain(X2),X1)))) = multiplication(X0,domain(X1)),
    inference(superposition,[status(thm)],[c_483,c_56]) ).

cnf(c_1883,plain,
    addition(domain(multiplication(domain(X0),X1)),multiplication(domain(X0),domain(X1))) = domain(multiplication(domain(X0),X1)),
    inference(superposition,[status(thm)],[c_410,c_543]) ).

cnf(c_1899,plain,
    addition(multiplication(domain(X0),domain(X1)),domain(multiplication(domain(X0),X1))) = domain(multiplication(domain(X0),X1)),
    inference(theory_normalisation,[status(thm)],[c_1883,c_50,c_49]) ).

cnf(c_11329,plain,
    addition(multiplication(domain(X0),domain(multiplication(X0,X1))),domain(multiplication(X0,X1))) = multiplication(domain(X0),domain(multiplication(X0,X1))),
    inference(superposition,[status(thm)],[c_413,c_636]) ).

cnf(c_11384,plain,
    addition(domain(multiplication(X0,X1)),multiplication(domain(X0),domain(multiplication(X0,X1)))) = multiplication(domain(X0),domain(multiplication(X0,X1))),
    inference(theory_normalisation,[status(thm)],[c_11329,c_50,c_49]) ).

cnf(c_17702,plain,
    addition(multiplication(domain(X0),domain(multiplication(X0,X1))),domain(multiplication(X0,X1))) = domain(multiplication(X0,X1)),
    inference(superposition,[status(thm)],[c_415,c_1899]) ).

cnf(c_17761,plain,
    addition(domain(multiplication(X0,X1)),multiplication(domain(X0),domain(multiplication(X0,X1)))) = domain(multiplication(X0,X1)),
    inference(theory_normalisation,[status(thm)],[c_17702,c_50,c_49]) ).

cnf(c_17762,plain,
    multiplication(domain(X0),domain(multiplication(X0,X1))) = domain(multiplication(X0,X1)),
    inference(light_normalisation,[status(thm)],[c_17761,c_11384]) ).

cnf(c_17951,plain,
    addition(multiplication(domain(domain(X0)),domain(X1)),domain(multiplication(domain(X0),X1))) = multiplication(domain(domain(X0)),domain(X1)),
    inference(superposition,[status(thm)],[c_17762,c_862]) ).

cnf(c_18013,plain,
    multiplication(domain(X0),domain(X1)) = domain(multiplication(domain(X0),X1)),
    inference(light_normalisation,[status(thm)],[c_17951,c_199,c_1899]) ).

cnf(c_18031,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_65,c_18013]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : KLE060+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Tue Aug 29 11:03:29 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.22/0.49  Running first-order theorem proving
% 0.22/0.49  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.35/1.68  % SZS status Started for theBenchmark.p
% 7.35/1.68  % SZS status Theorem for theBenchmark.p
% 7.35/1.68  
% 7.35/1.68  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.35/1.68  
% 7.35/1.68  ------  iProver source info
% 7.35/1.68  
% 7.35/1.68  git: date: 2023-05-31 18:12:56 +0000
% 7.35/1.68  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.35/1.68  git: non_committed_changes: false
% 7.35/1.68  git: last_make_outside_of_git: false
% 7.35/1.68  
% 7.35/1.68  ------ Parsing...
% 7.35/1.68  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.35/1.68  
% 7.35/1.68  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 7.35/1.68  
% 7.35/1.68  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.35/1.68  
% 7.35/1.68  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 7.35/1.68  ------ Proving...
% 7.35/1.68  ------ Problem Properties 
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  clauses                                 17
% 7.35/1.68  conjectures                             1
% 7.35/1.68  EPR                                     0
% 7.35/1.68  Horn                                    17
% 7.35/1.68  unary                                   17
% 7.35/1.68  binary                                  0
% 7.35/1.68  lits                                    17
% 7.35/1.68  lits eq                                 17
% 7.35/1.68  fd_pure                                 0
% 7.35/1.68  fd_pseudo                               0
% 7.35/1.68  fd_cond                                 0
% 7.35/1.68  fd_pseudo_cond                          0
% 7.35/1.68  AC symbols                              1
% 7.35/1.68  
% 7.35/1.68  ------ Schedule UEQ
% 7.35/1.68  
% 7.35/1.68  ------ Option_UEQ Time Limit: 10.
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  ------ 
% 7.35/1.68  Current options:
% 7.35/1.68  ------ 
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  ------ Proving...
% 7.35/1.68  
% 7.35/1.68  
% 7.35/1.68  % SZS status Theorem for theBenchmark.p
% 7.35/1.68  
% 7.35/1.68  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.35/1.68  
% 7.35/1.68  
%------------------------------------------------------------------------------