↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN053+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 : n002.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:00 PM UTC 2026

% Result   : Theorem 1.49s 1.27s
% Output   : CNFRefutation 1.49s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f14ERROR: Could not build tree for root c_88ERROR: MakeTreeStats fails)

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

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

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

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

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

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

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

fof(f9,plain,
    ( ~ big_f(sK1)
    | ~ big_f(sK0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_49,negated_conjecture,
    ~ p,
    inference(cnf_transformation,[],[f13]) ).

tcf(c_52,negated_conjecture,
    ( ~ big_f(sK0)
    | ~ big_f(sK1) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_53,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( p
      | big_f(X1)
      | big_f(X0) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_54,plain,
    ( p
    | big_f(sK0) ),
    inference(instantiation,[status(thm)],[c_53]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i] :
      ( big_f(X0)
      | big_f(X1) ),
    inference(global_subsumption_just,[status(thm)],[c_53,c_49,c_53]) ).

tcf(c_56,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_f(X1)
      | big_f(X0) ),
    inference(renaming,[status(thm)],[c_55]) ).

tcf(c_62,negated_conjecture,
    ~ big_f(sK1),
    inference(global_subsumption_just,[status(thm)],[c_52,c_49,c_54,c_52]) ).

tcf(c_78,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | big_f(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_56]) ).

tcf(c_79,negated_conjecture,
    iPr_def_10,
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_56]) ).

tcf(c_80,negated_conjecture,
    ~ big_f(sK1),
    inference(demodulation,[status(thm)],[c_62]) ).

tcf(c_81,negated_conjecture,
    iPr_def_10,
    inference(demodulation,[status(thm)],[c_79]) ).

tcf(c_83,negated_conjecture,
    ! [X0: $i] :
      ( big_f(X0)
      | ~ iPr_def_10 ),
    inference(demodulation,[status(thm)],[c_78]) ).

tcf(c_86,negated_conjecture,
    ! [X0: $i] : big_f(X0),
    inference(global_subsumption_just,[status(thm)],[c_83,c_81,c_83]) ).

tcf(c_88,plain,
    $false,
    inference(resolution,[status(thm)],[c_86,c_80]) ).


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