↑ 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  : LCL591^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 : n018.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 10:29:28 AM UTC 2026

% Result   : Theorem 0.07s 0.23s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   35 (  34 unt;   0 typ;  15 def)
%            Number of atoms       :  105 (  33 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  107 (  11   ~;   5   |;   2   &;  77   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   1 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   33 (  33   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   26 (  23 usr;   5 con; 0-3 aty)
%            Number of variables   :   66 (  28   ^;  34   !;   4   ?;  66   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_individuals,type,
    individuals: $tType ).

thf(tp_current_world,type,
    current_world: $i ).

thf(tp_mall,type,
    mall: ( individuals > $i > $o ) > $i > $o ).

thf(tp_mand,type,
    mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_mbox,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_mcountersatisfiable,type,
    mcountersatisfiable: ( $i > $o ) > $o ).

thf(tp_mdia,type,
    mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_mexists,type,
    mexists: ( individuals > $i > $o ) > $i > $o ).

thf(tp_mfalse,type,
    mfalse: $i > $o ).

thf(tp_miff,type,
    miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_mimpl,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_minvalid,type,
    minvalid: ( $i > $o ) > $o ).

thf(tp_mnot,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(tp_mor,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_msatisfiable,type,
    msatisfiable: ( $i > $o ) > $o ).

thf(tp_mtrue,type,
    mtrue: $i > $o ).

thf(tp_mvalid,type,
    mvalid: ( $i > $o ) > $o ).

thf(tp_prop_a,type,
    prop_a: $i > $o ).

thf(tp_prop_b,type,
    prop_b: $i > $o ).

thf(tp_prop_c,type,
    prop_c: $i > $o ).

thf(tp_sK1_SY0,type,
    sK1_SY0: $i > $i > $o ).

thf(tp_sK2_SY15,type,
    sK2_SY15: $i > $o ).

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

thf(tp_sK4_SY22,type,
    sK4_SY22: $i ).

thf(mall,definition,
    ( mall
    = ( ^ [P: individuals > $i > $o,W: $i] :
        ! [X: individuals] : ( P @ X @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mall) ).

thf(mand,definition,
    ( mand
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          & ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand) ).

thf(mbox,definition,
    ( mbox
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ! [Y: $i] :
          ( ( R @ X @ Y )
         => ( P @ Y ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox) ).

thf(mcountersatisfiable,definition,
    ( mcountersatisfiable
    = ( ^ [P: $i > $o] :
        ? [W: $i] :
          ~ ( P @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mcountersatisfiable) ).

thf(mdia,definition,
    ( mdia
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ? [Y: $i] :
          ( ( R @ X @ Y )
          & ( P @ Y ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',individuals_decl) ).

thf(mexists,definition,
    ( mexists
    = ( ^ [P: individuals > $i > $o,W: $i] :
        ? [X: individuals] : ( P @ X @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists) ).

thf(mfalse,definition,
    ( mfalse
    = ( ^ [X: $i] : $false ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mfalse) ).

thf(miff,definition,
    ( miff
    = ( ^ [U: $i > $o,V: $i > $o] : ( mand @ ( mimpl @ U @ V ) @ ( mimpl @ V @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',miff) ).

thf(mimpl,definition,
    ( mimpl
    = ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimpl) ).

thf(minvalid,definition,
    ( minvalid
    = ( ^ [P: $i > $o] :
        ! [W: $i] :
          ~ ( P @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',minvalid) ).

thf(mnot,definition,
    ( mnot
    = ( ^ [X: $i > $o,U: $i] :
          ~ ( X @ U ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot) ).

thf(mor,definition,
    ( mor
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor) ).

thf(msatisfiable,definition,
    ( msatisfiable
    = ( ^ [P: $i > $o] :
        ? [W: $i] : ( P @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',msatisfiable) ).

thf(mtrue,definition,
    ( mtrue
    = ( ^ [X: $i] : $true ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtrue) ).

thf(mvalid,definition,
    ( mvalid
    = ( ^ [P: $i > $o] :
        ! [W: $i] : ( P @ W ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid) ).

thf(1,conjecture,
    ! [R: $i > $i > $o,A: $i > $o] :
      ( ( mvalid @ A )
     => ( mvalid @ ( mbox @ R @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ( ( ! [R: $i > $i > $o,A: $i > $o] :
          ( ( mvalid @ A )
         => ( mvalid @ ( mbox @ R @ A ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [SY0: $i > $i > $o,SY1: $i > $o] :
          ( ! [SY2: $i] : ( SY1 @ SY2 )
         => ! [SY8: $i,SY9: $i] :
              ( ( SY0 @ SY8 @ SY9 )
             => ( SY1 @ SY9 ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2,mall,mand,mbox,mcountersatisfiable,mdia,mexists,mfalse,miff,mimpl,minvalid,mnot,mor,msatisfiable,mtrue,mvalid]) ).

thf(4,plain,
    ( ( ! [SY15: $i > $o] :
          ( ! [SY2: $i] : ( SY15 @ SY2 )
         => ! [SY17: $i,SY18: $i] :
              ( ( sK1_SY0 @ SY17 @ SY18 )
             => ( SY15 @ SY18 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ! [SY19: $i] : ( sK2_SY15 @ SY19 )
     => ! [SY20: $i,SY21: $i] :
          ( ( sK1_SY0 @ SY20 @ SY21 )
         => ( sK2_SY15 @ SY21 ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [SY19: $i] : ( sK2_SY15 @ SY19 ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [SY20: $i,SY21: $i] :
          ( ( sK1_SY0 @ SY20 @ SY21 )
         => ( sK2_SY15 @ SY21 ) ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[5]) ).

thf(8,plain,
    ( ( ~ ! [SY20: $i,SY21: $i] :
            ( ( sK1_SY0 @ SY20 @ SY21 )
           => ( sK2_SY15 @ SY21 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ! [SY19: $i] : ( sK2_SY15 @ SY19 ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

thf(10,plain,
    ( ( ~ ! [SY20: $i,SY21: $i] :
            ( ( sK1_SY0 @ SY20 @ SY21 )
           => ( sK2_SY15 @ SY21 ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(11,plain,
    ( ( ~ ! [SX0: $i,SX1: $i] :
            ( ~ ( sK1_SY0 @ SX0 @ SX1 )
            | ( sK2_SY15 @ SX1 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[10,mall,mand,mbox,mcountersatisfiable,mdia,mexists,mfalse,miff,mimpl,minvalid,mnot,mor,msatisfiable,mtrue,mvalid]) ).

thf(12,plain,
    ! [SV1: $i] :
      ( ( sK2_SY15 @ SV1 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[9]) ).

thf(13,plain,
    ( ( ! [SX0: $i,SX1: $i] :
          ( ~ ( sK1_SY0 @ SX0 @ SX1 )
          | ( sK2_SY15 @ SX1 ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

thf(14,plain,
    ( ( ! [SY22: $i] :
          ( ~ ( sK1_SY0 @ sK3_SX0 @ SY22 )
          | ( sK2_SY15 @ SY22 ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[13]) ).

thf(15,plain,
    ( ( ~ ( sK1_SY0 @ sK3_SX0 @ sK4_SY22 )
      | ( sK2_SY15 @ sK4_SY22 ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[14]) ).

thf(16,plain,
    ( ( ~ ( sK1_SY0 @ sK3_SX0 @ sK4_SY22 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[15]) ).

thf(17,plain,
    ( ( sK2_SY15 @ sK4_SY22 )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[15]) ).

thf(18,plain,
    ( ( sK1_SY0 @ sK3_SX0 @ sK4_SY22 )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

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

thf(20,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL591^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.07/0.19  % Computer : n018.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Oct  6 12:26:51 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  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.07/0.23  
% 0.07/0.23   No.of.Axioms: 0
% 0.07/0.23  
% 0.07/0.23   Length.of.Defs: 2215
% 0.07/0.23  
% 0.07/0.23   Contains.Choice.Funs: false
% 0.07/0.23  
% 0.07/0.23  ********************************
% 0.07/0.23  *   All subproblems solved!    *
% 0.07/0.23  ********************************
% 0.07/0.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:19,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.23  
% 0.07/0.23  %**** Beginning of derivation protocol ****
% 0.07/0.23  % SZS output start CNFRefutation
% See solution above
% 0.07/0.23  
% 0.07/0.23  %**** End of derivation protocol ****
% 0.07/0.23  %**** no. of clauses in derivation: 20 ****
% 0.07/0.23  %**** clause counter: 19 ****
% 0.07/0.23  
% 0.07/0.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:19,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------