TSTP Solution File: KRS259+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS259+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 3.52s 1.11s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 66 ( 13 unt; 0 def)
% Number of atoms : 197 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 223 ( 92 ~; 68 |; 42 &)
% ( 11 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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; 5 con; 0-2 aty)
% Number of variables : 194 ( 10 sgn 118 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
fof(f7,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,tac) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tac) ).
fof(f13,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cax) ).
fof(f16,axiom,
! [X0,X1] :
( ( ? [X4] : ~ model(X4,X1)
& ? [X3] : model(X3,X1)
& ~ ? [X2] : model(X2,X0) )
<=> status(X0,X1,wca) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wca) ).
fof(f20,axiom,
! [X6,X7] :
( ? [X0,X1] :
( status(X0,X1,X7)
& status(X0,X1,X6) )
<=> mighta(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta) ).
fof(f27,axiom,
? [X9] :
! [X8] : model(X8,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tautology) ).
fof(f33,conjecture,
mighta(tac,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_tac_thm) ).
fof(f34,negated_conjecture,
~ mighta(tac,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( ( ! [X2] : model(X2,X1)
& ? [X3] : model(X3,X0) )
<=> status(X0,X1,tac) ),
inference(rectify,[],[f7]) ).
fof(f43,plain,
! [X0,X1] :
( ( ? [X2] : ~ model(X2,X1)
& ? [X3] : model(X3,X1)
& ~ ? [X4] : model(X4,X0) )
<=> status(X0,X1,wca) ),
inference(rectify,[],[f16]) ).
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(f59,plain,
~ mighta(tac,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(f66,plain,
! [X0,X1] :
( ! [X2] : ~ model(X2,X0)
<=> status(X0,X1,cax) ),
inference(ennf_transformation,[],[f13]) ).
fof(f69,plain,
! [X0,X1] :
( ( ? [X2] : ~ model(X2,X1)
& ? [X3] : model(X3,X1)
& ! [X4] : ~ model(X4,X0) )
<=> status(X0,X1,wca) ),
inference(ennf_transformation,[],[f43]) ).
fof(f70,plain,
! [X0,X1] :
( mighta(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
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(f105,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,tac) )
& ( status(X0,X1,tac)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : ~ model(X3,X0) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f106,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,tac) )
& ( status(X0,X1,tac)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : ~ model(X3,X0) ) ),
inference(flattening,[],[f105]) ).
fof(f107,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : model(X3,X0) )
| ~ status(X0,X1,tac) )
& ( status(X0,X1,tac)
| ? [X4] : ~ model(X4,X1)
| ! [X5] : ~ model(X5,X0) ) ),
inference(rectify,[],[f106]) ).
fof(f108,plain,
! [X0] :
( ? [X3] : model(X3,X0)
=> model(sK12(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
! [X1] :
( ? [X4] : ~ model(X4,X1)
=> ~ model(sK13(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& model(sK12(X0),X0) )
| ~ status(X0,X1,tac) )
& ( status(X0,X1,tac)
| ~ model(sK13(X1),X1)
| ! [X5] : ~ model(X5,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f107,f109,f108]) ).
fof(f144,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X2] : model(X2,X0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f145,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X3] : model(X3,X0) ) ),
inference(rectify,[],[f144]) ).
fof(f146,plain,
! [X0] :
( ? [X3] : model(X3,X0)
=> model(sK28(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| model(sK28(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28])],[f145,f146]) ).
fof(f160,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] : model(X3,X1)
& ! [X4] : ~ model(X4,X0) )
| ~ status(X0,X1,wca) )
& ( status(X0,X1,wca)
| ! [X2] : model(X2,X1)
| ! [X3] : ~ model(X3,X1)
| ? [X4] : model(X4,X0) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f161,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] : model(X3,X1)
& ! [X4] : ~ model(X4,X0) )
| ~ status(X0,X1,wca) )
& ( status(X0,X1,wca)
| ! [X2] : model(X2,X1)
| ! [X3] : ~ model(X3,X1)
| ? [X4] : model(X4,X0) ) ),
inference(flattening,[],[f160]) ).
fof(f162,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] : model(X3,X1)
& ! [X4] : ~ model(X4,X0) )
| ~ status(X0,X1,wca) )
& ( status(X0,X1,wca)
| ! [X5] : model(X5,X1)
| ! [X6] : ~ model(X6,X1)
| ? [X7] : model(X7,X0) ) ),
inference(rectify,[],[f161]) ).
fof(f163,plain,
! [X1] :
( ? [X2] : ~ model(X2,X1)
=> ~ model(sK33(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X1] :
( ? [X3] : model(X3,X1)
=> model(sK34(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
! [X0] :
( ? [X7] : model(X7,X0)
=> model(sK35(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1] :
( ( ( ~ model(sK33(X1),X1)
& model(sK34(X1),X1)
& ! [X4] : ~ model(X4,X0) )
| ~ status(X0,X1,wca) )
& ( status(X0,X1,wca)
| ! [X5] : model(X5,X1)
| ! [X6] : ~ model(X6,X1)
| model(sK35(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK33,sK34,sK35])],[f162,f165,f164,f163]) ).
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(f219,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f226,plain,
! [X0,X1,X5] :
( status(X0,X1,tac)
| ~ model(sK13(X1),X1)
| ~ model(X5,X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f255,plain,
! [X0,X1] :
( status(X0,X1,cax)
| model(sK28(X0),X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f256,plain,
! [X2,X0,X1] :
( ~ model(X2,X0)
| ~ status(X0,X1,cax) ),
inference(cnf_transformation,[],[f147]) ).
fof(f266,plain,
! [X0,X1] :
( ~ model(sK33(X1),X1)
| ~ status(X0,X1,wca) ),
inference(cnf_transformation,[],[f166]) ).
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(f298,plain,
~ mighta(tac,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_72,plain,
( ~ model(sK13(X0),X0)
| ~ model(X1,X2)
| status(X2,X0,tac) ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_99,plain,
( ~ status(X0,X1,cax)
| ~ model(X2,X0) ),
inference(cnf_transformation,[],[f256]) ).
cnf(c_100,plain,
( model(sK28(X0),X0)
| status(X0,X1,cax) ),
inference(cnf_transformation,[],[f255]) ).
cnf(c_107,plain,
( ~ model(sK33(X0),X0)
| ~ status(X1,X0,wca) ),
inference(cnf_transformation,[],[f266]) ).
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_142,negated_conjecture,
~ mighta(tac,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_974,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,tac) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1020,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,tac) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
cnf(c_2573,plain,
status(X0,sK41,thm),
inference(superposition,[status(thm)],[c_127,c_63]) ).
cnf(c_3346,plain,
( ~ model(X0,X1)
| status(X1,sK41,tac) ),
inference(superposition,[status(thm)],[c_127,c_72]) ).
cnf(c_3539,plain,
( status(X0,X1,cax)
| status(X0,sK41,tac) ),
inference(superposition,[status(thm)],[c_100,c_3346]) ).
cnf(c_6913,plain,
( ~ status(X0,sK41,thm)
| ~ status(X0,sK41,tac) ),
inference(instantiation,[status(thm)],[c_1020]) ).
cnf(c_7599,plain,
( ~ model(sK33(X0),X0)
| ~ status(X0,X1,cax) ),
inference(instantiation,[status(thm)],[c_99]) ).
cnf(c_7805,plain,
~ model(sK33(X0),X0),
inference(global_subsumption_just,[status(thm)],[c_107,c_2573,c_3539,c_6913,c_7599]) ).
cnf(c_7811,plain,
$false,
inference(superposition,[status(thm)],[c_127,c_7805]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : KRS259+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n028.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 23:00:18 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 3.52/1.11 % SZS status Started for theBenchmark.p
% 3.52/1.11 % SZS status Theorem for theBenchmark.p
% 3.52/1.11
% 3.52/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.52/1.11
% 3.52/1.11 ------ iProver source info
% 3.52/1.11
% 3.52/1.11 git: date: 2024-05-02 19:28:25 +0000
% 3.52/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.52/1.11 git: non_committed_changes: false
% 3.52/1.11
% 3.52/1.11 ------ Parsing...
% 3.52/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.52/1.11
% 3.52/1.11 ------ 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.52/1.11
% 3.52/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.52/1.11 ------ Proving...
% 3.52/1.11 ------ Problem Properties
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11 clauses 91
% 3.52/1.11 conjectures 0
% 3.52/1.11 EPR 39
% 3.52/1.11 Horn 72
% 3.52/1.11 unary 13
% 3.52/1.11 binary 47
% 3.52/1.11 lits 220
% 3.52/1.11 lits eq 0
% 3.52/1.11 fd_pure 0
% 3.52/1.11 fd_pseudo 0
% 3.52/1.11 fd_cond 0
% 3.52/1.11 fd_pseudo_cond 0
% 3.52/1.11 AC symbols 0
% 3.52/1.11
% 3.52/1.11 ------ Schedule dynamic 5 is on
% 3.52/1.11
% 3.52/1.11 ------ no conjectures: strip conj schedule
% 3.52/1.11
% 3.52/1.11 ------ no equalities: superposition off
% 3.52/1.11
% 3.52/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11 ------
% 3.52/1.11 Current options:
% 3.52/1.11 ------
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11 ------ Proving...
% 3.52/1.11
% 3.52/1.11
% 3.52/1.11 % SZS status Theorem for theBenchmark.p
% 3.52/1.11
% 3.52/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.52/1.11
% 3.52/1.11
%------------------------------------------------------------------------------