↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : CAT017-4 : TPTP v9.3.1. Released v1.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:01:11 PM UTC 2026

% Result   : Unsatisfiable 2.00s 1.16s
% Output   : CNFRefutation 2.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  13 unt;   1 def)
%            Number of atoms       :   38 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (  10   ~;   7   |;   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  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0,X1] :
      ( there_exists(domain(X0))
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).

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

fof(f12,axiom,
    there_exists(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_a_exists) ).

fof(f13,negated_conjecture,
    ~ there_exists(codomain(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_a_exists) ).

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_72,plain,
    ! [X0: $i] : compose(codomain(X0),X0) = X0,
    inference(cnf_transformation,[],[f11]) ).

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

tcf(c_74,negated_conjecture,
    ~ there_exists(codomain(a)),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_227,definition,
    iPr_def_10 = codomain(a),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_228,negated_conjecture,
    ~ there_exists(iPr_def_10),
    inference(demodulation,[status(thm)],[c_74,c_227]) ).

tcf(c_364,plain,
    compose(iPr_def_10,a) = a,
    inference(superposition,[status(thm)],[c_227,c_72]) ).

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

tcf(c_385,plain,
    there_exists(domain(iPr_def_10)),
    inference(forward_subsumption_resolution,[status(thm)],[c_384,c_73]) ).

tcf(c_402,plain,
    ( ( codomain(a) = domain(iPr_def_10) )
    | ~ there_exists(a) ),
    inference(superposition,[status(thm)],[c_364,c_68]) ).

tcf(c_403,plain,
    ( ( domain(iPr_def_10) = iPr_def_10 )
    | ~ there_exists(a) ),
    inference(light_normalisation,[status(thm)],[c_402,c_227]) ).

tcf(c_404,plain,
    domain(iPr_def_10) = iPr_def_10,
    inference(forward_subsumption_resolution,[status(thm)],[c_403,c_73]) ).

tcf(c_425,plain,
    there_exists(iPr_def_10),
    inference(light_normalisation,[status(thm)],[c_385,c_404]) ).

tcf(c_426,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_425,c_228]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT017-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.35  % Computer : n006.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 06:57:29 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 2.00/1.16  % SZS status Started for theBenchmark.p
% 2.00/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.00/1.16  
% 2.00/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.00/1.16  
% 2.00/1.16  % ------  iProver source info
% 2.00/1.16  
% 2.00/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 2.00/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.00/1.16  % git: non_committed_changes: false
% 2.00/1.16  
% 2.00/1.16  % ------ Parsing...% successful
% 2.00/1.16  
% 2.00/1.16  
% 2.00/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.00/1.16  
% 2.00/1.16  % ------ 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 % 
% 2.00/1.16  
% 2.00/1.16  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.00/1.16  
% 2.00/1.16  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.00/1.16  % ------ Proving...
% 2.00/1.16  % ------ Problem Properties 
% 2.00/1.16  
% 2.00/1.16  % 
% 2.00/1.16  % clauses                               11
% 2.00/1.16  % conjectures                           1
% 2.00/1.16  % EPR                                   2
% 2.00/1.16  % Horn                                  11
% 2.00/1.16  % unary                                 6
% 2.00/1.16  % binary                                4
% 2.00/1.16  % lits                                  17
% 2.00/1.16  % lits eq                               6
% 2.00/1.16  % fd_pure                               0
% 2.00/1.16  % fd_pseudo                             0
% 2.00/1.16  % fd_cond                               0
% 2.00/1.16  % fd_pseudo_cond                        0
% 2.00/1.16  % AC symbols                            0
% 2.00/1.16  
% 2.00/1.16  % ------ Schedule dynamic 5 is on 
% 2.00/1.16  
% 2.00/1.16  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.00/1.16  
% 2.00/1.16  
% 2.00/1.16  % ------ 
% 2.00/1.16  % Current options:
% 2.00/1.16  % ------ 
% 2.00/1.16  
% 2.00/1.16  
% 2.00/1.16  % 
% 2.00/1.16  
% 2.00/1.16  % ------ Proving...
% 2.00/1.16  % 
% 2.00/1.16  
% 2.00/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.00/1.16  
% 2.00/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.00/1.16  
% 2.00/1.16  
%------------------------------------------------------------------------------