TSTP Solution File: SYN416+1 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n023.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 08:26:04 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   28 (  25 unt;   2 typ;   0 def)
%            Number of atoms       :  104 (  24 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :   88 (  58   ~;  16   |;   6   &;   0   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   4 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(1,conjecture,
    ( ( p
     => q )
    | ( q
     => p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel16) ).

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

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

thf(4,plain,
    ( ( ~ ( ( p
           => q )
          | ( q
           => p ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( p
      & ~ q
      & q
      & ~ p )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( p
      & ~ q
      & q
      & ~ p )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

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

thf(8,plain,
    ( ( ~ ~ ( ~ p
            | ~ ~ q )
      | ~ ~ ( ~ q
            | ~ ~ p ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

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

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

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

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

thf(13,plain,
    ( ( ~ p
      | ~ ~ q )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

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

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

thf(16,plain,
    ( ( ~ ~ q )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[13]) ).

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

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

thf(19,plain,
    p = $true,
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(20,plain,
    ( ( ~ q )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(21,plain,
    q = $true,
    inference(extcnf_not_neg,[status(thm)],[17]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN416+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 17:11:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  
% 0.13/0.34   No.of.Axioms: 0
% 0.13/0.34  
% 0.13/0.34   Length.of.Defs: 0
% 0.13/0.34  
% 0.13/0.34   Contains.Choice.Funs: false
% 0.13/0.34  (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:600,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.13/0.36  ********************************
% 0.13/0.36  *   All subproblems solved!    *
% 0.13/0.36  ********************************
% 0.13/0.36  % SZS status Theorem for /export/starexec/sandbox2/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:74,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.13/0.36  
% 0.13/0.36  %**** Beginning of derivation protocol ****
% 0.13/0.36  % SZS output start CNFRefutation
% See solution above
% 0.13/0.36  
% 0.13/0.36  %**** End of derivation protocol ****
% 0.13/0.36  %**** no. of clauses in derivation: 26 ****
% 0.13/0.36  %**** clause counter: 25 ****
% 0.13/0.36  
% 0.13/0.36  % SZS status Theorem for /export/starexec/sandbox2/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:25,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------