↑ 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  : SYN361+1 : TPTP v9.3.1. Released v2.0.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 : n002.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:05:37 AM UTC 2026

% Result   : Theorem 0.08s 0.21s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   28 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :  119 (  31 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  152 (  25   ~;  12   |;   6   &;  98   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   54 (   0   ^;  41   !;  13   ?;  54   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_big_p,type,
    big_p: $i > $i > $o ).

thf(tp_big_q,type,
    big_q: $i > $i > $o ).

thf(tp_big_s,type,
    big_s: $i > $o ).

thf(tp_sK1_V,type,
    sK1_V: $i ).

thf(tp_sK2_Y,type,
    sK2_Y: $i > $i ).

thf(1,conjecture,
    ( ( ? [V: $i] :
        ! [X: $i] : ( big_p @ X @ V )
      & ! [X: $i] :
          ( ( big_s @ X )
         => ? [Y: $i] : ( big_q @ Y @ X ) )
      & ! [X: $i,Y: $i] :
          ( ( big_p @ X @ Y )
         => ~ ( big_q @ X @ Y ) ) )
   => ? [U: $i] :
        ~ ( big_s @ U ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2112) ).

thf(2,negated_conjecture,
    ( ( ( ? [V: $i] :
          ! [X: $i] : ( big_p @ X @ V )
        & ! [X: $i] :
            ( ( big_s @ X )
           => ? [Y: $i] : ( big_q @ Y @ X ) )
        & ! [X: $i,Y: $i] :
            ( ( big_p @ X @ Y )
           => ~ ( big_q @ X @ Y ) ) )
     => ? [U: $i] :
          ~ ( big_s @ U ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ( ? [V: $i] :
          ! [X: $i] : ( big_p @ X @ V )
        & ! [X: $i] :
            ( ( big_s @ X )
           => ? [Y: $i] : ( big_q @ Y @ X ) )
        & ! [X: $i,Y: $i] :
            ( ( big_p @ X @ Y )
           => ~ ( big_q @ X @ Y ) ) )
     => ? [U: $i] :
          ~ ( big_s @ U ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ? [V: $i] :
        ! [X: $i] : ( big_p @ X @ V ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [X: $i] :
          ( ( big_s @ X )
         => ? [Y: $i] : ( big_q @ Y @ X ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ( big_p @ X @ Y )
         => ~ ( big_q @ X @ Y ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(7,plain,
    ( ( ? [U: $i] :
          ~ ( big_s @ U ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(8,plain,
    ( ( ~ ? [U: $i] :
            ~ ( big_s @ U ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ! [U: $i] : ( big_s @ U ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[8]) ).

thf(10,plain,
    ( ( ! [SY7: $i] : ( big_p @ SY7 @ sK1_V ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(11,plain,
    ( ( ! [X: $i] :
          ( ~ ( big_s @ X )
          | ( big_q @ ( sK2_Y @ X ) @ X ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[5]) ).

thf(12,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ~ ( big_p @ X @ Y )
          | ~ ( big_q @ X @ Y ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(13,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ~ ( big_p @ X @ Y )
          | ~ ( big_q @ X @ Y ) ) )
    = $true ),
    inference(copy,[status(thm)],[12]) ).

thf(14,plain,
    ( ( ! [X: $i] :
          ( ~ ( big_s @ X )
          | ( big_q @ ( sK2_Y @ X ) @ X ) ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(15,plain,
    ( ( ! [SY7: $i] : ( big_p @ SY7 @ sK1_V ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(16,plain,
    ( ( ! [U: $i] : ( big_s @ U ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(17,plain,
    ! [SV1: $i] :
      ( ( ! [SY8: $i] :
            ( ~ ( big_p @ SV1 @ SY8 )
            | ~ ( big_q @ SV1 @ SY8 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[13]) ).

thf(18,plain,
    ! [SV2: $i] :
      ( ( ~ ( big_s @ SV2 )
        | ( big_q @ ( sK2_Y @ SV2 ) @ SV2 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[14]) ).

thf(19,plain,
    ! [SV3: $i] :
      ( ( big_p @ SV3 @ sK1_V )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[15]) ).

thf(20,plain,
    ! [SV4: $i] :
      ( ( big_s @ SV4 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[16]) ).

thf(21,plain,
    ! [SV5: $i,SV1: $i] :
      ( ( ~ ( big_p @ SV1 @ SV5 )
        | ~ ( big_q @ SV1 @ SV5 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[17]) ).

thf(22,plain,
    ! [SV2: $i] :
      ( ( ( ~ ( big_s @ SV2 ) )
        = $true )
      | ( ( big_q @ ( sK2_Y @ SV2 ) @ SV2 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[18]) ).

thf(23,plain,
    ! [SV5: $i,SV1: $i] :
      ( ( ( ~ ( big_p @ SV1 @ SV5 ) )
        = $true )
      | ( ( ~ ( big_q @ SV1 @ SV5 ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[21]) ).

thf(24,plain,
    ! [SV2: $i] :
      ( ( ( big_s @ SV2 )
        = $false )
      | ( ( big_q @ ( sK2_Y @ SV2 ) @ SV2 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[22]) ).

thf(25,plain,
    ! [SV5: $i,SV1: $i] :
      ( ( ( big_p @ SV1 @ SV5 )
        = $false )
      | ( ( ~ ( big_q @ SV1 @ SV5 ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[23]) ).

thf(26,plain,
    ! [SV5: $i,SV1: $i] :
      ( ( ( big_q @ SV1 @ SV5 )
        = $false )
      | ( ( big_p @ SV1 @ SV5 )
        = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[25]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN361+1 : TPTP v9.3.1. Released v2.0.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.18  % Computer : n002.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Oct  6 17:22:01 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  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.21  
% 0.08/0.21   No.of.Axioms: 0
% 0.08/0.21  
% 0.08/0.21   Length.of.Defs: 0
% 0.08/0.21  
% 0.08/0.21   Contains.Choice.Funs: false
% 0.08/0.21  
% 0.08/0.21  ********************************
% 0.08/0.21  *   All subproblems solved!    *
% 0.08/0.21  ********************************
% 0.08/0.21  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:27,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.08/0.21  
% 0.08/0.21  %**** Beginning of derivation protocol ****
% 0.08/0.21  % 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: 28 ****
% 0.08/0.21  %**** clause counter: 27 ****
% 0.08/0.21  
% 0.08/0.21  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:27,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------