↑ 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  : SYO019^1 : TPTP v9.3.1. Released v3.7.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 : n006.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:23 AM UTC 2026

% Result   : Theorem 0.10s 0.22s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   42 (  35 unt;   0 typ;   0 def)
%            Number of atoms       :  181 (  46 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :  166 ( 105   ~;  39   |;  11   &;   0   @)
%                                         (   5 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :    7 (   0   ^;   7   !;   0   ?;   7   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_sK1_X,type,
    sK1_X: $o ).

thf(tp_sK2_SY2,type,
    sK2_SY2: $o ).

thf(1,conjecture,
    ! [X: $o,Y: $o] :
      ( ( X
        & Y )
    <=> ~ ( ~ X
          | ~ Y ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

thf(2,negated_conjecture,
    ( ( ! [X: $o,Y: $o] :
          ( ( X
            & Y )
        <=> ~ ( ~ X
              | ~ Y ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [X: $o,Y: $o] :
          ( ( X
            & Y )
        <=> ~ ( ~ X
              | ~ Y ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [SY2: $o] :
          ( ( sK1_X
            & SY2 )
        <=> ~ ( ~ sK1_X
              | ~ SY2 ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ( sK1_X
        & sK2_SY2 )
    <=> ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ( sK1_X
        & sK2_SY2 )
     => ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[5]) ).

thf(7,plain,
    ( ( ~ ( ~ sK1_X
          | ~ sK2_SY2 )
     => ( sK1_X
        & sK2_SY2 ) )
    = $false ),
    inference(split_conjecture,[split_conjecture(split,[])],[5]) ).

thf(8,plain,
    ( ( ~ ( ( sK1_X
            & sK2_SY2 )
         => ~ ( ~ sK1_X
              | ~ sK2_SY2 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ~ ( ~ ( ~ sK1_X
              | ~ sK2_SY2 )
         => ( sK1_X
            & sK2_SY2 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(10,plain,
    ( ( ~ ( ( sK1_X
            & sK2_SY2 )
         => ~ ( ~ sK1_X
              | ~ sK2_SY2 ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

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

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

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

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

thf(15,plain,
    ( ( ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[13]) ).

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

thf(17,plain,
    ( ( ~ sK1_X
      | ~ sK2_SY2 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[15]) ).

thf(18,plain,
    ( ( ( ~ sK1_X ) = $true )
    | ( ( ~ sK2_SY2 ) = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[16]) ).

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

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

thf(21,plain,
    ( ( sK1_X = $false )
    | ( ( ~ sK2_SY2 ) = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[18]) ).

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

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

thf(24,plain,
    ( ( sK2_SY2 = $false )
    | ( sK1_X = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[21]) ).

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

thf(26,plain,
    ( ( ~ ( ~ ( ~ sK1_X
              | ~ sK2_SY2 )
         => ( sK1_X
            & sK2_SY2 ) ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(27,plain,
    ( ( ~ ( ~ ~ ( ~ sK1_X
                | ~ sK2_SY2 )
          | ~ ( ~ sK1_X
              | ~ sK2_SY2 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[26]) ).

thf(28,plain,
    ( ( ~ ~ ( ~ sK1_X
            | ~ sK2_SY2 )
      | ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[27]) ).

thf(29,plain,
    ( ( ~ ~ ( ~ sK1_X
            | ~ sK2_SY2 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[28]) ).

thf(30,plain,
    ( ( ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[28]) ).

thf(31,plain,
    ( ( ~ ( ~ sK1_X
          | ~ sK2_SY2 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[29]) ).

thf(32,plain,
    ( ( ~ sK1_X
      | ~ sK2_SY2 )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[30]) ).

thf(33,plain,
    ( ( ~ sK1_X
      | ~ sK2_SY2 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[31]) ).

thf(34,plain,
    ( ( ( ~ sK1_X ) = $true )
    | ( ( ~ sK2_SY2 ) = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[32]) ).

thf(35,plain,
    ( ( ~ sK1_X ) = $false ),
    inference(extcnf_or_neg,[status(thm)],[33]) ).

thf(36,plain,
    ( ( ~ sK2_SY2 ) = $false ),
    inference(extcnf_or_neg,[status(thm)],[33]) ).

thf(37,plain,
    ( ( sK1_X = $false )
    | ( ( ~ sK2_SY2 ) = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[34]) ).

thf(38,plain,
    sK1_X = $true,
    inference(extcnf_not_neg,[status(thm)],[35]) ).

thf(39,plain,
    sK2_SY2 = $true,
    inference(extcnf_not_neg,[status(thm)],[36]) ).

thf(40,plain,
    ( ( sK2_SY2 = $false )
    | ( sK1_X = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[37]) ).

thf(41,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[38,40,39]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO019^1 : TPTP v9.3.1. Released v3.7.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.18  % Computer : n006.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % 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:30:22 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.22  
% 0.10/0.22   No.of.Axioms: 0
% 0.10/0.22  
% 0.10/0.22   Length.of.Defs: 0
% 0.10/0.22  
% 0.10/0.22   Contains.Choice.Funs: false
% 0.10/0.22  
% 0.10/0.22  ********************************
% 0.10/0.22  *   All subproblems solved!    *
% 0.10/0.22  ********************************
% 0.10/0.22  % 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:41,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.22  
% 0.10/0.22  %**** Beginning of derivation protocol ****
% 0.10/0.22  % SZS output start CNFRefutation
% See solution above
% 0.10/0.22  
% 0.10/0.22  %**** End of derivation protocol ****
% 0.10/0.22  %**** no. of clauses in derivation: 42 ****
% 0.10/0.22  %**** clause counter: 41 ****
% 0.10/0.22  
% 0.10/0.22  % 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:41,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------