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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : PUZ063-2 : TPTP v8.1.0. Released v3.2.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 : Mon Jul 18 18:19:33 EDT 2022

% Result   : Unsatisfiable 0.18s 0.36s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   28 (  20 unt;   8 typ;   0 def)
%            Number of atoms       :   50 (  20 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   74 (   5   ~;   0   |;   0   &;  69   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   6 con; 0-3 aty)
%            Number of variables   :   10 (   0   ^  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_c_Mutil_Otiling,type,
    c_Mutil_Otiling: $i > $i > $i ).

thf(tp_c_emptyset,type,
    c_emptyset: $i ).

thf(tp_c_in,type,
    c_in: $i > $i > $i > $o ).

thf(tp_c_union,type,
    c_union: $i > $i > $i > $i ).

thf(tp_t_a,type,
    t_a: $i ).

thf(tp_tc_set,type,
    tc_set: $i > $i ).

thf(tp_v_A,type,
    v_A: $i ).

thf(tp_v_u,type,
    v_u: $i ).

thf(1,axiom,
    ! [V_y: $i,T_a: $i] :
      ( ( c_union @ c_emptyset @ V_y @ T_a )
      = V_y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__empty__left_0) ).

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

thf(3,negated_conjecture,
    $false = $false,
    inference(negate_conjecture,[status(cth)],[2]) ).

thf(4,negated_conjecture,
    ~ ( c_in @ ( c_union @ c_emptyset @ v_u @ t_a ) @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

thf(5,negated_conjecture,
    c_in @ v_u @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

thf(6,plain,
    $false = $false,
    inference(unfold_def,[status(thm)],[3]) ).

thf(7,plain,
    ( ( ! [V_y: $i,T_a: $i] :
          ( ( c_union @ c_emptyset @ V_y @ T_a )
          = V_y ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(8,plain,
    ( ( ~ ( c_in @ ( c_union @ c_emptyset @ v_u @ t_a ) @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

thf(9,plain,
    ( ( c_in @ v_u @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) )
    = $true ),
    inference(unfold_def,[status(thm)],[5]) ).

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

thf(11,plain,
    ( ( c_in @ v_u @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(12,plain,
    ( ( ~ ( c_in @ ( c_union @ c_emptyset @ v_u @ t_a ) @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(13,plain,
    ( ( ! [V_y: $i,T_a: $i] :
          ( ( c_union @ c_emptyset @ V_y @ T_a )
          = V_y ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

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

thf(15,plain,
    ( ( c_in @ ( c_union @ c_emptyset @ v_u @ t_a ) @ ( c_Mutil_Otiling @ v_A @ t_a ) @ ( tc_set @ t_a ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

thf(16,plain,
    ! [SV1: $i] :
      ( ( ! [SY2: $i] :
            ( ( c_union @ c_emptyset @ SV1 @ SY2 )
            = SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[13]) ).

thf(17,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[14]) ).

thf(18,plain,
    ! [SV2: $i,SV1: $i] :
      ( ( ( c_union @ c_emptyset @ SV1 @ SV2 )
        = SV1 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[16]) ).

thf(19,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[11,18,17,15]) ).

thf(20,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : PUZ063-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat May 28 20:49:12 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.34  
% 0.18/0.34   No.of.Axioms: 3
% 0.18/0.34  
% 0.18/0.34   Length.of.Defs: 0
% 0.18/0.34  
% 0.18/0.34   Contains.Choice.Funs: false
% 0.18/0.34  (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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:5,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.18/0.36  ********************************
% 0.18/0.36  *   All subproblems solved!    *
% 0.18/0.36  ********************************
% 0.18/0.36  % SZS status Unsatisfiable 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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:19,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.36  
% 0.18/0.36  %**** Beginning of derivation protocol ****
% 0.18/0.36  % SZS output start CNFRefutation
% See solution above
% 0.18/0.36  
% 0.18/0.36  %**** End of derivation protocol ****
% 0.18/0.36  %**** no. of clauses in derivation: 20 ****
% 0.18/0.36  %**** clause counter: 19 ****
% 0.18/0.36  
% 0.18/0.36  % SZS status Unsatisfiable 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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:19,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------