TSTP Solution File: KRS010-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS010-1 : TPTP v8.1.2. Released v2.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 : Fri May 3 02:33:26 EDT 2024
% Result : Unsatisfiable 1.78s 1.16s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 3 unt; 16 nHn; 49 RR)
% Number of literals : 181 ( 0 equ; 123 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_50,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(c_51,plain,
( ~ a(X0)
| c(X0)
| d(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_54,plain,
( ~ r(X0,X1)
| ~ r(X0,X2)
| ~ e(X0)
| ~ c(X1)
| ~ c(X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(c_55,plain,
( ~ e(X0)
| r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(c_56,plain,
( ~ r(X0,X1)
| ~ e(X0)
| a(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(c_67,plain,
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(c_68,plain,
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(c_69,plain,
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(c_70,plain,
( ~ r3least(X0)
| r(X0,u2r1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(c_71,plain,
( ~ r3least(X0)
| r(X0,u2r2(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(c_72,plain,
( ~ r3least(X0)
| r(X0,u2r3(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(c_79,plain,
( ~ r(X0,X1)
| ~ r(X0,X2)
| ~ d(X1)
| ~ d(X2)
| equalish(X1,X2)
| f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
cnf(c_80,plain,
( ~ e(exist)
| r3least(exist) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_83,plain,
( ~ r3least(exist)
| r(exist,u2r3(exist)) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_84,plain,
( ~ r3least(exist)
| r(exist,u2r2(exist)) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_85,plain,
( ~ r3least(exist)
| r(exist,u2r1(exist)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_87,plain,
( ~ equalish(u2r3(exist),u2r2(exist))
| ~ r3least(exist) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_88,plain,
( ~ equalish(u2r3(exist),u2r1(exist))
| ~ r3least(exist) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_89,plain,
( ~ equalish(u2r2(exist),u2r1(exist))
| ~ r3least(exist) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_1960,plain,
( ~ r(X0,u2r1(X0))
| ~ e(X0)
| a(u2r1(X0)) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1961,plain,
( ~ r(exist,u2r1(exist))
| ~ e(exist)
| a(u2r1(exist)) ),
inference(instantiation,[status(thm)],[c_1960]) ).
cnf(c_1962,plain,
( ~ r(X0,u2r2(X0))
| ~ e(X0)
| a(u2r2(X0)) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1963,plain,
( ~ r(exist,u2r2(exist))
| ~ e(exist)
| a(u2r2(exist)) ),
inference(instantiation,[status(thm)],[c_1962]) ).
cnf(c_1964,plain,
( ~ r(X0,u2r3(X0))
| ~ e(X0)
| a(u2r3(X0)) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1965,plain,
( ~ r(exist,u2r3(exist))
| ~ e(exist)
| a(u2r3(exist)) ),
inference(instantiation,[status(thm)],[c_1964]) ).
cnf(c_1966,plain,
( ~ a(u2r1(X0))
| c(u2r1(X0))
| d(u2r1(X0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1967,plain,
( ~ a(u2r1(exist))
| c(u2r1(exist))
| d(u2r1(exist)) ),
inference(instantiation,[status(thm)],[c_1966]) ).
cnf(c_1968,plain,
( ~ a(u2r2(X0))
| c(u2r2(X0))
| d(u2r2(X0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1969,plain,
( ~ a(u2r2(exist))
| c(u2r2(exist))
| d(u2r2(exist)) ),
inference(instantiation,[status(thm)],[c_1968]) ).
cnf(c_1970,plain,
( ~ a(u2r3(X0))
| c(u2r3(X0))
| d(u2r3(X0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1971,plain,
( ~ a(u2r3(exist))
| c(u2r3(exist))
| d(u2r3(exist)) ),
inference(instantiation,[status(thm)],[c_1970]) ).
cnf(c_1978,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,X2)
| ~ c(u2r2(X1))
| ~ e(X0)
| ~ c(X2)
| equalish(u2r2(X1),X2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1982,plain,
( ~ r(X0,u2r3(X1))
| ~ r(X0,X2)
| ~ c(u2r3(X1))
| ~ e(X0)
| ~ c(X2)
| equalish(u2r3(X1),X2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1984,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,u2r1(X1))
| ~ c(u2r2(X1))
| ~ c(u2r1(X1))
| ~ e(X0)
| equalish(u2r2(X1),u2r1(X1)) ),
inference(instantiation,[status(thm)],[c_1978]) ).
cnf(c_1985,plain,
( ~ r(exist,u2r2(exist))
| ~ r(exist,u2r1(exist))
| ~ c(u2r2(exist))
| ~ c(u2r1(exist))
| ~ e(exist)
| equalish(u2r2(exist),u2r1(exist)) ),
inference(instantiation,[status(thm)],[c_1984]) ).
cnf(c_1986,plain,
( ~ r(X0,u2r1(X1))
| ~ r(X0,u2r3(X1))
| ~ c(u2r1(X1))
| ~ c(u2r3(X1))
| ~ e(X0)
| equalish(u2r3(X1),u2r1(X1)) ),
inference(instantiation,[status(thm)],[c_1982]) ).
cnf(c_1987,plain,
( ~ r(exist,u2r1(exist))
| ~ r(exist,u2r3(exist))
| ~ c(u2r1(exist))
| ~ c(u2r3(exist))
| ~ e(exist)
| equalish(u2r3(exist),u2r1(exist)) ),
inference(instantiation,[status(thm)],[c_1986]) ).
cnf(c_1988,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,u2r3(X1))
| ~ c(u2r2(X1))
| ~ c(u2r3(X1))
| ~ e(X0)
| equalish(u2r3(X1),u2r2(X1)) ),
inference(instantiation,[status(thm)],[c_1982]) ).
cnf(c_1989,plain,
( ~ r(exist,u2r2(exist))
| ~ r(exist,u2r3(exist))
| ~ c(u2r2(exist))
| ~ c(u2r3(exist))
| ~ e(exist)
| equalish(u2r3(exist),u2r2(exist)) ),
inference(instantiation,[status(thm)],[c_1988]) ).
cnf(c_1999,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,X2)
| ~ d(u2r2(X1))
| ~ d(X2)
| equalish(u2r2(X1),X2)
| f(X0) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_2005,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,u2r1(X2))
| ~ d(u2r2(X1))
| ~ d(u2r1(X2))
| equalish(u2r2(X1),u2r1(X2))
| f(X0) ),
inference(instantiation,[status(thm)],[c_1999]) ).
cnf(c_2006,plain,
( ~ r(exist,u2r2(exist))
| ~ r(exist,u2r1(exist))
| ~ d(u2r2(exist))
| ~ d(u2r1(exist))
| equalish(u2r2(exist),u2r1(exist))
| f(exist) ),
inference(instantiation,[status(thm)],[c_2005]) ).
cnf(c_2019,plain,
( ~ r(X0,u2r3(X1))
| ~ r(X0,X2)
| ~ d(u2r3(X1))
| ~ d(X2)
| equalish(u2r3(X1),X2)
| f(X0) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_2021,plain,
( ~ r(X0,u2r1(X1))
| ~ r(X0,u2r3(X2))
| ~ d(u2r1(X1))
| ~ d(u2r3(X2))
| equalish(u2r3(X2),u2r1(X1))
| f(X0) ),
inference(instantiation,[status(thm)],[c_2019]) ).
cnf(c_2022,plain,
( ~ r(exist,u2r1(exist))
| ~ r(exist,u2r3(exist))
| ~ d(u2r1(exist))
| ~ d(u2r3(exist))
| equalish(u2r3(exist),u2r1(exist))
| f(exist) ),
inference(instantiation,[status(thm)],[c_2021]) ).
cnf(c_2029,plain,
( ~ r(X0,u2r2(X1))
| ~ r(X0,u2r3(X2))
| ~ d(u2r2(X1))
| ~ d(u2r3(X2))
| equalish(u2r3(X2),u2r2(X1))
| f(X0) ),
inference(instantiation,[status(thm)],[c_2019]) ).
cnf(c_2032,plain,
( ~ r(exist,u2r2(exist))
| ~ r(exist,u2r3(exist))
| ~ d(u2r2(exist))
| ~ d(u2r3(exist))
| equalish(u2r3(exist),u2r2(exist))
| f(exist) ),
inference(instantiation,[status(thm)],[c_2029]) ).
cnf(c_2033,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2032,c_2022,c_2006,c_1989,c_1987,c_1985,c_1971,c_1969,c_1967,c_1965,c_1963,c_1961,c_89,c_88,c_87,c_85,c_84,c_83,c_80,c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS010-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 22:52:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.78/1.16 % SZS status Started for theBenchmark.p
% 1.78/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.16
% 1.78/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.78/1.16
% 1.78/1.16 ------ iProver source info
% 1.78/1.16
% 1.78/1.16 git: date: 2024-05-02 19:28:25 +0000
% 1.78/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.78/1.16 git: non_committed_changes: false
% 1.78/1.16
% 1.78/1.16 ------ Parsing...successful
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.78/1.16
% 1.78/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.78/1.16 ------ Proving...
% 1.78/1.16 ------ Problem Properties
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16 clauses 31
% 1.78/1.16 conjectures 2
% 1.78/1.16 EPR 10
% 1.78/1.16 Horn 19
% 1.78/1.16 unary 2
% 1.78/1.16 binary 14
% 1.78/1.16 lits 95
% 1.78/1.16 lits eq 0
% 1.78/1.16 fd_pure 0
% 1.78/1.16 fd_pseudo 0
% 1.78/1.16 fd_cond 0
% 1.78/1.16 fd_pseudo_cond 0
% 1.78/1.16 AC symbols 0
% 1.78/1.16
% 1.78/1.16 ------ Schedule dynamic 5 is on
% 1.78/1.16
% 1.78/1.16 ------ no equalities: superposition off
% 1.78/1.16
% 1.78/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16 ------
% 1.78/1.16 Current options:
% 1.78/1.16 ------
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16 ------ Proving...
% 1.78/1.16
% 1.78/1.16
% 1.78/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.16
% 1.78/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.16
% 1.78/1.17
%------------------------------------------------------------------------------