TSTP Solution File: KRS216+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS216+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:57 EDT 2024
% Result : Theorem 3.62s 1.14s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 18 unt; 0 def)
% Number of atoms : 139 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 146 ( 62 ~; 47 |; 22 &)
% ( 8 <=>; 7 =>; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 128 ( 2 sgn 82 !; 23 ?)
% 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(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(f26,axiom,
! [X8,X9] :
( model(X8,X9)
<=> ~ model(X8,not(X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not) ).
fof(f27,axiom,
? [X9] :
! [X8] : model(X8,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tautology) ).
fof(f29,axiom,
? [X9] :
! [X8] : ~ model(X8,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contradiction) ).
fof(f33,conjecture,
nota(uns,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota_uns_thm) ).
fof(f34,negated_conjecture,
~ nota(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(f48,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
inference(rectify,[],[f22]) ).
fof(f52,plain,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
inference(rectify,[],[f26]) ).
fof(f53,plain,
? [X0] :
! [X1] : model(X1,X0),
inference(rectify,[],[f27]) ).
fof(f55,plain,
? [X0] :
! [X1] : ~ model(X1,X0),
inference(rectify,[],[f29]) ).
fof(f59,plain,
~ nota(uns,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(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(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(f184,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,not(X1))
| ~ model(X0,X1) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f185,plain,
( ? [X0] :
! [X1] : model(X1,X0)
=> ! [X1] : model(X1,sK41) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
! [X1] : model(X1,sK41),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41])],[f53,f185]) ).
fof(f191,plain,
( ? [X0] :
! [X1] : ~ model(X1,X0)
=> ! [X1] : ~ model(X1,sK45) ),
introduced(choice_axiom,[]) ).
fof(f192,plain,
! [X1] : ~ model(X1,sK45),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK45])],[f55,f191]) ).
fof(f220,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f98]) ).
fof(f270,plain,
! [X0,X1] :
( status(X0,X1,uns)
| ~ model(sK37(X1),not(X1))
| ~ model(sK38(X0),X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( nota(X0,X1)
| status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f282,plain,
! [X0,X1] :
( model(X0,X1)
| model(X0,not(X1)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f283,plain,
! [X1] : model(X1,sK41),
inference(cnf_transformation,[],[f186]) ).
fof(f286,plain,
! [X1] : ~ model(X1,sK45),
inference(cnf_transformation,[],[f192]) ).
fof(f298,plain,
~ nota(uns,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_62,plain,
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_116,plain,
( ~ model(sK37(X0),not(X0))
| ~ model(sK38(X1),X1)
| status(X1,X0,uns) ),
inference(cnf_transformation,[],[f270]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| status(X0,X1,X3)
| nota(X2,X3) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_125,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f282]) ).
cnf(c_127,plain,
model(X0,sK41),
inference(cnf_transformation,[],[f283]) ).
cnf(c_130,plain,
~ model(X0,sK45),
inference(cnf_transformation,[],[f286]) ).
cnf(c_142,negated_conjecture,
~ nota(uns,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_973,plain,
( ~ status(X0,X1,uns)
| status(X0,X1,thm) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1023,plain,
( status(X0,X1,thm)
| ~ status(X0,X1,uns) ),
inference(prop_impl_just,[status(thm)],[c_973]) ).
cnf(c_1024,plain,
( ~ status(X0,X1,uns)
| status(X0,X1,thm) ),
inference(renaming,[status(thm)],[c_1023]) ).
cnf(c_3344,plain,
( ~ model(sK38(X0),X0)
| model(sK37(X1),X1)
| status(X0,X1,uns) ),
inference(superposition,[status(thm)],[c_125,c_116]) ).
cnf(c_6227,plain,
( model(sK37(X0),X0)
| status(sK41,X0,uns) ),
inference(superposition,[status(thm)],[c_127,c_3344]) ).
cnf(c_7105,plain,
status(sK41,sK45,uns),
inference(superposition,[status(thm)],[c_6227,c_130]) ).
cnf(c_7427,plain,
status(sK41,sK45,thm),
inference(superposition,[status(thm)],[c_7105,c_1024]) ).
cnf(c_7433,plain,
( ~ model(X0,sK41)
| model(X0,sK45) ),
inference(superposition,[status(thm)],[c_7427,c_62]) ).
cnf(c_7434,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7433,c_130,c_127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS216+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 22:29:19 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.62/1.14 % SZS status Started for theBenchmark.p
% 3.62/1.14 % SZS status Theorem for theBenchmark.p
% 3.62/1.14
% 3.62/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.62/1.14
% 3.62/1.14 ------ iProver source info
% 3.62/1.14
% 3.62/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.62/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.62/1.14 git: non_committed_changes: false
% 3.62/1.14
% 3.62/1.14 ------ Parsing...
% 3.62/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.62/1.14
% 3.62/1.14 ------ 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.62/1.14
% 3.62/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.14 ------ Proving...
% 3.62/1.14 ------ Problem Properties
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14 clauses 91
% 3.62/1.14 conjectures 0
% 3.62/1.14 EPR 39
% 3.62/1.14 Horn 72
% 3.62/1.14 unary 13
% 3.62/1.14 binary 47
% 3.62/1.14 lits 220
% 3.62/1.14 lits eq 0
% 3.62/1.14 fd_pure 0
% 3.62/1.14 fd_pseudo 0
% 3.62/1.14 fd_cond 0
% 3.62/1.14 fd_pseudo_cond 0
% 3.62/1.14 AC symbols 0
% 3.62/1.14
% 3.62/1.14 ------ Schedule dynamic 5 is on
% 3.62/1.14
% 3.62/1.14 ------ no conjectures: strip conj schedule
% 3.62/1.14
% 3.62/1.14 ------ no equalities: superposition off
% 3.62/1.14
% 3.62/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14 ------
% 3.62/1.14 Current options:
% 3.62/1.14 ------
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14 ------ Proving...
% 3.62/1.14
% 3.62/1.14
% 3.62/1.14 % SZS status Theorem for theBenchmark.p
% 3.62/1.14
% 3.62/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.14
% 3.62/1.14
%------------------------------------------------------------------------------