↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 1.10s 1.29s
% Output   : CNFRefutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   15 (   5   ~;   6   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   18 (   0 sgn  13   !;   5   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X0] :
    ! [X1] :
    ? [X2] :
      ( ( big_p(X0,X1,f(X1))
        | big_p(a,X1,h(X1)) )
     => big_p(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2121) ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
      ! [X1] :
      ? [X2] :
        ( ( big_p(X0,X1,f(X1))
          | big_p(a,X1,h(X1)) )
       => big_p(X0,X1,X2) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( big_p(X0,X1,f(X1))
        | big_p(a,X1,h(X1)) )
      & ~ big_p(X0,X1,X2) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ! [X0,X2] :
      ( ( big_p(X0,sK0(X0),f(sK0(X0)))
        | big_p(a,sK0(X0),h(sK0(X0))) )
      & ~ big_p(X0,sK0(X0),X2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f3]) ).

fof(f5,plain,
    ! [X0] :
      ( big_p(X0,sK0(X0),f(sK0(X0)))
      | big_p(a,sK0(X0),h(sK0(X0))) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f6,plain,
    ! [X2,X0] : ~ big_p(X0,sK0(X0),X2),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i] : ~ big_p(X0,sK0(X0),X1),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i] :
      ( big_p(a,sK0(X0),h(sK0(X0)))
      | big_p(X0,sK0(X0),f(sK0(X0))) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_55,plain,
    ! [X0: $i] : big_p(a,sK0(X0),h(sK0(X0))),
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_49]) ).

tcf(c_59,plain,
    $false,
    inference(resolution,[status(thm)],[c_49,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN370+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.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Fri Sep 25 01:00:49 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.43  
% 0.12/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43  
% 0.12/0.43  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 1.10/1.29  % SZS status Started for theBenchmark.p
% 1.10/1.29  % SZS status Theorem for theBenchmark.p
% 1.10/1.29  
% 1.10/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.10/1.29  
% 1.10/1.29  % ------  iProver source info
% 1.10/1.29  
% 1.10/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.10/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.10/1.29  % git: non_committed_changes: false
% 1.10/1.29  
% 1.10/1.29  % ------ Parsing...
% 1.10/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.10/1.29  
% 1.10/1.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s % 
% 1.10/1.29  
% 1.10/1.29  % SZS status Theorem for theBenchmark.p
% 1.10/1.29  
% 1.10/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.10/1.29  
% 1.10/1.29  
%------------------------------------------------------------------------------