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

View Problem - Process Solution

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

% Computer : n027.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:36 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).

cnf(c_50,plain,
    apply(X0,apply(X1,X1)) = apply(apply(l,X0),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_definition) ).

cnf(c_51,plain,
    apply(X0,X0) = apply(m,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_definition) ).

cnf(c_52,negated_conjecture,
    apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).

cnf(c_68,negated_conjecture,
    apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
    inference(demodulation,[status(thm)],[c_52]) ).

cnf(c_98,plain,
    apply(apply(l,X0),X1) = apply(X0,apply(m,X1)),
    inference(superposition,[status(thm)],[c_51,c_50]) ).

cnf(c_114,plain,
    apply(X0,apply(m,apply(l,X0))) = apply(m,apply(l,X0)),
    inference(superposition,[status(thm)],[c_98,c_51]) ).

cnf(c_285,plain,
    apply(f(apply(apply(b,X0),X1)),apply(X0,apply(X1,f(apply(apply(b,X0),X1))))) != apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),
    inference(superposition,[status(thm)],[c_49,c_68]) ).

cnf(c_715,plain,
    $false,
    inference(superposition,[status(thm)],[c_114,c_285]) ).


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