TSTP Solution File: PLA053_2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PLA053_2 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:53:58 EDT 2024
% Result : Theorem 0.73s 1.14s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 223 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 197 ( 77 ~; 59 |; 41 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 59 ( 59 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 77 ( 5 sgn 44 !; 16 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f2,axiom,
! [X0: '$ki_world',X1] : '$ki_exists_in_world_$i'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X5] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> ( ( h(X4,X5)
& bomb(X4,X1) )
=> defused(X4,X1) ) )
& '$ki_exists_in_world_$i'(X0,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
tff(f7,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X5] :
( ( ( h(X0,X5)
& bomb(X0,X1) )
=> defused(X0,X1) )
& '$ki_exists_in_world_$i'(X0,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f8,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X5] :
( ( ( h(X0,X5)
& bomb(X0,X1) )
=> defused(X0,X1) )
& '$ki_exists_in_world_$i'(X0,X5) ) ) ),
inference(negated_conjecture,[],[f7]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X2] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ( ( h(X3,X2)
& bomb(X3,X1) )
=> defused(X3,X1) ) )
& '$ki_exists_in_world_$i'(X0,X2) ) ) ),
inference(rectify,[],[f6]) ).
tff(f12,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X2] :
( ( ( h(X0,X2)
& bomb(X0,X1) )
=> defused(X0,X1) )
& '$ki_exists_in_world_$i'(X0,X2) ) ) ),
inference(rectify,[],[f8]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f16]) ).
tff(f18,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f12]) ).
tff(f19,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f18]) ).
tff(f26,plain,
! [X0: '$ki_world',X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
=> ( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,sK3(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,sK3(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,sK3(X0,X1)) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f17,f26]) ).
tff(f28,plain,
( ? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1] :
( ! [X2] :
( ( ~ defused(sK4,X1)
& h(sK4,X2)
& bomb(sK4,X1) )
| ~ '$ki_exists_in_world_$i'(sK4,X2) )
& '$ki_exists_in_world_$i'(sK4,X1) )
& '$ki_accessible'('$ki_local_world',sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
( ? [X1] :
( ! [X2] :
( ( ~ defused(sK4,X1)
& h(sK4,X2)
& bomb(sK4,X1) )
| ~ '$ki_exists_in_world_$i'(sK4,X2) )
& '$ki_exists_in_world_$i'(sK4,X1) )
=> ( ! [X2] :
( ( ~ defused(sK4,sK5)
& h(sK4,X2)
& bomb(sK4,sK5) )
| ~ '$ki_exists_in_world_$i'(sK4,X2) )
& '$ki_exists_in_world_$i'(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f30,plain,
( ! [X2] :
( ( ~ defused(sK4,sK5)
& h(sK4,X2)
& bomb(sK4,sK5) )
| ~ '$ki_exists_in_world_$i'(sK4,X2) )
& '$ki_exists_in_world_$i'(sK4,sK5)
& '$ki_accessible'('$ki_local_world',sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f19,f29,f28]) ).
tff(f31,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f32,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f2]) ).
tff(f39,plain,
! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
( defused(X3,X1)
| ~ h(X3,sK3(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f27]) ).
tff(f40,plain,
'$ki_accessible'('$ki_local_world',sK4),
inference(cnf_transformation,[],[f30]) ).
tff(f41,plain,
'$ki_exists_in_world_$i'(sK4,sK5),
inference(cnf_transformation,[],[f30]) ).
tff(f42,plain,
! [X2: $i] :
( bomb(sK4,sK5)
| ~ '$ki_exists_in_world_$i'(sK4,X2) ),
inference(cnf_transformation,[],[f30]) ).
tff(f43,plain,
! [X2: $i] :
( h(sK4,X2)
| ~ '$ki_exists_in_world_$i'(sK4,X2) ),
inference(cnf_transformation,[],[f30]) ).
tff(f44,plain,
! [X2: $i] :
( ~ defused(sK4,sK5)
| ~ '$ki_exists_in_world_$i'(sK4,X2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X0_13),
inference(cnf_transformation,[],[f31]) ).
cnf(c_50,plain,
'$ki_exists_in_world_$i'(X0_13,X0),
inference(cnf_transformation,[],[f32]) ).
cnf(c_56,plain,
( ~ h(X0_13,sK3(X1_13,X0))
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ bomb(X0_13,X0)
| ~ '$ki_exists_in_world_$i'(X1_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| defused(X0_13,X0) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_58,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK4,X0)
| ~ defused(sK4,sK5) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_59,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK4,X0)
| h(sK4,X0) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_60,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK4,X0)
| bomb(sK4,sK5) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_61,negated_conjecture,
'$ki_exists_in_world_$i'(sK4,sK5),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK4),
inference(cnf_transformation,[],[f40]) ).
cnf(c_63,plain,
'$ki_accessible'(sK4,sK4),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_65,plain,
( ~ '$ki_exists_in_world_$i'(sK4,sK5)
| bomb(sK4,sK5) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_67,plain,
( ~ defused(sK4,sK5)
| ~ '$ki_exists_in_world_$i'(sK4,sK5) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_74,negated_conjecture,
~ defused(sK4,sK5),
inference(global_subsumption_just,[status(thm)],[c_58,c_61,c_67]) ).
cnf(c_85,plain,
h(sK4,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_59,c_50]) ).
cnf(c_86,plain,
( ~ h(X0_13,sK3(X1_13,X0))
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ bomb(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| defused(X0_13,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_50]) ).
cnf(c_121,plain,
( ~ h(sK4,sK3(X0_13,sK5))
| ~ '$ki_accessible'(X0_13,sK4)
| ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ bomb(sK4,sK5) ),
inference(resolution,[status(thm)],[c_86,c_74]) ).
cnf(c_123,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ '$ki_accessible'(X0_13,sK4)
| ~ h(sK4,sK3(X0_13,sK5)) ),
inference(global_subsumption_just,[status(thm)],[c_121,c_61,c_65,c_121]) ).
cnf(c_124,plain,
( ~ h(sK4,sK3(X0_13,sK5))
| ~ '$ki_accessible'(X0_13,sK4)
| ~ '$ki_accessible'('$ki_local_world',X0_13) ),
inference(renaming,[status(thm)],[c_123]) ).
cnf(c_132,plain,
( ~ '$ki_accessible'(X0_13,sK4)
| ~ '$ki_accessible'('$ki_local_world',X0_13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_124,c_85]) ).
cnf(c_135,plain,
( ~ '$ki_accessible'('$ki_local_world',sK4)
| ~ '$ki_accessible'(sK4,sK4) ),
inference(instantiation,[status(thm)],[c_132]) ).
cnf(c_136,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_135,c_63,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PLA053_2 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n016.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:08:00 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.45 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
% 0.73/1.14 % SZS status Started for theBenchmark.p
% 0.73/1.14 % SZS status Theorem for theBenchmark.p
% 0.73/1.14
% 0.73/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.73/1.14
% 0.73/1.14 ------ iProver source info
% 0.73/1.14
% 0.73/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.73/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.73/1.14 git: non_committed_changes: false
% 0.73/1.14
% 0.73/1.14 ------ Parsing...
% 0.73/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 ------ Preprocessing... pe_s pe:1:0s
% 0.73/1.14
% 0.73/1.14 % SZS status Theorem for theBenchmark.p
% 0.73/1.14
% 0.73/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.14
% 0.73/1.14
%------------------------------------------------------------------------------