↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 1.05s 1.07s
% Output   : CNFRefutation 1.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  22 unt;   2 def)
%            Number of atoms       :   33 (  21 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn  13   !;   1   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

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(f18,conjecture,
    ! [X0] : domain(multiplication(one,domain(X0))) = domain(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

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

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

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

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

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

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

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

tcf(c_115,plain,
    domain(domain(sK0)) != domain(sK0),
    inference(demodulation,[status(thm)],[c_65,c_55]) ).

tcf(c_121,definition,
    iPr_def_10 = domain(sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

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

tcf(c_123,plain,
    iPr_def_11 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_115,c_121,c_122]) ).

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

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

tcf(c_220,plain,
    domain(iPr_def_10) = iPr_def_10,
    inference(superposition,[status(thm)],[c_121,c_213]) ).

tcf(c_223,plain,
    iPr_def_10 = iPr_def_11,
    inference(demodulation,[status(thm)],[c_122,c_220]) ).

tcf(c_225,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_123,c_223]) ).

tcf(c_226,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_225]) ).


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