↑ Up

iProver---3.9.4.THM-CRf.s

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

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

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

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

fof(f3,plain,
    ~ ? [X0] :
        ( ! [X1] :
            ( ( big_f(X1,X0)
             => big_f(X0,X1) )
           => big_g(X1,X0) )
       => ~ ! [X2] :
              ( ( big_f(X2,X0)
               => big_f(X0,X2) )
             => ~ big_g(X2,X0) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( big_f(X1,X0)
            & ~ big_f(X0,X1) )
          | big_g(X1,X0) )
      & ! [X2] :
          ( ( big_f(X2,X0)
            & ~ big_f(X0,X2) )
          | ~ big_g(X2,X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ! [X0] :
      ( ! [X2] :
          ( ( big_f(X2,X0)
            & ~ big_f(X0,X2) )
          | big_g(X2,X0) )
      & ! [X1] :
          ( ( big_f(X1,X0)
            & ~ big_f(X0,X1) )
          | ~ big_g(X1,X0) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ! [X2,X0] :
      ( big_f(X2,X0)
      | big_g(X2,X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X2,X0] :
      ( ~ big_f(X0,X2)
      | big_g(X2,X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( big_f(X1,X0)
      | ~ big_g(X1,X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | ~ big_g(X1,X0) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ big_f(X1,X0)
      | ~ big_g(X0,X1) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_f(X0,X1)
      | ~ big_g(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_g(X1,X0)
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_52,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_f(X0,X1)
      | big_g(X0,X1) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_53,plain,
    ( big_f(iProver_bot,iProver_bot)
    | big_g(iProver_bot,iProver_bot) ),
    inference(instantiation,[status(thm)],[c_52]) ).

tcf(c_54,plain,
    ( big_g(iProver_bot,iProver_bot)
    | ~ big_f(iProver_bot,iProver_bot) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_55,plain,
    ( big_f(iProver_bot,iProver_bot)
    | ~ big_g(iProver_bot,iProver_bot) ),
    inference(instantiation,[status(thm)],[c_50]) ).

tcf(c_56,plain,
    ( ~ big_f(iProver_bot,iProver_bot)
    | ~ big_g(iProver_bot,iProver_bot) ),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_57,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_56,c_55,c_54,c_53]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN323+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 : n007.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:47:53 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.40  Running first-order theorem proving
% 0.15/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.15/0.42  
% 0.15/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42  
% 0.15/0.42  % Detected problem language: tptp
% 0.15/0.43  % Proving...
% 1.10/1.27  % SZS status Started for theBenchmark.p
% 1.10/1.27  % SZS status Theorem for theBenchmark.p
% 1.10/1.27  
% 1.10/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.10/1.27  
% 1.10/1.27  % ------  iProver source info
% 1.10/1.27  
% 1.10/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 1.10/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.10/1.27  % git: non_committed_changes: false
% 1.10/1.27  
% 1.10/1.27  % ------ Parsing...
% 1.10/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 1.10/1.27  % 
% 1.10/1.27  
% 1.10/1.27  % ------ Preprocessing...% 
% 1.10/1.27  
% 1.10/1.27  % SZS status Theorem for theBenchmark.p
% 1.10/1.27  
% 1.10/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.10/1.27  
% 1.10/1.27  
%------------------------------------------------------------------------------