TSTP Solution File: KRS217+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS217+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:57 EDT 2024
% Result : Theorem 4.19s 1.20s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 12 unt; 0 def)
% Number of atoms : 241 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 281 ( 108 ~; 90 |; 64 &)
% ( 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 : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 166 ( 0 sgn 77 !; 47 ?)
% 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(f19,axiom,
! [X0,X1] :
( ( ? [X3] :
( model(X3,not(X1))
& model(X3,X0) )
& ? [X2] :
( model(X2,X1)
& model(X2,X0) ) )
<=> status(X0,X1,noc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',noc) ).
fof(f22,axiom,
! [X6,X7] :
( ? [X0,X1] :
( ~ status(X0,X1,X7)
& status(X0,X1,X6) )
<=> nota(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota) ).
fof(f26,axiom,
! [X8,X9] :
( model(X8,X9)
<=> ~ model(X8,not(X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not) ).
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/sandbox/benchmark/theBenchmark.p',mixed_pair) ).
fof(f33,conjecture,
nota(noc,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_noc_thm) ).
fof(f34,negated_conjecture,
~ nota(noc,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f45,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
& ? [X3] :
( model(X3,X1)
& model(X3,X0) ) )
<=> status(X0,X1,noc) ),
inference(rectify,[],[f19]) ).
fof(f48,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
inference(rectify,[],[f22]) ).
fof(f52,plain,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
inference(rectify,[],[f26]) ).
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,
~ nota(noc,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
=> nota(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
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] :
( nota(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(f177,plain,
! [X0,X1] :
( ( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
& ? [X3] :
( model(X3,X1)
& model(X3,X0) ) )
| ~ status(X0,X1,noc) )
& ( status(X0,X1,noc)
| ! [X2] :
( ~ model(X2,not(X1))
| ~ model(X2,X0) )
| ! [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) ) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f178,plain,
! [X0,X1] :
( ( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
& ? [X3] :
( model(X3,X1)
& model(X3,X0) ) )
| ~ status(X0,X1,noc) )
& ( status(X0,X1,noc)
| ! [X2] :
( ~ model(X2,not(X1))
| ~ model(X2,X0) )
| ! [X3] :
( ~ model(X3,X1)
| ~ model(X3,X0) ) ) ),
inference(flattening,[],[f177]) ).
fof(f179,plain,
! [X0,X1] :
( ( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
& ? [X3] :
( model(X3,X1)
& model(X3,X0) ) )
| ~ status(X0,X1,noc) )
& ( status(X0,X1,noc)
| ! [X4] :
( ~ model(X4,not(X1))
| ~ model(X4,X0) )
| ! [X5] :
( ~ model(X5,X1)
| ~ model(X5,X0) ) ) ),
inference(rectify,[],[f178]) ).
fof(f180,plain,
! [X0,X1] :
( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
=> ( model(sK39(X0,X1),not(X1))
& model(sK39(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
! [X0,X1] :
( ? [X3] :
( model(X3,X1)
& model(X3,X0) )
=> ( model(sK40(X0,X1),X1)
& model(sK40(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
! [X0,X1] :
( ( ( model(sK39(X0,X1),not(X1))
& model(sK39(X0,X1),X0)
& model(sK40(X0,X1),X1)
& model(sK40(X0,X1),X0) )
| ~ status(X0,X1,noc) )
& ( status(X0,X1,noc)
| ! [X4] :
( ~ model(X4,not(X1))
| ~ model(X4,X0) )
| ! [X5] :
( ~ model(X5,X1)
| ~ model(X5,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK39,sK40])],[f179,f181,f180]) ).
fof(f184,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,not(X1))
| ~ model(X0,X1) ) ),
inference(nnf_transformation,[],[f52]) ).
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(f220,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f98]) ).
fof(f273,plain,
! [X0,X1,X4,X5] :
( status(X0,X1,noc)
| ~ model(X4,not(X1))
| ~ model(X4,X0)
| ~ model(X5,X1)
| ~ model(X5,X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( nota(X0,X1)
| status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f282,plain,
! [X0,X1] :
( model(X0,X1)
| model(X0,not(X1)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f290,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f291,plain,
! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) ),
inference(cnf_transformation,[],[f201]) ).
fof(f292,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f293,plain,
model(sK53,sK51),
inference(cnf_transformation,[],[f201]) ).
fof(f298,plain,
~ nota(noc,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_62,plain,
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_121,plain,
( ~ model(X0,not(X1))
| ~ model(X0,X3)
| ~ model(X2,X1)
| ~ model(X2,X3)
| status(X3,X1,noc) ),
inference(cnf_transformation,[],[f273]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| status(X0,X1,X3)
| nota(X2,X3) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_125,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f282]) ).
cnf(c_135,plain,
model(sK53,sK51),
inference(cnf_transformation,[],[f293]) ).
cnf(c_136,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f292]) ).
cnf(c_137,plain,
( ~ model(X0,sK50)
| model(X0,sK51) ),
inference(cnf_transformation,[],[f291]) ).
cnf(c_138,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f290]) ).
cnf(c_142,negated_conjecture,
~ nota(noc,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_203,plain,
( model(X0,X1)
| model(X0,not(X1)) ),
inference(prop_impl_just,[status(thm)],[c_125]) ).
cnf(c_204,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(renaming,[status(thm)],[c_203]) ).
cnf(c_528,plain,
( ~ model(X0,X1)
| ~ model(X2,X1)
| ~ model(X2,X3)
| status(X1,X3,noc)
| model(X0,X3) ),
inference(bin_hyper_res,[status(thm)],[c_121,c_204]) ).
cnf(c_973,plain,
( ~ status(X0,X1,noc)
| status(X0,X1,thm) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1023,plain,
( status(X0,X1,thm)
| ~ status(X0,X1,noc) ),
inference(prop_impl_just,[status(thm)],[c_973]) ).
cnf(c_1024,plain,
( ~ status(X0,X1,noc)
| status(X0,X1,thm) ),
inference(renaming,[status(thm)],[c_1023]) ).
cnf(c_1749,plain,
( ~ status(X0_13,X1_13,noc)
| status(X0_13,X1_13,thm) ),
inference(subtyping,[status(esa)],[c_1024]) ).
cnf(c_1750,plain,
( ~ model(X0_15,X0_13)
| ~ model(X1_15,X0_13)
| ~ model(X1_15,X1_13)
| status(X0_13,X1_13,noc)
| model(X0_15,X1_13) ),
inference(subtyping,[status(esa)],[c_528]) ).
cnf(c_1756,plain,
( ~ model(X0_15,sK50)
| model(X0_15,sK51) ),
inference(subtyping,[status(esa)],[c_137]) ).
cnf(c_1826,plain,
( ~ status(X0_13,X1_13,thm)
| ~ model(X0_15,X0_13)
| model(X0_15,X1_13) ),
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_2074,plain,
( ~ model(X0_15,X0_13)
| ~ model(sK54,X0_13)
| ~ model(sK54,sK50)
| status(X0_13,sK50,noc)
| model(X0_15,sK50) ),
inference(instantiation,[status(thm)],[c_1750]) ).
cnf(c_2092,plain,
( ~ status(sK51,X0_13,thm)
| ~ model(sK53,sK51)
| model(sK53,X0_13) ),
inference(instantiation,[status(thm)],[c_1826]) ).
cnf(c_2093,plain,
( ~ status(sK51,sK50,thm)
| ~ model(sK53,sK51)
| model(sK53,sK50) ),
inference(instantiation,[status(thm)],[c_2092]) ).
cnf(c_2151,plain,
( ~ model(sK54,sK50)
| model(sK54,sK51) ),
inference(instantiation,[status(thm)],[c_1756]) ).
cnf(c_4006,plain,
( ~ status(sK51,X0_13,noc)
| status(sK51,X0_13,thm) ),
inference(instantiation,[status(thm)],[c_1749]) ).
cnf(c_4007,plain,
( ~ status(sK51,sK50,noc)
| status(sK51,sK50,thm) ),
inference(instantiation,[status(thm)],[c_4006]) ).
cnf(c_4187,plain,
( ~ model(sK53,sK51)
| ~ model(sK54,sK51)
| ~ model(sK54,sK50)
| status(sK51,sK50,noc)
| model(sK53,sK50) ),
inference(instantiation,[status(thm)],[c_2074]) ).
cnf(c_4188,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4187,c_4007,c_2151,c_2093,c_136,c_135,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS217+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:13:46 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/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
% 4.19/1.20 % SZS status Started for theBenchmark.p
% 4.19/1.20 % SZS status Theorem for theBenchmark.p
% 4.19/1.20
% 4.19/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.19/1.20
% 4.19/1.20 ------ iProver source info
% 4.19/1.20
% 4.19/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.19/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.19/1.20 git: non_committed_changes: false
% 4.19/1.20
% 4.19/1.20 ------ Parsing...
% 4.19/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.19/1.20
% 4.19/1.20 ------ 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
% 4.19/1.20
% 4.19/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.19/1.20 ------ Proving...
% 4.19/1.20 ------ Problem Properties
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20 clauses 91
% 4.19/1.20 conjectures 0
% 4.19/1.20 EPR 39
% 4.19/1.20 Horn 72
% 4.19/1.20 unary 13
% 4.19/1.20 binary 47
% 4.19/1.20 lits 220
% 4.19/1.20 lits eq 0
% 4.19/1.20 fd_pure 0
% 4.19/1.20 fd_pseudo 0
% 4.19/1.20 fd_cond 0
% 4.19/1.20 fd_pseudo_cond 0
% 4.19/1.20 AC symbols 0
% 4.19/1.20
% 4.19/1.20 ------ Input Options Time Limit: Unbounded
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20 ------
% 4.19/1.20 Current options:
% 4.19/1.20 ------
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20 ------ Proving...
% 4.19/1.20
% 4.19/1.20
% 4.19/1.20 % SZS status Theorem for theBenchmark.p
% 4.19/1.20
% 4.19/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.19/1.20
% 4.19/1.20
%------------------------------------------------------------------------------