TSTP Solution File: KRS260+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS260+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:34:00 EDT 2024
% Result : Theorem 6.40s 1.65s
% Output : CNFRefutation 6.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 79 ( 20 unt; 0 def)
% Number of atoms : 237 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 267 ( 109 ~; 81 |; 53 &)
% ( 11 <=>; 13 =>; 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 : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 200 ( 16 sgn 108 !; 47 ?)
% 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(f13,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cax) ).
fof(f20,axiom,
! [X6,X7] :
( ? [X0,X1] :
( status(X0,X1,X7)
& status(X0,X1,X6) )
<=> mighta(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta) ).
fof(f26,axiom,
! [X8,X9] :
( model(X8,X9)
<=> ~ model(X8,not(X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not) ).
fof(f28,axiom,
? [X9] :
( ? [X3] : ~ model(X3,X9)
& ? [X2] : model(X2,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satisfiable) ).
fof(f29,axiom,
? [X9] :
! [X8] : ~ model(X8,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',contradiction) ).
fof(f33,conjecture,
mighta(wec,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_wec_thm) ).
fof(f34,negated_conjecture,
~ mighta(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(f46,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
inference(rectify,[],[f20]) ).
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(f55,plain,
? [X0] :
! [X1] : ~ model(X1,X0),
inference(rectify,[],[f29]) ).
fof(f59,plain,
~ mighta(wec,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
=> mighta(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
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(f66,plain,
! [X0,X1] :
( ! [X2] : ~ model(X2,X0)
<=> status(X0,X1,cax) ),
inference(ennf_transformation,[],[f13]) ).
fof(f70,plain,
! [X0,X1] :
( mighta(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(f144,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X2] : model(X2,X0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f145,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X3] : model(X3,X0) ) ),
inference(rectify,[],[f144]) ).
fof(f146,plain,
! [X0] :
( ? [X3] : model(X3,X0)
=> model(sK28(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| model(sK28(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28])],[f145,f146]) ).
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(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(f219,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f220,plain,
! [X2,X0,X1] :
( model(X2,X1)
| ~ model(X2,X0)
| ~ status(X0,X1,thm) ),
inference(cnf_transformation,[],[f98]) ).
fof(f230,plain,
! [X0,X1,X7,X5] :
( status(X0,X1,wec)
| model(X5,X0)
| ~ model(X5,X1)
| ~ model(sK16(X0,X1),X1)
| ~ model(X7,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f255,plain,
! [X0,X1] :
( status(X0,X1,cax)
| model(sK28(X0),X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f256,plain,
! [X2,X0,X1] :
( ~ model(X2,X0)
| ~ status(X0,X1,cax) ),
inference(cnf_transformation,[],[f147]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( mighta(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(f284,plain,
model(sK44,sK42),
inference(cnf_transformation,[],[f190]) ).
fof(f285,plain,
~ model(sK43,sK42),
inference(cnf_transformation,[],[f190]) ).
fof(f286,plain,
! [X1] : ~ model(X1,sK45),
inference(cnf_transformation,[],[f192]) ).
fof(f298,plain,
~ mighta(wec,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_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_77,plain,
( ~ model(sK16(X0,X1),X1)
| ~ model(X2,X1)
| ~ model(X3,X0)
| status(X0,X1,wec)
| model(X2,X0) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_99,plain,
( ~ status(X0,X1,cax)
| ~ model(X2,X0) ),
inference(cnf_transformation,[],[f256]) ).
cnf(c_100,plain,
( model(sK28(X0),X0)
| status(X0,X1,cax) ),
inference(cnf_transformation,[],[f255]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| ~ status(X0,X1,X3)
| mighta(X3,X2) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_125,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(cnf_transformation,[],[f282]) ).
cnf(c_128,plain,
~ model(sK43,sK42),
inference(cnf_transformation,[],[f285]) ).
cnf(c_129,plain,
model(sK44,sK42),
inference(cnf_transformation,[],[f284]) ).
cnf(c_130,plain,
~ model(X0,sK45),
inference(cnf_transformation,[],[f286]) ).
cnf(c_142,negated_conjecture,
~ mighta(wec,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_974,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wec) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1020,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wec) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
cnf(c_1988,plain,
( model(X0,not(sK45))
| model(X0,sK45) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_2572,plain,
( model(sK9(X0,not(X1)),X1)
| status(X0,not(X1),thm) ),
inference(superposition,[status(thm)],[c_125,c_63]) ).
cnf(c_3477,plain,
( ~ model(X0,X1)
| model(sK28(X1),X1) ),
inference(superposition,[status(thm)],[c_100,c_99]) ).
cnf(c_3575,plain,
model(sK28(sK42),sK42),
inference(superposition,[status(thm)],[c_129,c_3477]) ).
cnf(c_7239,plain,
status(X0,not(sK45),thm),
inference(superposition,[status(thm)],[c_2572,c_130]) ).
cnf(c_8122,plain,
~ status(X0,not(sK45),wec),
inference(superposition,[status(thm)],[c_7239,c_1020]) ).
cnf(c_8123,plain,
( ~ model(X0,X1)
| model(X0,not(sK45)) ),
inference(superposition,[status(thm)],[c_7239,c_62]) ).
cnf(c_9603,plain,
model(X0,not(sK45)),
inference(global_subsumption_just,[status(thm)],[c_8123,c_130,c_1988]) ).
cnf(c_9613,plain,
( ~ model(X0,not(sK45))
| ~ model(X1,X2)
| status(X2,not(sK45),wec)
| model(X0,X2) ),
inference(superposition,[status(thm)],[c_9603,c_77]) ).
cnf(c_9618,plain,
( ~ model(X0,X1)
| status(X1,not(sK45),wec)
| model(X2,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9613,c_9603]) ).
cnf(c_9619,plain,
( ~ model(X0,X1)
| model(X2,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9618,c_8122]) ).
cnf(c_9808,plain,
model(X0,sK42),
inference(superposition,[status(thm)],[c_3575,c_9619]) ).
cnf(c_9850,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_128,c_9808]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : KRS260+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.02/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu May 2 22:38:35 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 6.40/1.65 % SZS status Started for theBenchmark.p
% 6.40/1.65 % SZS status Theorem for theBenchmark.p
% 6.40/1.65
% 6.40/1.65 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 6.40/1.65
% 6.40/1.65 ------ iProver source info
% 6.40/1.65
% 6.40/1.65 git: date: 2024-05-02 19:28:25 +0000
% 6.40/1.65 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 6.40/1.65 git: non_committed_changes: false
% 6.40/1.65
% 6.40/1.65 ------ Parsing...
% 6.40/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 6.40/1.65
% 6.40/1.65 ------ 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
% 6.40/1.65
% 6.40/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 6.40/1.65 ------ Proving...
% 6.40/1.65 ------ Problem Properties
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65 clauses 91
% 6.40/1.65 conjectures 0
% 6.40/1.65 EPR 39
% 6.40/1.65 Horn 72
% 6.40/1.65 unary 13
% 6.40/1.65 binary 47
% 6.40/1.65 lits 220
% 6.40/1.65 lits eq 0
% 6.40/1.65 fd_pure 0
% 6.40/1.65 fd_pseudo 0
% 6.40/1.65 fd_cond 0
% 6.40/1.65 fd_pseudo_cond 0
% 6.40/1.65 AC symbols 0
% 6.40/1.65
% 6.40/1.65 ------ Schedule dynamic 5 is on
% 6.40/1.65
% 6.40/1.65 ------ no conjectures: strip conj schedule
% 6.40/1.65
% 6.40/1.65 ------ no equalities: superposition off
% 6.40/1.65
% 6.40/1.65 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65 ------
% 6.40/1.65 Current options:
% 6.40/1.65 ------
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65 ------ Proving...
% 6.40/1.65
% 6.40/1.65
% 6.40/1.65 % SZS status Theorem for theBenchmark.p
% 6.40/1.65
% 6.40/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.40/1.65
% 6.40/1.65
%------------------------------------------------------------------------------