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

View Problem - Process Solution

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

% Computer : n017.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:48 EDT 2024

% Result   : Unsatisfiable 58.56s 8.77s
% Output   : CNFRefutation 58.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  11 unt;   0 nHn;  14 RR)
%            Number of literals    :   34 (  33 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_50,negated_conjecture,
    apply(abstraction,apply(abstraction,k(b))) != k(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_TRC2b) ).

cnf(c_51,plain,
    apply(k(X0),X1) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',k_definition) ).

cnf(c_56,plain,
    apply(apply(X0,k(X1)),apply(X2,X1)) = apply(apply(apply(abstraction,X0),X2),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',abstraction) ).

cnf(c_59,plain,
    ( apply(X0,n(X0,X1)) != apply(X1,n(X0,X1))
    | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',extensionality2) ).

cnf(c_76,plain,
    X0 = X0,
    theory(equality) ).

cnf(c_77,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_91,plain,
    ( apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b)))
    | apply(abstraction,apply(abstraction,k(b))) = k(b) ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_94,plain,
    ( apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != X0
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != X0
    | apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) ),
    inference(instantiation,[status(thm)],[c_77]) ).

cnf(c_117,plain,
    ( apply(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),X0)) != apply(X0,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),X0))
    | apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = X0 ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_119,plain,
    ( apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b)))
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b)))
    | apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) ),
    inference(instantiation,[status(thm)],[c_94]) ).

cnf(c_120,plain,
    apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),
    inference(instantiation,[status(thm)],[c_76]) ).

cnf(c_180,plain,
    ( apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != X0
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != X0
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) ),
    inference(instantiation,[status(thm)],[c_77]) ).

cnf(c_587,plain,
    ( apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != b
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != b
    | apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) ),
    inference(instantiation,[status(thm)],[c_180]) ).

cnf(c_588,plain,
    apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = b,
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_1542,plain,
    apply(apply(apply(abstraction,k(X0)),X1),X2) = apply(X0,apply(X1,X2)),
    inference(superposition,[status(thm)],[c_51,c_56]) ).

cnf(c_1600,plain,
    apply(apply(apply(abstraction,apply(abstraction,k(X0))),X1),X2) = apply(X0,apply(k(X2),apply(X1,X2))),
    inference(superposition,[status(thm)],[c_1542,c_56]) ).

cnf(c_1603,plain,
    apply(apply(apply(abstraction,apply(abstraction,k(X0))),X1),X2) = apply(X0,X2),
    inference(demodulation,[status(thm)],[c_1600,c_51]) ).

cnf(c_7826,plain,
    ( apply(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)) != apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b))
    | apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) = b ),
    inference(instantiation,[status(thm)],[c_117]) ).

cnf(c_51635,plain,
    apply(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)) = apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(instantiation,[status(thm)],[c_1603]) ).

cnf(c_51636,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_51635,c_7826,c_588,c_587,c_120,c_119,c_91,c_50]) ).


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