↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYO890_16 : TPTP v9.3.1. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:52:16 PM UTC 2026

% Result   : Theorem 1.52s 1.48s
% Output   : CNFRefutation 1.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO890_16 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.57  % Computer : n003.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Fri Sep 25 03:59:52 UTC 2026
% 0.09/0.57  % CPUTime  : 
% 0.09/0.57  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.61  Running first-order theorem proving
% 0.09/0.61  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.63  
% 0.13/0.63  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.63  
% 0.13/0.63  % Detected problem language: tptp
% 0.13/0.64  % Proving...
% 1.52/1.48  % SZS status Started for theBenchmark.p
% 1.52/1.48  % SZS status Theorem for theBenchmark.p
% 1.52/1.48  
% 1.52/1.48  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.52/1.48  
% 1.52/1.48  % ------  iProver source info
% 1.52/1.48  
% 1.52/1.48  % git: date: 2026-07-19 20:42:38 +0200
% 1.52/1.48  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.52/1.48  % git: non_committed_changes: false
% 1.52/1.48  
% 1.52/1.48  % ------ Parsing...
% 1.52/1.48  % ------ 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.52/1.48  % 
% 1.52/1.48  
% 1.52/1.48  % ------ Preprocessing... pe_s  pe:1:0s pe_e  pe_s  pe_e % 
% 1.52/1.48  
% 1.52/1.48  % ------ Preprocessing...% ------  preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.52/1.48   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.52/1.48  % ------ Proving...
% 1.52/1.48  % ------ Problem Properties 
% 1.52/1.48  
% 1.52/1.48  % 
% 1.52/1.48  % clauses                               7
% 1.52/1.48  % conjectures                           2
% 1.52/1.48  % EPR                                   6
% 1.52/1.48  % Horn                                  7
% 1.52/1.48  % unary                                 5
% 1.52/1.48  % binary                                0
% 1.52/1.48  % lits                                  11
% 1.52/1.48  % lits eq                               0
% 1.52/1.48  % fd_pure                               0
% 1.52/1.48  % fd_pseudo                             0
% 1.52/1.48  % fd_cond                               0
% 1.52/1.48  % fd_pseudo_cond                        0
% 1.52/1.48  % AC symbols                            0
% 1.52/1.48  
% 1.52/1.48  % ------ Schedule dynamic 5 is on 
% 1.52/1.48  
% 1.52/1.48  % ------ no equalities: superposition off 
% 1.52/1.48  
% 1.52/1.48  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.48  
% 1.52/1.48  
% 1.52/1.48  % ------ 
% 1.52/1.48  % Current options:
% 1.52/1.48  % ------ 
% 1.52/1.48  
% 1.52/1.48  
% 1.52/1.48  % 
% 1.52/1.48  
% 1.52/1.48  % ------ Proving...
% 1.52/1.48  % 
% 1.52/1.48  
% 1.52/1.48  % SZS status Theorem for theBenchmark.p
% 1.52/1.48  
% 1.52/1.48  % SZS output start CNFRefutation for theBenchmark.p
% 1.52/1.48  
% 1.52/1.48  tff(func_def_0, type, '$ki_local_world': '$ki_world').
% 1.52/1.48  tff(pred_def_1, type, '$ki_accessible': ('$ki_world' * '$ki_world') > $o).
% 1.52/1.48  tff(pred_def_2, type, e: ('$ki_world' * $i) > $o).
% 1.52/1.48  tff(pred_def_3, type, f: ('$ki_world' * $i) > $o).
% 1.52/1.48  tff(pred_def_4, type, '$ki_exists_in_world_$i': ('$ki_world' * $i) > $o).
% 1.52/1.48  tff(type_def_5, type, '$ki_world': $tType).
% 1.52/1.48  tff(f3,axiom,(
% 1.52/1.48    ! [X0 : '$ki_world',X1 : '$ki_world',X2 : $i] : (('$ki_exists_in_world_$i'(X0,X2) & '$ki_accessible'(X0,X1)) => '$ki_exists_in_world_$i'(X1,X2))),
% 1.52/1.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul')).
% 1.52/1.48  
% 1.52/1.48  tff(f5,conjecture,(
% 1.52/1.48    ? [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) & ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => (e(X1,X0) & f(X1,X0)))) => ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => ? [X0 : $i] : ('$ki_exists_in_world_$i'(X1,X0) & f(X1,X0)))),
% 1.52/1.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify)).
% 1.52/1.48  
% 1.52/1.48  tff(f6,negated_conjecture,(
% 1.52/1.48    ~(? [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) & ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => (e(X1,X0) & f(X1,X0)))) => ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => ? [X0 : $i] : ('$ki_exists_in_world_$i'(X1,X0) & f(X1,X0))))),
% 1.52/1.48    inference(negated_conjecture,[status(cth)],[f5])).
% 1.52/1.48  
% 1.52/1.48  tff(f7,plain,(
% 1.52/1.48    ~(? [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) & ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => (e(X1,X0) & f(X1,X0)))) => ! [X2 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X2) => ? [X3 : $i] : ('$ki_exists_in_world_$i'(X2,X3) & f(X2,X3))))),
% 1.52/1.48    inference(rectify,[],[f6])).
% 1.52/1.48  
% 1.52/1.48  tff(f8,plain,(
% 1.52/1.48    ~(? [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) & ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => f(X1,X0))) => ! [X2 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X2) => ? [X3 : $i] : ('$ki_exists_in_world_$i'(X2,X3) & f(X2,X3))))),
% 1.52/1.48    inference(pure_predicate_removal,[],[f7])).
% 1.52/1.48  
% 1.52/1.48  tff(f11,plain,(
% 1.52/1.48    ! [X0 : '$ki_world',X1 : '$ki_world',X2 : $i] : ('$ki_exists_in_world_$i'(X1,X2) | (~'$ki_exists_in_world_$i'(X0,X2) | ~'$ki_accessible'(X0,X1)))),
% 1.52/1.48    inference(ennf_transformation,[],[f3])).
% 1.52/1.48  
% 1.52/1.48  tff(f12,plain,(
% 1.52/1.48    ! [X0 : '$ki_world',X1 : '$ki_world',X2 : $i] : ('$ki_exists_in_world_$i'(X1,X2) | ~'$ki_exists_in_world_$i'(X0,X2) | ~'$ki_accessible'(X0,X1))),
% 1.52/1.48    inference(flattening,[],[f11])).
% 1.52/1.48  
% 1.52/1.48  tff(f13,plain,(
% 1.52/1.48    ? [X2 : '$ki_world'] : (! [X3 : $i] : (~'$ki_exists_in_world_$i'(X2,X3) | ~f(X2,X3)) & '$ki_accessible'('$ki_local_world',X2)) & ? [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) & ! [X1 : '$ki_world'] : (f(X1,X0) | ~'$ki_accessible'('$ki_local_world',X1)))),
% 1.52/1.48    inference(ennf_transformation,[],[f8])).
% 1.52/1.48  
% 1.52/1.48  tff(f15,plain,(
% 1.52/1.48    ? [X0 : '$ki_world'] : (! [X1 : $i] : (~'$ki_exists_in_world_$i'(X0,X1) | ~f(X0,X1)) & '$ki_accessible'('$ki_local_world',X0)) & ? [X2 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X2) & ! [X3 : '$ki_world'] : (f(X3,X2) | ~'$ki_accessible'('$ki_local_world',X3)))),
% 1.52/1.48    inference(rectify,[],[f13])).
% 1.52/1.48  
% 1.52/1.48  tff(f16,plain,(
% 1.52/1.48    (! [X1 : $i] : (~'$ki_exists_in_world_$i'(sK1,X1) | ~f(sK1,X1)) & '$ki_accessible'('$ki_local_world',sK1)) & ('$ki_exists_in_world_$i'('$ki_local_world',sK2) & ! [X3 : '$ki_world'] : (f(X3,sK2) | ~'$ki_accessible'('$ki_local_world',X3)))),
% 1.52/1.48    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X2,sK2)],[f15])).
% 1.52/1.48  
% 1.52/1.48  tff(f19,plain,(
% 1.52/1.48    ( ! [X2 : $i,X0 : '$ki_world',X1 : '$ki_world'] : ('$ki_exists_in_world_$i'(X1,X2) | ~'$ki_exists_in_world_$i'(X0,X2) | ~'$ki_accessible'(X0,X1)) )),
% 1.52/1.48    inference(cnf_transformation,[],[f12])).
% 1.52/1.48  
% 1.52/1.48  tff(f21,plain,(
% 1.52/1.48    ( ! [X3 : '$ki_world'] : (f(X3,sK2) | ~'$ki_accessible'('$ki_local_world',X3)) )),
% 1.52/1.48    inference(cnf_transformation,[],[f16])).
% 1.52/1.48  
% 1.52/1.48  tff(f22,plain,(
% 1.52/1.48    '$ki_exists_in_world_$i'('$ki_local_world',sK2)),
% 1.52/1.48    inference(cnf_transformation,[],[f16])).
% 1.52/1.48  
% 1.52/1.48  tff(f23,plain,(
% 1.52/1.48    '$ki_accessible'('$ki_local_world',sK1)),
% 1.52/1.48    inference(cnf_transformation,[],[f16])).
% 1.52/1.48  
% 1.52/1.48  tff(f24,plain,(
% 1.52/1.48    ( ! [X1 : $i] : (~'$ki_exists_in_world_$i'(sK1,X1) | ~f(sK1,X1)) )),
% 1.52/1.48    inference(cnf_transformation,[],[f16])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_51,plain,![X0:$i,X0_'ki_world':'$ki_world',X1_'ki_world':'$ki_world']:  
% 1.52/1.48      (~'$ki_accessible'(X0_'ki_world',X1_'ki_world')|~'$ki_exists_in_world(X0_'ki_world',X0)|
% 1.52/1.48      '$ki_exists_in_world(X1_'ki_world',X0)),
% 1.52/1.48      inference(cnf_transformation,[],[f19])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_53,negated_conjecture,![X0:$i]:  
% 1.52/1.48      (~f(sK1,X0)|~'$ki_exists_in_world(sK1,X0)),
% 1.52/1.48      inference(cnf_transformation,[],[f24])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_54,negated_conjecture, 
% 1.52/1.48      ('$ki_accessible'('$ki_local_world',sK1)),
% 1.52/1.48      inference(cnf_transformation,[],[f23])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_55,negated_conjecture, 
% 1.52/1.48      ('$ki_exists_in_world('$ki_local_world',sK2)),
% 1.52/1.48      inference(cnf_transformation,[],[f22])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_56,negated_conjecture,![X0_'ki_world':'$ki_world']:  
% 1.52/1.48      (~'$ki_accessible'('$ki_local_world',X0_'ki_world')|f(X0_'ki_world',sK2)),
% 1.52/1.48      inference(cnf_transformation,[],[f21])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_89,plain, 
% 1.52/1.48      (~'$ki_accessible'('$ki_local_world',sK1)|~'$ki_exists_in_world(sK1,sK2)),
% 1.52/1.48      inference(resolution,[status(thm)],[c_53,c_56])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_121,plain,![X0_'ki_world':'$ki_world']:  
% 1.52/1.48      (~'$ki_accessible'(X0_'ki_world',sK1)|~'$ki_exists_in_world(X0_'ki_world',sK2)|
% 1.52/1.48      '$ki_exists_in_world(sK1,sK2)),
% 1.52/1.48      inference(instantiation,[status(thm)],[c_51])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_122,plain, 
% 1.52/1.48      (~'$ki_accessible'('$ki_local_world',sK1)|~'$ki_exists_in_world('$ki_local_world',sK2)|
% 1.52/1.48      '$ki_exists_in_world(sK1,sK2)),
% 1.52/1.48      inference(instantiation,[status(thm)],[c_121])).
% 1.52/1.48  
% 1.52/1.48  tcf(c_123,plain, 
% 1.52/1.48      ($false),
% 1.52/1.48      inference(prop_impl_just,[status(thm)],[c_122,c_89,c_54,c_55])).
% 1.52/1.48  
% 1.52/1.48  
% 1.52/1.48  % SZS output end CNFRefutation for theBenchmark.p
% 1.52/1.48  
% 1.52/1.48  
%------------------------------------------------------------------------------