↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE063+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 : n006.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:19 PM UTC 2026

% Result   : Theorem 4.92s 1.32s
% Output   : CNFRefutation 4.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   69 (  65 unt;   5 def)
%            Number of atoms       :  113 (  72 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   8   ~;   0   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    7 (   5 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   74 (   0 sgn  72   !;   2   ?;  32   :)

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

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

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

fof(f21,plain,
    ( multiplication(domain(sK1),sK0) = addition(sK0,multiplication(domain(sK1),sK0))
    & domain(sK1) != addition(domain(sK0),domain(sK1)) ),
    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(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(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,
    multiplication(domain(sK1),sK0) = addition(sK0,multiplication(domain(sK1),sK0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f39,plain,
    domain(sK1) != addition(domain(sK0),domain(sK1)),
    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_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_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(sK0),domain(sK1)) != domain(sK1),
    inference(cnf_transformation,[],[f39]) ).

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

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

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

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

tcf(c_126,definition,
    iPr_def_10 = addition(sK1,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_127,definition,
    iPr_def_11 = domain(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_128,definition,
    iPr_def_12 = domain(sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_129,definition,
    iPr_def_13 = multiplication(iPr_def_12,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_130,definition,
    iPr_def_14 = addition(sK0,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_131,plain,
    iPr_def_11 != iPr_def_12,
    inference(demodulation,[status(thm)],[c_119,c_128,c_126,c_127]) ).

tcf(c_132,negated_conjecture,
    iPr_def_14 = iPr_def_13,
    inference(demodulation,[status(thm)],[c_66,c_129,c_130]) ).

tcf(c_213,plain,
    addition(one,iPr_def_12) = one,
    inference(superposition,[status(thm)],[c_128,c_80]) ).

tcf(c_216,plain,
    addition(iPr_def_12,one) = one,
    inference(theory_normalisation,[status(thm)],[c_213,c_50,c_49]) ).

tcf(c_218,plain,
    addition(iPr_def_13,sK0) = iPr_def_14,
    inference(theory_normalisation,[status(thm)],[c_130,c_50,c_49]) ).

tcf(c_219,plain,
    addition(iPr_def_13,sK0) = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_218,c_132]) ).

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

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

tcf(c_239,plain,
    domain(iPr_def_12) = iPr_def_12,
    inference(superposition,[status(thm)],[c_128,c_236]) ).

tcf(c_290,plain,
    addition(domain(sK1),domain(sK0)) = domain(iPr_def_10),
    inference(superposition,[status(thm)],[c_126,c_64]) ).

tcf(c_300,plain,
    addition(iPr_def_12,domain(sK0)) = iPr_def_11,
    inference(light_normalisation,[status(thm)],[c_290,c_127,c_128]) ).

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

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

tcf(c_537,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_12,X0),multiplication(one,X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_216,c_57]) ).

tcf(c_558,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_12,X0),X0) = X0,
    inference(light_normalisation,[status(thm)],[c_537,c_55]) ).

tcf(c_559,plain,
    ! [X0: $i] : addition(X0,multiplication(iPr_def_12,X0)) = X0,
    inference(theory_normalisation,[status(thm)],[c_558,c_50,c_49]) ).

tcf(c_894,plain,
    addition(sK0,iPr_def_13) = sK0,
    inference(superposition,[status(thm)],[c_129,c_559]) ).

tcf(c_908,plain,
    addition(iPr_def_13,sK0) = sK0,
    inference(theory_normalisation,[status(thm)],[c_894,c_50,c_49]) ).

tcf(c_909,plain,
    sK0 = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_908,c_219]) ).

tcf(c_927,plain,
    addition(iPr_def_12,domain(iPr_def_13)) = iPr_def_11,
    inference(demodulation,[status(thm)],[c_300,c_909]) ).

tcf(c_929,plain,
    multiplication(iPr_def_12,iPr_def_13) = iPr_def_13,
    inference(demodulation,[status(thm)],[c_129,c_909]) ).

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

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

tcf(c_6871,plain,
    addition(domain(iPr_def_12),domain(iPr_def_13)) = domain(iPr_def_12),
    inference(superposition,[status(thm)],[c_929,c_1031]) ).

tcf(c_6891,plain,
    iPr_def_11 = iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_6871,c_239,c_927]) ).

tcf(c_6892,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6891,c_131]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE063+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Wed Sep 23 18:49:12 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 4.92/1.32  % SZS status Started for theBenchmark.p
% 4.92/1.32  % SZS status Theorem for theBenchmark.p
% 4.92/1.32  
% 4.92/1.32  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.92/1.32  
% 4.92/1.32  % ------  iProver source info
% 4.92/1.32  
% 4.92/1.32  % git: date: 2026-07-19 20:42:38 +0200
% 4.92/1.32  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.92/1.32  % git: non_committed_changes: false
% 4.92/1.32  
% 4.92/1.32  % ------ Parsing...
% 4.92/1.32  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_UEQ
% 4.92/1.32  % 
% 4.92/1.32  
% 4.92/1.32  % ------ Preprocessing... sup_sim: 3  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 4.92/1.32  
% 4.92/1.32  % ------ Preprocessing...% ------  preprocesses with Option_UEQ
% 4.92/1.32   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.92/1.32  
% 4.92/1.32  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 4.92/1.32  % ------ Proving...
% 4.92/1.32  % ------ Problem Properties 
% 4.92/1.32  
% 4.92/1.32  % 
% 4.92/1.32  % clauses                               23
% 4.92/1.32  % conjectures                           1
% 4.92/1.32  % EPR                                   2
% 4.92/1.32  % Horn                                  23
% 4.92/1.32  % unary                                 23
% 4.92/1.32  % binary                                0
% 4.92/1.32  % lits                                  23
% 4.92/1.32  % lits eq                               23
% 4.92/1.32  % fd_pure                               0
% 4.92/1.32  % fd_pseudo                             0
% 4.92/1.32  % fd_cond                               0
% 4.92/1.32  % fd_pseudo_cond                        0
% 4.92/1.32  % AC symbols                            1
% 4.92/1.32  
% 4.92/1.32  % ------ Schedule UEQ
% 4.92/1.32  
% 4.92/1.32  % ------ Option_UEQ Time Limit: 10.
% 4.92/1.32  
% 4.92/1.32  
% 4.92/1.32  % ------ 
% 4.92/1.32  % Current options:
% 4.92/1.32  % ------ 
% 4.92/1.32  
% 4.92/1.32  
% 4.92/1.32  % 
% 4.92/1.32  
% 4.92/1.32  % ------ Proving...
% 4.92/1.32  % 
% 4.92/1.32  
% 4.92/1.32  % SZS status Theorem for theBenchmark.p
% 4.92/1.32  
% 4.92/1.32  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.92/1.33  
% 4.92/1.33  
%------------------------------------------------------------------------------