↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN934+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 : n020.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:45:27 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0] :
        ( c
       => p(X0) )
  <=> ( c
     => ? [X0] : p(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

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

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

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

fof(f13,plain,
    ! [X0,X1] :
      ( ~ p(X1)
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f8]) ).

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

tcf(c_52,negated_conjecture,
    c,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_53,negated_conjecture,
    ( p(sK1)
    | p(sK0)
    | ~ c ),
    inference(cnf_transformation,[],[f15]) ).

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

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

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

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

tcf(c_77,negated_conjecture,
    p(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] :
      ( ~ iPr_def_10
      | ~ p(X0) ),
    inference(demodulation,[status(thm)],[c_75]) ).

tcf(c_83,negated_conjecture,
    ! [X0: $i] : ~ p(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.03  % Problem  : SYN934+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n020.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 02:36:33 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.41  % Detected problem language: tptp
% 0.12/0.42  % Proving...
% 0.41/1.27  % SZS status Started for theBenchmark.p
% 0.41/1.27  % SZS status Theorem for theBenchmark.p
% 0.41/1.27  
% 0.41/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.41/1.27  
% 0.41/1.27  % ------  iProver source info
% 0.41/1.27  
% 0.41/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 0.41/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.41/1.27  % git: non_committed_changes: false
% 0.41/1.27  
% 0.41/1.27  % ------ Parsing...
% 0.41/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.41/1.27  % 
% 0.41/1.27  
% 0.41/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 % 
% 0.41/1.27  
% 0.41/1.27  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 0.41/1.27   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.41/1.27  % ------ Proving...
% 0.41/1.27  % ------ Problem Properties 
% 0.41/1.27  
% 0.41/1.27  % 
% 0.41/1.27  % clauses                               3
% 0.41/1.27  % conjectures                           3
% 0.41/1.27  % EPR                                   3
% 0.41/1.27  % Horn                                  3
% 0.41/1.27  % unary                                 2
% 0.41/1.27  % binary                                1
% 0.41/1.27  % lits                                  4
% 0.41/1.27  % lits eq                               0
% 0.41/1.27  % fd_pure                               0
% 0.41/1.27  % fd_pseudo                             0
% 0.41/1.27  % fd_cond                               0
% 0.41/1.27  % fd_pseudo_cond                        0
% 0.41/1.27  % AC symbols                            0
% 0.41/1.27  
% 0.41/1.27  % ------ Schedule EPR Horn non eq is on
% 0.41/1.27  
% 0.41/1.27  % ------ no equalities: superposition off 
% 0.41/1.27  
% 0.41/1.27  % ------ Option_epr_horn Time Limit: Unbounded
% 0.41/1.27  
% 0.41/1.27  
% 0.41/1.27  % ------ 
% 0.41/1.27  % Current options:
% 0.41/1.27  % ------ 
% 0.41/1.27  
% 0.41/1.27  
% 0.41/1.27  % 
% 0.41/1.27  
% 0.41/1.27  % ------ Proving...
% 0.41/1.27  % 
% 0.41/1.27  
% 0.41/1.27  % SZS status Theorem for theBenchmark.p
% 0.41/1.27  
% 0.41/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.41/1.28  
% 0.41/1.28  
%------------------------------------------------------------------------------