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

View Problem - Process Solution

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

% Computer : n010.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:30:38 EDT 2022

% Result   : Theorem 0.21s 0.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   29 (  27 unt;   1 typ;   0 def)
%            Number of atoms       :   95 (  26 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   43 (  28   ~;   4   |;   4   &;   0   @)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   1 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (   0   ^   0   !;   7   ?;   7   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_c,type,
    c: $o ).

thf(1,conjecture,
    ( ? [X: $i] : c
  <=> c ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(2,negated_conjecture,
    ( ( ? [X: $i] : c
    <=> c )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [X: $i] : c
    <=> c )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ? [X: $i] : c
     => c )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[3]) ).

thf(5,plain,
    ( ( c
     => ? [X: $i] : c )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[3]) ).

thf(6,plain,
    ( ( ~ ( ? [X: $i] : c
         => c ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(7,plain,
    ( ( ~ ( c
         => ? [X: $i] : c ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(8,plain,
    ( ( c
      & ~ c )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(9,plain,
    ( ( c
      & ~ c )
    = $true ),
    inference(extcnf_combined,[status(esa)],[7]) ).

thf(10,plain,
    ( ( c
      & ~ c )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(11,plain,
    ( ( ~ ( ~ c
          | ~ ~ c ) )
    = $true ),
    inference(unfold_def,[status(thm)],[10]) ).

thf(12,plain,
    ( ( ~ c
      | ~ ~ c )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

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

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

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

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

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

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

thf(19,plain,
    ( ( c
      & ~ c )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(20,plain,
    ( ( ~ ( ~ c
          | ~ ~ c ) )
    = $true ),
    inference(unfold_def,[status(thm)],[19]) ).

thf(21,plain,
    ( ( ~ c
      | ~ ~ c )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[20]) ).

thf(22,plain,
    ( ( ~ c )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[21]) ).

thf(23,plain,
    ( ( ~ ~ c )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[21]) ).

thf(24,plain,
    c = $true,
    inference(extcnf_not_neg,[status(thm)],[22]) ).

thf(25,plain,
    ( ( ~ c )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[23]) ).

thf(26,plain,
    c = $false,
    inference(extcnf_not_pos,[status(thm)],[25]) ).

thf(27,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[24,26]) ).

thf(28,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[27,18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN932+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.14  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jul 12 04:28:30 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  
% 0.14/0.36   No.of.Axioms: 0
% 0.14/0.36  
% 0.14/0.36   Length.of.Defs: 0
% 0.14/0.36  
% 0.14/0.36   Contains.Choice.Funs: false
% 0.21/0.36  (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.21/0.40  ********************************
% 0.21/0.40  *   All subproblems solved!    *
% 0.21/0.40  ********************************
% 0.21/0.40  % 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:27,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.21/0.40  
% 0.21/0.40  %**** Beginning of derivation protocol ****
% 0.21/0.40  % SZS output start CNFRefutation
% See solution above
% 0.21/0.40  
% 0.21/0.40  %**** End of derivation protocol ****
% 0.21/0.40  %**** no. of clauses in derivation: 28 ****
% 0.21/0.40  %**** clause counter: 27 ****
% 0.21/0.40  
% 0.21/0.40  % 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:27,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------