TSTP Solution File: MSC008-2.002 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MSC008-2.002 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:10 EDT 2023
% Result : Unsatisfiable 2.29s 1.21s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 52 ( 2 unt; 25 nHn; 40 RR)
% Number of literals : 164 ( 0 equ; 76 neg)
% Maximal clause size : 6 ( 3 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
~ eq(p1,p2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1_is_not_p2) ).
cnf(c_51,plain,
( ~ eq(X0,X1)
| eq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry) ).
cnf(c_52,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X1,X3)
| eq(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_element_is_unique) ).
cnf(c_53,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X3,X2)
| eq(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_column_is_unique) ).
cnf(c_54,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X3,X1,X2)
| eq(X3,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_is_unique) ).
cnf(c_56,plain,
( ~ greek(X0,X1,X2)
| ~ greek(X0,X3,X2)
| eq(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_column_is_unique) ).
cnf(c_57,plain,
( ~ greek(X0,X1,X2)
| ~ greek(X3,X1,X2)
| eq(X3,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_row_is_unique) ).
cnf(c_58,plain,
( latin(X0,X1,p1)
| latin(X0,X1,p2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_cell_element) ).
cnf(c_59,plain,
( latin(X0,p1,X1)
| latin(X0,p2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_column_required) ).
cnf(c_60,plain,
( latin(p1,X0,X1)
| latin(p2,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_required) ).
cnf(c_62,plain,
( greek(X0,p1,X1)
| greek(X0,p2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_column_required) ).
cnf(c_63,plain,
( greek(p1,X0,X1)
| greek(p2,X0,X1) ),
file('/export/starexec/sandbox2/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(X3,X0)
| eq(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_two_same) ).
cnf(c_67,plain,
( greek(p1,p1,p1)
| greek(p1,p2,p1) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_71,plain,
( latin(p1,p1,p1)
| latin(p1,p1,p2) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_152,plain,
( ~ latin(X0,p2,X1)
| ~ latin(X2,p1,X1)
| ~ greek(X0,p2,X3)
| ~ greek(X2,p1,X3)
| eq(X2,X0)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_153,plain,
( ~ eq(p2,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_154,plain,
( ~ latin(X0,X1,p1)
| ~ latin(X0,X1,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_155,plain,
( ~ latin(p1,p1,p1)
| ~ latin(p1,p1,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_154]) ).
cnf(c_156,plain,
( ~ latin(X0,p1,X1)
| ~ latin(X0,p2,X1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_158,plain,
( ~ latin(p1,X0,X1)
| ~ latin(p2,X0,X1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_159,plain,
( ~ latin(p1,p1,p1)
| ~ latin(p2,p1,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_164,plain,
( ~ greek(p1,X0,X1)
| ~ greek(p2,X0,X1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_166,plain,
( ~ latin(p1,p1,X0)
| ~ latin(p2,p2,X0)
| ~ greek(p1,p1,X1)
| ~ greek(p2,p2,X1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_167,plain,
( ~ latin(p1,p1,p1)
| ~ latin(p2,p2,p1)
| ~ greek(p1,p1,p1)
| ~ greek(p2,p2,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_173,plain,
( ~ greek(X0,p1,X1)
| ~ greek(X0,p2,X1)
| eq(p2,p1) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_176,plain,
( ~ greek(p1,p1,p1)
| ~ greek(p1,p2,p1)
| eq(p2,p1) ),
inference(instantiation,[status(thm)],[c_173]) ).
cnf(c_185,plain,
( latin(X0,p1,p2)
| latin(X0,p2,p2) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_186,plain,
( latin(p1,p1,p2)
| latin(p1,p2,p2) ),
inference(instantiation,[status(thm)],[c_185]) ).
cnf(c_188,plain,
( latin(p1,X0,p2)
| latin(p2,X0,p2) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_191,plain,
( ~ latin(X0,p1,p2)
| ~ latin(X0,p2,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_156]) ).
cnf(c_192,plain,
( ~ latin(p1,p1,p2)
| ~ latin(p1,p2,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_191]) ).
cnf(c_202,plain,
( ~ latin(p1,X0,p2)
| ~ latin(p2,X0,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_218,plain,
( greek(p1,p2,X0)
| greek(p2,p2,X0) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_219,plain,
( greek(p1,p2,p1)
| greek(p2,p2,p1) ),
inference(instantiation,[status(thm)],[c_218]) ).
cnf(c_220,plain,
( ~ greek(p1,X0,p1)
| ~ greek(p2,X0,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_164]) ).
cnf(c_224,plain,
( greek(p2,p1,X0)
| greek(p2,p2,X0) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_225,plain,
( greek(p2,p1,p1)
| greek(p2,p2,p1) ),
inference(instantiation,[status(thm)],[c_224]) ).
cnf(c_247,plain,
( latin(X0,p2,p1)
| latin(X0,p2,p2) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_253,plain,
( latin(p1,p2,p2)
| latin(p2,p2,p2) ),
inference(instantiation,[status(thm)],[c_188]) ).
cnf(c_320,plain,
( ~ latin(p1,p2,p2)
| ~ latin(p2,p2,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_202]) ).
cnf(c_416,plain,
( ~ latin(X0,X1,X2)
| ~ greek(X0,X1,X3)
| ~ greek(X4,p2,X3)
| latin(X4,p1,X2)
| eq(X0,X4)
| eq(X1,p2) ),
inference(superposition,[status(thm)],[c_59,c_64]) ).
cnf(c_438,plain,
( ~ greek(p1,p2,p1)
| ~ greek(p2,p2,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_220]) ).
cnf(c_456,plain,
( ~ greek(X0,X1,X2)
| ~ greek(X3,p2,X2)
| latin(X0,X1,p1)
| latin(X3,p1,p2)
| eq(X0,X3)
| eq(X1,p2) ),
inference(superposition,[status(thm)],[c_58,c_416]) ).
cnf(c_558,plain,
( ~ greek(X0,p2,X1)
| ~ greek(p2,X2,X1)
| latin(X0,p1,X3)
| latin(p1,X2,X3)
| eq(X2,p2)
| eq(p2,X0) ),
inference(superposition,[status(thm)],[c_60,c_416]) ).
cnf(c_572,plain,
( ~ greek(p1,p2,p1)
| ~ greek(p2,p1,p1)
| latin(p1,p1,p1)
| eq(p1,p2)
| eq(p2,p1) ),
inference(instantiation,[status(thm)],[c_558]) ).
cnf(c_744,plain,
( ~ greek(X0,p2,X1)
| greek(p1,X2,X1)
| latin(X0,p1,p2)
| latin(p2,X2,p1)
| eq(X2,p2)
| eq(p2,X0) ),
inference(superposition,[status(thm)],[c_63,c_456]) ).
cnf(c_758,plain,
( ~ greek(p1,p2,p1)
| latin(p1,p1,p2)
| latin(p2,p1,p1)
| greek(p1,p1,p1)
| eq(p1,p2)
| eq(p2,p1) ),
inference(instantiation,[status(thm)],[c_744]) ).
cnf(c_1000,plain,
( latin(p2,p2,p1)
| latin(p2,p2,p2) ),
inference(instantiation,[status(thm)],[c_247]) ).
cnf(c_1213,plain,
( ~ greek(p1,p1,X0)
| ~ greek(p2,p2,X0)
| ~ latin(p1,p1,p2)
| ~ latin(p2,p2,p2)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_1214,plain,
( ~ latin(p1,p1,p2)
| ~ latin(p2,p2,p2)
| ~ greek(p1,p1,p1)
| ~ greek(p2,p2,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_1213]) ).
cnf(c_1665,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1214,c_1000,c_758,c_572,c_438,c_320,c_253,c_225,c_219,c_192,c_186,c_176,c_167,c_159,c_155,c_153,c_71,c_67,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MSC008-2.002 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n023.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 Aug 24 14:04:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.29/1.21 % SZS status Started for theBenchmark.p
% 2.29/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 2.29/1.21
% 2.29/1.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.29/1.21
% 2.29/1.21 ------ iProver source info
% 2.29/1.21
% 2.29/1.21 git: date: 2023-05-31 18:12:56 +0000
% 2.29/1.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.29/1.21 git: non_committed_changes: false
% 2.29/1.21 git: last_make_outside_of_git: false
% 2.29/1.21
% 2.29/1.21 ------ Parsing...successful
% 2.29/1.21
% 2.29/1.21 ------ preprocesses with Option_epr_non_horn_non_eq
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.29/1.21
% 2.29/1.21 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 2.29/1.21 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.29/1.21 ------ Proving...
% 2.29/1.21 ------ Problem Properties
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21 clauses 16
% 2.29/1.21 conjectures 1
% 2.29/1.21 EPR 16
% 2.29/1.21 Horn 9
% 2.29/1.21 unary 2
% 2.29/1.21 binary 7
% 2.29/1.21 lits 40
% 2.29/1.21 lits eq 0
% 2.29/1.21 fd_pure 0
% 2.29/1.21 fd_pseudo 0
% 2.29/1.21 fd_cond 0
% 2.29/1.21 fd_pseudo_cond 0
% 2.29/1.21 AC symbols 0
% 2.29/1.21
% 2.29/1.21 ------ Schedule EPR non Horn non eq is on
% 2.29/1.21
% 2.29/1.21 ------ no equalities: superposition off
% 2.29/1.21
% 2.29/1.21 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21 ------
% 2.29/1.21 Current options:
% 2.29/1.21 ------
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21 ------ Proving...
% 2.29/1.21
% 2.29/1.21
% 2.29/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 2.29/1.21
% 2.29/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/1.21
% 2.29/1.21
%------------------------------------------------------------------------------