TSTP Solution File: SYO895_9 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO895_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:06 EDT 2024
% Result : Theorem 0.78s 1.18s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 88 ( 34 ~; 21 |; 20 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 35 ( 35 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 25 ( 0 sgn 19 !; 4 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(f2,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f4,plain,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> p(X1) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ( q(X2)
& p(X2) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ? [X2: '$ki_world'] :
( ( ~ q(X2)
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ? [X2: '$ki_world'] :
( ( ~ q(X2)
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f5]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( ( ~ q(X0)
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f10,plain,
( ? [X0: '$ki_world'] :
( ( ~ q(X0)
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ( ~ q(sK1)
| ~ p(sK1) )
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ( ~ q(sK1)
| ~ p(sK1) )
& '$ki_accessible'('$ki_local_world',sK1)
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f9,f10]) ).
tff(f13,plain,
! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f11]) ).
tff(f14,plain,
! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f15,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f11]) ).
tff(f16,plain,
( ~ q(sK1)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,negated_conjecture,
( ~ p(sK1)
| ~ q(sK1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_51,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_52,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| q(X0_13) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_53,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| p(X0_13) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_73,plain,
( ~ '$ki_accessible'('$ki_local_world',sK1)
| ~ q(sK1) ),
inference(resolution,[status(thm)],[c_50,c_53]) ).
cnf(c_74,plain,
~ q(sK1),
inference(global_subsumption_just,[status(thm)],[c_73,c_51,c_73]) ).
cnf(c_80,plain,
~ '$ki_accessible'('$ki_local_world',sK1),
inference(resolution,[status(thm)],[c_74,c_52]) ).
cnf(c_81,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_80,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO895_9 : TPTP v8.2.0. Released v8.2.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 20:06:56 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.78/1.18 % SZS status Started for theBenchmark.p
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.78/1.18
% 0.78/1.18 ------ iProver source info
% 0.78/1.18
% 0.78/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.78/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.78/1.18 git: non_committed_changes: false
% 0.78/1.18
% 0.78/1.18 ------ Parsing...
% 0.78/1.18 ------ 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.78/1.18
% 0.78/1.18
% 0.78/1.18 ------ Preprocessing... pe_s pe:1:0s
% 0.78/1.18
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.18
% 0.78/1.18
%------------------------------------------------------------------------------