TSTP Solution File: KRS258+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS258+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:00 EDT 2024
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 8 unt; 0 def)
% Number of atoms : 226 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 269 ( 101 ~; 92 |; 57 &)
% ( 8 <=>; 11 =>; 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 149 ( 4 sgn 72 !; 45 ?)
% 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(f6,axiom,
! [X0,X1] :
( ( ! [X3] :
( model(X3,X0)
<=> model(X3,X1) )
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,eqv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eqv) ).
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(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(eqv,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_eqv_thm) ).
fof(f34,negated_conjecture,
~ mighta(eqv,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X0)
<=> model(X2,X1) )
& ? [X3] : model(X3,X0) )
<=> status(X0,X1,eqv) ),
inference(rectify,[],[f6]) ).
fof(f46,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
inference(rectify,[],[f20]) ).
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(eqv,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(f99,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( model(X2,X0)
| ~ model(X2,X1) )
& ( model(X2,X1)
| ~ model(X2,X0) ) )
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,eqv) )
& ( status(X0,X1,eqv)
| ? [X2] :
( ( ~ model(X2,X1)
| ~ model(X2,X0) )
& ( model(X2,X1)
| model(X2,X0) ) )
| ! [X3] : ~ model(X3,X0) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f100,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( model(X2,X0)
| ~ model(X2,X1) )
& ( model(X2,X1)
| ~ model(X2,X0) ) )
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,eqv) )
& ( status(X0,X1,eqv)
| ? [X2] :
( ( ~ model(X2,X1)
| ~ model(X2,X0) )
& ( model(X2,X1)
| model(X2,X0) ) )
| ! [X3] : ~ model(X3,X0) ) ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( model(X2,X0)
| ~ model(X2,X1) )
& ( model(X2,X1)
| ~ model(X2,X0) ) )
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,eqv) )
& ( status(X0,X1,eqv)
| ? [X4] :
( ( ~ model(X4,X1)
| ~ model(X4,X0) )
& ( model(X4,X1)
| model(X4,X0) ) )
| ! [X5] : ~ model(X5,X0) ) ),
inference(rectify,[],[f100]) ).
fof(f102,plain,
! [X0] :
( ? [X3] : model(X3,X0)
=> model(sK10(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
! [X0,X1] :
( ? [X4] :
( ( ~ model(X4,X1)
| ~ model(X4,X0) )
& ( model(X4,X1)
| model(X4,X0) ) )
=> ( ( ~ model(sK11(X0,X1),X1)
| ~ model(sK11(X0,X1),X0) )
& ( model(sK11(X0,X1),X1)
| model(sK11(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( model(X2,X0)
| ~ model(X2,X1) )
& ( model(X2,X1)
| ~ model(X2,X0) ) )
& model(sK10(X0),X0) )
| ~ status(X0,X1,eqv) )
& ( status(X0,X1,eqv)
| ( ( ~ model(sK11(X0,X1),X1)
| ~ model(sK11(X0,X1),X0) )
& ( model(sK11(X0,X1),X1)
| model(sK11(X0,X1),X0) ) )
| ! [X5] : ~ model(X5,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f101,f103,f102]) ).
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(f218,plain,
! [X0,X1] :
( status(X0,X1,thm)
| model(sK9(X0,X1),X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f219,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f221,plain,
! [X0,X1,X5] :
( status(X0,X1,eqv)
| model(sK11(X0,X1),X1)
| model(sK11(X0,X1),X0)
| ~ model(X5,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f222,plain,
! [X0,X1,X5] :
( status(X0,X1,eqv)
| ~ model(sK11(X0,X1),X1)
| ~ model(sK11(X0,X1),X0)
| ~ model(X5,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( mighta(X0,X1)
| ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f290,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f298,plain,
~ mighta(eqv,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_64,plain,
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_68,plain,
( ~ model(sK11(X0,X1),X0)
| ~ model(sK11(X0,X1),X1)
| ~ model(X2,X0)
| status(X0,X1,eqv) ),
inference(cnf_transformation,[],[f222]) ).
cnf(c_69,plain,
( ~ model(X0,X1)
| model(sK11(X1,X2),X1)
| model(sK11(X1,X2),X2)
| status(X1,X2,eqv) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| ~ status(X0,X1,X3)
| mighta(X3,X2) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_138,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f290]) ).
cnf(c_142,negated_conjecture,
~ mighta(eqv,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_974,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,eqv) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1020,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,eqv) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
cnf(c_1750,plain,
( ~ status(X0_13,X1_13,thm)
| ~ status(X0_13,X1_13,eqv) ),
inference(subtyping,[status(esa)],[c_1020]) ).
cnf(c_1820,plain,
( ~ model(X0_15,X0_13)
| model(sK11(X0_13,X1_13),X0_13)
| model(sK11(X0_13,X1_13),X1_13)
| status(X0_13,X1_13,eqv) ),
inference(subtyping,[status(esa)],[c_69]) ).
cnf(c_1821,plain,
( ~ model(sK11(X0_13,X1_13),X0_13)
| ~ model(sK11(X0_13,X1_13),X1_13)
| ~ model(X0_15,X0_13)
| status(X0_13,X1_13,eqv) ),
inference(subtyping,[status(esa)],[c_68]) ).
cnf(c_1825,plain,
( model(sK9(X0_13,X1_13),X0_13)
| status(X0_13,X1_13,thm) ),
inference(subtyping,[status(esa)],[c_64]) ).
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_1869,plain,
( model(sK9(sK50,sK50),sK50)
| status(sK50,sK50,thm) ),
inference(instantiation,[status(thm)],[c_1825]) ).
cnf(c_1870,plain,
( ~ status(sK50,sK50,thm)
| ~ status(sK50,sK50,eqv) ),
inference(instantiation,[status(thm)],[c_1750]) ).
cnf(c_1880,plain,
( ~ model(sK9(sK50,sK50),sK50)
| status(sK50,sK50,thm) ),
inference(instantiation,[status(thm)],[c_1826]) ).
cnf(c_2122,plain,
( ~ model(sK11(sK50,X0_13),X0_13)
| ~ model(sK11(sK50,X0_13),sK50)
| ~ model(sK54,sK50)
| status(sK50,X0_13,eqv) ),
inference(instantiation,[status(thm)],[c_1821]) ).
cnf(c_2123,plain,
( ~ model(sK54,sK50)
| model(sK11(sK50,X0_13),X0_13)
| model(sK11(sK50,X0_13),sK50)
| status(sK50,X0_13,eqv) ),
inference(instantiation,[status(thm)],[c_1820]) ).
cnf(c_2126,plain,
( ~ model(sK54,sK50)
| model(sK11(sK50,sK50),sK50)
| status(sK50,sK50,eqv) ),
inference(instantiation,[status(thm)],[c_2123]) ).
cnf(c_2127,plain,
( ~ model(sK11(sK50,sK50),sK50)
| ~ model(sK54,sK50)
| status(sK50,sK50,eqv) ),
inference(instantiation,[status(thm)],[c_2122]) ).
cnf(c_2128,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2127,c_2126,c_1880,c_1870,c_1869,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS258+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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:56:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/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
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ 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
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 91
% 0.48/1.16 conjectures 0
% 0.48/1.16 EPR 39
% 0.48/1.16 Horn 72
% 0.48/1.16 unary 13
% 0.48/1.16 binary 47
% 0.48/1.16 lits 220
% 0.48/1.16 lits eq 0
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 3.34/1.16 fd_cond 0
% 3.34/1.16 fd_pseudo_cond 0
% 3.34/1.16 AC symbols 0
% 3.34/1.16
% 3.34/1.16 ------ Input Options Time Limit: Unbounded
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 ------
% 3.34/1.16 Current options:
% 3.34/1.16 ------
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 ------ Proving...
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 % SZS status Theorem for theBenchmark.p
% 3.34/1.16
% 3.34/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.34/1.16
% 3.34/1.16
%------------------------------------------------------------------------------