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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYO128^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 : n005.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:19 EDT 2022

% Result   : Theorem 0.14s 0.37s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  18 unt;   3 typ;   0 def)
%            Number of atoms       :  137 (  31 equ;   0 cnn)
%            Maximal formula atoms :    7 (   5 avg)
%            Number of connectives :   87 (  38   ~;  31   |;  15   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_p,type,
    p: $o ).

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

thf(tp_r,type,
    r: $o ).

thf(1,conjecture,
    ( ( p
      & ( q
        | r ) )
   => ( ( p
        & q )
      | ( p
        & r ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDISJ_BUG_2) ).

thf(2,negated_conjecture,
    ( ( ( p
        & ( q
          | r ) )
     => ( ( p
          & q )
        | ( p
          & r ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ( p
        & ( q
          | r ) )
     => ( ( p
          & q )
        | ( p
          & r ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    p = $true,
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( q
      | r )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ( p
        & q )
      | ( p
        & r ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(7,plain,
    ( ( ~ ( ( p
            & q )
          | ( p
            & r ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ( ~ p
        | ~ q )
      & ( ~ p
        | ~ r ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[7]) ).

thf(9,plain,
    ( ( q
      | r )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(10,plain,
    p = $true,
    inference(copy,[status(thm)],[4]) ).

thf(11,plain,
    ( ( ( ~ p
        | ~ q )
      & ( ~ p
        | ~ r ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(12,plain,
    ( ( ~ ( ~ ( ~ p
              | ~ q )
          | ~ ( ~ p
              | ~ r ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[11]) ).

thf(13,plain,
    ( ( q = $true )
    | ( r = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[9]) ).

thf(14,plain,
    ( ( ~ ( ~ p
          | ~ q )
      | ~ ( ~ p
          | ~ r ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ~ ( ~ p
          | ~ q ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[14]) ).

thf(16,plain,
    ( ( ~ ( ~ p
          | ~ r ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[14]) ).

thf(17,plain,
    ( ( ~ p
      | ~ q )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(18,plain,
    ( ( ~ p
      | ~ r )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(19,plain,
    ( ( ( ~ p )
      = $true )
    | ( ( ~ q )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[17]) ).

thf(20,plain,
    ( ( ( ~ p )
      = $true )
    | ( ( ~ r )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[18]) ).

thf(21,plain,
    ( ( p = $false )
    | ( ( ~ q )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[19]) ).

thf(22,plain,
    ( ( p = $false )
    | ( ( ~ r )
      = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[20]) ).

thf(23,plain,
    ( ( q = $false )
    | ( p = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[21]) ).

thf(24,plain,
    ( ( r = $false )
    | ( p = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[22]) ).

thf(25,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[10,24,23,13]) ).

thf(26,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO128^5 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34  % Computer : n005.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 : Fri Jul  8 18:56:52 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.14/0.37  ********************************
% 0.14/0.37  *   All subproblems solved!    *
% 0.14/0.37  ********************************
% 0.14/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:25,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.14/0.37  
% 0.14/0.37  %**** Beginning of derivation protocol ****
% 0.14/0.37  % SZS output start CNFRefutation
% See solution above
% 0.14/0.37  
% 0.14/0.37  %**** End of derivation protocol ****
% 0.14/0.37  %**** no. of clauses in derivation: 26 ****
% 0.14/0.37  %**** clause counter: 25 ****
% 0.14/0.37  
% 0.14/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:25,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------