↑ 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  : SEU836^5 : TPTP v9.3.1. Released v4.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 : n010.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:49:05 AM UTC 2026

% Result   : Theorem 0.07s 0.20s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   22 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  20 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :   76 (  20   ~;  10   |;   2   &;  38   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^;  12   !;   0   ?;  12   :)

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

thf(tp_sK1_S,type,
    sK1_S: a > $o ).

thf(tp_sK2_SY3,type,
    sK2_SY3: a > $o ).

thf(tp_sK3_SY5,type,
    sK3_SY5: a ).

thf(1,conjecture,
    ! [S: a > $o,T: a > $o,Xx: a] :
      ( ( S @ Xx )
     => ( ( T @ Xx )
        | ( S @ Xx ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM19_pme) ).

thf(2,negated_conjecture,
    ( ( ! [S: a > $o,T: a > $o,Xx: a] :
          ( ( S @ Xx )
         => ( ( T @ Xx )
            | ( S @ Xx ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [S: a > $o,T: a > $o,Xx: a] :
          ( ( S @ Xx )
         => ( ( T @ Xx )
            | ( S @ Xx ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [SY3: a > $o,SY4: a] :
          ( ( sK1_S @ SY4 )
         => ( ( SY3 @ SY4 )
            | ( sK1_S @ SY4 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ! [SY5: a] :
          ( ( sK1_S @ SY5 )
         => ( ( sK2_SY3 @ SY5 )
            | ( sK1_S @ SY5 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ( sK1_S @ sK3_SY5 )
     => ( ( sK2_SY3 @ sK3_SY5 )
        | ( sK1_S @ sK3_SY5 ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[5]) ).

thf(7,plain,
    ( ( sK1_S @ sK3_SY5 )
    = $true ),
    inference(standard_cnf,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ( sK2_SY3 @ sK3_SY5 )
      | ( sK1_S @ sK3_SY5 ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ~ ( ( sK2_SY3 @ sK3_SY5 )
          | ( sK1_S @ sK3_SY5 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ~ ( sK1_S @ sK3_SY5 )
      & ~ ( sK2_SY3 @ sK3_SY5 ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[9]) ).

thf(11,plain,
    ( ( sK1_S @ sK3_SY5 )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(12,plain,
    ( ( ~ ( sK1_S @ sK3_SY5 )
      & ~ ( sK2_SY3 @ sK3_SY5 ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(13,plain,
    ( ( ~ ( ~ ~ ( sK1_S @ sK3_SY5 )
          | ~ ~ ( sK2_SY3 @ sK3_SY5 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[12]) ).

thf(14,plain,
    ( ( ~ ~ ( sK1_S @ sK3_SY5 )
      | ~ ~ ( sK2_SY3 @ sK3_SY5 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[13]) ).

thf(15,plain,
    ( ( ~ ~ ( sK1_S @ sK3_SY5 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[14]) ).

thf(16,plain,
    ( ( ~ ~ ( sK2_SY3 @ sK3_SY5 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[14]) ).

thf(17,plain,
    ( ( ~ ( sK1_S @ sK3_SY5 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(18,plain,
    ( ( ~ ( sK2_SY3 @ sK3_SY5 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(19,plain,
    ( ( sK1_S @ sK3_SY5 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(20,plain,
    ( ( sK2_SY3 @ sK3_SY5 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[18]) ).

thf(21,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[11,20,19]) ).

thf(22,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU836^5 : TPTP v9.3.1. Released v4.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.07/0.17  % Computer : n010.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Tue Oct  6 15:37:25 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.17  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.20  
% 0.07/0.20   No.of.Axioms: 0
% 0.07/0.20  
% 0.07/0.20   Length.of.Defs: 0
% 0.07/0.20  
% 0.07/0.20   Contains.Choice.Funs: false
% 0.07/0.20  
% 0.07/0.20  ********************************
% 0.07/0.20  *   All subproblems solved!    *
% 0.07/0.20  ********************************
% 0.07/0.20  % 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:21,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.20  
% 0.07/0.20  %**** Beginning of derivation protocol ****
% 0.07/0.20  % SZS output start CNFRefutation
% See solution above
% 0.07/0.20  
% 0.07/0.20  %**** End of derivation protocol ****
% 0.07/0.20  %**** no. of clauses in derivation: 22 ****
% 0.07/0.20  %**** clause counter: 21 ****
% 0.07/0.20  
% 0.07/0.20  % 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:21,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------