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

% Computer : n011.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:35:06 AM UTC 2026

% Result   : Theorem 0.13s 0.23s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (  19 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   91 (   7   ~;   6   |;   0   &;  76   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^;  26   !;   0   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_frac,type,
    frac: $tType ).

thf(tp_less,type,
    less: frac > frac > $o ).

thf(tp_more,type,
    more: frac > frac > $o ).

thf(tp_pf,type,
    pf: frac > frac > frac ).

thf(tp_x,type,
    x: frac ).

thf(tp_y,type,
    y: frac ).

thf(1,axiom,
    ! [Xx: frac,Xy: frac] : ( more @ ( pf @ Xx @ Xy ) @ Xx ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60) ).

thf(2,axiom,
    ! [Xx: frac,Xy: frac] :
      ( ( more @ Xx @ Xy )
     => ( less @ Xy @ Xx ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42) ).

thf(3,conjecture,
    less @ x @ ( pf @ x @ y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60a) ).

thf(4,negated_conjecture,
    ( ( less @ x @ ( pf @ x @ y ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[3]) ).

thf(5,plain,
    ( ( less @ x @ ( pf @ x @ y ) )
    = $false ),
    inference(unfold_def,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ! [Xx: frac,Xy: frac] : ( more @ ( pf @ Xx @ Xy ) @ Xx ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(7,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ( more @ Xx @ Xy )
         => ( less @ Xy @ Xx ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(8,plain,
    ( ( ~ ( less @ x @ ( pf @ x @ y ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(9,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ~ ( more @ Xx @ Xy )
          | ( less @ Xy @ Xx ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[7]) ).

thf(10,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ~ ( more @ Xx @ Xy )
          | ( less @ Xy @ Xx ) ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(11,plain,
    ( ( ! [Xx: frac,Xy: frac] : ( more @ ( pf @ Xx @ Xy ) @ Xx ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

thf(12,plain,
    ( ( ~ ( less @ x @ ( pf @ x @ y ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(13,plain,
    ! [SV1: frac] :
      ( ( ! [SY4: frac] :
            ( ~ ( more @ SV1 @ SY4 )
            | ( less @ SY4 @ SV1 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[10]) ).

thf(14,plain,
    ! [SV2: frac] :
      ( ( ! [SY5: frac] : ( more @ ( pf @ SV2 @ SY5 ) @ SV2 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[11]) ).

thf(15,plain,
    ( ( less @ x @ ( pf @ x @ y ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

thf(16,plain,
    ! [SV3: frac,SV1: frac] :
      ( ( ~ ( more @ SV1 @ SV3 )
        | ( less @ SV3 @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[13]) ).

thf(17,plain,
    ! [SV4: frac,SV2: frac] :
      ( ( more @ ( pf @ SV2 @ SV4 ) @ SV2 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[14]) ).

thf(18,plain,
    ! [SV3: frac,SV1: frac] :
      ( ( ( ~ ( more @ SV1 @ SV3 ) )
        = $true )
      | ( ( less @ SV3 @ SV1 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[16]) ).

thf(19,plain,
    ! [SV3: frac,SV1: frac] :
      ( ( ( more @ SV1 @ SV3 )
        = $false )
      | ( ( less @ SV3 @ SV1 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[18]) ).

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

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

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