↑ 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  : SYO189^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/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n001.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 11:07:47 AM UTC 2026

% Result   : Theorem 0.10s 0.20s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   28 (  27 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  26 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   45 (  26   ~;  12   |;   0   &;   2   @)
%                                         (   0 <=>;   5  =>;   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;   4 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  23   !;   5   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_sK1_SY2,type,
    sK1_SY2: $o > $o ).

thf(tp_sK2_SX0,type,
    sK2_SX0: $o ).

thf(tp_sK3_SX0,type,
    sK3_SX0: $o ).

thf(1,conjecture,
    ? [Xx: $o] :
    ! [Xy: $o] :
      ( Xx
     => Xy ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT5) ).

thf(2,negated_conjecture,
    ( ( ? [Xx: $o] :
        ! [Xy: $o] :
          ( Xx
         => Xy ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [Xx: $o] :
        ! [Xy: $o] :
          ( Xx
         => Xy ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ~ ? [Xx: $o] :
          ! [Xy: $o] :
            ( Xx
           => Xy ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ~ ? [Xx: $o] :
          ! [Xy: $o] :
            ( Xx
           => Xy ) )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ~ ~ ! [SX0: $o] :
              ~ ! [SX1: $o] :
                  ( ~ SX0
                  | SX1 ) )
    = $true ),
    inference(unfold_def,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ~ ! [SX0: $o] :
            ~ ! [SX1: $o] :
                ( ~ SX0
                | SX1 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ! [SX0: $o] :
          ~ ! [SX1: $o] :
              ( ~ SX0
              | SX1 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[7]) ).

thf(9,plain,
    ! [SV1: $o] :
      ( ( ~ ! [SY2: $o] :
              ( ~ SV1
              | SY2 ) )
      = $true ),
    inference(extcnf_forall_special_pos,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ~ ! [SX0: $o] :
            ( ~ $true
            | SX0 ) )
    = $true ),
    inference(extcnf_forall_special_pos,[status(thm)],[8]) ).

thf(11,plain,
    ( ( ~ ! [SX0: $o] :
            ( ~ $false
            | SX0 ) )
    = $true ),
    inference(extcnf_forall_special_pos,[status(thm)],[8]) ).

thf(12,plain,
    ! [SV1: $o] :
      ( ( ! [SY2: $o] :
            ( ~ SV1
            | SY2 ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[9]) ).

thf(13,plain,
    ( ( ! [SX0: $o] :
          ( ~ $true
          | SX0 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(14,plain,
    ( ( ! [SX0: $o] :
          ( ~ $false
          | SX0 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

thf(15,plain,
    ! [SV1: $o] :
      ( ( ~ SV1
        | ( sK1_SY2 @ SV1 ) )
      = $false ),
    inference(extcnf_forall_neg,[status(esa)],[12]) ).

thf(16,plain,
    ( ( ~ $true
      | sK2_SX0 )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[13]) ).

thf(17,plain,
    ( ( ~ $false
      | sK3_SX0 )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[14]) ).

thf(18,plain,
    ! [SV1: $o] :
      ( ( ~ SV1 ) = $false ),
    inference(extcnf_or_neg,[status(thm)],[15]) ).

thf(19,plain,
    ! [SV1: $o] :
      ( ( sK1_SY2 @ SV1 )
      = $false ),
    inference(extcnf_or_neg,[status(thm)],[15]) ).

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

thf(21,plain,
    sK2_SX0 = $false,
    inference(extcnf_or_neg,[status(thm)],[16]) ).

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

thf(23,plain,
    sK3_SX0 = $false,
    inference(extcnf_or_neg,[status(thm)],[17]) ).

thf(24,plain,
    ! [SV1: $o] : ( SV1 = $true ),
    inference(extcnf_not_neg,[status(thm)],[18]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO189^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/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.17  % Computer : n001.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Tue Oct  6 17:39:09 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.20  
% 0.10/0.20   No.of.Axioms: 0
% 0.10/0.20  
% 0.10/0.20   Length.of.Defs: 0
% 0.10/0.20  
% 0.10/0.20   Contains.Choice.Funs: false
% 0.10/0.20  
% 0.10/0.20  ********************************
% 0.10/0.20  *   All subproblems solved!    *
% 0.10/0.20  ********************************
% 0.10/0.20  % SZS status Theorem for /export/starexec/sandbox2/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:27,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.20  
% 0.10/0.20  %**** Beginning of derivation protocol ****
% 0.10/0.20  % SZS output start CNFRefutation
% See solution above
% 0.10/0.20  
% 0.10/0.20  %**** End of derivation protocol ****
% 0.10/0.20  %**** no. of clauses in derivation: 28 ****
% 0.10/0.20  %**** clause counter: 27 ****
% 0.10/0.20  
% 0.10/0.20  % SZS status Theorem for /export/starexec/sandbox2/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:27,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------