TSTP Solution File: SYO887_22 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:04 EDT 2024
% Result : Theorem 0.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 73 ( 29 ~; 20 |; 17 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 28 ( 28 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 37 ( 0 sgn 19 !; 12 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f5,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) )
=> ? [X3] :
( ? [X0: '$ki_world'] :
( f(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f6,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) )
=> ? [X3] :
( ? [X0: '$ki_world'] :
( f(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f9,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( f(X0,X1)
& '$ki_exists_in_world_$i'(X0,X1) ) )
=> ? [X2] :
( ? [X3: '$ki_world'] :
( f(X3,X2)
& '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f14,plain,
( ! [X2] :
( ! [X3: '$ki_world'] :
( ~ f(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( ? [X1] :
( f(X0,X1)
& '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f9]) ).
tff(f17,plain,
( ! [X0] :
( ! [X1: '$ki_world'] :
( ~ f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2: '$ki_world'] :
( ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f14]) ).
tff(f18,plain,
! [X2: '$ki_world'] :
( ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) )
=> ( f(X2,sK1(X2))
& '$ki_exists_in_world_$i'(X2,sK1(X2)) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
( ! [X0] :
( ! [X1: '$ki_world'] :
( ~ f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2: '$ki_world'] :
( ( f(X2,sK1(X2))
& '$ki_exists_in_world_$i'(X2,sK1(X2)) )
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f17,f18]) ).
tff(f20,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f24,plain,
! [X2: '$ki_world'] :
( '$ki_exists_in_world_$i'(X2,sK1(X2))
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f19]) ).
tff(f25,plain,
! [X2: '$ki_world'] :
( f(X2,sK1(X2))
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f19]) ).
tff(f26,plain,
! [X0: $i,X1: '$ki_world'] :
( ~ f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X0_13),
inference(cnf_transformation,[],[f20]) ).
cnf(c_53,negated_conjecture,
( ~ f(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| f(X0_13,sK1(X0_13)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| '$ki_exists_in_world_$i'(X0_13,sK1(X0_13)) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,plain,
'$ki_accessible'('$ki_local_world','$ki_local_world'),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_58,plain,
( ~ '$ki_accessible'('$ki_local_world','$ki_local_world')
| '$ki_exists_in_world_$i'('$ki_local_world',sK1('$ki_local_world')) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_91,plain,
( ~ '$ki_exists_in_world_$i'('$ki_local_world',sK1(X0_13))
| ~ '$ki_accessible'('$ki_local_world',X0_13) ),
inference(resolution,[status(thm)],[c_53,c_54]) ).
cnf(c_92,plain,
( ~ '$ki_exists_in_world_$i'('$ki_local_world',sK1('$ki_local_world'))
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_93,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_92,c_58,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 20:11:57 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...
% 0.45/1.13 ------ 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.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... pe_s
% 0.45/1.13
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.13
% 0.45/1.13
%------------------------------------------------------------------------------