TSTP Solution File: CAT001-4 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : CAT001-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:08:59 EDT 2024

% Result   : Unsatisfiable 2.33s 1.11s
% Output   : CNFRefutation 2.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   15 (  14 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_50,plain,
    ( compose(compose(a,b),X0) != X1
    | compose(compose(a,b),X2) != X1
    | X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monomorphism) ).

cnf(c_52,plain,
    compose(b,h) = compose(b,g),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bh_equals_bg) ).

cnf(c_53,negated_conjecture,
    h != g,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_h_equals_g) ).

cnf(c_62,plain,
    compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).

cnf(c_66,plain,
    ( compose(compose(a,b),X0) != compose(compose(a,b),X1)
    | X1 = X0 ),
    inference(unflattening,[status(thm)],[c_50]) ).

cnf(c_163,plain,
    ( compose(a,compose(b,X0)) != compose(a,compose(b,X1))
    | X0 = X1 ),
    inference(demodulation,[status(thm)],[c_66,c_62]) ).

cnf(c_247,negated_conjecture,
    h != g,
    inference(demodulation,[status(thm)],[c_53]) ).

cnf(c_390,plain,
    ( compose(a,compose(b,X0)) != compose(a,compose(b,h))
    | X0 = g ),
    inference(superposition,[status(thm)],[c_52,c_163]) ).

cnf(c_523,plain,
    h = g,
    inference(equality_resolution,[status(thm)],[c_390]) ).

cnf(c_524,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_523,c_247]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : CAT001-4 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.31  % Computer : n020.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Thu May  2 21:11:31 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.41  Running first-order theorem proving
% 0.16/0.41  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.33/1.11  % SZS status Started for theBenchmark.p
% 2.33/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 2.33/1.11  
% 2.33/1.11  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.33/1.11  
% 2.33/1.11  ------  iProver source info
% 2.33/1.11  
% 2.33/1.11  git: date: 2024-05-02 19:28:25 +0000
% 2.33/1.11  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.33/1.11  git: non_committed_changes: false
% 2.33/1.11  
% 2.33/1.11  ------ Parsing...successful
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  ------ Preprocessing... sup_sim: 1  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.33/1.11  
% 2.33/1.11  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.33/1.11  
% 2.33/1.11  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.33/1.11  ------ Proving...
% 2.33/1.11  ------ Problem Properties 
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  clauses                                 13
% 2.33/1.11  conjectures                             1
% 2.33/1.11  EPR                                     1
% 2.33/1.11  Horn                                    13
% 2.33/1.11  unary                                   7
% 2.33/1.11  binary                                  5
% 2.33/1.11  lits                                    20
% 2.33/1.11  lits eq                                 9
% 2.33/1.11  fd_pure                                 0
% 2.33/1.11  fd_pseudo                               0
% 2.33/1.11  fd_cond                                 0
% 2.33/1.11  fd_pseudo_cond                          1
% 2.33/1.11  AC symbols                              0
% 2.33/1.11  
% 2.33/1.11  ------ Schedule dynamic 5 is on 
% 2.33/1.11  
% 2.33/1.11  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  ------ 
% 2.33/1.11  Current options:
% 2.33/1.11  ------ 
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  ------ Proving...
% 2.33/1.11  
% 2.33/1.11  
% 2.33/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 2.33/1.11  
% 2.33/1.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.33/1.11  
% 2.33/1.11  
%------------------------------------------------------------------------------