TSTP Solution File: SYO552^1 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n009.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:35:31 EDT 2022

% Result   : Theorem 0.47s 0.68s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   30 (  10 unt;  20 typ;   0 def)
%            Number of atoms       :   26 (  16 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   32 (   4   ~;   0   |;   0   &;  28   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :  112 ( 112   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   23 (  20 usr;  10 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^  12   !;   4   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_sK10_E,type,
    sK10_E: $i ).

thf(tp_sK11_E,type,
    sK11_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK12_E,type,
    sK12_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK13_E,type,
    sK13_E: $i ).

thf(tp_sK14_E,type,
    sK14_E: $i ).

thf(tp_sK15_E,type,
    sK15_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK16_E,type,
    sK16_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK17_E,type,
    sK17_E: $i ).

thf(tp_sK18_E,type,
    sK18_E: $i ).

thf(tp_sK19_E,type,
    sK19_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

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

thf(tp_sK20_E,type,
    sK20_E: ( $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK2_SY3,type,
    sK2_SY3: ( $i > $i > $i ) > $i ).

thf(tp_sK3_E,type,
    sK3_E: ( $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK4_E,type,
    sK4_E: ( $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK5_E,type,
    sK5_E: $i ).

thf(tp_sK6_E,type,
    sK6_E: $i ).

thf(tp_sK7_E,type,
    sK7_E: ( $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK8_E,type,
    sK8_E: ( $i > $i > $i > $i > $i > $i > $i ) > $i ).

thf(tp_sK9_E,type,
    sK9_E: $i ).

thf(1,conjecture,
    ? [F: $i > $i > $i] :
    ! [X: $i,Y: $i] :
      ( ( F @ X @ Y )
      = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim) ).

thf(2,negated_conjecture,
    ( ( ? [F: $i > $i > $i] :
        ! [X: $i,Y: $i] :
          ( ( F @ X @ Y )
          = X ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [F: $i > $i > $i] :
        ! [X: $i,Y: $i] :
          ( ( F @ X @ Y )
          = X ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ~ ? [F: $i > $i > $i] :
          ! [X: $i,Y: $i] :
            ( ( F @ X @ Y )
            = X ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [F: $i > $i > $i] :
          ( ( F @ ( sK1_X @ F ) @ ( sK2_SY3 @ F ) )
         != ( sK1_X @ F ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [F: $i > $i > $i] :
          ( ( F @ ( sK1_X @ F ) @ ( sK2_SY3 @ F ) )
         != ( sK1_X @ F ) ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ! [SV1: $i > $i > $i] :
      ( ( ( ( SV1 @ ( sK1_X @ SV1 ) @ ( sK2_SY3 @ SV1 ) )
         != ( sK1_X @ SV1 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[6]) ).

thf(8,plain,
    ! [SV1: $i > $i > $i] :
      ( ( ( SV1 @ ( sK1_X @ SV1 ) @ ( sK2_SY3 @ SV1 ) )
        = ( sK1_X @ SV1 ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

thf(47,plain,
    $false = $true,
    inference(extuni,[status(esa)],[8:[bind(SV1,$thf( ^ [SX0: $i] : ^ [SX1: $i] : SX0 ))]]) ).

thf(48,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYO552^1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jul  9 09:10:37 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  
% 0.14/0.35   No.of.Axioms: 0
% 0.14/0.35  
% 0.14/0.35   Length.of.Defs: 0
% 0.14/0.35  
% 0.14/0.35   Contains.Choice.Funs: false
% 0.14/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: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.47/0.68  
% 0.47/0.68  ********************************
% 0.47/0.68  *   All subproblems solved!    *
% 0.47/0.68  ********************************
% 0.47/0.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (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:47,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.47/0.68  
% 0.47/0.68  %**** Beginning of derivation protocol ****
% 0.47/0.68  % SZS output start CNFRefutation
% See solution above
% 0.47/0.68  
% 0.47/0.68  %**** End of derivation protocol ****
% 0.47/0.68  %**** no. of clauses in derivation: 10 ****
% 0.47/0.68  %**** clause counter: 47 ****
% 0.47/0.68  
% 0.47/0.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (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:47,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------