TSTP Solution File: KRS234+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS234+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 0.43s 1.13s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 136 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 137 ( 52 ~; 45 |; 23 &)
% ( 6 <=>; 9 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 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 : 123 ( 8 sgn 82 !; 15 ?)
% 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(f18,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) )
<=> status(X0,X1,uns) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uns) ).
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(uns,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nevera_uns_thm) ).
fof(f34,negated_conjecture,
~ nevera(uns,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f44,plain,
! [X0,X1] :
( ( ! [X2] : model(X2,not(X1))
& ! [X3] : model(X3,X0) )
<=> status(X0,X1,uns) ),
inference(rectify,[],[f18]) ).
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(uns,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(f171,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,not(X1))
& ! [X3] : model(X3,X0) )
| ~ status(X0,X1,uns) )
& ( status(X0,X1,uns)
| ? [X2] : ~ model(X2,not(X1))
| ? [X3] : ~ model(X3,X0) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f172,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,not(X1))
& ! [X3] : model(X3,X0) )
| ~ status(X0,X1,uns) )
& ( status(X0,X1,uns)
| ? [X2] : ~ model(X2,not(X1))
| ? [X3] : ~ model(X3,X0) ) ),
inference(flattening,[],[f171]) ).
fof(f173,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,not(X1))
& ! [X3] : model(X3,X0) )
| ~ status(X0,X1,uns) )
& ( status(X0,X1,uns)
| ? [X4] : ~ model(X4,not(X1))
| ? [X5] : ~ model(X5,X0) ) ),
inference(rectify,[],[f172]) ).
fof(f174,plain,
! [X1] :
( ? [X4] : ~ model(X4,not(X1))
=> ~ model(sK37(X1),not(X1)) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
! [X0] :
( ? [X5] : ~ model(X5,X0)
=> ~ model(sK38(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
! [X0,X1] :
( ( ( ! [X2] : model(X2,not(X1))
& ! [X3] : model(X3,X0) )
| ~ status(X0,X1,uns) )
& ( status(X0,X1,uns)
| ~ model(sK37(X1),not(X1))
| ~ model(sK38(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK37,sK38])],[f173,f175,f174]) ).
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(f273,plain,
! [X3,X0,X1] :
( model(X3,X0)
| ~ status(X0,X1,uns) ),
inference(cnf_transformation,[],[f176]) ).
fof(f274,plain,
! [X2,X0,X1] :
( model(X2,not(X1))
| ~ status(X0,X1,uns) ),
inference(cnf_transformation,[],[f176]) ).
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(uns,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_114,plain,
( ~ status(X0,X1,uns)
| model(X2,not(X1)) ),
inference(cnf_transformation,[],[f274]) ).
cnf(c_115,plain,
( ~ status(X0,X1,uns)
| model(X2,X0) ),
inference(cnf_transformation,[],[f273]) ).
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(uns,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(uns,thm),sK42(uns,thm),uns),
inference(resolution,[status(thm)],[c_379,c_143]) ).
cnf(c_989,plain,
status(sK41(uns,thm),sK42(uns,thm),thm),
inference(resolution,[status(thm)],[c_382,c_143]) ).
cnf(c_2300,plain,
( ~ status(sK41(uns,thm),sK42(uns,thm),uns)
| model(X0,sK41(uns,thm)) ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_2397,plain,
( ~ model(X0,sK41(uns,thm))
| model(X0,sK42(uns,thm)) ),
inference(superposition,[status(thm)],[c_989,c_62]) ).
cnf(c_2415,plain,
model(X0,sK42(uns,thm)),
inference(global_subsumption_just,[status(thm)],[c_2397,c_985,c_2300,c_2397]) ).
cnf(c_3099,plain,
model(X0,not(sK42(uns,thm))),
inference(superposition,[status(thm)],[c_985,c_114]) ).
cnf(c_4156,plain,
~ model(X0,sK42(uns,thm)),
inference(superposition,[status(thm)],[c_3099,c_124]) ).
cnf(c_4164,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4156,c_2415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS234+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 22:35:25 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 0.43/1.13 % SZS status Started for theBenchmark.p
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.13
% 0.43/1.13 ------ iProver source info
% 0.43/1.13
% 0.43/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.13 git: non_committed_changes: false
% 0.43/1.13
% 0.43/1.13 ------ Parsing...
% 0.43/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.13
% 0.43/1.13 ------ 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
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.13 ------ Proving...
% 0.43/1.13 ------ Problem Properties
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 clauses 92
% 0.43/1.13 conjectures 0
% 0.43/1.13 EPR 38
% 0.43/1.13 Horn 73
% 0.43/1.13 unary 15
% 0.43/1.13 binary 46
% 0.43/1.13 lits 220
% 0.43/1.13 lits eq 0
% 0.43/1.13 fd_pure 0
% 0.43/1.13 fd_pseudo 0
% 0.43/1.13 fd_cond 0
% 0.43/1.13 fd_pseudo_cond 0
% 0.43/1.13 AC symbols 0
% 0.43/1.13
% 0.43/1.13 ------ Schedule dynamic 5 is on
% 0.43/1.13
% 0.43/1.13 ------ no conjectures: strip conj schedule
% 0.43/1.13
% 0.43/1.13 ------ no equalities: superposition off
% 0.43/1.13
% 0.43/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------
% 0.43/1.13 Current options:
% 0.43/1.13 ------
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------ Proving...
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.13
% 0.43/1.14
%------------------------------------------------------------------------------