TSTP Solution File: KRS201+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS201+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:55 EDT 2024
% Result : Theorem 3.97s 1.21s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 77 ( 20 unt; 0 def)
% Number of atoms : 210 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 223 ( 90 ~; 56 |; 52 &)
% ( 8 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 179 ( 15 sgn 83 !; 59 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ( ? [X2] : model(X2,X0)
=> ? [X3] : model(X3,X1) )
<=> status(X0,X1,sap) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sap) ).
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(f22,axiom,
! [X6,X7] :
( ? [X0,X1] :
( ~ status(X0,X1,X7)
& status(X0,X1,X6) )
<=> nota(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota) ).
fof(f25,axiom,
! [X8,X9] :
( model(X8,X9)
<~> model(X8,not(X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',completeness) ).
fof(f26,axiom,
! [X8,X9] :
( model(X8,X9)
<=> ~ model(X8,not(X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not) ).
fof(f28,axiom,
? [X9] :
( ? [X3] : ~ model(X3,X9)
& ? [X2] : model(X2,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satisfiable) ).
fof(f31,axiom,
? [X0,X1] :
( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( model(X4,X1)
& ~ model(X4,X0) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mixed_pair) ).
fof(f33,conjecture,
nota(sap,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota_sap_thm) ).
fof(f34,negated_conjecture,
~ nota(sap,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f48,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
inference(rectify,[],[f22]) ).
fof(f51,plain,
! [X0,X1] :
( model(X0,X1)
<~> model(X0,not(X1)) ),
inference(rectify,[],[f25]) ).
fof(f52,plain,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
inference(rectify,[],[f26]) ).
fof(f54,plain,
? [X0] :
( ? [X1] : ~ model(X1,X0)
& ? [X2] : model(X2,X0) ),
inference(rectify,[],[f28]) ).
fof(f57,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X0)
=> model(X4,X1) )
& ? [X5] : model(X5,X0) ),
inference(rectify,[],[f31]) ).
fof(f59,plain,
~ nota(sap,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
=> nota(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
fof(f62,plain,
! [X0,X1] :
( ( ? [X3] : model(X3,X1)
| ! [X2] : ~ model(X2,X0) )
<=> status(X0,X1,sap) ),
inference(ennf_transformation,[],[f2]) ).
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] :
( nota(X0,X1)
| ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f71,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f78,plain,
! [X0,X1] :
( ( ? [X3] : model(X3,X1)
| ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,sap) )
& ( status(X0,X1,sap)
| ( ! [X3] : ~ model(X3,X1)
& ? [X2] : model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f62]) ).
fof(f79,plain,
! [X0,X1] :
( ( ? [X3] : model(X3,X1)
| ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,sap) )
& ( status(X0,X1,sap)
| ( ! [X3] : ~ model(X3,X1)
& ? [X2] : model(X2,X0) ) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1] :
( ( ? [X2] : model(X2,X1)
| ! [X3] : ~ model(X3,X0)
| ~ status(X0,X1,sap) )
& ( status(X0,X1,sap)
| ( ! [X4] : ~ model(X4,X1)
& ? [X5] : model(X5,X0) ) ) ),
inference(rectify,[],[f79]) ).
fof(f81,plain,
! [X1] :
( ? [X2] : model(X2,X1)
=> model(sK2(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
! [X0] :
( ? [X5] : model(X5,X0)
=> model(sK3(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f83,plain,
! [X0,X1] :
( ( model(sK2(X1),X1)
| ! [X3] : ~ model(X3,X0)
| ~ status(X0,X1,sap) )
& ( status(X0,X1,sap)
| ( ! [X4] : ~ model(X4,X1)
& model(sK3(X0),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f80,f82,f81]) ).
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(f183,plain,
! [X0,X1] :
( ( ~ model(X0,not(X1))
| ~ model(X0,X1) )
& ( model(X0,not(X1))
| model(X0,X1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f184,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,not(X1))
| ~ model(X0,X1) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f187,plain,
( ? [X0] :
( ? [X1] : ~ model(X1,X0)
& ? [X2] : model(X2,X0) )
=> ( ? [X1] : ~ model(X1,sK42)
& ? [X2] : model(X2,sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f188,plain,
( ? [X1] : ~ model(X1,sK42)
=> ~ model(sK43,sK42) ),
introduced(choice_axiom,[]) ).
fof(f189,plain,
( ? [X2] : model(X2,sK42)
=> model(sK44,sK42) ),
introduced(choice_axiom,[]) ).
fof(f190,plain,
( ~ model(sK43,sK42)
& model(sK44,sK42) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK42,sK43,sK44])],[f54,f189,f188,f187]) ).
fof(f197,plain,
( ? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
=> ( ? [X2] : ~ model(X2,sK51)
& ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& ? [X5] : model(X5,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
( ? [X2] : ~ model(X2,sK51)
=> ~ model(sK52,sK51) ),
introduced(choice_axiom,[]) ).
fof(f199,plain,
( ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
=> ( model(sK53,sK51)
& ~ model(sK53,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f200,plain,
( ? [X5] : model(X5,sK50)
=> model(sK54,sK50) ),
introduced(choice_axiom,[]) ).
fof(f201,plain,
( ~ model(sK52,sK51)
& model(sK53,sK51)
& ~ model(sK53,sK50)
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& model(sK54,sK50) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK50,sK51,sK52,sK53,sK54])],[f71,f200,f199,f198,f197]) ).
fof(f209,plain,
! [X0,X1,X4] :
( status(X0,X1,sap)
| ~ model(X4,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f220,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f98]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( nota(X0,X1)
| status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f280,plain,
! [X0,X1] :
( ~ model(X0,not(X1))
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f183]) ).
fof(f282,plain,
! [X0,X1] :
( model(X0,X1)
| model(X0,not(X1)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f284,plain,
model(sK44,sK42),
inference(cnf_transformation,[],[f190]) ).
fof(f290,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f291,plain,
! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) ),
inference(cnf_transformation,[],[f201]) ).
fof(f294,plain,
~ model(sK52,sK51),
inference(cnf_transformation,[],[f201]) ).
fof(f298,plain,
~ nota(sap,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_53,plain,
( ~ model(X0,X1)
| status(X2,X1,sap) ),
inference(cnf_transformation,[],[f209]) ).
cnf(c_62,plain,
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| status(X0,X1,X3)
| nota(X2,X3) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_123,plain,
( ~ model(X0,not(X1))
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f280]) ).
cnf(c_125,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f282]) ).
cnf(c_129,plain,
model(sK44,sK42),
inference(cnf_transformation,[],[f284]) ).
cnf(c_134,plain,
~ model(sK52,sK51),
inference(cnf_transformation,[],[f294]) ).
cnf(c_137,plain,
( ~ model(X0,sK50)
| model(X0,sK51) ),
inference(cnf_transformation,[],[f291]) ).
cnf(c_138,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f290]) ).
cnf(c_142,negated_conjecture,
~ nota(sap,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_973,plain,
( ~ status(X0,X1,sap)
| status(X0,X1,thm) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1001,plain,
( ~ status(X0,X1,sap)
| status(X0,X1,thm) ),
inference(prop_impl_just,[status(thm)],[c_973]) ).
cnf(c_2398,plain,
model(sK54,sK51),
inference(superposition,[status(thm)],[c_138,c_137]) ).
cnf(c_2574,plain,
status(X0,sK42,sap),
inference(superposition,[status(thm)],[c_129,c_53]) ).
cnf(c_2581,plain,
status(X0,sK51,sap),
inference(superposition,[status(thm)],[c_2398,c_53]) ).
cnf(c_2600,plain,
( status(X0,not(X1),sap)
| model(X2,X1) ),
inference(superposition,[status(thm)],[c_125,c_53]) ).
cnf(c_2789,plain,
( ~ model(X0,not(sK51))
| ~ model(X0,sK51) ),
inference(instantiation,[status(thm)],[c_123]) ).
cnf(c_3341,plain,
status(X0,not(sK51),sap),
inference(superposition,[status(thm)],[c_2600,c_134]) ).
cnf(c_5013,plain,
status(X0,sK42,thm),
inference(superposition,[status(thm)],[c_2574,c_1001]) ).
cnf(c_5016,plain,
status(X0,sK51,thm),
inference(superposition,[status(thm)],[c_2581,c_1001]) ).
cnf(c_5503,plain,
status(X0,not(sK51),thm),
inference(superposition,[status(thm)],[c_3341,c_1001]) ).
cnf(c_5796,plain,
( ~ model(X0,X1)
| model(X0,sK42) ),
inference(superposition,[status(thm)],[c_5013,c_62]) ).
cnf(c_5854,plain,
( ~ model(X0,X1)
| model(X0,sK51) ),
inference(superposition,[status(thm)],[c_5016,c_62]) ).
cnf(c_6114,plain,
( ~ model(X0,X1)
| model(X0,not(sK51)) ),
inference(superposition,[status(thm)],[c_5503,c_62]) ).
cnf(c_6589,plain,
~ model(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_5796,c_2789,c_5854,c_6114]) ).
cnf(c_6592,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_125,c_6589]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS201+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:13:46 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.97/1.21 % SZS status Started for theBenchmark.p
% 3.97/1.21 % SZS status Theorem for theBenchmark.p
% 3.97/1.21
% 3.97/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.97/1.21
% 3.97/1.21 ------ iProver source info
% 3.97/1.21
% 3.97/1.21 git: date: 2024-05-02 19:28:25 +0000
% 3.97/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.97/1.21 git: non_committed_changes: false
% 3.97/1.21
% 3.97/1.21 ------ Parsing...
% 3.97/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.97/1.21
% 3.97/1.21 ------ 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.97/1.21
% 3.97/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.97/1.21 ------ Proving...
% 3.97/1.21 ------ Problem Properties
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21 clauses 91
% 3.97/1.21 conjectures 0
% 3.97/1.21 EPR 39
% 3.97/1.21 Horn 72
% 3.97/1.21 unary 13
% 3.97/1.21 binary 47
% 3.97/1.21 lits 220
% 3.97/1.21 lits eq 0
% 3.97/1.21 fd_pure 0
% 3.97/1.21 fd_pseudo 0
% 3.97/1.21 fd_cond 0
% 3.97/1.21 fd_pseudo_cond 0
% 3.97/1.21 AC symbols 0
% 3.97/1.21
% 3.97/1.21 ------ Schedule dynamic 5 is on
% 3.97/1.21
% 3.97/1.21 ------ no conjectures: strip conj schedule
% 3.97/1.21
% 3.97/1.21 ------ no equalities: superposition off
% 3.97/1.21
% 3.97/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21 ------
% 3.97/1.21 Current options:
% 3.97/1.21 ------
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21 ------ Proving...
% 3.97/1.21
% 3.97/1.21
% 3.97/1.21 % SZS status Theorem for theBenchmark.p
% 3.97/1.21
% 3.97/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/1.21
% 3.97/1.21
%------------------------------------------------------------------------------