TSTP Solution File: SYO894_8 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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 1.55s 1.20s
% Output : CNFRefutation 1.55s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f27)
% Comments :
%------------------------------------------------------------------------------
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ p(X0) ) )
<=> ~ ? [X0: '$ki_world'] :
( 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)
=> ~ p(X0) ) )
<=> ~ ? [X0: '$ki_world'] :
( 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)
=> ~ p(X0) ) )
<=> ~ ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(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,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
<~> ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f5]) ).
tff(f7,plain,
( ( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) )
| ? [X0: '$ki_world'] :
( p(X0)
& p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) )
& ( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f8,plain,
( ( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
| ? [X1: '$ki_world'] :
( p(X1)
& p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) )
& ( ! [X2: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
| ! [X3: '$ki_world'] :
( ~ p(X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(rectify,[],[f7]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
( ? [X1: '$ki_world'] :
( p(X1)
& p(X1)
& '$ki_accessible'('$ki_local_world',X1) )
=> ( p(sK1)
& p(sK1)
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ( ( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0) )
| ( p(sK1)
& p(sK1)
& '$ki_accessible'('$ki_local_world',sK1) ) )
& ( ! [X2: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
| ! [X3: '$ki_world'] :
( ~ p(X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
tff(f14,plain,
( '$ki_accessible'('$ki_local_world',sK0)
| '$ki_accessible'('$ki_local_world',sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f15,plain,
( '$ki_accessible'('$ki_local_world',sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f17,plain,
( p(sK0)
| '$ki_accessible'('$ki_local_world',sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f18,plain,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,negated_conjecture,
( '$ki_accessible'('$ki_local_world',sK1)
| p(sK0) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,negated_conjecture,
( '$ki_accessible'('$ki_local_world',sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_55,negated_conjecture,
( '$ki_accessible'('$ki_local_world',sK0)
| '$ki_accessible'('$ki_local_world',sK1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_56,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| ~ p(X0_13)
| ~ p(X1_13) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_111,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ p(X0_13)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_56]) ).
cnf(c_112,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_56]) ).
cnf(c_113,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_112]) ).
cnf(c_115,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ p(X0_13)
| ~ sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_111]) ).
cnf(c_120,plain,
( ~ '$ki_accessible'('$ki_local_world',sK0)
| ~ p(sK0)
| ~ sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_121,plain,
( ~ '$ki_accessible'('$ki_local_world',sK1)
| ~ p(sK1)
| ~ sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_122,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_121,c_120,c_113,c_55,c_52,c_54,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.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:09:12 EDT 2024
% 0.13/0.35 % 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.55/1.20 % SZS status Started for theBenchmark.p
% 1.55/1.20 % SZS status Theorem for theBenchmark.p
% 1.55/1.20
% 1.55/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.55/1.20
% 1.55/1.20 ------ iProver source info
% 1.55/1.20
% 1.55/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.55/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.55/1.20 git: non_committed_changes: false
% 1.55/1.20
% 1.55/1.20 ------ Parsing...
% 1.55/1.20 ------ 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.55/1.20
% 1.55/1.20
% 1.55/1.20 ------ Preprocessing... pe_s pe_e pe_s pe_e
% 1.55/1.20
% 1.55/1.20 ------ Preprocessing...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.55/1.20 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.55/1.20 ------ Proving...
% 1.55/1.20 ------ Problem Properties
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20 clauses 7
% 1.55/1.20 conjectures 6
% 1.55/1.20 EPR 7
% 1.55/1.20 Horn 3
% 1.55/1.20 unary 2
% 1.55/1.20 binary 4
% 1.55/1.20 lits 13
% 1.55/1.20 lits eq 0
% 1.55/1.20 fd_pure 0
% 1.55/1.20 fd_pseudo 0
% 1.55/1.20 fd_cond 0
% 1.55/1.20 fd_pseudo_cond 0
% 1.55/1.20 AC symbols 0
% 1.55/1.20
% 1.55/1.20 ------ Schedule EPR non Horn non eq is on
% 1.55/1.20
% 1.55/1.20 ------ no equalities: superposition off
% 1.55/1.20
% 1.55/1.20 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20 ------
% 1.55/1.20 Current options:
% 1.55/1.20 ------
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20 ------ Proving...
% 1.55/1.20
% 1.55/1.20
% 1.55/1.20 % SZS status Theorem for theBenchmark.p
% 1.55/1.20
% 1.55/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.55/1.20
% 1.55/1.20
%------------------------------------------------------------------------------