TSTP Solution File: SYN403+1 by LEO-II---1.7.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYN403+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 08:25:59 EDT 2022

% Result   : Theorem 0.20s 0.37s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (  17 unt;   4 typ;   0 def)
%            Number of atoms       :  100 (  24 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   88 (   8   ~;   8   |;   4   &;  50   @)
%                                         (   0 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    3 (   0   ^   3   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_f,type,
    f: $i > $o ).

thf(tp_g,type,
    g: $i > $o ).

thf(tp_h,type,
    h: $i > $o ).

thf(tp_sK1_X,type,
    sK1_X: $i ).

thf(1,conjecture,
    ! [X: $i] :
      ( ( ( ( f @ X )
         => ( g @ X ) )
        & ( ( g @ X )
         => ( h @ X ) ) )
     => ( ( f @ X )
       => ( h @ X ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish234) ).

thf(2,negated_conjecture,
    ( ( ! [X: $i] :
          ( ( ( ( f @ X )
             => ( g @ X ) )
            & ( ( g @ X )
             => ( h @ X ) ) )
         => ( ( f @ X )
           => ( h @ X ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [X: $i] :
          ( ( ( ( f @ X )
             => ( g @ X ) )
            & ( ( g @ X )
             => ( h @ X ) ) )
         => ( ( f @ X )
           => ( h @ X ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ( ( ( f @ sK1_X )
         => ( g @ sK1_X ) )
        & ( ( g @ sK1_X )
         => ( h @ sK1_X ) ) )
     => ( ( f @ sK1_X )
       => ( h @ sK1_X ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ( f @ sK1_X )
     => ( g @ sK1_X ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ( g @ sK1_X )
     => ( h @ sK1_X ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[4]) ).

thf(7,plain,
    ( ( f @ sK1_X )
    = $true ),
    inference(standard_cnf,[status(thm)],[4]) ).

thf(8,plain,
    ( ( h @ sK1_X )
    = $false ),
    inference(standard_cnf,[status(thm)],[4]) ).

thf(9,plain,
    ( ( ~ ( h @ sK1_X ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ~ ( f @ sK1_X )
      | ( g @ sK1_X ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[5]) ).

thf(11,plain,
    ( ( ~ ( g @ sK1_X )
      | ( h @ sK1_X ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(12,plain,
    ( ( f @ sK1_X )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(13,plain,
    ( ( ~ ( g @ sK1_X )
      | ( h @ sK1_X ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(14,plain,
    ( ( ~ ( f @ sK1_X )
      | ( g @ sK1_X ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(15,plain,
    ( ( ~ ( h @ sK1_X ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(16,plain,
    ( ( ( ~ ( g @ sK1_X ) )
      = $true )
    | ( ( h @ sK1_X )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[13]) ).

thf(17,plain,
    ( ( ( ~ ( f @ sK1_X ) )
      = $true )
    | ( ( g @ sK1_X )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[14]) ).

thf(18,plain,
    ( ( h @ sK1_X )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[15]) ).

thf(19,plain,
    ( ( ( g @ sK1_X )
      = $false )
    | ( ( h @ sK1_X )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[16]) ).

thf(20,plain,
    ( ( ( f @ sK1_X )
      = $false )
    | ( ( g @ sK1_X )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(21,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[12,20,19,18]) ).

thf(22,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN403+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 04:39:44 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.35  
% 0.20/0.35   No.of.Axioms: 0
% 0.20/0.35  
% 0.20/0.35   Length.of.Defs: 0
% 0.20/0.35  
% 0.20/0.35   Contains.Choice.Funs: false
% 0.20/0.35  (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.20/0.37  ********************************
% 0.20/0.37  *   All subproblems solved!    *
% 0.20/0.37  ********************************
% 0.20/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.37  
% 0.20/0.37  %**** Beginning of derivation protocol ****
% 0.20/0.37  % SZS output start CNFRefutation
% See solution above
% 0.20/0.37  
% 0.20/0.37  %**** End of derivation protocol ****
% 0.20/0.37  %**** no. of clauses in derivation: 22 ****
% 0.20/0.37  %**** clause counter: 21 ****
% 0.20/0.37  
% 0.20/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------