↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 1.53s 1.29s
% Output   : CNFRefutation 1.53s
% 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_q(X0)
        & p )
  <=> ( ? [X0] : big_q(X0)
      & p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2109) ).

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

fof(f3,plain,
    ~ ( ? [X0] :
          ( big_q(X0)
          & p )
    <=> ( ? [X1] : big_q(X1)
        & p ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X0] :
        ( big_q(X0)
        & p )
  <~> ( ? [X1] : big_q(X1)
      & p ) ),
    inference(ennf_transformation,[],[f3]) ).

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

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

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

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

fof(f9,plain,
    ( big_q(sK1)
    | big_q(sK0) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ p
      | ~ big_q(X1)
      | ~ big_q(X0) ),
    inference(cnf_transformation,[],[f14]) ).

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

tcf(c_53,negated_conjecture,
    ( big_q(sK0)
    | big_q(sK1) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_54,plain,
    ( ~ p
    | ~ big_q(sK0) ),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_59,negated_conjecture,
    big_q(sK1),
    inference(global_subsumption_just,[status(thm)],[c_53,c_50,c_53,c_54]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] :
      ( ~ big_q(X0)
      | ~ big_q(X1) ),
    inference(global_subsumption_just,[status(thm)],[c_49,c_50,c_49]) ).

tcf(c_62,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ big_q(X1)
      | ~ big_q(X0) ),
    inference(renaming,[status(thm)],[c_61]) ).

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

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

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

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

tcf(c_83,negated_conjecture,
    big_q(sK1),
    inference(demodulation,[status(thm)],[c_59]) ).

tcf(c_86,negated_conjecture,
    ! [X0: $i] : ~ big_q(X0),
    inference(global_subsumption_just,[status(thm)],[c_82,c_80,c_82]) ).

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


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