↑ 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  : LCL579^2 : TPTP v9.3.1. Released v5.1.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 : n004.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:27 AM UTC 2026

% Result   : Theorem 0.07s 0.24s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   24 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (  28 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   81 (  18   ~;   8   |;   2   &;  41   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_cX,type,
    cX: $i ).

thf(tp_cY,type,
    cY: $i ).

thf(tp_sK1_R,type,
    sK1_R: $i > $o ).

thf(1,conjecture,
    ( ! [P: $i > $o] :
        ( ( P @ cY )
       => ( P @ cX ) )
   => ! [R: $i > $o] :
        ( ( R @ cX )
       => ( R @ cY ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM76A) ).

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

thf(3,plain,
    ( ( ! [P: $i > $o] :
          ( ( P @ cY )
         => ( P @ cX ) )
     => ! [R: $i > $o] :
          ( ( R @ cX )
         => ( R @ cY ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [P: $i > $o] :
          ( ( P @ cY )
         => ( P @ cX ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [R: $i > $o] :
          ( ( R @ cX )
         => ( R @ cY ) ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ~ ! [R: $i > $o] :
            ( ( R @ cX )
           => ( R @ cY ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ( sK1_R @ cX )
      & ~ ( sK1_R @ cY ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(8,plain,
    ( ( ! [P: $i > $o] :
          ( ~ ( P @ cY )
          | ( P @ cX ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(9,plain,
    ( ( ! [P: $i > $o] :
          ( ~ ( P @ cY )
          | ( P @ cX ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ( sK1_R @ cX )
      & ~ ( sK1_R @ cY ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(11,plain,
    ( ( ~ ( ~ ( sK1_R @ cX )
          | ~ ~ ( sK1_R @ cY ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[10]) ).

thf(12,plain,
    ! [SV1: $i > $o] :
      ( ( ~ ( SV1 @ cY )
        | ( SV1 @ cX ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[9]) ).

thf(13,plain,
    ( ( ~ ( sK1_R @ cX )
      | ~ ~ ( sK1_R @ cY ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

thf(14,plain,
    ! [SV1: $i > $o] :
      ( ( ( ~ ( SV1 @ cY ) )
        = $true )
      | ( ( SV1 @ cX )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ~ ( sK1_R @ cX ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ~ ~ ( sK1_R @ cY ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[13]) ).

thf(17,plain,
    ! [SV1: $i > $o] :
      ( ( ( SV1 @ cY )
        = $false )
      | ( ( SV1 @ cX )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[14]) ).

thf(18,plain,
    ( ( sK1_R @ cX )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(19,plain,
    ( ( ~ ( sK1_R @ cY ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(20,plain,
    ( ( sK1_R @ cY )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[19]) ).

thf(21,plain,
    ( ( ( cY = cY )
      = $false )
    | ( ( cX = cY )
      = $true ) ),
    inference(replace_leibnizEQ,[status(thm)],[17:[bind(SV1,$thf( ^ [SV2: $i] : ( SV2 = cY ) ))]]) ).

thf(22,plain,
    ( ( cX = cY )
    = $true ),
    inference(sim,[status(thm)],[21]) ).

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

thf(24,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL579^2 : TPTP v9.3.1. Released v5.1.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 : n004.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:24:09 UTC 2026
% 0.07/0.20  % CPUTime  : 
% 0.07/0.20  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.24  
% 0.07/0.24   No.of.Axioms: 0
% 0.07/0.24  
% 0.07/0.24   Length.of.Defs: 0
% 0.07/0.24  
% 0.07/0.24   Contains.Choice.Funs: false
% 0.07/0.24  
% 0.07/0.24  ********************************
% 0.07/0.24  *   All subproblems solved!    *
% 0.07/0.24  ********************************
% 0.07/0.24  % 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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:23,loop_count:0,foatp_calls:2,translation:fof_experiment)
% 0.07/0.24  
% 0.07/0.24  %**** Beginning of derivation protocol ****
% 0.07/0.24  % SZS output start CNFRefutation
% See solution above
% 0.07/0.24  
% 0.07/0.24  %**** End of derivation protocol ****
% 0.07/0.24  %**** no. of clauses in derivation: 24 ****
% 0.07/0.24  %**** clause counter: 23 ****
% 0.07/0.24  
% 0.07/0.24  % 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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:23,loop_count:0,foatp_calls:2,translation:fof_experiment)
%------------------------------------------------------------------------------