TSTP Solution File: MSC008-1.002 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n009.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 09:26:09 EDT 2023

% Result   : Unsatisfiable 0.46s 1.16s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   53 (   2 unt;  23 nHn;  41 RR)
%            Number of literals    :  156 (   0 equ;  81 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   73 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ~ eq(p_1,p_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1_is_not_p_2) ).

cnf(c_51,plain,
    ( ~ eq(X0,X1)
    | eq(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry) ).

cnf(c_52,plain,
    ( ~ latin(X0,X1,X2)
    | ~ latin(X0,X1,X3)
    | eq(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_element_is_unique) ).

cnf(c_54,plain,
    ( ~ latin(X0,X1,X2)
    | ~ latin(X3,X1,X2)
    | eq(X0,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_is_unique) ).

cnf(c_55,plain,
    ( ~ greek(X0,X1,X2)
    | ~ greek(X0,X1,X3)
    | eq(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_element_is_unique) ).

cnf(c_56,plain,
    ( ~ greek(X0,X1,X2)
    | ~ greek(X0,X3,X2)
    | eq(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_is_unique) ).

cnf(c_58,plain,
    ( latin(X0,X1,p_1)
    | latin(X0,X1,p_2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_cell_element) ).

cnf(c_59,plain,
    ( latin(X0,p_1,X1)
    | latin(X0,p_2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_column_required) ).

cnf(c_60,plain,
    ( latin(p_1,X0,X1)
    | latin(p_2,X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_required) ).

cnf(c_61,plain,
    ( greek(X0,X1,p_1)
    | greek(X0,X1,p_2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_cell_element) ).

cnf(c_62,plain,
    ( greek(X0,p_1,X1)
    | greek(X0,p_2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_required) ).

cnf(c_63,plain,
    ( greek(p_1,X0,X1)
    | greek(p_2,X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_required) ).

cnf(c_64,negated_conjecture,
    ( ~ latin(X0,X1,X2)
    | ~ latin(X3,X4,X2)
    | ~ greek(X0,X1,X5)
    | ~ greek(X3,X4,X5)
    | eq(X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_two_same1) ).

cnf(c_67,plain,
    ( greek(p_1,p_1,p_1)
    | greek(p_2,p_1,p_1) ),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_70,plain,
    ( latin(p_1,p_1,p_1)
    | latin(p_2,p_1,p_1) ),
    inference(instantiation,[status(thm)],[c_60]) ).

cnf(c_163,plain,
    ( ~ latin(X0,p_1,X1)
    | ~ latin(X2,p_2,X1)
    | ~ greek(X0,p_1,X3)
    | ~ greek(X2,p_2,X3)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_64]) ).

cnf(c_165,plain,
    ( ~ eq(p_2,p_1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_170,plain,
    ( ~ latin(p_1,X0,X1)
    | ~ latin(p_2,X0,X1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_172,plain,
    ( ~ greek(X0,X1,p_1)
    | ~ greek(X0,X1,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_55]) ).

cnf(c_174,plain,
    ( ~ greek(X0,p_1,X1)
    | ~ greek(X0,p_2,X1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_56]) ).

cnf(c_179,plain,
    ( greek(p_2,X0,p_1)
    | greek(p_2,X0,p_2) ),
    inference(instantiation,[status(thm)],[c_61]) ).

cnf(c_182,plain,
    ( greek(p_2,p_1,X0)
    | greek(p_2,p_2,X0) ),
    inference(instantiation,[status(thm)],[c_62]) ).

cnf(c_183,plain,
    ( greek(p_2,p_1,p_1)
    | greek(p_2,p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_182]) ).

cnf(c_188,plain,
    ( greek(p_1,p_2,X0)
    | greek(p_2,p_2,X0) ),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_189,plain,
    ( greek(p_1,p_2,p_1)
    | greek(p_2,p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_188]) ).

cnf(c_192,plain,
    ( ~ latin(X0,X1,p_1)
    | ~ latin(X0,X1,p_2)
    | eq(p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_193,plain,
    ( ~ latin(p_1,p_1,p_1)
    | ~ latin(p_1,p_1,p_2)
    | eq(p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_192]) ).

cnf(c_205,plain,
    ( ~ latin(X0,p_2,X1)
    | ~ latin(X2,p_1,X1)
    | ~ greek(X0,p_2,X3)
    | ~ greek(X2,p_1,X3)
    | eq(p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_64]) ).

cnf(c_207,plain,
    ( latin(X0,p_1,p_2)
    | latin(X0,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_208,plain,
    ( latin(p_1,p_1,p_2)
    | latin(p_1,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_207]) ).

cnf(c_210,plain,
    ( latin(p_1,X0,p_2)
    | latin(p_2,X0,p_2) ),
    inference(instantiation,[status(thm)],[c_60]) ).

cnf(c_213,plain,
    ( latin(X0,p_2,p_1)
    | latin(X0,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_214,plain,
    ( latin(p_1,p_2,p_1)
    | latin(p_1,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_213]) ).

cnf(c_225,plain,
    ( ~ greek(X0,p_2,p_1)
    | ~ greek(X0,p_2,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_172]) ).

cnf(c_239,plain,
    ( ~ latin(X0,p_2,X1)
    | ~ greek(X0,p_2,X2)
    | ~ latin(p_2,p_1,X1)
    | ~ greek(p_2,p_1,X2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_163]) ).

cnf(c_258,plain,
    ( ~ greek(p_2,p_1,p_1)
    | ~ greek(p_2,p_2,p_1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_174]) ).

cnf(c_266,plain,
    ( ~ latin(X0,p_2,X1)
    | ~ greek(X0,p_2,X2)
    | ~ latin(p_2,p_1,X1)
    | ~ greek(p_2,p_1,X2)
    | eq(p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_205]) ).

cnf(c_267,plain,
    ( ~ latin(p_1,p_2,p_1)
    | ~ latin(p_2,p_1,p_1)
    | ~ greek(p_1,p_2,p_1)
    | ~ greek(p_2,p_1,p_1)
    | eq(p_2,p_1) ),
    inference(instantiation,[status(thm)],[c_266]) ).

cnf(c_333,plain,
    ( latin(p_2,p_1,p_2)
    | latin(p_2,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_207]) ).

cnf(c_335,plain,
    ( ~ latin(p_1,p_2,p_2)
    | ~ latin(p_2,p_2,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_170]) ).

cnf(c_336,plain,
    ( ~ greek(X0,p_2,X1)
    | ~ latin(X0,p_2,p_2)
    | ~ greek(p_2,p_1,X1)
    | ~ latin(p_2,p_1,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_239]) ).

cnf(c_339,plain,
    ( ~ latin(p_1,p_2,p_2)
    | ~ latin(p_2,p_1,p_2)
    | ~ greek(p_1,p_2,p_1)
    | ~ greek(p_2,p_1,p_1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_336]) ).

cnf(c_504,plain,
    ( ~ greek(X0,p_1,X1)
    | ~ greek(X2,p_2,X1)
    | ~ latin(X0,p_1,p_2)
    | ~ latin(X2,p_2,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_163]) ).

cnf(c_626,plain,
    ( ~ greek(p_2,p_2,p_1)
    | ~ greek(p_2,p_2,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_225]) ).

cnf(c_793,plain,
    ( greek(p_2,p_2,p_1)
    | greek(p_2,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_179]) ).

cnf(c_937,plain,
    ( ~ greek(X0,p_1,X1)
    | ~ latin(X0,p_1,p_2)
    | ~ greek(p_2,p_2,X1)
    | ~ latin(p_2,p_2,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_504]) ).

cnf(c_939,plain,
    ( latin(p_1,p_2,p_2)
    | latin(p_2,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_210]) ).

cnf(c_940,plain,
    ( ~ latin(p_1,p_1,p_2)
    | ~ latin(p_2,p_2,p_2)
    | ~ greek(p_1,p_1,p_1)
    | ~ greek(p_2,p_2,p_1)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_937]) ).

cnf(c_1034,plain,
    ( greek(p_2,p_1,p_2)
    | greek(p_2,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_182]) ).

cnf(c_1035,plain,
    ( greek(p_1,p_2,p_2)
    | greek(p_2,p_2,p_2) ),
    inference(instantiation,[status(thm)],[c_188]) ).

cnf(c_1268,plain,
    ( ~ latin(X0,p_2,p_2)
    | ~ greek(X0,p_2,p_2)
    | ~ latin(p_2,p_1,p_2)
    | ~ greek(p_2,p_1,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_336]) ).

cnf(c_1269,plain,
    ( ~ latin(p_1,p_2,p_2)
    | ~ latin(p_2,p_1,p_2)
    | ~ greek(p_1,p_2,p_2)
    | ~ greek(p_2,p_1,p_2)
    | eq(p_1,p_2) ),
    inference(instantiation,[status(thm)],[c_1268]) ).

cnf(c_1445,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1269,c_1034,c_1035,c_939,c_940,c_793,c_626,c_339,c_335,c_333,c_267,c_258,c_214,c_208,c_193,c_189,c_183,c_165,c_70,c_67,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug 24 13:33:36 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.16  % SZS status Started for theBenchmark.p
% 0.46/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.16  
% 0.46/1.16  ------  iProver source info
% 0.46/1.16  
% 0.46/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.16  git: non_committed_changes: false
% 0.46/1.16  git: last_make_outside_of_git: false
% 0.46/1.16  
% 0.46/1.16  ------ Parsing...successful
% 0.46/1.16  
% 0.46/1.16  ------  preprocesses with Option_epr_non_horn_non_eq
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_non_eq
% 0.46/1.16   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.16  ------ Proving...
% 0.46/1.16  ------ Problem Properties 
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  clauses                                 17
% 0.46/1.16  conjectures                             2
% 0.46/1.16  EPR                                     17
% 0.46/1.16  Horn                                    11
% 0.46/1.16  unary                                   2
% 0.46/1.16  binary                                  7
% 0.46/1.16  lits                                    44
% 0.46/1.16  lits eq                                 0
% 0.46/1.16  fd_pure                                 0
% 0.46/1.16  fd_pseudo                               0
% 0.46/1.16  fd_cond                                 0
% 0.46/1.16  fd_pseudo_cond                          0
% 0.46/1.16  AC symbols                              0
% 0.46/1.16  
% 0.46/1.16  ------ Schedule EPR non Horn non eq is on
% 0.46/1.16  
% 0.46/1.16  ------ no equalities: superposition off 
% 0.46/1.16  
% 0.46/1.16  ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ 
% 0.46/1.16  Current options:
% 0.46/1.16  ------ 
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ Proving...
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16  
% 0.46/1.17  
%------------------------------------------------------------------------------