TSTP Solution File: KRS111+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS111+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:39 EDT 2024
% Result : Unsatisfiable 2.37s 1.20s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 8 unt; 0 def)
% Number of atoms : 250 ( 21 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 276 ( 109 ~; 97 |; 50 &)
% ( 7 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 160 ( 4 sgn 95 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f24,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( cp(X4)
& rf(X3,X4) )
& ? [X4] :
( cowlThing(X4)
& rs(X3,X4) )
& ? [X4] :
( cpxcomp(X4)
& rf1(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f25,axiom,
! [X3] :
( cp(X3)
<=> ~ ? [X4] : ra_Px1(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f26,axiom,
! [X3] :
( cpxcomp(X3)
<=> ? [X5] : ra_Px1(X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f27,axiom,
! [X3,X4,X6] :
( ( rf(X3,X6)
& rf(X3,X4) )
=> X4 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f28,axiom,
! [X3,X4,X6] :
( ( rf1(X3,X6)
& rf1(X3,X4) )
=> X4 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f33,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f34,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f35,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf1(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( cpxcomp(X3)
& rf1(X0,X3) ) ) ),
inference(rectify,[],[f24]) ).
fof(f39,plain,
! [X0] :
( cp(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f25]) ).
fof(f40,plain,
! [X0] :
( cpxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f26]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f27]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f28]) ).
fof(f47,plain,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
inference(rectify,[],[f34]) ).
fof(f48,plain,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
inference(rectify,[],[f35]) ).
fof(f91,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f92,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f93,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f95,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f98,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f99,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f101,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( ~ cpxcomp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( cpxcomp(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f102,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( ~ cpxcomp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( cpxcomp(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( ~ cpxcomp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X4] :
( cp(X4)
& rf(X0,X4) )
& ? [X5] :
( cowlThing(X5)
& rs(X0,X5) )
& ? [X6] :
( cpxcomp(X6)
& rf1(X0,X6) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f102]) ).
fof(f104,plain,
! [X0] :
( ? [X4] :
( cp(X4)
& rf(X0,X4) )
=> ( cp(sK0(X0))
& rf(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0] :
( ? [X5] :
( cowlThing(X5)
& rs(X0,X5) )
=> ( cowlThing(sK1(X0))
& rs(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
! [X0] :
( ? [X6] :
( cpxcomp(X6)
& rf1(X0,X6) )
=> ( cpxcomp(sK2(X0))
& rf1(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( ~ cpxcomp(X3)
| ~ rf1(X0,X3) ) )
& ( ( cp(sK0(X0))
& rf(X0,sK0(X0))
& cowlThing(sK1(X0))
& rs(X0,sK1(X0))
& cpxcomp(sK2(X0))
& rf1(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f103,f106,f105,f104]) ).
fof(f108,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) ) ),
inference(nnf_transformation,[],[f91]) ).
fof(f109,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(rectify,[],[f108]) ).
fof(f110,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
! [X0] :
( ( cp(X0)
| ra_Px1(X0,sK3(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f109,f110]) ).
fof(f112,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f113,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X2] : ra_Px1(X0,X2)
| ~ cpxcomp(X0) ) ),
inference(rectify,[],[f112]) ).
fof(f114,plain,
! [X0] :
( ? [X2] : ra_Px1(X0,X2)
=> ra_Px1(X0,sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ra_Px1(X0,sK4(X0))
| ~ cpxcomp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f113,f114]) ).
fof(f144,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f145,plain,
! [X0] :
( cpxcomp(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f146,plain,
! [X0] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f148,plain,
! [X0] :
( rf(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f149,plain,
! [X0] :
( cp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f151,plain,
! [X2,X0] :
( ~ ra_Px1(X0,X2)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f153,plain,
! [X0] :
( ra_Px1(X0,sK4(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f155,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f156,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f164,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(cnf_transformation,[],[f33]) ).
fof(f165,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f166,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_54,plain,
( ~ cUnsatisfiable(X0)
| cp(sK0(X0)) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_55,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f148]) ).
cnf(c_57,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| cpxcomp(sK2(X0)) ),
inference(cnf_transformation,[],[f145]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_61,plain,
( ~ ra_Px1(X0,X1)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_63,plain,
( ~ cpxcomp(X0)
| ra_Px1(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_64,plain,
( ~ rf(X0,X1)
| ~ rf(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f155]) ).
cnf(c_65,plain,
( ~ rf1(X0,X1)
| ~ rf1(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_73,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(cnf_transformation,[],[f164]) ).
cnf(c_74,plain,
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f165]) ).
cnf(c_75,plain,
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_105,plain,
( ~ cUnsatisfiable(X0)
| cp(sK0(X0)) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
cnf(c_121,plain,
( ~ cp(X0)
| ~ ra_Px1(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_122,plain,
( ~ ra_Px1(X0,X1)
| ~ cp(X0) ),
inference(renaming,[status(thm)],[c_121]) ).
cnf(c_129,plain,
( ~ cpxcomp(X0)
| ra_Px1(X0,sK4(X0)) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
cnf(c_469,plain,
( sK4(X1) != X2
| X0 != X1
| ~ cp(X0)
| ~ cpxcomp(X1) ),
inference(resolution_lifted,[status(thm)],[c_122,c_129]) ).
cnf(c_470,plain,
( ~ cp(X0)
| ~ cpxcomp(X0) ),
inference(unflattening,[status(thm)],[c_469]) ).
cnf(c_524,plain,
( sK0(X0) != X1
| ~ cUnsatisfiable(X0)
| ~ cpxcomp(X1) ),
inference(resolution_lifted,[status(thm)],[c_105,c_470]) ).
cnf(c_525,plain,
( ~ cpxcomp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(unflattening,[status(thm)],[c_524]) ).
cnf(c_526,plain,
( ~ cpxcomp(sK0(i2003_11_14_17_21_15425))
| ~ cUnsatisfiable(i2003_11_14_17_21_15425) ),
inference(instantiation,[status(thm)],[c_525]) ).
cnf(c_1676,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(superposition,[status(thm)],[c_57,c_74]) ).
cnf(c_1684,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK1(X0)) ),
inference(superposition,[status(thm)],[c_57,c_75]) ).
cnf(c_1694,plain,
( ~ rf(X0,X1)
| ~ cUnsatisfiable(X0)
| sK0(X0) = X1 ),
inference(superposition,[status(thm)],[c_55,c_64]) ).
cnf(c_1746,plain,
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK1(X0) ),
inference(superposition,[status(thm)],[c_1676,c_1694]) ).
cnf(c_1754,plain,
sK0(i2003_11_14_17_21_15425) = sK1(i2003_11_14_17_21_15425),
inference(superposition,[status(thm)],[c_73,c_1746]) ).
cnf(c_1755,plain,
( ~ cUnsatisfiable(i2003_11_14_17_21_15425)
| rf1(i2003_11_14_17_21_15425,sK0(i2003_11_14_17_21_15425)) ),
inference(superposition,[status(thm)],[c_1754,c_1684]) ).
cnf(c_1760,plain,
rf1(i2003_11_14_17_21_15425,sK0(i2003_11_14_17_21_15425)),
inference(forward_subsumption_resolution,[status(thm)],[c_1755,c_73]) ).
cnf(c_1772,plain,
( ~ rf1(i2003_11_14_17_21_15425,X0)
| sK0(i2003_11_14_17_21_15425) = X0 ),
inference(superposition,[status(thm)],[c_1760,c_65]) ).
cnf(c_1793,plain,
( ~ cUnsatisfiable(i2003_11_14_17_21_15425)
| sK0(i2003_11_14_17_21_15425) = sK2(i2003_11_14_17_21_15425) ),
inference(superposition,[status(thm)],[c_59,c_1772]) ).
cnf(c_1796,plain,
sK0(i2003_11_14_17_21_15425) = sK2(i2003_11_14_17_21_15425),
inference(forward_subsumption_resolution,[status(thm)],[c_1793,c_73]) ).
cnf(c_1798,plain,
( ~ cUnsatisfiable(i2003_11_14_17_21_15425)
| cpxcomp(sK0(i2003_11_14_17_21_15425)) ),
inference(superposition,[status(thm)],[c_1796,c_58]) ).
cnf(c_1799,plain,
cpxcomp(sK0(i2003_11_14_17_21_15425)),
inference(forward_subsumption_resolution,[status(thm)],[c_1798,c_73]) ).
cnf(c_1800,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1799,c_526,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS111+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n012.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 May 2 22:31:25 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/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
% 2.37/1.20 % SZS status Started for theBenchmark.p
% 2.37/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.37/1.20
% 2.37/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.37/1.20
% 2.37/1.20 ------ iProver source info
% 2.37/1.20
% 2.37/1.20 git: date: 2024-05-02 19:28:25 +0000
% 2.37/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.37/1.20 git: non_committed_changes: false
% 2.37/1.20
% 2.37/1.20 ------ Parsing...
% 2.37/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.37/1.20
% 2.37/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 2.37/1.20
% 2.37/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.37/1.20
% 2.37/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.37/1.20 ------ Proving...
% 2.37/1.20 ------ Problem Properties
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20 clauses 14
% 2.37/1.20 conjectures 0
% 2.37/1.20 EPR 9
% 2.37/1.20 Horn 13
% 2.37/1.20 unary 1
% 2.37/1.20 binary 9
% 2.37/1.20 lits 34
% 2.37/1.20 lits eq 3
% 2.37/1.20 fd_pure 0
% 2.37/1.20 fd_pseudo 0
% 2.37/1.20 fd_cond 0
% 2.37/1.20 fd_pseudo_cond 3
% 2.37/1.20 AC symbols 0
% 2.37/1.20
% 2.37/1.20 ------ Schedule dynamic 5 is on
% 2.37/1.20
% 2.37/1.20 ------ no conjectures: strip conj schedule
% 2.37/1.20
% 2.37/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20 ------
% 2.37/1.20 Current options:
% 2.37/1.20 ------
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20 ------ Proving...
% 2.37/1.20
% 2.37/1.20
% 2.37/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.37/1.20
% 2.37/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.37/1.20
% 2.37/1.20
%------------------------------------------------------------------------------