TSTP Solution File: KRS187+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS187+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:53 EDT 2024
% Result : Theorem 3.02s 1.10s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 113 ( 42 ~; 34 |; 22 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 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 : 100 ( 4 sgn 68 !; 17 ?)
% 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(f7,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,tac) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tac) ).
fof(f21,axiom,
! [X6,X7] :
( ! [X0,X1] :
( status(X0,X1,X6)
=> status(X0,X1,X7) )
<=> isa(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa) ).
fof(f33,conjecture,
isa(tac,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_tac_thm) ).
fof(f34,negated_conjecture,
~ isa(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(f47,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f59,plain,
~ isa(tac,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
=> isa(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f47]) ).
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] :
( isa(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(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] :
( isa(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(f221,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f230,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ status(X0,X1,tac) ),
inference(cnf_transformation,[],[f110]) ).
fof(f280,plain,
! [X0,X1] :
( isa(X0,X1)
| status(sK41(X0,X1),sK42(X0,X1),X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f281,plain,
! [X0,X1] :
( isa(X0,X1)
| ~ status(sK41(X0,X1),sK42(X0,X1),X1) ),
inference(cnf_transformation,[],[f184]) ).
fof(f301,plain,
~ isa(tac,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_70,plain,
( ~ status(X0,X1,tac)
| model(X2,X1) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_122,plain,
( ~ status(sK41(X0,X1),sK42(X0,X1),X1)
| isa(X0,X1) ),
inference(cnf_transformation,[],[f281]) ).
cnf(c_123,plain,
( status(sK41(X0,X1),sK42(X0,X1),X0)
| isa(X0,X1) ),
inference(cnf_transformation,[],[f280]) ).
cnf(c_143,negated_conjecture,
~ isa(tac,thm),
inference(cnf_transformation,[],[f301]) ).
cnf(c_326,plain,
( ~ status(sK41(X0,X1),sK42(X0,X1),X1)
| isa(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
cnf(c_382,plain,
( status(sK41(X0,X1),sK42(X0,X1),X0)
| isa(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_986,plain,
status(sK41(tac,thm),sK42(tac,thm),tac),
inference(resolution,[status(thm)],[c_382,c_143]) ).
cnf(c_990,plain,
~ status(sK41(tac,thm),sK42(tac,thm),thm),
inference(resolution,[status(thm)],[c_326,c_143]) ).
cnf(c_2806,plain,
model(X0,sK42(tac,thm)),
inference(superposition,[status(thm)],[c_986,c_70]) ).
cnf(c_2823,plain,
status(X0,sK42(tac,thm),thm),
inference(superposition,[status(thm)],[c_2806,c_63]) ).
cnf(c_2824,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_990,c_2823]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KRS187+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n015.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:51 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.02/1.10 % SZS status Started for theBenchmark.p
% 3.02/1.10 % SZS status Theorem for theBenchmark.p
% 3.02/1.10
% 3.02/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.02/1.10
% 3.02/1.10 ------ iProver source info
% 3.02/1.10
% 3.02/1.10 git: date: 2024-05-02 19:28:25 +0000
% 3.02/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.02/1.10 git: non_committed_changes: false
% 3.02/1.10
% 3.02/1.10 ------ Parsing...
% 3.02/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.02/1.10
% 3.02/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.02/1.10
% 3.02/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.02/1.10 ------ Proving...
% 3.02/1.10 ------ Problem Properties
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10 clauses 92
% 3.02/1.10 conjectures 0
% 3.02/1.10 EPR 38
% 3.02/1.10 Horn 73
% 3.02/1.10 unary 15
% 3.02/1.10 binary 46
% 3.02/1.10 lits 220
% 3.02/1.10 lits eq 0
% 3.02/1.10 fd_pure 0
% 3.02/1.10 fd_pseudo 0
% 3.02/1.10 fd_cond 0
% 3.02/1.10 fd_pseudo_cond 0
% 3.02/1.10 AC symbols 0
% 3.02/1.10
% 3.02/1.10 ------ Schedule dynamic 5 is on
% 3.02/1.10
% 3.02/1.10 ------ no conjectures: strip conj schedule
% 3.02/1.10
% 3.02/1.10 ------ no equalities: superposition off
% 3.02/1.10
% 3.02/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10 ------
% 3.02/1.10 Current options:
% 3.02/1.10 ------
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10 ------ Proving...
% 3.02/1.10
% 3.02/1.10
% 3.02/1.10 % SZS status Theorem for theBenchmark.p
% 3.02/1.10
% 3.02/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.02/1.10
% 3.02/1.10
%------------------------------------------------------------------------------