↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN398+1 : TPTP v9.3.1. Released v2.0.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 03:39:58 PM UTC 2026

% Result   : Theorem 0.91s 1.06s
% Output   : CNFRefutation 0.91s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f13ERROR: Could not build tree for root c_85ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( f(X0)
        & p )
  <=> ( ! [X1] : f(X1)
      & p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish215) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( f(X0)
          & p )
    <=> ( ! [X1] : f(X1)
        & p ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X0] :
        ( f(X0)
        & p )
  <~> ( ! [X1] : f(X1)
      & p ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ( ! [X0] :
          ( f(X0)
          & p )
      | ( ! [X1] : f(X1)
        & p ) )
    & ( ? [X0] :
          ( ~ f(X0)
          | ~ p )
      | ? [X1] : ~ f(X1)
      | ~ p ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ! [X0] :
          ( f(X0)
          & p )
      | ( ! [X1] : f(X1)
        & p ) )
    & ( ? [X0] :
          ( ~ f(X0)
          | ~ p )
      | ? [X1] : ~ f(X1)
      | ~ p ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ( ! [X3] :
          ( f(X3)
          & p )
      | ( ! [X2] : f(X2)
        & p ) )
    & ( ? [X1] :
          ( ~ f(X1)
          | ~ p )
      | ? [X0] : ~ f(X0)
      | ~ p ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ( ! [X3] :
          ( f(X3)
          & p )
      | ( ! [X2] : f(X2)
        & p ) )
    & ( ~ f(sK1)
      | ~ p
      | ~ f(sK0)
      | ~ p ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( f(X3)
      | f(X2) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_49,negated_conjecture,
    ( ~ p
    | ~ f(sK1)
    | ~ f(sK0) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_50,negated_conjecture,
    p,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_53,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X1)
      | f(X0) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_54,plain,
    f(sK0),
    inference(instantiation,[status(thm)],[c_53]) ).

tcf(c_59,negated_conjecture,
    ~ f(sK1),
    inference(global_subsumption_just,[status(thm)],[c_49,c_50,c_54,c_49]) ).

tcf(c_75,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | f(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_53]) ).

tcf(c_76,negated_conjecture,
    iPr_def_10,
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).

tcf(c_77,negated_conjecture,
    ~ f(sK1),
    inference(demodulation,[status(thm)],[c_59]) ).

tcf(c_78,negated_conjecture,
    iPr_def_10,
    inference(demodulation,[status(thm)],[c_76]) ).

tcf(c_80,negated_conjecture,
    ! [X0: $i] :
      ( f(X0)
      | ~ iPr_def_10 ),
    inference(demodulation,[status(thm)],[c_75]) ).

tcf(c_83,negated_conjecture,
    ! [X0: $i] : f(X0),
    inference(global_subsumption_just,[status(thm)],[c_80,c_78,c_80]) ).

tcf(c_85,plain,
    $false,
    inference(resolution,[status(thm)],[c_83,c_77]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN398+1 : TPTP v9.3.1. Released v2.0.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 : Fri Sep 25 01:04:35 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.33  Running first-order theorem proving
% 0.04/0.33  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.07/0.33  
% 0.07/0.33  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33  
% 0.07/0.33  % Detected problem language: tptp
% 0.07/0.34  % Proving...
% 0.91/1.06  % SZS status Started for theBenchmark.p
% 0.91/1.06  % SZS status Theorem for theBenchmark.p
% 0.91/1.06  
% 0.91/1.06  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.91/1.06  
% 0.91/1.06  % ------  iProver source info
% 0.91/1.06  
% 0.91/1.06  % git: date: 2026-07-19 20:42:38 +0200
% 0.91/1.06  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.91/1.06  % git: non_committed_changes: false
% 0.91/1.06  
% 0.91/1.06  % ------ Parsing...
% 0.91/1.06  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.91/1.06  % 
% 0.91/1.06  
% 0.91/1.06  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 0.91/1.06  
% 0.91/1.06  % ------ Preprocessing...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.91/1.06   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.91/1.06  % ------ Proving...
% 0.91/1.06  % ------ Problem Properties 
% 0.91/1.06  
% 0.91/1.06  % 
% 0.91/1.06  % clauses                               3
% 0.91/1.06  % conjectures                           3
% 0.91/1.06  % EPR                                   3
% 0.91/1.06  % Horn                                  3
% 0.91/1.06  % unary                                 2
% 0.91/1.06  % binary                                1
% 0.91/1.06  % lits                                  4
% 0.91/1.07  % lits eq                               0
% 0.91/1.07  % fd_pure                               0
% 0.91/1.07  % fd_pseudo                             0
% 0.91/1.07  % fd_cond                               0
% 0.91/1.07  % fd_pseudo_cond                        0
% 0.91/1.07  % AC symbols                            0
% 0.91/1.07  
% 0.91/1.07  % ------ Schedule EPR Horn non eq is on
% 0.91/1.07  
% 0.91/1.07  % ------ no equalities: superposition off 
% 0.91/1.07  
% 0.91/1.07  % ------ Option_epr_horn Time Limit: Unbounded
% 0.91/1.07  
% 0.91/1.07  
% 0.91/1.07  % ------ 
% 0.91/1.07  % Current options:
% 0.91/1.07  % ------ 
% 0.91/1.07  
% 0.91/1.07  
% 0.91/1.07  % 
% 0.91/1.07  
% 0.91/1.07  % ------ Proving...
% 0.91/1.07  % 
% 0.91/1.07  
% 0.91/1.07  % SZS status Theorem for theBenchmark.p
% 0.91/1.07  
% 0.91/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.91/1.07  
% 0.91/1.07  
%------------------------------------------------------------------------------