TSTP Solution File: KRS233+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS233+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:58 EDT 2024
% Result : Theorem 4.29s 1.20s
% Output : CNFRefutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 154 ( 61 ~; 56 |; 22 &)
% ( 5 <=>; 8 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 111 ( 0 sgn 67 !; 11 ?)
% 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(f17,axiom,
! [X0,X1] :
( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
<=> status(X0,X1,csa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',csa) ).
fof(f23,axiom,
! [X6,X7] :
( ! [X0,X1] :
( status(X0,X1,X6)
=> ~ status(X0,X1,X7) )
<=> nevera(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nevera) ).
fof(f25,axiom,
! [X8,X9] :
( model(X8,X9)
<~> model(X8,not(X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',completeness) ).
fof(f33,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(f34,negated_conjecture,
~ nevera(csa,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f49,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
inference(rectify,[],[f23]) ).
fof(f51,plain,
! [X0,X1] :
( model(X0,X1)
<~> model(X0,not(X1)) ),
inference(rectify,[],[f25]) ).
fof(f59,plain,
~ nevera(csa,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
=> nevera(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f49]) ).
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] :
( nevera(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(f167,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X2] :
( ~ model(X2,not(X1))
| ~ model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f168,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) ) ) ),
inference(rectify,[],[f167]) ).
fof(f169,plain,
! [X0,X1] :
( ? [X2] :
( model(X2,not(X1))
& model(X2,X0) )
=> ( model(sK36(X0,X1),not(X1))
& model(sK36(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f170,plain,
! [X0,X1] :
( ( ( model(sK36(X0,X1),not(X1))
& model(sK36(X0,X1),X0) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X3] :
( ~ model(X3,not(X1))
| ~ model(X3,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK36])],[f168,f169]) ).
fof(f183,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
=> ( status(sK41(X0,X1),sK42(X0,X1),X1)
& status(sK41(X0,X1),sK42(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
! [X0,X1] :
( nevera(X0,X1)
| ( status(sK41(X0,X1),sK42(X0,X1),X1)
& status(sK41(X0,X1),sK42(X0,X1),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42])],[f70,f183]) ).
fof(f185,plain,
! [X0,X1] :
( ( ~ model(X0,not(X1))
| ~ model(X0,X1) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f222,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f98]) ).
fof(f270,plain,
! [X0,X1] :
( model(sK36(X0,X1),X0)
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f170]) ).
fof(f271,plain,
! [X0,X1] :
( model(sK36(X0,X1),not(X1))
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f170]) ).
fof(f280,plain,
! [X0,X1] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f281,plain,
! [X0,X1] :
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(cnf_transformation,[],[f184]) ).
fof(f283,plain,
! [X0,X1] :
( ~ model(X0,not(X1))
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f185]) ).
fof(f301,plain,
~ nevera(csa,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_62,plain,
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f222]) ).
cnf(c_111,plain,
( ~ status(X0,X1,csa)
| model(sK36(X0,X1),not(X1)) ),
inference(cnf_transformation,[],[f271]) ).
cnf(c_112,plain,
( ~ status(X0,X1,csa)
| model(sK36(X0,X1),X0) ),
inference(cnf_transformation,[],[f270]) ).
cnf(c_122,plain,
( status(sK41(X0,X1),sK42(X0,X1),X1)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f281]) ).
cnf(c_123,plain,
( status(sK41(X0,X1),sK42(X0,X1),X0)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f280]) ).
cnf(c_124,plain,
( ~ model(X0,not(X1))
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f283]) ).
cnf(c_143,negated_conjecture,
~ nevera(csa,thm),
inference(cnf_transformation,[],[f301]) ).
cnf(c_379,plain,
( status(sK41(X0,X1),sK42(X0,X1),X0)
| nevera(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_381,plain,
( nevera(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
cnf(c_382,plain,
( status(sK41(X0,X1),sK42(X0,X1),X1)
| nevera(X0,X1) ),
inference(renaming,[status(thm)],[c_381]) ).
cnf(c_985,plain,
status(sK41(csa,thm),sK42(csa,thm),csa),
inference(resolution,[status(thm)],[c_379,c_143]) ).
cnf(c_989,plain,
status(sK41(csa,thm),sK42(csa,thm),thm),
inference(resolution,[status(thm)],[c_382,c_143]) ).
cnf(c_1779,plain,
( ~ model(X0_15,not(X0_13))
| ~ model(X0_15,X0_13) ),
inference(subtyping,[status(esa)],[c_124]) ).
cnf(c_1787,plain,
( ~ status(X0_13,X1_13,csa)
| model(sK36(X0_13,X1_13),X0_13) ),
inference(subtyping,[status(esa)],[c_112]) ).
cnf(c_1788,plain,
( ~ status(X0_13,X1_13,csa)
| model(sK36(X0_13,X1_13),not(X1_13)) ),
inference(subtyping,[status(esa)],[c_111]) ).
cnf(c_1837,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_1909,plain,
( ~ status(sK41(csa,thm),sK42(csa,thm),csa)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),not(sK42(csa,thm))) ),
inference(instantiation,[status(thm)],[c_1788]) ).
cnf(c_1910,plain,
( ~ status(sK41(csa,thm),sK42(csa,thm),csa)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),sK41(csa,thm)) ),
inference(instantiation,[status(thm)],[c_1787]) ).
cnf(c_1967,plain,
( ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),sK41(csa,thm))
| ~ status(sK41(csa,thm),X0_13,thm)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),X0_13) ),
inference(instantiation,[status(thm)],[c_1837]) ).
cnf(c_2032,plain,
( ~ status(sK41(csa,thm),X0_13,thm)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_1967,c_985,c_1910,c_1967]) ).
cnf(c_2450,plain,
( ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),sK41(csa,thm))
| ~ status(sK41(csa,thm),X0_13,thm)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),X0_13) ),
inference(instantiation,[status(thm)],[c_1837]) ).
cnf(c_2490,plain,
( ~ status(sK41(csa,thm),X0_13,thm)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_2450,c_2032]) ).
cnf(c_3894,plain,
( ~ status(sK41(csa,thm),sK42(csa,thm),thm)
| model(sK36(sK41(csa,thm),sK42(csa,thm)),sK42(csa,thm)) ),
inference(instantiation,[status(thm)],[c_2490]) ).
cnf(c_4294,plain,
( ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),not(X0_13))
| ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),X0_13) ),
inference(instantiation,[status(thm)],[c_1779]) ).
cnf(c_6565,plain,
( ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),not(sK42(csa,thm)))
| ~ model(sK36(sK41(csa,thm),sK42(csa,thm)),sK42(csa,thm)) ),
inference(instantiation,[status(thm)],[c_4294]) ).
cnf(c_6566,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6565,c_3894,c_1909,c_989,c_985]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS233+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 22:55:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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
% 4.29/1.20 % SZS status Started for theBenchmark.p
% 4.29/1.20 % SZS status Theorem for theBenchmark.p
% 4.29/1.20
% 4.29/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.29/1.20
% 4.29/1.20 ------ iProver source info
% 4.29/1.20
% 4.29/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.29/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.29/1.20 git: non_committed_changes: false
% 4.29/1.20
% 4.29/1.20 ------ Parsing...
% 4.29/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.29/1.20
% 4.29/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.29/1.20
% 4.29/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.29/1.20 ------ Proving...
% 4.29/1.20 ------ Problem Properties
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20 clauses 92
% 4.29/1.20 conjectures 0
% 4.29/1.20 EPR 38
% 4.29/1.20 Horn 73
% 4.29/1.20 unary 15
% 4.29/1.20 binary 46
% 4.29/1.20 lits 220
% 4.29/1.20 lits eq 0
% 4.29/1.20 fd_pure 0
% 4.29/1.20 fd_pseudo 0
% 4.29/1.20 fd_cond 0
% 4.29/1.20 fd_pseudo_cond 0
% 4.29/1.20 AC symbols 0
% 4.29/1.20
% 4.29/1.20 ------ Input Options Time Limit: Unbounded
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20 ------
% 4.29/1.20 Current options:
% 4.29/1.20 ------
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20 ------ Proving...
% 4.29/1.20
% 4.29/1.20
% 4.29/1.20 % SZS status Theorem for theBenchmark.p
% 4.29/1.20
% 4.29/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.29/1.20
% 4.29/1.20
%------------------------------------------------------------------------------