↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n006.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 01:04:13 PM UTC 2026

% Result   : Unsatisfiable 1.61s 1.28s
% Output   : CNFRefutation 1.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  11 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  15   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   18 (   0 sgn  18   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ follows(X0,X1)
      | succeeds(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( ~ succeeds(X2,X1)
      | ~ succeeds(X0,X2)
      | succeeds(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ labels(X2,X0)
      | ~ has(X1,goto(X2))
      | succeeds(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).

fof(f5,axiom,
    labels(loop,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).

fof(f9,axiom,
    follows(p8,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).

fof(f10,axiom,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).

fof(f11,negated_conjecture,
    ~ succeeds(p3,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] :
      ( succeeds(X0,X1)
      | ~ follows(X0,X1) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( succeeds(X0,X2)
      | ~ succeeds(X1,X2)
      | ~ succeeds(X0,X1) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( succeeds(X2,X0)
      | ~ labels(X1,X2)
      | ~ has(X0,goto(X1)) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_64,plain,
    labels(loop,p3),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_68,plain,
    follows(p8,p3),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_69,plain,
    has(p8,goto(loop)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_70,negated_conjecture,
    ~ succeeds(p3,p3),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_112,plain,
    succeeds(p8,p3),
    inference(resolution,[status(thm)],[c_60,c_68]) ).

tcf(c_118,plain,
    ! [X0: $i] :
      ( succeeds(p3,X0)
      | ~ has(X0,goto(loop)) ),
    inference(resolution,[status(thm)],[c_62,c_64]) ).

tcf(c_132,plain,
    succeeds(p3,p8),
    inference(resolution,[status(thm)],[c_69,c_118]) ).

tcf(c_159,plain,
    ! [X0: $i] :
      ( succeeds(p3,X0)
      | ~ succeeds(p8,X0) ),
    inference(resolution,[status(thm)],[c_61,c_132]) ).

tcf(c_160,plain,
    ( succeeds(p3,p3)
    | ~ succeeds(p8,p3) ),
    inference(instantiation,[status(thm)],[c_159]) ).

tcf(c_161,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_160,c_112,c_70]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n006.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Fri Sep 25 07:42:41 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  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.12/0.42  
% 0.12/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42  
% 0.12/0.42  % Detected problem language: tptp
% 0.12/0.43  % Proving...
% 1.61/1.28  % SZS status Started for theBenchmark.p
% 1.61/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 1.61/1.28  
% 1.61/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.61/1.28  
% 1.61/1.28  % ------  iProver source info
% 1.61/1.28  
% 1.61/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.61/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.61/1.28  % git: non_committed_changes: false
% 1.61/1.28  
% 1.61/1.28  % ------ Parsing...% successful
% 1.61/1.28  
% 1.61/1.28  
% 1.61/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.61/1.28  
% 1.61/1.28  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.61/1.28  
% 1.61/1.28  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 1.61/1.28   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.61/1.28  % ------ Proving...
% 1.61/1.28  % ------ Problem Properties 
% 1.61/1.28  
% 1.61/1.28  % 
% 1.61/1.28  % clauses                               6
% 1.61/1.28  % conjectures                           1
% 1.61/1.28  % EPR                                   6
% 1.61/1.28  % Horn                                  6
% 1.61/1.28  % unary                                 5
% 1.61/1.28  % binary                                0
% 1.61/1.28  % lits                                  8
% 1.61/1.28  % lits eq                               0
% 1.61/1.28  % fd_pure                               0
% 1.61/1.28  % fd_pseudo                             0
% 1.61/1.28  % fd_cond                               0
% 1.61/1.28  % fd_pseudo_cond                        0
% 1.61/1.28  % AC symbols                            0
% 1.61/1.28  
% 1.61/1.28  % ------ Schedule EPR Horn non eq is on
% 1.61/1.28  
% 1.61/1.28  % ------ no equalities: superposition off 
% 1.61/1.28  
% 1.61/1.28  % ------ Option_epr_horn Time Limit: Unbounded
% 1.61/1.28  
% 1.61/1.28  
% 1.61/1.28  % ------ 
% 1.61/1.28  % Current options:
% 1.61/1.28  % ------ 
% 1.61/1.28  
% 1.61/1.28  
% 1.61/1.28  % 
% 1.61/1.28  
% 1.61/1.28  % ------ Proving...
% 1.61/1.28  % 
% 1.61/1.28  
% 1.61/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 1.61/1.28  
% 1.61/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.61/1.28  
% 1.61/1.28  
%------------------------------------------------------------------------------