TSTP Solution File: KRS263+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS263+1 : TPTP v8.1.2. Bugfixed v5.4.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:34:01 EDT 2024
% Result : Theorem 3.96s 1.10s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 63 ( 22 unt; 0 def)
% Number of atoms : 189 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 211 ( 85 ~; 54 |; 53 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 162 ( 11 sgn 78 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
fof(f11,axiom,
! [X0,X1] :
( ( ! [X4] : model(X4,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,wtc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wtc) ).
fof(f20,axiom,
! [X6,X7] :
( ? [X0,X1] :
( status(X0,X1,X7)
& status(X0,X1,X6) )
<=> mighta(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta) ).
fof(f27,axiom,
? [X9] :
! [X8] : model(X8,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tautology) ).
fof(f31,axiom,
? [X0,X1] :
( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( model(X4,X1)
& ~ model(X4,X0) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mixed_pair) ).
fof(f33,conjecture,
mighta(wtc,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_wtc_thm) ).
fof(f34,negated_conjecture,
~ mighta(wtc,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f39,plain,
! [X0,X1] :
( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
<=> status(X0,X1,wtc) ),
inference(rectify,[],[f11]) ).
fof(f46,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f53,plain,
? [X0] :
! [X1] : model(X1,X0),
inference(rectify,[],[f27]) ).
fof(f57,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X0)
=> model(X4,X1) )
& ? [X5] : model(X5,X0) ),
inference(rectify,[],[f31]) ).
fof(f59,plain,
~ mighta(wtc,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
=> mighta(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f63,plain,
! [X0,X1] :
( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f70,plain,
! [X0,X1] :
( mighta(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f71,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f95,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X2] :
( ~ model(X2,X1)
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f96,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) ) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0,X1] :
( ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) )
=> ( ~ model(sK9(X0,X1),X1)
& model(sK9(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ( ~ model(sK9(X0,X1),X1)
& model(sK9(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f96,f97]) ).
fof(f129,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : model(X3,X0)
| ! [X4] : ~ model(X4,X0) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f130,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : model(X3,X0)
| ! [X4] : ~ model(X4,X0) ) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X5] : ~ model(X5,X1)
| ! [X6] : model(X6,X0)
| ! [X7] : ~ model(X7,X0) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0] :
( ? [X3] : ~ model(X3,X0)
=> ~ model(sK21(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
! [X0] :
( ? [X4] : model(X4,X0)
=> model(sK22(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
! [X1] :
( ? [X5] : ~ model(X5,X1)
=> ~ model(sK23(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ~ model(sK21(X0),X0)
& model(sK22(X0),X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ~ model(sK23(X1),X1)
| ! [X6] : model(X6,X0)
| ! [X7] : ~ model(X7,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23])],[f131,f134,f133,f132]) ).
fof(f185,plain,
( ? [X0] :
! [X1] : model(X1,X0)
=> ! [X1] : model(X1,sK41) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
! [X1] : model(X1,sK41),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41])],[f53,f185]) ).
fof(f197,plain,
( ? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
=> ( ? [X2] : ~ model(X2,sK51)
& ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& ? [X5] : model(X5,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
( ? [X2] : ~ model(X2,sK51)
=> ~ model(sK52,sK51) ),
introduced(choice_axiom,[]) ).
fof(f199,plain,
( ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
=> ( model(sK53,sK51)
& ~ model(sK53,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f200,plain,
( ? [X5] : model(X5,sK50)
=> model(sK54,sK50) ),
introduced(choice_axiom,[]) ).
fof(f201,plain,
( ~ model(sK52,sK51)
& model(sK53,sK51)
& ~ model(sK53,sK50)
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& model(sK54,sK50) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK50,sK51,sK52,sK53,sK54])],[f71,f200,f199,f198,f197]) ).
fof(f219,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f244,plain,
! [X0,X1,X6,X7] :
( status(X0,X1,wtc)
| ~ model(sK23(X1),X1)
| model(X6,X0)
| ~ model(X7,X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( mighta(X0,X1)
| ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f283,plain,
! [X1] : model(X1,sK41),
inference(cnf_transformation,[],[f186]) ).
fof(f290,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f292,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f298,plain,
~ mighta(wtc,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_91,plain,
( ~ model(sK23(X0),X0)
| ~ model(X1,X2)
| status(X2,X0,wtc)
| model(X3,X2) ),
inference(cnf_transformation,[],[f244]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| ~ status(X0,X1,X3)
| mighta(X3,X2) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_127,plain,
model(X0,sK41),
inference(cnf_transformation,[],[f283]) ).
cnf(c_136,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f292]) ).
cnf(c_138,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f290]) ).
cnf(c_142,negated_conjecture,
~ mighta(wtc,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_974,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wtc) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1020,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wtc) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
cnf(c_1750,plain,
( ~ status(X0_13,X1_13,thm)
| ~ status(X0_13,X1_13,wtc) ),
inference(subtyping,[status(esa)],[c_1020]) ).
cnf(c_1756,plain,
model(sK54,sK50),
inference(subtyping,[status(esa)],[c_138]) ).
cnf(c_1758,plain,
~ model(sK53,sK50),
inference(subtyping,[status(esa)],[c_136]) ).
cnf(c_1767,plain,
model(X0_15,sK41),
inference(subtyping,[status(esa)],[c_127]) ).
cnf(c_1798,plain,
( ~ model(sK23(X0_13),X0_13)
| ~ model(X0_15,X1_13)
| status(X1_13,X0_13,wtc)
| model(X1_15,X1_13) ),
inference(subtyping,[status(esa)],[c_91]) ).
cnf(c_1826,plain,
( ~ model(sK9(X0_13,X1_13),X1_13)
| status(X0_13,X1_13,thm) ),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_3138,plain,
( ~ model(X0_15,X0_13)
| status(X0_13,sK41,wtc)
| model(X1_15,X0_13) ),
inference(resolution,[status(thm)],[c_1798,c_1767]) ).
cnf(c_3153,plain,
( status(sK50,sK41,wtc)
| model(X0_15,sK50) ),
inference(resolution,[status(thm)],[c_3138,c_1756]) ).
cnf(c_3572,plain,
status(X0_13,sK41,thm),
inference(superposition,[status(thm)],[c_1767,c_1826]) ).
cnf(c_3735,plain,
status(sK50,sK41,wtc),
inference(resolution,[status(thm)],[c_1758,c_3153]) ).
cnf(c_3823,plain,
~ status(X0_13,sK41,wtc),
inference(superposition,[status(thm)],[c_3572,c_1750]) ).
cnf(c_3824,plain,
~ status(sK50,sK41,wtc),
inference(instantiation,[status(thm)],[c_3823]) ).
cnf(c_3825,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3824,c_3735]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KRS263+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.02/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 22:54:17 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 3.96/1.10 % SZS status Started for theBenchmark.p
% 3.96/1.10 % SZS status Theorem for theBenchmark.p
% 3.96/1.10
% 3.96/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.96/1.10
% 3.96/1.10 ------ iProver source info
% 3.96/1.10
% 3.96/1.10 git: date: 2024-05-02 19:28:25 +0000
% 3.96/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.96/1.10 git: non_committed_changes: false
% 3.96/1.10
% 3.96/1.10 ------ Parsing...
% 3.96/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.96/1.10
% 3.96/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.96/1.10
% 3.96/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.96/1.10 ------ Proving...
% 3.96/1.10 ------ Problem Properties
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10 clauses 91
% 3.96/1.10 conjectures 0
% 3.96/1.10 EPR 39
% 3.96/1.10 Horn 72
% 3.96/1.10 unary 13
% 3.96/1.10 binary 47
% 3.96/1.10 lits 220
% 3.96/1.10 lits eq 0
% 3.96/1.10 fd_pure 0
% 3.96/1.10 fd_pseudo 0
% 3.96/1.10 fd_cond 0
% 3.96/1.10 fd_pseudo_cond 0
% 3.96/1.10 AC symbols 0
% 3.96/1.10
% 3.96/1.10 ------ Input Options Time Limit: Unbounded
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10 ------
% 3.96/1.10 Current options:
% 3.96/1.10 ------
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10 ------ Proving...
% 3.96/1.10
% 3.96/1.10
% 3.96/1.10 % SZS status Theorem for theBenchmark.p
% 3.96/1.10
% 3.96/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.10
% 3.96/1.10
%------------------------------------------------------------------------------