TSTP Solution File: GRP022-2 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n021.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 : Sat Jul 16 10:15:27 EDT 2022

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   39 (  35 unt;   4 typ;   0 def)
%            Number of atoms       :   89 (  54 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :  104 (   6   ~;   0   |;   0   &;  98   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0   ^  34   !;   0   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_a,type,
    a: $i ).

thf(tp_identity,type,
    identity: $i ).

thf(tp_inverse,type,
    inverse: $i > $i ).

thf(tp_multiply,type,
    multiply: $i > $i > $i ).

thf(1,axiom,
    ! [X: $i] :
      ( ( multiply @ X @ ( inverse @ X ) )
      = identity ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).

thf(2,axiom,
    ! [X: $i] :
      ( ( multiply @ X @ identity )
      = X ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).

thf(3,axiom,
    ! [X: $i,Y: $i,Z: $i] :
      ( ( multiply @ ( multiply @ X @ Y ) @ Z )
      = ( multiply @ X @ ( multiply @ Y @ Z ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).

thf(4,axiom,
    ! [X: $i] :
      ( ( multiply @ ( inverse @ X ) @ X )
      = identity ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).

thf(5,axiom,
    ! [X: $i] :
      ( ( multiply @ identity @ X )
      = X ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).

thf(6,conjecture,
    $false,
    file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).

thf(7,negated_conjecture,
    $false = $false,
    inference(negate_conjecture,[status(cth)],[6]) ).

thf(8,negated_conjecture,
    ( inverse @ ( inverse @ a ) )
 != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_of_inverse_is_original) ).

thf(9,plain,
    $false = $false,
    inference(unfold_def,[status(thm)],[7]) ).

thf(10,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ X @ ( inverse @ X ) )
          = identity ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(11,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ X @ identity )
          = X ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(12,plain,
    ( ( ! [X: $i,Y: $i,Z: $i] :
          ( ( multiply @ ( multiply @ X @ Y ) @ Z )
          = ( multiply @ X @ ( multiply @ Y @ Z ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[3]) ).

thf(13,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ ( inverse @ X ) @ X )
          = identity ) )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

thf(14,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ identity @ X )
          = X ) )
    = $true ),
    inference(unfold_def,[status(thm)],[5]) ).

thf(15,plain,
    ( ( ( ( inverse @ ( inverse @ a ) )
       != a ) )
    = $true ),
    inference(unfold_def,[status(thm)],[8]) ).

thf(16,plain,
    ( ( ~ $false )
    = $true ),
    inference(polarity_switch,[status(thm)],[9]) ).

thf(17,plain,
    ( ( ( ( inverse @ ( inverse @ a ) )
       != a ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[15]) ).

thf(18,plain,
    ( ( ( ( inverse @ ( inverse @ a ) )
       != a ) )
    = $true ),
    inference(copy,[status(thm)],[17]) ).

thf(19,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ identity @ X )
          = X ) )
    = $true ),
    inference(copy,[status(thm)],[14]) ).

thf(20,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ ( inverse @ X ) @ X )
          = identity ) )
    = $true ),
    inference(copy,[status(thm)],[13]) ).

thf(21,plain,
    ( ( ! [X: $i,Y: $i,Z: $i] :
          ( ( multiply @ ( multiply @ X @ Y ) @ Z )
          = ( multiply @ X @ ( multiply @ Y @ Z ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[12]) ).

thf(22,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ X @ identity )
          = X ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(23,plain,
    ( ( ! [X: $i] :
          ( ( multiply @ X @ ( inverse @ X ) )
          = identity ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(24,plain,
    ( ( ~ $false )
    = $true ),
    inference(copy,[status(thm)],[16]) ).

thf(25,plain,
    ( ( ( inverse @ ( inverse @ a ) )
      = a )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[18]) ).

thf(26,plain,
    ! [SV1: $i] :
      ( ( ( multiply @ identity @ SV1 )
        = SV1 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[19]) ).

thf(27,plain,
    ! [SV2: $i] :
      ( ( ( multiply @ ( inverse @ SV2 ) @ SV2 )
        = identity )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[20]) ).

thf(28,plain,
    ! [SV3: $i] :
      ( ( ! [SY7: $i,SY8: $i] :
            ( ( multiply @ ( multiply @ SV3 @ SY7 ) @ SY8 )
            = ( multiply @ SV3 @ ( multiply @ SY7 @ SY8 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[21]) ).

thf(29,plain,
    ! [SV4: $i] :
      ( ( ( multiply @ SV4 @ identity )
        = SV4 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[22]) ).

thf(30,plain,
    ! [SV5: $i] :
      ( ( ( multiply @ SV5 @ ( inverse @ SV5 ) )
        = identity )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[23]) ).

thf(31,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[24]) ).

thf(32,plain,
    ! [SV6: $i,SV3: $i] :
      ( ( ! [SY9: $i] :
            ( ( multiply @ ( multiply @ SV3 @ SV6 ) @ SY9 )
            = ( multiply @ SV3 @ ( multiply @ SV6 @ SY9 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[28]) ).

thf(33,plain,
    ! [SV7: $i,SV6: $i,SV3: $i] :
      ( ( ( multiply @ ( multiply @ SV3 @ SV6 ) @ SV7 )
        = ( multiply @ SV3 @ ( multiply @ SV6 @ SV7 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[32]) ).

thf(34,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[25,33,31,30,29,27,26]) ).

thf(35,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34  % Computer : n021.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 Jun 14 13:55:43 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  
% 0.13/0.35   No.of.Axioms: 6
% 0.13/0.35  
% 0.13/0.35   Length.of.Defs: 0
% 0.13/0.35  
% 0.13/0.35   Contains.Choice.Funs: false
% 0.13/0.35  (rf:0,axioms:6,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:8,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.13/0.38  
% 0.13/0.38  ********************************
% 0.13/0.38  *   All subproblems solved!    *
% 0.13/0.38  ********************************
% 0.13/0.38  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:6,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:34,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38  
% 0.13/0.38  %**** Beginning of derivation protocol ****
% 0.13/0.38  % SZS output start CNFRefutation
% See solution above
% 0.13/0.38  
% 0.13/0.38  %**** End of derivation protocol ****
% 0.13/0.38  %**** no. of clauses in derivation: 35 ****
% 0.13/0.38  %**** clause counter: 34 ****
% 0.13/0.38  
% 0.13/0.38  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:6,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:34,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------