↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KRS100+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n012.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:54:09 PM UTC 2026

% Result   : Unsatisfiable 0.64s 1.05s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   22 (   4 unt;   0 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  107 (  45   ~;  35   |;  18   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 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    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   39 (   0 sgn  34   !;   5   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( ~ ce(X1)
            & rr(X0,X1) )
        & ! [X1] :
            ( rr(X0,X1)
           => cd(X1) )
        & ! [X1] :
            ( rr(X0,X1)
           => ( ~ cd(X1)
              | ce(X1) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f5,axiom,
    cUnsatisfiable(i2003_11_14_17_20_32704),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f6,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X3] :
            ( ~ ce(X3)
            & rr(X0,X3) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ! [X1] :
            ( rr(X0,X1)
           => ( ~ cd(X1)
              | ce(X1) ) ) ) ),
    inference(rectify,[],[f3]) ).

fof(f7,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => ( ? [X3] :
            ( ~ ce(X3)
            & rr(X0,X3) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ! [X1] :
            ( rr(X0,X1)
           => ( ~ cd(X1)
              | ce(X1) ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ( ? [X3] :
            ( ~ ce(X3)
            & rr(X0,X3) )
        & ! [X2] :
            ( ~ rr(X0,X2)
            | cd(X2) )
        & ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cd(X1)
            | ce(X1) ) ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ( ? [X3] :
            ( ~ ce(X3)
            & rr(X0,X3) )
        & ! [X2] :
            ( ~ rr(X0,X2)
            | cd(X2) )
        & ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cd(X1)
            | ce(X1) ) ) ),
    inference(flattening,[],[f11]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ( ~ ce(sK0(X0))
        & rr(X0,sK0(X0))
        & ! [X2] :
            ( ~ rr(X0,X2)
            | cd(X2) )
        & ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cd(X1)
            | ce(X1) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0))],[f12]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ ce(sK0(X0)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f16,plain,
    ! [X2,X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X2)
      | cd(X2) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X1)
      | ~ cd(X1)
      | ce(X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f18,plain,
    cUnsatisfiable(i2003_11_14_17_20_32704),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] :
      ( ce(X1)
      | ~ cUnsatisfiable(X0)
      | ~ cd(X1)
      | ~ rr(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i] :
      ( cd(X1)
      | ~ cUnsatisfiable(X0)
      | ~ rr(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_51,plain,
    ! [X0: $i] :
      ( rr(X0,sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_52,plain,
    ! [X0: $i] :
      ( ~ cUnsatisfiable(X0)
      | ~ ce(sK0(X0)) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_53,plain,
    cUnsatisfiable(i2003_11_14_17_20_32704),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_55,plain,
    ( rr(i2003_11_14_17_20_32704,sK0(i2003_11_14_17_20_32704))
    | ~ cUnsatisfiable(i2003_11_14_17_20_32704) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] :
      ( ce(X1)
      | ~ cUnsatisfiable(X0)
      | ~ rr(X0,X1) ),
    inference(global_subsumption_just,[status(thm)],[c_49,c_50,c_49]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i] :
      ( ~ cUnsatisfiable(X1)
      | ~ cUnsatisfiable(X0)
      | ~ rr(X0,sK0(X1)) ),
    inference(resolution,[status(thm)],[c_58,c_52]) ).

tcf(c_84,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_20_32704)
    | ~ rr(i2003_11_14_17_20_32704,sK0(i2003_11_14_17_20_32704)) ),
    inference(instantiation,[status(thm)],[c_83]) ).

tcf(c_85,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_84,c_55,c_53]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : KRS100+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Wed Sep 23 19:22:50 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32  Running first-order theorem proving
% 0.04/0.32  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.32  
% 0.04/0.32  % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.32  
% 0.04/0.32  % Detected problem language: tptp
% 0.06/0.33  % Proving...
% 0.64/1.05  % SZS status Started for theBenchmark.p
% 0.64/1.05  % SZS status Unsatisfiable for theBenchmark.p
% 0.64/1.05  
% 0.64/1.05  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.64/1.05  
% 0.64/1.05  % ------  iProver source info
% 0.64/1.05  
% 0.64/1.05  % git: date: 2026-07-19 20:42:38 +0200
% 0.64/1.05  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.64/1.05  % git: non_committed_changes: false
% 0.64/1.05  
% 0.64/1.05  % ------ Parsing...
% 0.64/1.05  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.64/1.05  
% 0.64/1.05  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s % 
% 0.64/1.05  
% 0.64/1.05  % SZS status Unsatisfiable for theBenchmark.p
% 0.64/1.05  
% 0.64/1.05  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.05  
% 0.64/1.05  
%------------------------------------------------------------------------------