TSTP Solution File: LCL962_16 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL962_16 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:40:23 EDT 2024
% Result : Theorem 2.00s 1.19s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 204 ( 0 equ)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 143 ( 63 ~; 53 |; 9 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 81 ( 81 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 9 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 47 ( 0 sgn 31 !; 5 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
tff(f3,axiom,
! [X0: '$ki_world'] : '$ki_accessible'('#idx(b)',X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','mrel_reflexive_#idx(b)') ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X0)
=> ( p(X0)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X0,X3)
=> p(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_axiom_1) ).
tff(f6,axiom,
( ~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b)','$ki_local_world',X0)
=> p(X0) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X0)
=> ~ ! [X3: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X0,X3)
=> p(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_axiom_2) ).
tff(f7,axiom,
~ p('$ki_local_world'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_a_axiom_1) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X0)
=> ~ p(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X0)
=> ~ p(X0) ),
inference(negated_conjecture,[],[f8]) ).
tff(f10,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X0)
=> ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X0,X1)
=> p(X1) ) ) ),
inference(rectify,[],[f5]) ).
tff(f11,plain,
( ~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b)','$ki_local_world',X0)
=> p(X0) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X1)
=> ~ ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X1,X2)
=> p(X2) ) ) ),
inference(rectify,[],[f6]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('#idx(b)',X0,X1) )
| ~ p(X0)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('#idx(b)',X0,X1) )
| ~ p(X0)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0) ),
inference(flattening,[],[f16]) ).
tff(f18,plain,
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'('#idx(b)',X1,X2) )
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X1) )
| ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f11]) ).
tff(f19,plain,
? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('#idx(a)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f20,plain,
( ! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'('#idx(b)',X0,X1) )
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ) ),
inference(rectify,[],[f18]) ).
tff(f21,plain,
! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'('#idx(b)',X0,X1) )
=> ( ~ p(sK0(X0))
& '$ki_accessible'('#idx(b)',X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
( ! [X0: '$ki_world'] :
( ( ~ p(sK0(X0))
& '$ki_accessible'('#idx(b)',X0,sK0(X0)) )
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).
tff(f23,plain,
( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('#idx(a)','$ki_local_world',X0) )
=> ( p(sK1)
& '$ki_accessible'('#idx(a)','$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
( p(sK1)
& '$ki_accessible'('#idx(a)','$ki_local_world',sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f19,f23]) ).
tff(f27,plain,
! [X0: '$ki_world'] : '$ki_accessible'('#idx(b)',X0,X0),
inference(cnf_transformation,[],[f3]) ).
tff(f29,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('#idx(b)',X0,X1)
| ~ p(X0)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f17]) ).
tff(f30,plain,
! [X2: '$ki_world',X0: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X0,sK0(X0))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0)
| p(X2)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ),
inference(cnf_transformation,[],[f22]) ).
tff(f31,plain,
! [X2: '$ki_world',X0: '$ki_world'] :
( ~ p(sK0(X0))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0)
| p(X2)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ),
inference(cnf_transformation,[],[f22]) ).
tff(f32,plain,
~ p('$ki_local_world'),
inference(cnf_transformation,[],[f7]) ).
tff(f33,plain,
'$ki_accessible'('#idx(a)','$ki_local_world',sK1),
inference(cnf_transformation,[],[f24]) ).
tff(f34,plain,
p(sK1),
inference(cnf_transformation,[],[f24]) ).
cnf(c_51,plain,
'$ki_accessible'('#idx(b)',X0_13,X0_13),
inference(cnf_transformation,[],[f27]) ).
cnf(c_53,plain,
( ~ '$ki_accessible'('#idx(b)',X0_13,X1_13)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0_13)
| ~ p(X0_13)
| p(X1_13) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,plain,
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0_13)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X1_13)
| ~ p(sK0(X0_13))
| p(X1_13) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_55,plain,
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0_13)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X1_13)
| '$ki_accessible'('#idx(b)',X0_13,sK0(X0_13))
| p(X1_13) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_56,plain,
~ p('$ki_local_world'),
inference(cnf_transformation,[],[f32]) ).
cnf(c_57,negated_conjecture,
p(sK1),
inference(cnf_transformation,[],[f34]) ).
cnf(c_58,negated_conjecture,
'$ki_accessible'('#idx(a)','$ki_local_world',sK1),
inference(cnf_transformation,[],[f33]) ).
cnf(c_59,plain,
'$ki_accessible'('#idx(b)','$ki_local_world','$ki_local_world'),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_109,plain,
( ~ '$ki_accessible'('#idx(b)','$ki_local_world',X0_13)
| p(X0_13)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_55]) ).
cnf(c_110,plain,
( '$ki_accessible'('#idx(b)',X0_13,sK0(X0_13))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0_13)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_55]) ).
cnf(c_111,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_55]) ).
cnf(c_112,plain,
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',X0_13)
| ~ p(sK0(X0_13))
| ~ sP2_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_def])],[c_54]) ).
cnf(c_113,plain,
( sP0_iProver_def
| sP2_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_54]) ).
cnf(c_116,plain,
( ~ '$ki_accessible'('#idx(b)','$ki_local_world','$ki_local_world')
| ~ sP0_iProver_def
| p('$ki_local_world') ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_119,plain,
( ~ '$ki_accessible'('#idx(b)',sK1,X0_13)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',sK1)
| ~ p(sK1)
| p(X0_13) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_123,plain,
( ~ '$ki_accessible'('#idx(b)',sK1,sK0(sK1))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',sK1)
| ~ p(sK1)
| p(sK0(sK1)) ),
inference(instantiation,[status(thm)],[c_119]) ).
cnf(c_124,plain,
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',sK1)
| ~ sP1_iProver_def
| '$ki_accessible'('#idx(b)',sK1,sK0(sK1)) ),
inference(instantiation,[status(thm)],[c_110]) ).
cnf(c_127,plain,
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',sK1)
| ~ p(sK0(sK1))
| ~ sP2_iProver_def ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_128,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_127,c_124,c_123,c_116,c_113,c_111,c_59,c_58,c_56,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL962_16 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu May 2 19:01:59 EDT 2024
% 0.13/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
% 2.00/1.19 % SZS status Started for theBenchmark.p
% 2.00/1.19 % SZS status Theorem for theBenchmark.p
% 2.00/1.19
% 2.00/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.00/1.19
% 2.00/1.19 ------ iProver source info
% 2.00/1.19
% 2.00/1.19 git: date: 2024-05-02 19:28:25 +0000
% 2.00/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.00/1.19 git: non_committed_changes: false
% 2.00/1.19
% 2.00/1.19 ------ Parsing...
% 2.00/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19 ------ Preprocessing... pe_s pe_e
% 2.00/1.19
% 2.00/1.19 ------ Preprocessing...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 2.00/1.19 gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.00/1.19 ------ Proving...
% 2.00/1.19 ------ Problem Properties
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19 clauses 13
% 2.00/1.19 conjectures 2
% 2.00/1.19 EPR 11
% 2.00/1.19 Horn 11
% 2.00/1.19 unary 5
% 2.00/1.19 binary 2
% 2.00/1.19 lits 28
% 2.00/1.19 lits eq 0
% 2.00/1.19 fd_pure 0
% 2.00/1.19 fd_pseudo 0
% 2.00/1.19 fd_cond 0
% 2.00/1.19 fd_pseudo_cond 0
% 2.00/1.19 AC symbols 0
% 2.00/1.19
% 2.00/1.19 ------ Schedule dynamic 5 is on
% 2.00/1.19
% 2.00/1.19 ------ no equalities: superposition off
% 2.00/1.19
% 2.00/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19 ------
% 2.00/1.19 Current options:
% 2.00/1.19 ------
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19 ------ Proving...
% 2.00/1.19
% 2.00/1.19
% 2.00/1.19 % SZS status Theorem for theBenchmark.p
% 2.00/1.19
% 2.00/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.00/1.19
% 2.00/1.20
%------------------------------------------------------------------------------