TSTP Solution File: LCL096-10 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL096-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n006.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 : Thu Aug 31 07:42:27 EDT 2023

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

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

cnf(c_50,plain,
    ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(c_51,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).

cnf(c_52,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).

cnf(c_53,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_4) ).

cnf(c_54,negated_conjecture,
    is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).

cnf(c_11112,plain,
    ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)),true,is_a_theorem(equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3))),true),true) = true,
    inference(superposition,[status(thm)],[c_53,c_50]) ).

cnf(c_11116,plain,
    ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4),X5)),true,ifeq(true,true,is_a_theorem(X5),true),true) = true,
    inference(superposition,[status(thm)],[c_52,c_50]) ).

cnf(c_11120,plain,
    ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)),true,is_a_theorem(equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3))),true) = true,
    inference(demodulation,[status(thm)],[c_11112,c_49]) ).

cnf(c_11122,plain,
    ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4),X5)),true,is_a_theorem(X5),true) = true,
    inference(demodulation,[status(thm)],[c_11116,c_49]) ).

cnf(c_11135,plain,
    ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),equivalent(equivalent(equivalent(X1,X2),X3),X4))),true) = true,
    inference(superposition,[status(thm)],[c_51,c_11120]) ).

cnf(c_11157,plain,
    ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),X5),equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))),true) = true,
    inference(superposition,[status(thm)],[c_53,c_11122]) ).

cnf(c_11187,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),equivalent(equivalent(equivalent(X1,X2),X3),X4))) = true,
    inference(demodulation,[status(thm)],[c_11135,c_49]) ).

cnf(c_11190,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),X5),equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))) = true,
    inference(demodulation,[status(thm)],[c_11157,c_49]) ).

cnf(c_11273,plain,
    ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4)),true,is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4)),true),true) = true,
    inference(superposition,[status(thm)],[c_11187,c_50]) ).

cnf(c_11331,plain,
    ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2))),X4),X4)),true) = true,
    inference(superposition,[status(thm)],[c_11190,c_11122]) ).

cnf(c_11412,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2))),X4),X4)) = true,
    inference(demodulation,[status(thm)],[c_11331,c_49]) ).

cnf(c_11422,plain,
    ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4)),true,is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4)),true) = true,
    inference(demodulation,[status(thm)],[c_11273,c_49]) ).

cnf(c_12144,plain,
    ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2),X2)),true) = true,
    inference(superposition,[status(thm)],[c_11412,c_11422]) ).

cnf(c_12581,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2),X2)) = true,
    inference(demodulation,[status(thm)],[c_12144,c_49]) ).

cnf(c_13816,plain,
    true != true,
    inference(demodulation,[status(thm)],[c_54,c_12581]) ).

cnf(c_13817,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_13816]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL096-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.17/0.34  % Computer : n006.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Fri Aug 25 04:32:23 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 0.21/0.46  Running UEQ theorem proving
% 0.21/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 15.39/2.64  % SZS status Started for theBenchmark.p
% 15.39/2.64  % SZS status Unsatisfiable for theBenchmark.p
% 15.39/2.64  
% 15.39/2.64  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 15.39/2.64  
% 15.39/2.64  ------  iProver source info
% 15.39/2.64  
% 15.39/2.64  git: date: 2023-05-31 18:12:56 +0000
% 15.39/2.64  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 15.39/2.64  git: non_committed_changes: false
% 15.39/2.64  git: last_make_outside_of_git: false
% 15.39/2.64  
% 15.39/2.64  ------ Parsing...successful
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 15.39/2.64  
% 15.39/2.64  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 15.39/2.64  
% 15.39/2.64  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 15.39/2.64  ------ Proving...
% 15.39/2.64  ------ Problem Properties 
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  clauses                                 6
% 15.39/2.64  conjectures                             1
% 15.39/2.64  EPR                                     0
% 15.39/2.64  Horn                                    6
% 15.39/2.64  unary                                   6
% 15.39/2.64  binary                                  0
% 15.39/2.64  lits                                    6
% 15.39/2.64  lits eq                                 6
% 15.39/2.64  fd_pure                                 0
% 15.39/2.64  fd_pseudo                               0
% 15.39/2.64  fd_cond                                 0
% 15.39/2.64  fd_pseudo_cond                          0
% 15.39/2.64  AC symbols                              0
% 15.39/2.64  
% 15.39/2.64  ------ Input Options Time Limit: Unbounded
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  ------ 
% 15.39/2.64  Current options:
% 15.39/2.64  ------ 
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  ------ Proving...
% 15.39/2.64  
% 15.39/2.64  
% 15.39/2.64  % SZS status Unsatisfiable for theBenchmark.p
% 15.39/2.64  
% 15.39/2.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 15.39/2.64  
% 15.39/2.64  
%------------------------------------------------------------------------------