TSTP Solution File: KRS188+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS188+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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.53s 1.18s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 9 unt; 0 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 180 ( 63 ~; 53 |; 45 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 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 : 122 ( 0 sgn 80 !; 25 ?)
% 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(f8,axiom,
! [X0,X1] :
( ( ? [X4] :
( ~ model(X4,X0)
& model(X4,X1) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,wec) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wec) ).
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(wec,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_wec_thm) ).
fof(f34,negated_conjecture,
~ isa(wec,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f37,plain,
! [X0,X1] :
( ( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X4] : model(X4,X0) )
<=> status(X0,X1,wec) ),
inference(rectify,[],[f8]) ).
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(wec,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(f64,plain,
! [X0,X1] :
( ( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
& ! [X3] :
( model(X3,X1)
| ~ model(X3,X0) )
& ? [X4] : model(X4,X0) )
<=> status(X0,X1,wec) ),
inference(ennf_transformation,[],[f37]) ).
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(f111,plain,
! [X0,X1] :
( ( ( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
& ! [X3] :
( model(X3,X1)
| ~ model(X3,X0) )
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wec) )
& ( status(X0,X1,wec)
| ! [X2] :
( model(X2,X0)
| ~ model(X2,X1) )
| ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) )
| ! [X4] : ~ model(X4,X0) ) ),
inference(nnf_transformation,[],[f64]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
& ! [X3] :
( model(X3,X1)
| ~ model(X3,X0) )
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wec) )
& ( status(X0,X1,wec)
| ! [X2] :
( model(X2,X0)
| ~ model(X2,X1) )
| ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) )
| ! [X4] : ~ model(X4,X0) ) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( ( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
& ! [X3] :
( model(X3,X1)
| ~ model(X3,X0) )
& ? [X4] : model(X4,X0) )
| ~ status(X0,X1,wec) )
& ( status(X0,X1,wec)
| ! [X5] :
( model(X5,X0)
| ~ model(X5,X1) )
| ? [X6] :
( ~ model(X6,X1)
& model(X6,X0) )
| ! [X7] : ~ model(X7,X0) ) ),
inference(rectify,[],[f112]) ).
fof(f114,plain,
! [X0,X1] :
( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
=> ( ~ model(sK14(X0,X1),X0)
& model(sK14(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
! [X0] :
( ? [X4] : model(X4,X0)
=> model(sK15(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
! [X0,X1] :
( ? [X6] :
( ~ model(X6,X1)
& model(X6,X0) )
=> ( ~ model(sK16(X0,X1),X1)
& model(sK16(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
! [X0,X1] :
( ( ( ~ model(sK14(X0,X1),X0)
& model(sK14(X0,X1),X1)
& ! [X3] :
( model(X3,X1)
| ~ model(X3,X0) )
& model(sK15(X0),X0) )
| ~ status(X0,X1,wec) )
& ( status(X0,X1,wec)
| ! [X5] :
( model(X5,X0)
| ~ model(X5,X1) )
| ( ~ model(sK16(X0,X1),X1)
& model(sK16(X0,X1),X0) )
| ! [X7] : ~ model(X7,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f113,f116,f115,f114]) ).
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(f220,plain,
! [X0,X1] :
( status(X0,X1,thm)
| model(sK9(X0,X1),X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f221,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f234,plain,
! [X3,X0,X1] :
( model(X3,X1)
| ~ model(X3,X0)
| ~ status(X0,X1,wec) ),
inference(cnf_transformation,[],[f117]) ).
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(wec,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_64,plain,
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_75,plain,
( ~ status(X0,X1,wec)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f234]) ).
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(wec,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(wec,thm),sK42(wec,thm),wec),
inference(resolution,[status(thm)],[c_382,c_143]) ).
cnf(c_990,plain,
~ status(sK41(wec,thm),sK42(wec,thm),thm),
inference(resolution,[status(thm)],[c_326,c_143]) ).
cnf(c_3595,plain,
( ~ model(X0,sK41(wec,thm))
| model(X0,sK42(wec,thm)) ),
inference(superposition,[status(thm)],[c_986,c_75]) ).
cnf(c_3901,plain,
( model(sK9(sK41(wec,thm),X0),sK42(wec,thm))
| status(sK41(wec,thm),X0,thm) ),
inference(superposition,[status(thm)],[c_64,c_3595]) ).
cnf(c_5469,plain,
status(sK41(wec,thm),sK42(wec,thm),thm),
inference(superposition,[status(thm)],[c_3901,c_63]) ).
cnf(c_5470,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5469,c_990]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KRS188+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 22:27:04 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.53/1.18 % SZS status Started for theBenchmark.p
% 3.53/1.18 % SZS status Theorem for theBenchmark.p
% 3.53/1.18
% 3.53/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/1.18
% 3.53/1.18 ------ iProver source info
% 3.53/1.18
% 3.53/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.53/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/1.18 git: non_committed_changes: false
% 3.53/1.18
% 3.53/1.18 ------ Parsing...
% 3.53/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/1.18
% 3.53/1.18 ------ 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.53/1.18
% 3.53/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/1.18 ------ Proving...
% 3.53/1.18 ------ Problem Properties
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18 clauses 92
% 3.53/1.18 conjectures 0
% 3.53/1.18 EPR 38
% 3.53/1.18 Horn 73
% 3.53/1.18 unary 15
% 3.53/1.18 binary 46
% 3.53/1.18 lits 220
% 3.53/1.18 lits eq 0
% 3.53/1.18 fd_pure 0
% 3.53/1.18 fd_pseudo 0
% 3.53/1.18 fd_cond 0
% 3.53/1.18 fd_pseudo_cond 0
% 3.53/1.18 AC symbols 0
% 3.53/1.18
% 3.53/1.18 ------ Schedule dynamic 5 is on
% 3.53/1.18
% 3.53/1.18 ------ no conjectures: strip conj schedule
% 3.53/1.18
% 3.53/1.18 ------ no equalities: superposition off
% 3.53/1.18
% 3.53/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18 ------
% 3.53/1.18 Current options:
% 3.53/1.18 ------
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18 ------ Proving...
% 3.53/1.18
% 3.53/1.18
% 3.53/1.18 % SZS status Theorem for theBenchmark.p
% 3.53/1.18
% 3.53/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.53/1.18
% 3.53/1.18
%------------------------------------------------------------------------------