TSTP Solution File: SYO890_16 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO890_16 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 03:39:05 EDT 2024
% Result : Theorem 1.52s 1.19s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 107 ( 38 ~; 27 |; 26 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 45 ( 45 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 55 ( 0 sgn 35 !; 14 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(f3,axiom,
! [X0: '$ki_world',X1: '$ki_world',X3] :
( ( '$ki_accessible'(X0,X1)
& '$ki_exists_in_world_$i'(X0,X3) )
=> '$ki_exists_in_world_$i'(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).
tff(f5,conjecture,
( ? [X3] :
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( f(X0,X3)
& e(X0,X3) ) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f6,negated_conjecture,
~ ( ? [X3] :
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( f(X0,X3)
& e(X0,X3) ) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f7,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( ( '$ki_accessible'(X0,X1)
& '$ki_exists_in_world_$i'(X0,X2) )
=> '$ki_exists_in_world_$i'(X1,X2) ),
inference(rectify,[],[f3]) ).
tff(f9,plain,
~ ( ? [X0] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( f(X1,X0)
& e(X1,X0) ) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) ) ) ),
inference(rectify,[],[f6]) ).
tff(f10,plain,
~ ( ? [X0] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> f(X1,X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) ) ) ),
inference(pure_predicate_removal,[],[f9]) ).
tff(f13,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
tff(f14,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2) ),
inference(flattening,[],[f13]) ).
tff(f15,plain,
( ? [X2: '$ki_world'] :
( ! [X3] :
( ~ f(X2,X3)
| ~ '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) )
& ? [X0] :
( ! [X1: '$ki_world'] :
( f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f10]) ).
tff(f18,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ~ f(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
& ? [X2] :
( ! [X3: '$ki_world'] :
( f(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
inference(rectify,[],[f15]) ).
tff(f19,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ~ f(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1] :
( ~ f(sK1,X1)
| ~ '$ki_exists_in_world_$i'(sK1,X1) )
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f20,plain,
( ? [X2] :
( ! [X3: '$ki_world'] :
( f(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) )
=> ( ! [X3: '$ki_world'] :
( f(X3,sK2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f21,plain,
( ! [X1] :
( ~ f(sK1,X1)
| ~ '$ki_exists_in_world_$i'(sK1,X1) )
& '$ki_accessible'('$ki_local_world',sK1)
& ! [X3: '$ki_world'] :
( f(X3,sK2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f18,f20,f19]) ).
tff(f24,plain,
! [X2: $i,X0: '$ki_world',X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
tff(f26,plain,
'$ki_exists_in_world_$i'('$ki_local_world',sK2),
inference(cnf_transformation,[],[f21]) ).
tff(f27,plain,
! [X3: '$ki_world'] :
( f(X3,sK2)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(cnf_transformation,[],[f21]) ).
tff(f28,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f21]) ).
tff(f29,plain,
! [X1: $i] :
( ~ f(sK1,X1)
| ~ '$ki_exists_in_world_$i'(sK1,X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_51,plain,
( ~ '$ki_accessible'(X0_13,X1_13)
| ~ '$ki_exists_in_world_$i'(X0_13,X0)
| '$ki_exists_in_world_$i'(X1_13,X0) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_53,negated_conjecture,
( ~ f(sK1,X0)
| ~ '$ki_exists_in_world_$i'(sK1,X0) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| f(X0_13,sK2) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_56,negated_conjecture,
'$ki_exists_in_world_$i'('$ki_local_world',sK2),
inference(cnf_transformation,[],[f26]) ).
cnf(c_89,plain,
( ~ '$ki_accessible'('$ki_local_world',sK1)
| ~ '$ki_exists_in_world_$i'(sK1,sK2) ),
inference(resolution,[status(thm)],[c_53,c_55]) ).
cnf(c_120,plain,
( ~ '$ki_accessible'(X0_13,sK1)
| ~ '$ki_exists_in_world_$i'(X0_13,sK2)
| '$ki_exists_in_world_$i'(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_121,plain,
( ~ '$ki_accessible'('$ki_local_world',sK1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK2)
| '$ki_exists_in_world_$i'(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_120]) ).
cnf(c_122,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_121,c_89,c_54,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO890_16 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n012.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 20:03:40 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 1.52/1.19 % SZS status Started for theBenchmark.p
% 1.52/1.19 % SZS status Theorem for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.52/1.19
% 1.52/1.19 ------ iProver source info
% 1.52/1.19
% 1.52/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.52/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.52/1.19 git: non_committed_changes: false
% 1.52/1.19
% 1.52/1.19 ------ Parsing...
% 1.52/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
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing... pe_s pe:1:0s pe_e pe_s pe_e
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.52/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.19 ------ Proving...
% 1.52/1.19 ------ Problem Properties
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 clauses 7
% 1.52/1.19 conjectures 2
% 1.52/1.19 EPR 6
% 1.52/1.19 Horn 7
% 1.52/1.19 unary 5
% 1.52/1.19 binary 0
% 1.52/1.19 lits 11
% 1.52/1.19 lits eq 0
% 1.52/1.19 fd_pure 0
% 1.52/1.19 fd_pseudo 0
% 1.52/1.19 fd_cond 0
% 1.52/1.19 fd_pseudo_cond 0
% 1.52/1.19 AC symbols 0
% 1.52/1.19
% 1.52/1.19 ------ Schedule dynamic 5 is on
% 1.52/1.19
% 1.52/1.19 ------ no equalities: superposition off
% 1.52/1.19
% 1.52/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------
% 1.52/1.19 Current options:
% 1.52/1.19 ------
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Proving...
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 % SZS status Theorem for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.19
% 1.52/1.19
%------------------------------------------------------------------------------