↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYO886_6 : 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 : n019.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:15 PM UTC 2026

% Result   : Theorem 1.15s 1.31s
% Output   : CNFRefutation 1.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO886_6 : 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.41  % Computer : n019.cluster.edu
% 0.09/0.41  % Model    : x86_64 x86_64
% 0.09/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.41  % Memory   : 8046.5625MB
% 0.09/0.41  % OS       : Linux 6.8.0-71-generic
% 0.09/0.41  % CPULimit : 300
% 0.09/0.41  % WCLimit  : 300
% 0.09/0.41  % DateTime : Fri Sep 25 03:57:49 UTC 2026
% 0.09/0.41  % CPUTime  : 
% 0.09/0.41  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.45  Running first-order theorem proving
% 0.09/0.45  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.14/0.46  
% 0.14/0.46  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.46  
% 0.14/0.46  % Detected problem language: tptp
% 0.14/0.47  % Proving...
% 1.15/1.31  % SZS status Started for theBenchmark.p
% 1.15/1.31  % SZS status Theorem for theBenchmark.p
% 1.15/1.31  
% 1.15/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/1.31  
% 1.15/1.31  % ------  iProver source info
% 1.15/1.31  
% 1.15/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 1.15/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/1.31  % git: non_committed_changes: false
% 1.15/1.31  
% 1.15/1.31  % ------ Parsing...
% 1.15/1.31  % ------ 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.15/1.31  % 
% 1.15/1.31  
% 1.15/1.31  % ------ Preprocessing... pe_s  pe:1:0s% 
% 1.15/1.31  
% 1.15/1.31  % SZS status Theorem for theBenchmark.p
% 1.15/1.31  
% 1.15/1.31  % SZS output start CNFRefutation for theBenchmark.p
% 1.15/1.31  
% 1.15/1.31  tff(func_def_0, type, '$ki_local_world': '$ki_world').
% 1.15/1.31  tff(pred_def_1, type, '$ki_accessible': ('$ki_world' * '$ki_world') > $o).
% 1.15/1.31  tff(pred_def_2, type, f: ('$ki_world' * $i) > $o).
% 1.15/1.31  tff(pred_def_3, type, '$ki_exists_in_world_$i': ('$ki_world' * $i) > $o).
% 1.15/1.31  tff(type_def_5, type, '$ki_world': $tType).
% 1.15/1.31  tff(f2,axiom,(
% 1.15/1.31    ! [X0 : '$ki_world',X1 : $i] : '$ki_exists_in_world_$i'(X0,X1)),
% 1.15/1.31    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const')).
% 1.15/1.31  
% 1.15/1.31  tff(f4,conjecture,(
% 1.15/1.31    ! [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) => ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => 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.15/1.31    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify)).
% 1.15/1.31  
% 1.15/1.31  tff(f5,negated_conjecture,(
% 1.15/1.31    ~(! [X0 : $i] : ('$ki_exists_in_world_$i'('$ki_local_world',X0) => ! [X1 : '$ki_world'] : ('$ki_accessible'('$ki_local_world',X1) => 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.15/1.31    inference(negated_conjecture,[status(cth)],[f4])).
% 1.15/1.31  
% 1.15/1.31  tff(f6,plain,(
% 1.15/1.31    ~(! [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.15/1.31    inference(rectify,[],[f5])).
% 1.15/1.31  
% 1.15/1.31  tff(f7,plain,(
% 1.15/1.31    ? [X2 : '$ki_world'] : (? [X3 : $i] : (~f(X2,X3) & '$ki_exists_in_world_$i'(X2,X3)) & '$ki_accessible'('$ki_local_world',X2)) & ! [X0 : $i] : (! [X1 : '$ki_world'] : (f(X1,X0) | ~'$ki_accessible'('$ki_local_world',X1)) | ~'$ki_exists_in_world_$i'('$ki_local_world',X0))),
% 1.15/1.31    inference(ennf_transformation,[],[f6])).
% 1.15/1.31  
% 1.15/1.31  tff(f10,plain,(
% 1.15/1.31    ? [X0 : '$ki_world'] : (? [X1 : $i] : (~f(X0,X1) & '$ki_exists_in_world_$i'(X0,X1)) & '$ki_accessible'('$ki_local_world',X0)) & ! [X2 : $i] : (! [X3 : '$ki_world'] : (f(X3,X2) | ~'$ki_accessible'('$ki_local_world',X3)) | ~'$ki_exists_in_world_$i'('$ki_local_world',X2))),
% 1.15/1.31    inference(rectify,[],[f7])).
% 1.15/1.31  
% 1.15/1.31  tff(f11,plain,(
% 1.15/1.31    ((~f(sK2,sK3) & '$ki_exists_in_world_$i'(sK2,sK3)) & '$ki_accessible'('$ki_local_world',sK2)) & ! [X2 : $i] : (! [X3 : '$ki_world'] : (f(X3,X2) | ~'$ki_accessible'('$ki_local_world',X3)) | ~'$ki_exists_in_world_$i'('$ki_local_world',X2))),
% 1.15/1.31    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f10])).
% 1.15/1.31  
% 1.15/1.31  tff(f13,plain,(
% 1.15/1.31    ( ! [X0 : '$ki_world',X1 : $i] : ('$ki_exists_in_world_$i'(X0,X1)) )),
% 1.15/1.31    inference(cnf_transformation,[],[f2])).
% 1.15/1.31  
% 1.15/1.31  tff(f15,plain,(
% 1.15/1.31    ( ! [X2 : $i,X3 : '$ki_world'] : (f(X3,X2) | ~'$ki_accessible'('$ki_local_world',X3) | ~'$ki_exists_in_world_$i'('$ki_local_world',X2)) )),
% 1.15/1.31    inference(cnf_transformation,[],[f11])).
% 1.15/1.31  
% 1.15/1.31  tff(f16,plain,(
% 1.15/1.31    '$ki_accessible'('$ki_local_world',sK2)),
% 1.15/1.31    inference(cnf_transformation,[],[f11])).
% 1.15/1.31  
% 1.15/1.31  tff(f18,plain,(
% 1.15/1.31    ~f(sK2,sK3)),
% 1.15/1.31    inference(cnf_transformation,[],[f11])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_50,plain,![X0:$i,X0_'ki_world':'$ki_world']:  
% 1.15/1.31      ('$ki_exists_in_world(X0_'ki_world',X0)),
% 1.15/1.31      inference(cnf_transformation,[],[f13])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_52,negated_conjecture, 
% 1.15/1.31      (~f(sK2,sK3)),
% 1.15/1.31      inference(cnf_transformation,[],[f18])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_54,negated_conjecture, 
% 1.15/1.31      ('$ki_accessible'('$ki_local_world',sK2)),
% 1.15/1.31      inference(cnf_transformation,[],[f16])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_55,negated_conjecture,![X0:$i,X0_'ki_world':'$ki_world']:  
% 1.15/1.31      (~'$ki_accessible'('$ki_local_world',X0_'ki_world')|~'$ki_exists_in_world('$ki_local_world',X0)|
% 1.15/1.31      f(X0_'ki_world',X0)),
% 1.15/1.31      inference(cnf_transformation,[],[f15])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_62,plain,![X0:$i,X0_'ki_world':'$ki_world']:  
% 1.15/1.31      (~'$ki_accessible'('$ki_local_world',X0_'ki_world')|f(X0_'ki_world',X0)),
% 1.15/1.31      inference(backward_subsumption_resolution,[status(thm)],[c_55,c_50])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_74,plain, 
% 1.15/1.31      (~'$ki_accessible'('$ki_local_world',sK2)),
% 1.15/1.31      inference(resolution,[status(thm)],[c_52,c_62])).
% 1.15/1.31  
% 1.15/1.31  tcf(c_75,plain, 
% 1.15/1.31      ($false),
% 1.15/1.31      inference(prop_impl_just,[status(thm)],[c_74,c_54])).
% 1.15/1.31  
% 1.15/1.31  
% 1.15/1.31  % SZS output end CNFRefutation for theBenchmark.p
% 1.15/1.31  
% 1.15/1.31  
%------------------------------------------------------------------------------