TSTP Solution File: KRS073+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS073+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:32 EDT 2024
% Result : Unsatisfiable 2.50s 1.18s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 6 unt; 0 def)
% Number of atoms : 239 ( 9 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 279 ( 104 ~; 93 |; 61 &)
% ( 9 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 143 ( 0 sgn 90 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ~ cp(X3)
& ? [X4] :
( ! [X5] :
( rinvF(X4,X5)
=> ? [X6] :
( cp(X6)
& rs(X5,X6) ) )
& ! [X5] :
( rinvS(X4,X5)
=> cp(X5) )
& rf(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X3,X4,X5] :
( ( rf(X3,X5)
& rf(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f24,axiom,
! [X3,X4] :
( rinvF(X3,X4)
<=> rf(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f26,axiom,
! [X3,X4] :
( rinvS(X3,X4)
<=> rs(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f30,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f33,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ~ cp(X0)
& ? [X1] :
( ! [X2] :
( rinvF(X1,X2)
=> ? [X3] :
( cp(X3)
& rs(X2,X3) ) )
& ! [X4] :
( rinvS(X1,X4)
=> cp(X4) )
& rf(X0,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f22]) ).
fof(f36,plain,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
inference(rectify,[],[f24]) ).
fof(f38,plain,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
inference(rectify,[],[f26]) ).
fof(f41,plain,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
inference(rectify,[],[f30]) ).
fof(f78,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ~ cp(X0)
& ? [X1] :
( ! [X2] :
( ? [X3] :
( cp(X3)
& rs(X2,X3) )
| ~ rinvF(X1,X2) )
& ! [X4] :
( cp(X4)
| ~ rinvS(X1,X4) )
& rf(X0,X1) ) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f79,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f80,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(flattening,[],[f79]) ).
fof(f86,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f87,plain,
! [X0] :
( sP0(X0)
<=> ( ~ cp(X0)
& ? [X1] :
( ! [X2] :
( ? [X3] :
( cp(X3)
& rs(X2,X3) )
| ~ rinvF(X1,X2) )
& ! [X4] :
( cp(X4)
| ~ rinvS(X1,X4) )
& rf(X0,X1) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f88,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f78,f87]) ).
fof(f90,plain,
! [X0] :
( ( sP0(X0)
| cp(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rs(X2,X3) )
& rinvF(X1,X2) )
| ? [X4] :
( ~ cp(X4)
& rinvS(X1,X4) )
| ~ rf(X0,X1) ) )
& ( ( ~ cp(X0)
& ? [X1] :
( ! [X2] :
( ? [X3] :
( cp(X3)
& rs(X2,X3) )
| ~ rinvF(X1,X2) )
& ! [X4] :
( cp(X4)
| ~ rinvS(X1,X4) )
& rf(X0,X1) ) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f87]) ).
fof(f91,plain,
! [X0] :
( ( sP0(X0)
| cp(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rs(X2,X3) )
& rinvF(X1,X2) )
| ? [X4] :
( ~ cp(X4)
& rinvS(X1,X4) )
| ~ rf(X0,X1) ) )
& ( ( ~ cp(X0)
& ? [X1] :
( ! [X2] :
( ? [X3] :
( cp(X3)
& rs(X2,X3) )
| ~ rinvF(X1,X2) )
& ! [X4] :
( cp(X4)
| ~ rinvS(X1,X4) )
& rf(X0,X1) ) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f90]) ).
fof(f92,plain,
! [X0] :
( ( sP0(X0)
| cp(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rs(X2,X3) )
& rinvF(X1,X2) )
| ? [X4] :
( ~ cp(X4)
& rinvS(X1,X4) )
| ~ rf(X0,X1) ) )
& ( ( ~ cp(X0)
& ? [X5] :
( ! [X6] :
( ? [X7] :
( cp(X7)
& rs(X6,X7) )
| ~ rinvF(X5,X6) )
& ! [X8] :
( cp(X8)
| ~ rinvS(X5,X8) )
& rf(X0,X5) ) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f91]) ).
fof(f93,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rs(X2,X3) )
& rinvF(X1,X2) )
=> ( ! [X3] :
( ~ cp(X3)
| ~ rs(sK1(X1),X3) )
& rinvF(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
! [X1] :
( ? [X4] :
( ~ cp(X4)
& rinvS(X1,X4) )
=> ( ~ cp(sK2(X1))
& rinvS(X1,sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
! [X0] :
( ? [X5] :
( ! [X6] :
( ? [X7] :
( cp(X7)
& rs(X6,X7) )
| ~ rinvF(X5,X6) )
& ! [X8] :
( cp(X8)
| ~ rinvS(X5,X8) )
& rf(X0,X5) )
=> ( ! [X6] :
( ? [X7] :
( cp(X7)
& rs(X6,X7) )
| ~ rinvF(sK3(X0),X6) )
& ! [X8] :
( cp(X8)
| ~ rinvS(sK3(X0),X8) )
& rf(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
! [X6] :
( ? [X7] :
( cp(X7)
& rs(X6,X7) )
=> ( cp(sK4(X6))
& rs(X6,sK4(X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f97,plain,
! [X0] :
( ( sP0(X0)
| cp(X0)
| ! [X1] :
( ( ! [X3] :
( ~ cp(X3)
| ~ rs(sK1(X1),X3) )
& rinvF(X1,sK1(X1)) )
| ( ~ cp(sK2(X1))
& rinvS(X1,sK2(X1)) )
| ~ rf(X0,X1) ) )
& ( ( ~ cp(X0)
& ! [X6] :
( ( cp(sK4(X6))
& rs(X6,sK4(X6)) )
| ~ rinvF(sK3(X0),X6) )
& ! [X8] :
( cp(X8)
| ~ rinvS(sK3(X0),X8) )
& rf(X0,sK3(X0)) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f92,f96,f95,f94,f93]) ).
fof(f98,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f88]) ).
fof(f99,plain,
! [X0,X1] :
( ( rinvF(X0,X1)
| ~ rf(X1,X0) )
& ( rf(X1,X0)
| ~ rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f101,plain,
! [X0,X1] :
( ( rinvS(X0,X1)
| ~ rs(X1,X0) )
& ( rs(X1,X0)
| ~ rinvS(X0,X1) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f124,plain,
! [X0] :
( rf(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f125,plain,
! [X0,X8] :
( cp(X8)
| ~ rinvS(sK3(X0),X8)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f126,plain,
! [X0,X6] :
( rs(X6,sK4(X6))
| ~ rinvF(sK3(X0),X6)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f128,plain,
! [X0] :
( ~ cp(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f133,plain,
! [X0] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f135,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f138,plain,
! [X0,X1] :
( rinvF(X0,X1)
| ~ rf(X1,X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f142,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f144,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(cnf_transformation,[],[f28]) ).
fof(f146,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_57,plain,
( ~ sP0(X0)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_59,plain,
( ~ rinvF(sK3(X0),X1)
| ~ sP0(X0)
| rs(X1,sK4(X1)) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_60,plain,
( ~ rinvS(sK3(X0),X1)
| ~ sP0(X0)
| cp(X1) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_61,plain,
( ~ sP0(X0)
| rf(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_63,plain,
( ~ cUnsatisfiable(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_64,plain,
( ~ rf(X0,X1)
| ~ rf(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_66,plain,
( ~ rf(X0,X1)
| rinvF(X1,X0) ),
inference(cnf_transformation,[],[f138]) ).
cnf(c_70,plain,
( ~ rs(X0,X1)
| rinvS(X1,X0) ),
inference(cnf_transformation,[],[f142]) ).
cnf(c_73,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(cnf_transformation,[],[f144]) ).
cnf(c_75,plain,
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_79,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| sP0(i2003_11_14_17_18_54369) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_80,plain,
( ~ sP0(i2003_11_14_17_18_54369)
| ~ cp(i2003_11_14_17_18_54369) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_91,plain,
( ~ rinvS(sK3(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369)
| ~ sP0(i2003_11_14_17_18_54369)
| cp(i2003_11_14_17_18_54369) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_105,plain,
( ~ cUnsatisfiable(X0)
| sP0(X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
cnf(c_115,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK3(X0)) ),
inference(prop_impl_just,[status(thm)],[c_63,c_61]) ).
cnf(c_201,plain,
( ~ rinvF(sK3(X0),X1)
| ~ cUnsatisfiable(X0)
| rs(X1,sK4(X1)) ),
inference(bin_hyper_res,[status(thm)],[c_59,c_105]) ).
cnf(c_2732,plain,
( ~ cUnsatisfiable(X0)
| rinvF(sK3(X0),X0) ),
inference(superposition,[status(thm)],[c_115,c_66]) ).
cnf(c_2742,plain,
( ~ rf(X0,X1)
| ~ cUnsatisfiable(X0)
| sK3(X0) = X1 ),
inference(superposition,[status(thm)],[c_115,c_64]) ).
cnf(c_2798,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK4(X0)) ),
inference(superposition,[status(thm)],[c_2732,c_201]) ).
cnf(c_2807,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK4(X0)) ),
inference(superposition,[status(thm)],[c_2798,c_75]) ).
cnf(c_2809,plain,
( ~ cUnsatisfiable(X0)
| rinvS(sK4(X0),X0) ),
inference(superposition,[status(thm)],[c_2798,c_70]) ).
cnf(c_2863,plain,
( ~ cUnsatisfiable(X0)
| sK4(X0) = sK3(X0) ),
inference(superposition,[status(thm)],[c_2807,c_2742]) ).
cnf(c_2924,plain,
sK4(i2003_11_14_17_18_54369) = sK3(i2003_11_14_17_18_54369),
inference(superposition,[status(thm)],[c_73,c_2863]) ).
cnf(c_2926,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| rinvS(sK3(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369) ),
inference(superposition,[status(thm)],[c_2924,c_2809]) ).
cnf(c_2937,plain,
rinvS(sK3(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369),
inference(forward_subsumption_resolution,[status(thm)],[c_2926,c_73]) ).
cnf(c_2939,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2937,c_91,c_80,c_79,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS073+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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:53:01 EDT 2024
% 0.13/0.35 % 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
% 2.50/1.18 % SZS status Started for theBenchmark.p
% 2.50/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.18
% 2.50/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.50/1.18
% 2.50/1.18 ------ iProver source info
% 2.50/1.18
% 2.50/1.18 git: date: 2024-05-02 19:28:25 +0000
% 2.50/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.50/1.18 git: non_committed_changes: false
% 2.50/1.18
% 2.50/1.18 ------ Parsing...
% 2.50/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.50/1.18
% 2.50/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.50/1.18
% 2.50/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.50/1.18
% 2.50/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.50/1.18 ------ Proving...
% 2.50/1.18 ------ Problem Properties
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18 clauses 19
% 2.50/1.18 conjectures 0
% 2.50/1.18 EPR 11
% 2.50/1.18 Horn 15
% 2.50/1.18 unary 1
% 2.50/1.18 binary 8
% 2.50/1.18 lits 57
% 2.50/1.18 lits eq 3
% 2.50/1.18 fd_pure 0
% 2.50/1.18 fd_pseudo 0
% 2.50/1.18 fd_cond 0
% 2.50/1.18 fd_pseudo_cond 3
% 2.50/1.18 AC symbols 0
% 2.50/1.18
% 2.50/1.18 ------ Schedule dynamic 5 is on
% 2.50/1.18
% 2.50/1.18 ------ no conjectures: strip conj schedule
% 2.50/1.18
% 2.50/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18 ------
% 2.50/1.18 Current options:
% 2.50/1.18 ------
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18 ------ Proving...
% 2.50/1.18
% 2.50/1.18
% 2.50/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.18
% 2.50/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.18
% 2.50/1.18
%------------------------------------------------------------------------------