↑ 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  : NUM770^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 : n009.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:11 AM UTC 2026

% Result   : Theorem 0.07s 0.21s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  25 unt;   0 typ;   0 def)
%            Number of atoms       :  140 (  37 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :  280 (  22   ~;  26   |;   0   &; 226   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   64 (   0   ^;  64   !;   0   ?;  64   :)

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

thf(tp_eq,type,
    eq: frac > frac > $o ).

thf(tp_mf,type,
    mf: frac > frac > frac ).

thf(tp_moref,type,
    moref: frac > frac > $o ).

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

thf(tp_v,type,
    v: frac ).

thf(tp_x,type,
    x: frac ).

thf(tp_y,type,
    y: frac ).

thf(1,axiom,
    ! [Xx: frac,Xy: frac] :
      ( ( moref @ Xx @ Xy )
     => ( eq @ ( pf @ Xy @ ( mf @ Xx @ Xy ) ) @ Xx ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67c) ).

thf(2,axiom,
    ! [Xx: frac,Xy: frac,Xv: frac,Xw: frac] :
      ( ( eq @ ( pf @ Xy @ Xv ) @ Xx )
     => ( ( eq @ ( pf @ Xy @ Xw ) @ Xx )
       => ( eq @ Xv @ Xw ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67b) ).

thf(3,axiom,
    eq @ ( pf @ y @ v ) @ x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).

thf(4,axiom,
    moref @ x @ y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

thf(5,conjecture,
    eq @ v @ ( mf @ x @ y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67e) ).

thf(6,negated_conjecture,
    ( ( eq @ v @ ( mf @ x @ y ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[5]) ).

thf(7,plain,
    ( ( eq @ v @ ( mf @ x @ y ) )
    = $false ),
    inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ( moref @ Xx @ Xy )
         => ( eq @ ( pf @ Xy @ ( mf @ Xx @ Xy ) ) @ Xx ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(9,plain,
    ( ( ! [Xx: frac,Xy: frac,Xv: frac,Xw: frac] :
          ( ( eq @ ( pf @ Xy @ Xv ) @ Xx )
         => ( ( eq @ ( pf @ Xy @ Xw ) @ Xx )
           => ( eq @ Xv @ Xw ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(10,plain,
    ( ( eq @ ( pf @ y @ v ) @ x )
    = $true ),
    inference(unfold_def,[status(thm)],[3]) ).

thf(11,plain,
    ( ( moref @ x @ y )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

thf(12,plain,
    ( ( ~ ( eq @ v @ ( mf @ x @ y ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(13,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ~ ( moref @ Xx @ Xy )
          | ( eq @ ( pf @ Xy @ ( mf @ Xx @ Xy ) ) @ Xx ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[8]) ).

thf(14,plain,
    ( ( ! [Xx: frac,Xy: frac,Xv: frac] :
          ( ~ ( eq @ ( pf @ Xy @ Xv ) @ Xx )
          | ! [Xw: frac] :
              ( ~ ( eq @ ( pf @ Xy @ Xw ) @ Xx )
              | ( eq @ Xv @ Xw ) ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[9]) ).

thf(15,plain,
    ( ( moref @ x @ y )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(16,plain,
    ( ( eq @ ( pf @ y @ v ) @ x )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(17,plain,
    ( ( ! [Xx: frac,Xy: frac,Xv: frac] :
          ( ~ ( eq @ ( pf @ Xy @ Xv ) @ Xx )
          | ! [Xw: frac] :
              ( ~ ( eq @ ( pf @ Xy @ Xw ) @ Xx )
              | ( eq @ Xv @ Xw ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[14]) ).

thf(18,plain,
    ( ( ! [Xx: frac,Xy: frac] :
          ( ~ ( moref @ Xx @ Xy )
          | ( eq @ ( pf @ Xy @ ( mf @ Xx @ Xy ) ) @ Xx ) ) )
    = $true ),
    inference(copy,[status(thm)],[13]) ).

thf(19,plain,
    ( ( ~ ( eq @ v @ ( mf @ x @ y ) ) )
    = $true ),
    inference(copy,[status(thm)],[12]) ).

thf(20,plain,
    ! [SV1: frac] :
      ( ( ! [SY6: frac,SY7: frac] :
            ( ~ ( eq @ ( pf @ SY6 @ SY7 ) @ SV1 )
            | ! [SY8: frac] :
                ( ~ ( eq @ ( pf @ SY6 @ SY8 ) @ SV1 )
                | ( eq @ SY7 @ SY8 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[17]) ).

thf(21,plain,
    ! [SV2: frac] :
      ( ( ! [SY9: frac] :
            ( ~ ( moref @ SV2 @ SY9 )
            | ( eq @ ( pf @ SY9 @ ( mf @ SV2 @ SY9 ) ) @ SV2 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[18]) ).

thf(22,plain,
    ( ( eq @ v @ ( mf @ x @ y ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[19]) ).

thf(23,plain,
    ! [SV1: frac,SV3: frac] :
      ( ( ! [SY10: frac] :
            ( ~ ( eq @ ( pf @ SV3 @ SY10 ) @ SV1 )
            | ! [SY11: frac] :
                ( ~ ( eq @ ( pf @ SV3 @ SY11 ) @ SV1 )
                | ( eq @ SY10 @ SY11 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[20]) ).

thf(24,plain,
    ! [SV4: frac,SV2: frac] :
      ( ( ~ ( moref @ SV2 @ SV4 )
        | ( eq @ ( pf @ SV4 @ ( mf @ SV2 @ SV4 ) ) @ SV2 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[21]) ).

thf(25,plain,
    ! [SV1: frac,SV5: frac,SV3: frac] :
      ( ( ~ ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 )
        | ! [SY12: frac] :
            ( ~ ( eq @ ( pf @ SV3 @ SY12 ) @ SV1 )
            | ( eq @ SV5 @ SY12 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[23]) ).

thf(26,plain,
    ! [SV4: frac,SV2: frac] :
      ( ( ( ~ ( moref @ SV2 @ SV4 ) )
        = $true )
      | ( ( eq @ ( pf @ SV4 @ ( mf @ SV2 @ SV4 ) ) @ SV2 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[24]) ).

thf(27,plain,
    ! [SV1: frac,SV5: frac,SV3: frac] :
      ( ( ( ~ ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 ) )
        = $true )
      | ( ( ! [SY12: frac] :
              ( ~ ( eq @ ( pf @ SV3 @ SY12 ) @ SV1 )
              | ( eq @ SV5 @ SY12 ) ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[25]) ).

thf(28,plain,
    ! [SV4: frac,SV2: frac] :
      ( ( ( moref @ SV2 @ SV4 )
        = $false )
      | ( ( eq @ ( pf @ SV4 @ ( mf @ SV2 @ SV4 ) ) @ SV2 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[26]) ).

thf(29,plain,
    ! [SV1: frac,SV5: frac,SV3: frac] :
      ( ( ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 )
        = $false )
      | ( ( ! [SY12: frac] :
              ( ~ ( eq @ ( pf @ SV3 @ SY12 ) @ SV1 )
              | ( eq @ SV5 @ SY12 ) ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[27]) ).

thf(30,plain,
    ! [SV5: frac,SV1: frac,SV6: frac,SV3: frac] :
      ( ( ( ~ ( eq @ ( pf @ SV3 @ SV6 ) @ SV1 )
          | ( eq @ SV5 @ SV6 ) )
        = $true )
      | ( ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 )
        = $false ) ),
    inference(extcnf_forall_pos,[status(thm)],[29]) ).

thf(31,plain,
    ! [SV5: frac,SV1: frac,SV6: frac,SV3: frac] :
      ( ( ( ~ ( eq @ ( pf @ SV3 @ SV6 ) @ SV1 ) )
        = $true )
      | ( ( eq @ SV5 @ SV6 )
        = $true )
      | ( ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 )
        = $false ) ),
    inference(extcnf_or_pos,[status(thm)],[30]) ).

thf(32,plain,
    ! [SV5: frac,SV1: frac,SV6: frac,SV3: frac] :
      ( ( ( eq @ ( pf @ SV3 @ SV6 ) @ SV1 )
        = $false )
      | ( ( eq @ SV5 @ SV6 )
        = $true )
      | ( ( eq @ ( pf @ SV3 @ SV5 ) @ SV1 )
        = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[31]) ).

thf(33,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[15,32,28,22,16]) ).

thf(34,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM770^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03  % 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.07/0.17  % Computer : n009.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 13:38:17 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  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.07/0.21  
% 0.07/0.21   No.of.Axioms: 4
% 0.07/0.21  
% 0.07/0.21   Length.of.Defs: 0
% 0.07/0.21  
% 0.07/0.21   Contains.Choice.Funs: false
% 0.07/0.21  
% 0.07/0.21  ********************************
% 0.07/0.21  *   All subproblems solved!    *
% 0.07/0.21  ********************************
% 0.07/0.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:33,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.21  
% 0.07/0.21  %**** Beginning of derivation protocol ****
% 0.07/0.21  % SZS output start CNFRefutation
% See solution above
% 0.07/0.21  
% 0.07/0.21  %**** End of derivation protocol ****
% 0.07/0.21  %**** no. of clauses in derivation: 34 ****
% 0.07/0.21  %**** clause counter: 33 ****
% 0.07/0.21  
% 0.07/0.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:33,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------