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

View Problem - Process Solution

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

% Computer : n032.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 : Mon Jun 24 04:47:19 EDT 2024

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

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

cnf(c_50,plain,
    apply(X0,apply(X1,X1)) = apply(apply(l2,X1),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_definition) ).

cnf(c_51,negated_conjecture,
    apply(combinator,X0) != X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).

cnf(c_64,negated_conjecture,
    apply(combinator,X0) != X0,
    inference(demodulation,[status(thm)],[c_51]) ).

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

cnf(c_105,plain,
    apply(apply(apply(apply(l2,X0),b),X1),X2) = apply(apply(X0,X0),apply(X1,X2)),
    inference(superposition,[status(thm)],[c_50,c_49]) ).

cnf(c_106,plain,
    apply(X0,apply(X1,apply(X2,apply(apply(b,X1),X2)))) = apply(apply(l2,apply(apply(b,X1),X2)),X0),
    inference(superposition,[status(thm)],[c_49,c_50]) ).

cnf(c_107,plain,
    apply(apply(l2,X0),apply(apply(b,X1),X2)) = apply(X1,apply(X2,apply(X0,X0))),
    inference(superposition,[status(thm)],[c_49,c_50]) ).

cnf(c_148,plain,
    apply(apply(X0,X0),apply(l2,l2)) = apply(apply(l2,l2),apply(l2,X0)),
    inference(superposition,[status(thm)],[c_98,c_50]) ).

cnf(c_1073,plain,
    apply(apply(apply(apply(l2,X0),b),X1),X1) = apply(apply(l2,X1),apply(X0,X0)),
    inference(superposition,[status(thm)],[c_105,c_50]) ).

cnf(c_1084,plain,
    apply(apply(apply(apply(l2,X0),b),l2),l2) = apply(apply(l2,l2),apply(l2,X0)),
    inference(superposition,[status(thm)],[c_105,c_148]) ).

cnf(c_1288,plain,
    apply(apply(l2,X0),apply(apply(b,combinator),X1)) != apply(X1,apply(X0,X0)),
    inference(superposition,[status(thm)],[c_107,c_64]) ).

cnf(c_1470,plain,
    apply(apply(l2,X0),apply(apply(b,combinator),apply(l2,X1))) != apply(apply(X0,X0),apply(X1,X1)),
    inference(superposition,[status(thm)],[c_50,c_1288]) ).

cnf(c_11118,plain,
    apply(apply(l2,l2),apply(apply(b,combinator),apply(l2,X0))) != apply(apply(apply(apply(l2,X0),b),l2),l2),
    inference(superposition,[status(thm)],[c_1073,c_1470]) ).

cnf(c_11190,plain,
    apply(apply(l2,l2),apply(apply(b,combinator),apply(l2,X0))) != apply(apply(l2,l2),apply(l2,X0)),
    inference(light_normalisation,[status(thm)],[c_11118,c_1084]) ).

cnf(c_72793,plain,
    apply(apply(l2,apply(apply(b,apply(b,combinator)),l2)),apply(l2,l2)) != apply(apply(l2,l2),apply(l2,apply(apply(b,apply(b,combinator)),l2))),
    inference(superposition,[status(thm)],[c_106,c_11190]) ).

cnf(c_72836,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_72793,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : COL009-1 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.08  % Command  : run_iprover %s %d THM
% 0.08/0.29  % Computer : n032.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 300
% 0.08/0.29  % DateTime : Tue Jun 18 16:27:54 EDT 2024
% 0.08/0.29  % CPUTime  : 
% 0.15/0.38  Running UEQ theorem proving
% 0.15/0.38  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 34.49/5.31  % SZS status Started for theBenchmark.p
% 34.49/5.31  % SZS status Unsatisfiable for theBenchmark.p
% 34.49/5.31  
% 34.49/5.31  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 34.49/5.31  
% 34.49/5.31  ------  iProver source info
% 34.49/5.31  
% 34.49/5.31  git: date: 2024-06-12 09:56:46 +0000
% 34.49/5.31  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 34.49/5.31  git: non_committed_changes: false
% 34.49/5.31  
% 34.49/5.31  ------ Parsing...successful
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 34.49/5.31  
% 34.49/5.31  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 34.49/5.31  
% 34.49/5.31  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 34.49/5.31  ------ Proving...
% 34.49/5.31  ------ Problem Properties 
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  clauses                                 3
% 34.49/5.31  conjectures                             1
% 34.49/5.31  EPR                                     0
% 34.49/5.31  Horn                                    3
% 34.49/5.31  unary                                   3
% 34.49/5.31  binary                                  0
% 34.49/5.31  lits                                    3
% 34.49/5.31  lits eq                                 3
% 34.49/5.31  fd_pure                                 0
% 34.49/5.31  fd_pseudo                               0
% 34.49/5.31  fd_cond                                 0
% 34.49/5.31  fd_pseudo_cond                          0
% 34.49/5.31  AC symbols                              0
% 34.49/5.31  
% 34.49/5.31  ------ Input Options Time Limit: Unbounded
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  ------ 
% 34.49/5.31  Current options:
% 34.49/5.31  ------ 
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  ------ Proving...
% 34.49/5.31  
% 34.49/5.31  
% 34.49/5.31  % SZS status Unsatisfiable for theBenchmark.p
% 34.49/5.31  
% 34.49/5.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 34.49/5.31  
% 34.49/5.31  
%------------------------------------------------------------------------------