↑ 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  : SYN984^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n019.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:17 AM UTC 2026

% Result   : Theorem 0.08s 0.20s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   42 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :  262 (  72 equ;   0 cnn)
%            Maximal formula atoms :    7 (   6 avg)
%            Number of connectives :  121 (  45   ~;  42   |;   9   &;  22   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   8 con; 0-2 aty)
%            Number of variables   :   22 (  22   ^;   0   !;   0   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_a,type,
    a: $o ).

thf(tp_b,type,
    b: $o ).

thf(tp_p,type,
    p: ( $i > $o ) > $o ).

thf(tp_sK1_E,type,
    sK1_E: $i ).

thf(tp_sK2_E,type,
    sK2_E: $i ).

thf(tp_sK3_E,type,
    sK3_E: $i ).

thf(tp_sK4_E,type,
    sK4_E: $i ).

thf(1,conjecture,
    ( ( ( p
        @ ^ [X: $i] : a )
      & ( p
        @ ^ [X: $i] : b ) )
   => ( p
      @ ^ [X: $i] :
          ( a
          & b ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ( ( ( ( p
          @ ^ [X: $i] : a )
        & ( p
          @ ^ [X: $i] : b ) )
     => ( p
        @ ^ [X: $i] :
            ( a
            & b ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ( ( p
          @ ^ [X: $i] : a )
        & ( p
          @ ^ [X: $i] : b ) )
     => ( p
        @ ^ [X: $i] :
            ( a
            & b ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( p
      @ ^ [X: $i] : a )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( p
      @ ^ [X: $i] : b )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( p
      @ ^ [X: $i] :
          ( a
          & b ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(7,plain,
    ( ( ~ ( p
          @ ^ [X: $i] :
              ( a
              & b ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(8,plain,
    ( ( p
      @ ^ [X: $i] : b )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(9,plain,
    ( ( p
      @ ^ [X: $i] : a )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(10,plain,
    ( ( ~ ( p
          @ ^ [X: $i] :
              ( a
              & b ) ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(11,plain,
    ( ( ~ ( p
          @ ^ [SX0: $i] :
              ~ ( ~ a
                | ~ b ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[10]) ).

thf(12,plain,
    ( ( p
      @ ^ [SX0: $i] :
          ~ ( ~ a
            | ~ b ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

thf(13,plain,
    ( ( ( p
        @ ^ [SX0: $i] :
            ~ ( ~ a
              | ~ b ) )
      = ( p
        @ ^ [X: $i] : a ) )
    = $false ),
    inference(res,[status(thm)],[12,9]) ).

thf(14,plain,
    ( ( ( p
        @ ^ [SX0: $i] :
            ~ ( ~ a
              | ~ b ) )
      = ( p
        @ ^ [X: $i] : b ) )
    = $false ),
    inference(res,[status(thm)],[12,8]) ).

thf(15,plain,
    ( ( ( ~ ( ~ a
            | ~ b ) )
      = $true )
    | ( b = $true ) ),
    inference(extuni,[status(esa)],[14]) ).

thf(16,plain,
    ( ( ( ~ ( ~ a
            | ~ b ) )
      = $false )
    | ( b = $false ) ),
    inference(extuni,[status(esa)],[14]) ).

thf(17,plain,
    ( ( ( ~ ( ~ a
            | ~ b ) )
      = $true )
    | ( a = $true ) ),
    inference(extuni,[status(esa)],[13]) ).

thf(18,plain,
    ( ( ( ~ ( ~ a
            | ~ b ) )
      = $false )
    | ( a = $false ) ),
    inference(extuni,[status(esa)],[13]) ).

thf(19,plain,
    ( ( ( ~ a
        | ~ b )
      = $true )
    | ( b = $false ) ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(20,plain,
    ( ( ( ~ a
        | ~ b )
      = $false )
    | ( b = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[15]) ).

thf(21,plain,
    ( ( ( ~ a
        | ~ b )
      = $true )
    | ( a = $false ) ),
    inference(extcnf_not_neg,[status(thm)],[18]) ).

thf(22,plain,
    ( ( ( ~ a
        | ~ b )
      = $false )
    | ( a = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(23,plain,
    ( ( ( ~ a ) = $true )
    | ( ( ~ b ) = $true )
    | ( b = $false ) ),
    inference(extcnf_or_pos,[status(thm)],[19]) ).

thf(24,plain,
    ( ( ( ~ a ) = $false )
    | ( b = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[20]) ).

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

thf(26,plain,
    ( ( ( ~ a ) = $true )
    | ( ( ~ b ) = $true )
    | ( a = $false ) ),
    inference(extcnf_or_pos,[status(thm)],[21]) ).

thf(27,plain,
    ( ( ( ~ a ) = $false )
    | ( a = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[22]) ).

thf(28,plain,
    ( ( ( ~ b ) = $false )
    | ( a = $true ) ),
    inference(extcnf_or_neg,[status(thm)],[22]) ).

thf(29,plain,
    ( ( a = $false )
    | ( ( ~ b ) = $true )
    | ( b = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[23]) ).

thf(30,plain,
    ( ( a = $true )
    | ( b = $true ) ),
    inference(extcnf_not_neg,[status(thm)],[24]) ).

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

thf(32,plain,
    ( ( a = $false )
    | ( ( ~ b ) = $true )
    | ( a = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[26]) ).

thf(33,plain,
    ( ( a = $true )
    | ( a = $true ) ),
    inference(extcnf_not_neg,[status(thm)],[27]) ).

thf(34,plain,
    ( ( b = $true )
    | ( a = $true ) ),
    inference(extcnf_not_neg,[status(thm)],[28]) ).

thf(35,plain,
    ( ( b = $false )
    | ( a = $false )
    | ( b = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[29]) ).

thf(36,plain,
    ( ( b = $false )
    | ( a = $false )
    | ( a = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[32]) ).

thf(37,plain,
    ( ( b = $false )
    | ( a = $false ) ),
    inference(sim,[status(thm)],[35]) ).

thf(38,plain,
    b = $true,
    inference(sim,[status(thm)],[31]) ).

thf(39,plain,
    ( ( b = $false )
    | ( a = $false ) ),
    inference(sim,[status(thm)],[36]) ).

thf(40,plain,
    a = $true,
    inference(sim,[status(thm)],[33]) ).

thf(42,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[8,40,39,38,37,34,30,12,9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN984^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04  % Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.16  % Computer : n019.cluster.edu
% 0.08/0.16  % Model    : x86_64 x86_64
% 0.08/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16  % Memory   : 8046.5625MB
% 0.08/0.16  % OS       : Linux 6.8.0-71-generic
% 0.08/0.16  % CPULimit : 300
% 0.08/0.16  % WCLimit  : 300
% 0.08/0.16  % DateTime : Tue Oct  6 17:30:46 UTC 2026
% 0.08/0.16  % CPUTime  : 
% 0.08/0.16  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.20  
% 0.08/0.20   No.of.Axioms: 0
% 0.08/0.20  
% 0.08/0.20   Length.of.Defs: 0
% 0.08/0.20  
% 0.08/0.20   Contains.Choice.Funs: false
% 0.08/0.20  
% 0.08/0.20  ********************************
% 0.08/0.20  *   All subproblems solved!    *
% 0.08/0.20  ********************************
% 0.08/0.20  % SZS status Theorem for /export/starexec/sandbox/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:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:42,loop_count:5,foatp_calls:2,translation:fof_full)
% 0.08/0.20  
% 0.08/0.20  %**** Beginning of derivation protocol ****
% 0.08/0.20  % SZS output start CNFRefutation
% See solution above
% 0.08/0.21  
% 0.08/0.21  %**** End of derivation protocol ****
% 0.08/0.21  %**** no. of clauses in derivation: 42 ****
% 0.08/0.21  %**** clause counter: 42 ****
% 0.08/0.21  
% 0.08/0.21  % SZS status Theorem for /export/starexec/sandbox/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:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:42,loop_count:5,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------