TSTP Solution File: KRS191+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS191+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:54 EDT 2024
% Result : Theorem 3.14s 1.15s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 10 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 132 ( 50 ~; 38 |; 28 &)
% ( 6 <=>; 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 111 ( 4 sgn 73 !; 23 ?)
% 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(f11,axiom,
! [X0,X1] :
( ( ! [X4] : model(X4,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,wtc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wtc) ).
fof(f21,axiom,
! [X6,X7] :
( ! [X0,X1] :
( status(X0,X1,X6)
=> status(X0,X1,X7) )
<=> isa(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).
fof(f33,conjecture,
isa(wtc,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_wtc_thm) ).
fof(f34,negated_conjecture,
~ isa(wtc,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f39,plain,
! [X0,X1] :
( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
<=> status(X0,X1,wtc) ),
inference(rectify,[],[f11]) ).
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(wtc,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(f129,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : model(X3,X0)
| ! [X4] : ~ model(X4,X0) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f130,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X2] : ~ model(X2,X1)
| ! [X3] : model(X3,X0)
| ! [X4] : ~ model(X4,X0) ) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ? [X3] : ~ model(X3,X0)
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ? [X5] : ~ model(X5,X1)
| ! [X6] : model(X6,X0)
| ! [X7] : ~ model(X7,X0) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0] :
( ? [X3] : ~ model(X3,X0)
=> ~ model(sK21(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
! [X0] :
( ? [X4] : model(X4,X0)
=> model(sK22(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
! [X1] :
( ? [X5] : ~ model(X5,X1)
=> ~ model(sK23(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,X1)
& ~ model(sK21(X0),X0)
& model(sK22(X0),X0) )
| ~ status(X0,X1,wtc) )
& ( status(X0,X1,wtc)
| ~ model(sK23(X1),X1)
| ! [X6] : model(X6,X0)
| ! [X7] : ~ model(X7,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23])],[f131,f134,f133,f132]) ).
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(f249,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ status(X0,X1,wtc) ),
inference(cnf_transformation,[],[f135]) ).
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(wtc,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_88,plain,
( ~ status(X0,X1,wtc)
| model(X2,X1) ),
inference(cnf_transformation,[],[f249]) ).
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(wtc,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(wtc,thm),sK42(wtc,thm),wtc),
inference(resolution,[status(thm)],[c_382,c_143]) ).
cnf(c_990,plain,
~ status(sK41(wtc,thm),sK42(wtc,thm),thm),
inference(resolution,[status(thm)],[c_326,c_143]) ).
cnf(c_2920,plain,
model(X0,sK42(wtc,thm)),
inference(superposition,[status(thm)],[c_986,c_88]) ).
cnf(c_3009,plain,
status(X0,sK42(wtc,thm),thm),
inference(superposition,[status(thm)],[c_2920,c_63]) ).
cnf(c_3010,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_990,c_3009]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS191+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 22:39:44 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.14/1.15 % SZS status Started for theBenchmark.p
% 3.14/1.15 % SZS status Theorem for theBenchmark.p
% 3.14/1.15
% 3.14/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.14/1.15
% 3.14/1.15 ------ iProver source info
% 3.14/1.15
% 3.14/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.14/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.14/1.15 git: non_committed_changes: false
% 3.14/1.15
% 3.14/1.15 ------ Parsing...
% 3.14/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.14/1.15
% 3.14/1.15 ------ 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.14/1.15
% 3.14/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.14/1.15 ------ Proving...
% 3.14/1.15 ------ Problem Properties
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15 clauses 92
% 3.14/1.15 conjectures 0
% 3.14/1.15 EPR 38
% 3.14/1.15 Horn 73
% 3.14/1.15 unary 15
% 3.14/1.15 binary 46
% 3.14/1.15 lits 220
% 3.14/1.15 lits eq 0
% 3.14/1.15 fd_pure 0
% 3.14/1.15 fd_pseudo 0
% 3.14/1.15 fd_cond 0
% 3.14/1.15 fd_pseudo_cond 0
% 3.14/1.15 AC symbols 0
% 3.14/1.15
% 3.14/1.15 ------ Schedule dynamic 5 is on
% 3.14/1.15
% 3.14/1.15 ------ no conjectures: strip conj schedule
% 3.14/1.15
% 3.14/1.15 ------ no equalities: superposition off
% 3.14/1.15
% 3.14/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15 ------
% 3.14/1.15 Current options:
% 3.14/1.15 ------
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15 ------ Proving...
% 3.14/1.15
% 3.14/1.15
% 3.14/1.15 % SZS status Theorem for theBenchmark.p
% 3.14/1.15
% 3.14/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.14/1.15
% 3.14/1.15
%------------------------------------------------------------------------------