TSTP Solution File: SYO237^5 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n013.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 17:32:54 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  17 unt;   6 typ;   0 def)
%            Number of atoms       :   63 (  28 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   62 (   2   ~;   0   |;   0   &;  51   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (  14   ^   8   !;   0   ?;  22   :)

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

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

thf(tp_p,type,
    p: ( $i > $i ) > $o ).

thf(tp_q,type,
    q: $i > $o ).

thf(tp_sK1_E,type,
    sK1_E: $i ).

thf(tp_x,type,
    x: $i ).

thf(1,conjecture,
    ( ! [Xx0: $i] :
        ( ( f @ Xx0 )
        = ( g @ Xx0 ) )
   => ( ( p
        @ ^ [Xx0: $i] : ( f @ Xx0 ) )
     => ( ( q @ x )
       => ( p
          @ ^ [Xx0: $i] : ( g @ Xx0 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM508) ).

thf(2,negated_conjecture,
    ( ( ! [Xx0: $i] :
          ( ( f @ Xx0 )
          = ( g @ Xx0 ) )
     => ( ( p
          @ ^ [Xx0: $i] : ( f @ Xx0 ) )
       => ( ( q @ x )
         => ( p
            @ ^ [Xx0: $i] : ( g @ Xx0 ) ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [Xx0: $i] :
          ( ( f @ Xx0 )
          = ( g @ Xx0 ) )
     => ( ( p
          @ ^ [Xx0: $i] : ( f @ Xx0 ) )
       => ( ( q @ x )
         => ( p
            @ ^ [Xx0: $i] : ( g @ Xx0 ) ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [Xx0: $i] :
          ( ( f @ Xx0 )
          = ( g @ Xx0 ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( p
      @ ^ [Xx0: $i] : ( f @ Xx0 ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(7,plain,
    ( ( p
      @ ^ [Xx0: $i] : ( g @ Xx0 ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(8,plain,
    ( ( ~ ( p
          @ ^ [Xx0: $i] : ( g @ Xx0 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(10,plain,
    ( ( p
      @ ^ [Xx0: $i] : ( f @ Xx0 ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(11,plain,
    ( ( ! [Xx0: $i] :
          ( ( f @ Xx0 )
          = ( g @ Xx0 ) ) )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(12,plain,
    ( ( ~ ( p
          @ ^ [Xx0: $i] : ( g @ Xx0 ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(13,plain,
    ! [SV1: $i] :
      ( ( ( f @ SV1 )
        = ( g @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[11]) ).

thf(14,plain,
    ( ( p
      @ ^ [Xx0: $i] : ( g @ Xx0 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

thf(15,plain,
    ! [SV2: $i] :
      ( ( ( f @ SV2 )
        = ( g @ SV2 ) )
      = $true ),
    inference(rename,[status(thm)],[13]) ).

thf(17,plain,
    ( ( ( p
        @ ^ [Xx0: $i] : ( g @ Xx0 ) )
      = ( p
        @ ^ [Xx0: $i] : ( f @ Xx0 ) ) )
    = $false ),
    inference(res,[status(thm)],[14,10]) ).

thf(19,plain,
    ( ( ( g @ sK1_E )
      = ( f @ sK1_E ) )
    = $false ),
    inference(extuni,[status(esa)],[17]) ).

thf(20,plain,
    ! [SV2: $i] :
      ( ( ( ( g @ sK1_E )
          = ( f @ sK1_E ) )
        = ( ( f @ SV2 )
          = ( g @ SV2 ) ) )
      = $false ),
    inference(res,[status(thm)],[19,15]) ).

thf(23,plain,
    $false = $true,
    inference(extuni,[status(esa)],[20:[bind(SV2,$thf( sK1_E ))]]) ).

thf(24,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYO237^5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jul  8 21:15:29 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  
% 0.13/0.34   No.of.Axioms: 0
% 0.13/0.34  
% 0.13/0.34   Length.of.Defs: 0
% 0.13/0.34  
% 0.13/0.34   Contains.Choice.Funs: false
% 0.13/0.34  (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:25,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.13/0.36  
% 0.13/0.36  ********************************
% 0.13/0.36  *   All subproblems solved!    *
% 0.13/0.36  ********************************
% 0.13/0.36  % SZS status Theorem for /export/starexec/sandbox/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:23,loop_count:5,foatp_calls:1,translation:fof_full)
% 0.13/0.36  
% 0.13/0.36  %**** Beginning of derivation protocol ****
% 0.13/0.36  % SZS output start CNFRefutation
% See solution above
% 0.13/0.36  
% 0.13/0.36  %**** End of derivation protocol ****
% 0.13/0.36  %**** no. of clauses in derivation: 18 ****
% 0.13/0.36  %**** clause counter: 23 ****
% 0.13/0.36  
% 0.13/0.36  % SZS status Theorem for /export/starexec/sandbox/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:23,loop_count:5,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------