↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n020.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:01:09 PM UTC 2026

% Result   : Unsatisfiable 3.66s 11.30s
% Output   : CNFRefutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   31 (  19 unt;   3 def)
%            Number of atoms       :   67 (  20 equ)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   27 (  15   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  19   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] :
      ( there_exists(X0)
      | ~ there_exists(domain(X0)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( there_exists(domain(X0))
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( domain(X0) = codomain(X1)
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).

fof(f9,axiom,
    ! [X2,X0,X1] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).

fof(f11,axiom,
    ! [X0] : compose(codomain(X0),X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).

fof(f12,axiom,
    there_exists(compose(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).

fof(f13,negated_conjecture,
    codomain(compose(a,b)) != codomain(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).

tcf(c_65,plain,
    ! [X0: $i] :
      ( there_exists(X0)
      | ~ there_exists(domain(X0)) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i] :
      ( there_exists(domain(X0))
      | ~ there_exists(compose(X0,X1)) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i] :
      ( ( codomain(X1) = domain(X0) )
      | ~ there_exists(compose(X0,X1)) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_70,plain,
    ! [X0: $i,X1: $i,X2: $i] : compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_72,plain,
    ! [X0: $i] : compose(codomain(X0),X0) = X0,
    inference(cnf_transformation,[],[f11]) ).

tcf(c_73,plain,
    there_exists(compose(a,b)),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_74,negated_conjecture,
    codomain(compose(a,b)) != codomain(a),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_76,plain,
    ( there_exists(a)
    | ~ there_exists(domain(a)) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_230,definition,
    iPr_def_10 = compose(a,b),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_231,definition,
    iPr_def_11 = codomain(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_232,definition,
    iPr_def_12 = codomain(a),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_233,negated_conjecture,
    iPr_def_11 != iPr_def_12,
    inference(demodulation,[status(thm)],[c_74,c_232,c_230,c_231]) ).

tcf(c_370,plain,
    there_exists(iPr_def_10),
    inference(light_normalisation,[status(thm)],[c_73,c_230]) ).

tcf(c_395,plain,
    compose(iPr_def_12,a) = a,
    inference(superposition,[status(thm)],[c_232,c_72]) ).

tcf(c_403,plain,
    ( there_exists(domain(a))
    | ~ there_exists(iPr_def_10) ),
    inference(superposition,[status(thm)],[c_230,c_67]) ).

tcf(c_409,plain,
    there_exists(domain(a)),
    inference(forward_subsumption_resolution,[status(thm)],[c_403,c_370]) ).

tcf(c_436,plain,
    ( ( codomain(a) = domain(iPr_def_12) )
    | ~ there_exists(a) ),
    inference(superposition,[status(thm)],[c_395,c_68]) ).

tcf(c_438,plain,
    ! [X0: $i] : compose(iPr_def_12,compose(a,X0)) = compose(a,X0),
    inference(superposition,[status(thm)],[c_395,c_70]) ).

tcf(c_441,plain,
    ( ( domain(iPr_def_12) = iPr_def_12 )
    | ~ there_exists(a) ),
    inference(light_normalisation,[status(thm)],[c_436,c_232]) ).

tcf(c_613,plain,
    domain(iPr_def_12) = iPr_def_12,
    inference(global_subsumption_just,[status(thm)],[c_441,c_76,c_409,c_441]) ).

tcf(c_797,plain,
    compose(iPr_def_12,iPr_def_10) = iPr_def_10,
    inference(superposition,[status(thm)],[c_230,c_438]) ).

tcf(c_813,plain,
    ( ( codomain(iPr_def_10) = domain(iPr_def_12) )
    | ~ there_exists(iPr_def_10) ),
    inference(superposition,[status(thm)],[c_797,c_68]) ).

tcf(c_817,plain,
    ( ( iPr_def_11 = iPr_def_12 )
    | ~ there_exists(iPr_def_10) ),
    inference(light_normalisation,[status(thm)],[c_813,c_231,c_613]) ).

tcf(c_818,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_817,c_233,c_370]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/10.39  % Computer : n020.cluster.edu
% 0.13/10.39  % Model    : x86_64 x86_64
% 0.13/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.39  % Memory   : 8046.5625MB
% 0.13/10.39  % OS       : Linux 6.8.0-71-generic
% 0.13/10.39  % CPULimit : 300
% 0.13/10.39  % WCLimit  : 300
% 0.13/10.39  % DateTime : Fri Sep 25 06:55:45 UTC 2026
% 0.13/10.39  % CPUTime  : 
% 0.13/10.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/10.43  Running first-order theorem proving
% 0.16/10.43  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/10.44  
% 0.16/10.44  % ======== iProver multi-core TPTP/SMT =========
% 0.16/10.44  
% 0.16/10.44  % Detected problem language: tptp
% 0.16/10.45  % Proving...
% 3.66/11.30  % SZS status Started for theBenchmark.p
% 3.66/11.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.66/11.30  
% 3.66/11.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.66/11.30  
% 3.66/11.30  % ------  iProver source info
% 3.66/11.30  
% 3.66/11.30  % git: date: 2026-07-19 20:42:38 +0200
% 3.66/11.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.66/11.30  % git: non_committed_changes: false
% 3.66/11.30  
% 3.66/11.30  % ------ Parsing...% successful
% 3.66/11.30  
% 3.66/11.30  
% 3.66/11.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.66/11.30  
% 3.66/11.30  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.66/11.30  
% 3.66/11.30  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.66/11.30  
% 3.66/11.30  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.66/11.30  % ------ Proving...
% 3.66/11.30  % ------ Problem Properties 
% 3.66/11.30  
% 3.66/11.30  % 
% 3.66/11.30  % clauses                               13
% 3.66/11.30  % conjectures                           1
% 3.66/11.30  % EPR                                   1
% 3.66/11.30  % Horn                                  13
% 3.66/11.30  % unary                                 8
% 3.66/11.30  % binary                                4
% 3.66/11.30  % lits                                  19
% 3.66/11.30  % lits eq                               9
% 3.66/11.30  % fd_pure                               0
% 3.66/11.30  % fd_pseudo                             0
% 3.66/11.30  % fd_cond                               0
% 3.66/11.30  % fd_pseudo_cond                        0
% 3.66/11.30  % AC symbols                            0
% 3.66/11.30  
% 3.66/11.30  % ------ Schedule dynamic 5 is on 
% 3.66/11.30  
% 3.66/11.30  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.66/11.30  
% 3.66/11.30  
% 3.66/11.30  % ------ 
% 3.66/11.30  % Current options:
% 3.66/11.30  % ------ 
% 3.66/11.30  
% 3.66/11.30  
% 3.66/11.30  % 
% 3.66/11.30  
% 3.66/11.30  % ------ Proving...
% 3.66/11.30  % 
% 3.66/11.30  
% 3.66/11.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.66/11.30  
% 3.66/11.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/11.30  
% 3.66/11.30  
%------------------------------------------------------------------------------