TSTP Solution File: SYO898_9 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO898_9 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:07 EDT 2024
% Result : Theorem 0.59s 0.98s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 43 ( 17 ~; 8 |; 6 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 17 ( 17 fml; 0 var)
% Number of types : 0 ( 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 : 25 ( 2 sgn 14 !; 6 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] :
? [X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_serial) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( ( q(X0)
=> p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( ( q(X0)
=> p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( ( q(X1)
=> p(X1) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(pure_predicate_removal,[],[f4]) ).
tff(f6,plain,
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f7,plain,
! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] : '$ki_accessible'(X0,X1)
=> '$ki_accessible'(X0,sK0(X0)) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,sK0(X0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f7]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(rectify,[],[f6]) ).
tff(f10,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,sK0(X0)),
inference(cnf_transformation,[],[f8]) ).
tff(f11,plain,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f9]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,sK0(X0_13)),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ p(X0_13) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| p(X0_13) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_55,negated_conjecture,
~ '$ki_accessible'('$ki_local_world',X0_13),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_50]) ).
cnf(c_58,negated_conjecture,
~ '$ki_accessible'('$ki_local_world',X0_13),
inference(global_subsumption_just,[status(thm)],[c_50,c_55]) ).
cnf(c_64,plain,
$false,
inference(resolution,[status(thm)],[c_49,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYO898_9 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.07 % Command : run_iprover %s %d THM
% 0.07/0.26 % Computer : n005.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Thu May 2 20:04:26 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.33 Running first-order theorem proving
% 0.10/0.33 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
% 0.59/0.98 % SZS status Started for theBenchmark.p
% 0.59/0.98 % SZS status Theorem for theBenchmark.p
% 0.59/0.98
% 0.59/0.98 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.59/0.98
% 0.59/0.98 ------ iProver source info
% 0.59/0.98
% 0.59/0.98 git: date: 2024-05-02 19:28:25 +0000
% 0.59/0.98 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.59/0.98 git: non_committed_changes: false
% 0.59/0.98
% 0.59/0.98 ------ Parsing...
% 0.59/0.98 ------ 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.59/0.98
% 0.59/0.98
% 0.59/0.98 ------ Preprocessing... pe_s
% 0.59/0.98
% 0.59/0.98 % SZS status Theorem for theBenchmark.p
% 0.59/0.98
% 0.59/0.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.59/0.98
% 0.59/0.98
%------------------------------------------------------------------------------