↑ Up

LEO-II---2.3.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LEO-II---2.3.1
% Problem  : SEV397^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Oct  7 10:50:02 AM UTC 2026

% Result   : Theorem 0.10s 0.19s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   53 (  31 unt;   0 typ;   0 def)
%            Number of atoms       :  339 (  72 equ;   0 cnn)
%            Maximal formula atoms :    7 (   6 avg)
%            Number of connectives :  414 (  80   ~; 112   |;  20   &; 192   @)
%                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   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_a,type,
    a: $tType ).

thf(tp_cX,type,
    cX: a > $o ).

thf(tp_cY,type,
    cY: a > $o ).

thf(tp_cZ,type,
    cZ: a > $o ).

thf(tp_sK1_Xx,type,
    sK1_Xx: a ).

thf(1,conjecture,
    ! [Xx: a] :
      ( ( ( ( cX @ Xx )
          & ( cY @ Xx ) )
        | ( cZ @ Xx ) )
    <=> ( ( ( cX @ Xx )
          | ( cZ @ Xx ) )
        & ( ( cY @ Xx )
          | ( cZ @ Xx ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM59_pme) ).

thf(2,negated_conjecture,
    ( ( ! [Xx: a] :
          ( ( ( ( cX @ Xx )
              & ( cY @ Xx ) )
            | ( cZ @ Xx ) )
        <=> ( ( ( cX @ Xx )
              | ( cZ @ Xx ) )
            & ( ( cY @ Xx )
              | ( cZ @ Xx ) ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [Xx: a] :
          ( ( ( ( cX @ Xx )
              & ( cY @ Xx ) )
            | ( cZ @ Xx ) )
        <=> ( ( ( cX @ Xx )
              | ( cZ @ Xx ) )
            & ( ( cY @ Xx )
              | ( cZ @ Xx ) ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ( ( ( cX @ sK1_Xx )
          & ( cY @ sK1_Xx ) )
        | ( cZ @ sK1_Xx ) )
    <=> ( ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) )
        & ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ( ( ( cX @ sK1_Xx )
          & ( cY @ sK1_Xx ) )
        | ( cZ @ sK1_Xx ) )
     => ( ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) )
        & ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) ) )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[4]) ).

thf(6,plain,
    ( ( ( ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) )
        & ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) )
     => ( ( ( cX @ sK1_Xx )
          & ( cY @ sK1_Xx ) )
        | ( cZ @ sK1_Xx ) ) )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[4]) ).

thf(7,plain,
    ( ( ~ ( ( ( ( cX @ sK1_Xx )
              & ( cY @ sK1_Xx ) )
            | ( cZ @ sK1_Xx ) )
         => ( ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
            & ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(8,plain,
    ( ( ~ ( ( ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
            & ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) )
         => ( ( ( cX @ sK1_Xx )
              & ( cY @ sK1_Xx ) )
            | ( cZ @ sK1_Xx ) ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ~ ( ( ( ( cX @ sK1_Xx )
              & ( cY @ sK1_Xx ) )
            | ( cZ @ sK1_Xx ) )
         => ( ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
            & ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(10,plain,
    ( ( ~ ( ~ ( ~ ( ~ ( cX @ sK1_Xx )
                  | ~ ( cY @ sK1_Xx ) )
              | ( cZ @ sK1_Xx ) )
          | ~ ( ~ ( ( cX @ sK1_Xx )
                  | ( cZ @ sK1_Xx ) )
              | ~ ( ( cY @ sK1_Xx )
                  | ( cZ @ sK1_Xx ) ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[9]) ).

thf(11,plain,
    ( ( ~ ( ~ ( ~ ( cX @ sK1_Xx )
              | ~ ( cY @ sK1_Xx ) )
          | ( cZ @ sK1_Xx ) )
      | ~ ( ~ ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
          | ~ ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(12,plain,
    ( ( ~ ( ~ ( ~ ( cX @ sK1_Xx )
              | ~ ( cY @ sK1_Xx ) )
          | ( cZ @ sK1_Xx ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[11]) ).

thf(13,plain,
    ( ( ~ ( ~ ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
          | ~ ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[11]) ).

thf(14,plain,
    ( ( ~ ( ~ ( cX @ sK1_Xx )
          | ~ ( cY @ sK1_Xx ) )
      | ( cZ @ sK1_Xx ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ~ ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) )
      | ~ ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ( ~ ( ~ ( cX @ sK1_Xx )
            | ~ ( cY @ sK1_Xx ) ) )
      = $true )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[14]) ).

thf(17,plain,
    ( ( ( ~ ( ( cX @ sK1_Xx )
            | ( cZ @ sK1_Xx ) ) )
      = $true )
    | ( ( ~ ( ( cY @ sK1_Xx )
            | ( cZ @ sK1_Xx ) ) )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[15]) ).

thf(18,plain,
    ( ( ( ~ ( cX @ sK1_Xx )
        | ~ ( cY @ sK1_Xx ) )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[16]) ).

thf(19,plain,
    ( ( ( ( cX @ sK1_Xx )
        | ( cZ @ sK1_Xx ) )
      = $false )
    | ( ( ~ ( ( cY @ sK1_Xx )
            | ( cZ @ sK1_Xx ) ) )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(20,plain,
    ( ( ( ~ ( cX @ sK1_Xx ) )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[18]) ).

thf(21,plain,
    ( ( ( ~ ( cY @ sK1_Xx ) )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[18]) ).

thf(22,plain,
    ( ( ( cX @ sK1_Xx )
      = $false )
    | ( ( ~ ( ( cY @ sK1_Xx )
            | ( cZ @ sK1_Xx ) ) )
      = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[19]) ).

thf(23,plain,
    ( ( ( cZ @ sK1_Xx )
      = $false )
    | ( ( ~ ( ( cY @ sK1_Xx )
            | ( cZ @ sK1_Xx ) ) )
      = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[19]) ).

thf(24,plain,
    ( ( ( cX @ sK1_Xx )
      = $true )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_not_neg,[status(thm)],[20]) ).

thf(25,plain,
    ( ( ( cY @ sK1_Xx )
      = $true )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_not_neg,[status(thm)],[21]) ).

thf(26,plain,
    ( ( ( ( cY @ sK1_Xx )
        | ( cZ @ sK1_Xx ) )
      = $false )
    | ( ( cX @ sK1_Xx )
      = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[22]) ).

thf(27,plain,
    ( ( ( ( cY @ sK1_Xx )
        | ( cZ @ sK1_Xx ) )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[23]) ).

thf(28,plain,
    ( ( ( cY @ sK1_Xx )
      = $false )
    | ( ( cX @ sK1_Xx )
      = $false ) ),
    inference(extcnf_or_neg,[status(thm)],[26]) ).

thf(29,plain,
    ( ( ( cZ @ sK1_Xx )
      = $false )
    | ( ( cX @ sK1_Xx )
      = $false ) ),
    inference(extcnf_or_neg,[status(thm)],[26]) ).

thf(30,plain,
    ( ( ( cY @ sK1_Xx )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $false ) ),
    inference(extcnf_or_neg,[status(thm)],[27]) ).

thf(31,plain,
    ( ( ( cZ @ sK1_Xx )
      = $false )
    | ( ( cZ @ sK1_Xx )
      = $false ) ),
    inference(extcnf_or_neg,[status(thm)],[27]) ).

thf(32,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[24,31,30,29,28,25]) ).

thf(33,plain,
    ( ( ~ ( ( ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
            & ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) )
         => ( ( ( cX @ sK1_Xx )
              & ( cY @ sK1_Xx ) )
            | ( cZ @ sK1_Xx ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(34,plain,
    ( ( ~ ( ~ ~ ( ~ ( ( cX @ sK1_Xx )
                    | ( cZ @ sK1_Xx ) )
                | ~ ( ( cY @ sK1_Xx )
                    | ( cZ @ sK1_Xx ) ) )
          | ~ ( ~ ( cX @ sK1_Xx )
              | ~ ( cY @ sK1_Xx ) )
          | ( cZ @ sK1_Xx ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[33]) ).

thf(35,plain,
    ( ( ~ ~ ( ~ ( ( cX @ sK1_Xx )
                | ( cZ @ sK1_Xx ) )
            | ~ ( ( cY @ sK1_Xx )
                | ( cZ @ sK1_Xx ) ) )
      | ~ ( ~ ( cX @ sK1_Xx )
          | ~ ( cY @ sK1_Xx ) )
      | ( cZ @ sK1_Xx ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[34]) ).

thf(36,plain,
    ( ( ~ ~ ( ~ ( ( cX @ sK1_Xx )
                | ( cZ @ sK1_Xx ) )
            | ~ ( ( cY @ sK1_Xx )
                | ( cZ @ sK1_Xx ) ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[35]) ).

thf(37,plain,
    ( ( ~ ( ~ ( cX @ sK1_Xx )
          | ~ ( cY @ sK1_Xx ) )
      | ( cZ @ sK1_Xx ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[35]) ).

thf(38,plain,
    ( ( ~ ( ~ ( ( cX @ sK1_Xx )
              | ( cZ @ sK1_Xx ) )
          | ~ ( ( cY @ sK1_Xx )
              | ( cZ @ sK1_Xx ) ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[36]) ).

thf(39,plain,
    ( ( ~ ( ~ ( cX @ sK1_Xx )
          | ~ ( cY @ sK1_Xx ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[37]) ).

thf(40,plain,
    ( ( cZ @ sK1_Xx )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[37]) ).

thf(41,plain,
    ( ( ~ ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) )
      | ~ ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[38]) ).

thf(42,plain,
    ( ( ~ ( cX @ sK1_Xx )
      | ~ ( cY @ sK1_Xx ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[39]) ).

thf(43,plain,
    ( ( ~ ( ( cX @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[41]) ).

thf(44,plain,
    ( ( ~ ( ( cY @ sK1_Xx )
          | ( cZ @ sK1_Xx ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[41]) ).

thf(45,plain,
    ( ( ( ~ ( cX @ sK1_Xx ) )
      = $true )
    | ( ( ~ ( cY @ sK1_Xx ) )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[42]) ).

thf(46,plain,
    ( ( ( cX @ sK1_Xx )
      | ( cZ @ sK1_Xx ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[43]) ).

thf(47,plain,
    ( ( ( cY @ sK1_Xx )
      | ( cZ @ sK1_Xx ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[44]) ).

thf(48,plain,
    ( ( ( cX @ sK1_Xx )
      = $false )
    | ( ( ~ ( cY @ sK1_Xx ) )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[45]) ).

thf(49,plain,
    ( ( ( cX @ sK1_Xx )
      = $true )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[46]) ).

thf(50,plain,
    ( ( ( cY @ sK1_Xx )
      = $true )
    | ( ( cZ @ sK1_Xx )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[47]) ).

thf(51,plain,
    ( ( ( cY @ sK1_Xx )
      = $false )
    | ( ( cX @ sK1_Xx )
      = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[48]) ).

thf(52,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[40,51,50,49]) ).

thf(53,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[52,32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV397^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.15  % Computer : n010.cluster.edu
% 0.10/0.15  % Model    : x86_64 x86_64
% 0.10/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15  % Memory   : 8046.5625MB
% 0.10/0.15  % OS       : Linux 6.8.0-71-generic
% 0.10/0.15  % CPULimit : 300
% 0.10/0.15  % WCLimit  : 300
% 0.10/0.15  % DateTime : Tue Oct  6 15:46:40 UTC 2026
% 0.10/0.15  % CPUTime  : 
% 0.10/0.16  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.19  
% 0.10/0.19   No.of.Axioms: 0
% 0.10/0.19  
% 0.10/0.19   Length.of.Defs: 0
% 0.10/0.19  
% 0.10/0.19   Contains.Choice.Funs: false
% 0.10/0.19  
% 0.10/0.19  ********************************
% 0.10/0.19  *   All subproblems solved!    *
% 0.10/0.19  ********************************
% 0.10/0.19  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:0,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:52,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.19  
% 0.10/0.19  %**** Beginning of derivation protocol ****
% 0.10/0.19  % SZS output start CNFRefutation
% See solution above
% 0.10/0.19  
% 0.10/0.19  %**** End of derivation protocol ****
% 0.10/0.19  %**** no. of clauses in derivation: 53 ****
% 0.10/0.19  %**** clause counter: 52 ****
% 0.10/0.19  
% 0.10/0.19  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:0,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:52,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------