↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE054+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 01:52:17 PM UTC 2026

% Result   : Theorem 3.52s 1.26s
% Output   : CNFRefutation 3.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   71 (  71 unt;   4 def)
%            Number of atoms       :  110 (  70 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    9 (   9   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn  87   !;   2   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(f5,axiom,
    ! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',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/Axioms/KLE001+0.ax',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/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f13,axiom,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).

fof(f14,axiom,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(f15,axiom,
    ! [X0] : addition(domain(X0),one) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).

fof(f17,axiom,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).

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

fof(f19,negated_conjecture,
    ~ ! [X0,X1] : addition(domain(multiplication(X0,X1)),domain(X0)) = domain(X0),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f20,plain,
    ? [X0,X1] : domain(X0) != addition(domain(multiplication(X0,X1)),domain(X0)),
    inference(ennf_transformation,[],[f19]) ).

fof(f21,plain,
    domain(sK0) != addition(domain(multiplication(sK0,sK1)),domain(sK0)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).

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

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

fof(f26,plain,
    ! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(cnf_transformation,[],[f5]) ).

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

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

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

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

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

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

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

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

fof(f38,plain,
    domain(sK0) != addition(domain(multiplication(sK0,sK1)),domain(sK0)),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
    inference(cnf_transformation,[],[f26]) ).

tcf(c_54,plain,
    ! [X0: $i] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f27]) ).

tcf(c_55,plain,
    ! [X0: $i] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_60,plain,
    ! [X0: $i] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] : domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
    inference(cnf_transformation,[],[f34]) ).

tcf(c_62,plain,
    ! [X0: $i] : addition(domain(X0),one) = one,
    inference(cnf_transformation,[],[f35]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
    inference(cnf_transformation,[],[f37]) ).

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

tcf(c_79,plain,
    ! [X0: $i] : addition(one,domain(X0)) = one,
    inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).

tcf(c_80,negated_conjecture,
    addition(domain(sK0),domain(multiplication(sK0,sK1))) != domain(sK0),
    inference(theory_normalisation,[status(thm)],[c_65,c_50,c_49]) ).

tcf(c_116,plain,
    domain(addition(multiplication(sK0,sK1),sK0)) != domain(sK0),
    inference(ac_demodulation,[status(thm)],[c_80,c_64,c_50,c_49]) ).

tcf(c_117,plain,
    domain(addition(sK0,multiplication(sK0,sK1))) != domain(sK0),
    inference(theory_normalisation,[status(thm)],[c_116,c_50,c_49]) ).

tcf(c_123,definition,
    iPr_def_10 = multiplication(sK0,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_124,definition,
    iPr_def_11 = addition(sK0,iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_125,definition,
    iPr_def_12 = domain(iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_126,definition,
    iPr_def_13 = domain(sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_127,plain,
    iPr_def_12 != iPr_def_13,
    inference(demodulation,[status(thm)],[c_117,c_126,c_123,c_124,c_125]) ).

tcf(c_209,plain,
    addition(iPr_def_10,sK0) = iPr_def_11,
    inference(theory_normalisation,[status(thm)],[c_124,c_50,c_49]) ).

tcf(c_218,plain,
    ! [X0: $i] : domain(multiplication(one,X0)) = domain(domain(X0)),
    inference(superposition,[status(thm)],[c_55,c_61]) ).

tcf(c_226,plain,
    ! [X0: $i] : domain(domain(X0)) = domain(X0),
    inference(light_normalisation,[status(thm)],[c_218,c_55]) ).

tcf(c_229,plain,
    domain(iPr_def_13) = iPr_def_13,
    inference(superposition,[status(thm)],[c_126,c_226]) ).

tcf(c_281,plain,
    addition(domain(iPr_def_10),domain(sK0)) = domain(iPr_def_11),
    inference(superposition,[status(thm)],[c_209,c_64]) ).

tcf(c_285,plain,
    addition(domain(iPr_def_10),iPr_def_13) = iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_281,c_125,c_126]) ).

tcf(c_286,plain,
    addition(iPr_def_13,domain(iPr_def_10)) = iPr_def_12,
    inference(theory_normalisation,[status(thm)],[c_285,c_50,c_49]) ).

tcf(c_408,plain,
    ! [X0: $i,X1: $i] : addition(multiplication(X0,one),multiplication(X0,domain(X1))) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_79,c_56]) ).

tcf(c_429,plain,
    ! [X0: $i,X1: $i] : addition(X0,multiplication(X0,domain(X1))) = X0,
    inference(light_normalisation,[status(thm)],[c_408,c_54]) ).

tcf(c_444,plain,
    ! [X0: $i,X1: $i] : addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_79,c_57]) ).

tcf(c_468,plain,
    ! [X0: $i,X1: $i] : addition(X0,multiplication(domain(X1),X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_444,c_55]) ).

tcf(c_470,plain,
    ! [X0: $i] : multiplication(domain(X0),X0) = X0,
    inference(demodulation,[status(thm)],[c_60,c_468]) ).

tcf(c_477,plain,
    multiplication(iPr_def_13,sK0) = sK0,
    inference(superposition,[status(thm)],[c_126,c_470]) ).

tcf(c_500,plain,
    ! [X0: $i] : multiplication(iPr_def_13,multiplication(sK0,X0)) = multiplication(sK0,X0),
    inference(superposition,[status(thm)],[c_477,c_53]) ).

tcf(c_606,plain,
    ! [X0: $i,X1: $i] : addition(domain(X0),domain(multiplication(X0,domain(X1)))) = domain(X0),
    inference(superposition,[status(thm)],[c_429,c_64]) ).

tcf(c_617,plain,
    ! [X0: $i,X1: $i] : addition(domain(X0),domain(multiplication(X0,X1))) = domain(X0),
    inference(light_normalisation,[status(thm)],[c_606,c_61]) ).

tcf(c_1082,plain,
    multiplication(iPr_def_13,iPr_def_10) = iPr_def_10,
    inference(superposition,[status(thm)],[c_123,c_500]) ).

tcf(c_3033,plain,
    addition(domain(iPr_def_13),domain(iPr_def_10)) = domain(iPr_def_13),
    inference(superposition,[status(thm)],[c_1082,c_617]) ).

tcf(c_3045,plain,
    addition(domain(iPr_def_10),domain(iPr_def_13)) = domain(iPr_def_13),
    inference(theory_normalisation,[status(thm)],[c_3033,c_50,c_49]) ).

tcf(c_3046,plain,
    addition(domain(iPr_def_10),iPr_def_13) = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_3045,c_229]) ).

tcf(c_3047,plain,
    addition(iPr_def_13,domain(iPr_def_10)) = iPr_def_13,
    inference(theory_normalisation,[status(thm)],[c_3046,c_50,c_49]) ).

tcf(c_3048,plain,
    iPr_def_12 = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_3047,c_286]) ).

tcf(c_3049,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3048,c_127]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KLE054+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.43  % Computer : n011.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Wed Sep 23 18:48:42 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.21/0.46  Running first-order theorem proving
% 0.21/0.46  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  
% 0.21/0.48  % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.48  
% 0.21/0.48  % Detected problem language: tptp
% 0.21/0.49  % Proving...
% 3.52/1.26  % SZS status Started for theBenchmark.p
% 3.52/1.26  % SZS status Theorem for theBenchmark.p
% 3.52/1.26  
% 3.52/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.52/1.26  
% 3.52/1.26  % ------  iProver source info
% 3.52/1.26  
% 3.52/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.52/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.52/1.26  % git: non_committed_changes: false
% 3.52/1.26  
% 3.52/1.26  % ------ Parsing...
% 3.52/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_UEQ
% 3.52/1.26  % 
% 3.52/1.26  
% 3.52/1.26  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.52/1.26  
% 3.52/1.26  % ------ Preprocessing...% ------  preprocesses with Option_UEQ
% 3.52/1.26   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.52/1.26  
% 3.52/1.26  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.52/1.26  % ------ Proving...
% 3.52/1.26  % ------ Problem Properties 
% 3.52/1.26  
% 3.52/1.26  % 
% 3.52/1.26  % clauses                               21
% 3.52/1.26  % conjectures                           0
% 3.52/1.26  % EPR                                   1
% 3.52/1.26  % Horn                                  21
% 3.52/1.26  % unary                                 21
% 3.52/1.26  % binary                                0
% 3.52/1.26  % lits                                  21
% 3.52/1.26  % lits eq                               21
% 3.52/1.26  % fd_pure                               0
% 3.52/1.26  % fd_pseudo                             0
% 3.52/1.26  % fd_cond                               0
% 3.52/1.26  % fd_pseudo_cond                        0
% 3.52/1.26  % AC symbols                            1
% 3.52/1.26  
% 3.52/1.26  % ------ Schedule UEQ
% 3.52/1.26  
% 3.52/1.26  % ------ Option_UEQ Time Limit: 10.
% 3.52/1.26  
% 3.52/1.26  
% 3.52/1.26  % ------ 
% 3.52/1.26  % Current options:
% 3.52/1.26  % ------ 
% 3.52/1.26  
% 3.52/1.26  
% 3.52/1.26  % 
% 3.52/1.26  
% 3.52/1.26  % ------ Proving...
% 3.52/1.26  % 
% 3.52/1.26  
% 3.52/1.26  % SZS status Theorem for theBenchmark.p
% 3.52/1.26  
% 3.52/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.52/1.26  
% 3.52/1.26  
%------------------------------------------------------------------------------