TSTP Solution File: SYO899_8 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO899_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 1.80s 1.22s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 110 ( 42 ~; 32 |; 20 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 42 ( 0 sgn 25 !; 10 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> p(X2) )
=> ? [X3: '$ki_world'] :
( q(X3)
& '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(flattening,[],[f5]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ? [X2: '$ki_world'] :
( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X2,X3) )
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f8,plain,
( ? [X2: '$ki_world'] :
( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X2,X3) )
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
=> ( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ~ p(sK0) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ~ p(sK0) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
tff(f10,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f9]) ).
tff(f12,plain,
! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f9]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( ~ q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X0_13),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ q(X0_13) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| p(X0_13) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
( ~ '$ki_accessible'(sK0,X0_13)
| ~ p(sK0)
| q(X0_13) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_76,plain,
( ~ '$ki_accessible'(sK0,X0_13)
| ~ '$ki_accessible'('$ki_local_world',sK0)
| q(X0_13) ),
inference(resolution,[status(thm)],[c_51,c_52]) ).
cnf(c_78,plain,
( ~ '$ki_accessible'(sK0,X0_13)
| q(X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_76,c_53,c_76]) ).
cnf(c_89,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ '$ki_accessible'(sK0,X0_13) ),
inference(resolution,[status(thm)],[c_78,c_50]) ).
cnf(c_107,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK0),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_108,plain,
~ '$ki_accessible'(sK0,sK0),
inference(resolution,[status(thm)],[c_89,c_107]) ).
cnf(c_110,plain,
$false,
inference(resolution,[status(thm)],[c_49,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO899_8 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:00:41 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.80/1.22 % SZS status Started for theBenchmark.p
% 1.80/1.22 % SZS status Theorem for theBenchmark.p
% 1.80/1.22
% 1.80/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.80/1.22
% 1.80/1.22 ------ iProver source info
% 1.80/1.22
% 1.80/1.22 git: date: 2024-05-02 19:28:25 +0000
% 1.80/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.80/1.22 git: non_committed_changes: false
% 1.80/1.22
% 1.80/1.22 ------ Parsing...
% 1.80/1.22 ------ 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.80/1.22
% 1.80/1.22
% 1.80/1.22 ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe_e pe_s pe_e
% 1.80/1.22
% 1.80/1.22 ------ Preprocessing...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.80/1.22 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.80/1.22 ------ Proving...
% 1.80/1.22 ------ Problem Properties
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22 clauses 3
% 1.80/1.22 conjectures 1
% 1.80/1.22 EPR 3
% 1.80/1.22 Horn 3
% 1.80/1.22 unary 2
% 1.80/1.22 binary 1
% 1.80/1.22 lits 4
% 1.80/1.22 lits eq 0
% 1.80/1.22 fd_pure 0
% 1.80/1.22 fd_pseudo 0
% 1.80/1.22 fd_cond 0
% 1.80/1.22 fd_pseudo_cond 0
% 1.80/1.22 AC symbols 0
% 1.80/1.22
% 1.80/1.22 ------ Schedule EPR Horn non eq is on
% 1.80/1.22
% 1.80/1.22 ------ no equalities: superposition off
% 1.80/1.22
% 1.80/1.22 ------ Option_epr_horn Time Limit: Unbounded
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22 ------
% 1.80/1.22 Current options:
% 1.80/1.22 ------
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22 ------ Proving...
% 1.80/1.22
% 1.80/1.22
% 1.80/1.22 % SZS status Theorem for theBenchmark.p
% 1.80/1.22
% 1.80/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.22
% 1.80/1.22
%------------------------------------------------------------------------------