TSTP Solution File: COL052-1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n023.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:09:41 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).

cnf(c_50,plain,
    response(X0,common_bird(X0)) = response(c,common_bird(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).

cnf(c_51,negated_conjecture,
    response(a,X0) != response(odd_bird,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).

cnf(c_52,plain,
    compose(a,b) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).

cnf(c_68,negated_conjecture,
    response(a,X0) != response(odd_bird,X0),
    inference(demodulation,[status(thm)],[c_51]) ).

cnf(c_106,plain,
    response(a,response(b,X0)) = response(c,X0),
    inference(superposition,[status(thm)],[c_52,c_49]) ).

cnf(c_107,plain,
    response(X0,response(X1,common_bird(compose(X0,X1)))) = response(c,common_bird(compose(X0,X1))),
    inference(superposition,[status(thm)],[c_49,c_50]) ).

cnf(c_115,plain,
    response(a,response(X0,common_bird(compose(odd_bird,X0)))) != response(c,common_bird(compose(odd_bird,X0))),
    inference(superposition,[status(thm)],[c_107,c_68]) ).

cnf(c_145,plain,
    $false,
    inference(superposition,[status(thm)],[c_106,c_115]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COL052-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May  2 21:40:24 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running UEQ theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.58/1.18  % SZS status Started for theBenchmark.p
% 1.58/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.18  
% 1.58/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.58/1.18  
% 1.58/1.18  ------  iProver source info
% 1.58/1.18  
% 1.58/1.18  git: date: 2024-05-02 19:28:25 +0000
% 1.58/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.58/1.18  git: non_committed_changes: false
% 1.58/1.18  
% 1.58/1.18  ------ Parsing...successful
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.58/1.18  
% 1.58/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.58/1.18  
% 1.58/1.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.58/1.18  ------ Proving...
% 1.58/1.18  ------ Problem Properties 
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  clauses                                 4
% 1.58/1.18  conjectures                             1
% 1.58/1.18  EPR                                     0
% 1.58/1.18  Horn                                    4
% 1.58/1.18  unary                                   4
% 1.58/1.18  binary                                  0
% 1.58/1.18  lits                                    4
% 1.58/1.18  lits eq                                 4
% 1.58/1.18  fd_pure                                 0
% 1.58/1.18  fd_pseudo                               0
% 1.58/1.18  fd_cond                                 0
% 1.58/1.18  fd_pseudo_cond                          0
% 1.58/1.18  AC symbols                              0
% 1.58/1.18  
% 1.58/1.18  ------ Input Options Time Limit: Unbounded
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  ------ 
% 1.58/1.18  Current options:
% 1.58/1.18  ------ 
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  ------ Proving...
% 1.58/1.18  
% 1.58/1.18  
% 1.58/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.18  
% 1.58/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.18  
% 1.58/1.18  
%------------------------------------------------------------------------------