↑ Up

LEO-II---2.3.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LEO-II---2.3.1
% Problem  : ROB005-1 : TPTP v9.3.1. Released v1.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 : n020.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:37:55 AM UTC 2026

% Result   : Unsatisfiable 82.43s 13.99s
% Output   : CNFRefutation 82.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  32 unt;   0 typ;   0 def)
%            Number of atoms       :   82 (  49 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :  185 (   6   ~;   0   |;   0   &; 179   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   38 (   0   ^;  38   !;   0   ?;  38   :)

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

thf(tp_add,type,
    add: $i > $i > $i ).

thf(tp_b,type,
    b: $i ).

thf(tp_c,type,
    c: $i ).

thf(tp_negate,type,
    negate: $i > $i ).

thf(1,axiom,
    ! [X: $i,Y: $i] :
      ( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
      = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',robbins_axiom) ).

thf(2,axiom,
    ! [X: $i,Y: $i,Z: $i] :
      ( ( add @ ( add @ X @ Y ) @ Z )
      = ( add @ X @ ( add @ Y @ Z ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_add) ).

thf(3,axiom,
    ! [X: $i,Y: $i] :
      ( ( add @ X @ Y )
      = ( add @ Y @ X ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_add) ).

thf(4,axiom,
    ( ( add @ c @ c )
    = c ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).

thf(5,conjecture,
    $false,
    file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).

thf(6,negated_conjecture,
    $false = $false,
    inference(negate_conjecture,[status(cth)],[5]) ).

thf(7,negated_conjecture,
    ( ( add @ ( negate @ ( add @ a @ ( negate @ b ) ) ) @ ( negate @ ( add @ ( negate @ a ) @ ( negate @ b ) ) ) )
   != b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).

thf(8,plain,
    $false = $false,
    inference(unfold_def,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
          = X ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(10,plain,
    ( ( ! [X: $i,Y: $i,Z: $i] :
          ( ( add @ ( add @ X @ Y ) @ Z )
          = ( add @ X @ ( add @ Y @ Z ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(11,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ( add @ X @ Y )
          = ( add @ Y @ X ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[3]) ).

thf(12,plain,
    ( ( ( add @ c @ c )
      = c )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

thf(13,plain,
    ( ( ( add @ ( negate @ ( add @ a @ ( negate @ b ) ) ) @ ( negate @ ( add @ ( negate @ a ) @ ( negate @ b ) ) ) )
     != b )
    = $true ),
    inference(unfold_def,[status(thm)],[7]) ).

thf(14,plain,
    ( ( ~ $false ) = $true ),
    inference(polarity_switch,[status(thm)],[8]) ).

thf(15,plain,
    ( ( ( add @ ( negate @ ( add @ a @ ( negate @ b ) ) ) @ ( negate @ ( add @ ( negate @ a ) @ ( negate @ b ) ) ) )
     != b )
    = $true ),
    inference(copy,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ( add @ c @ c )
      = c )
    = $true ),
    inference(copy,[status(thm)],[12]) ).

thf(17,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ( add @ X @ Y )
          = ( add @ Y @ X ) ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(18,plain,
    ( ( ! [X: $i,Y: $i,Z: $i] :
          ( ( add @ ( add @ X @ Y ) @ Z )
          = ( add @ X @ ( add @ Y @ Z ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(19,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
          = X ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(20,plain,
    ( ( ~ $false ) = $true ),
    inference(copy,[status(thm)],[14]) ).

thf(21,plain,
    ( ( ( add @ ( negate @ ( add @ a @ ( negate @ b ) ) ) @ ( negate @ ( add @ ( negate @ a ) @ ( negate @ b ) ) ) )
     != b )
    = $true ),
    inference(unfold_def,[status(thm)],[15]) ).

thf(22,plain,
    ! [SV1: $i] :
      ( ( ! [SY7: $i] :
            ( ( add @ SV1 @ SY7 )
            = ( add @ SY7 @ SV1 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[17]) ).

thf(23,plain,
    ! [SV2: $i] :
      ( ( ! [SY8: $i,SY9: $i] :
            ( ( add @ ( add @ SV2 @ SY8 ) @ SY9 )
            = ( add @ SV2 @ ( add @ SY8 @ SY9 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[18]) ).

thf(24,plain,
    ! [SV3: $i] :
      ( ( ! [SY10: $i] :
            ( ( negate @ ( add @ ( negate @ ( add @ SV3 @ SY10 ) ) @ ( negate @ ( add @ SV3 @ ( negate @ SY10 ) ) ) ) )
            = SV3 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[19]) ).

thf(25,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[20]) ).

thf(26,plain,
    ( ( ( add @ ( negate @ ( add @ a @ ( negate @ b ) ) ) @ ( negate @ ( add @ ( negate @ a ) @ ( negate @ b ) ) ) )
      = b )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[21]) ).

thf(27,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ( add @ SV1 @ SV4 )
        = ( add @ SV4 @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[22]) ).

thf(28,plain,
    ! [SV5: $i,SV2: $i] :
      ( ( ! [SY11: $i] :
            ( ( add @ ( add @ SV2 @ SV5 ) @ SY11 )
            = ( add @ SV2 @ ( add @ SV5 @ SY11 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[23]) ).

thf(29,plain,
    ! [SV6: $i,SV3: $i] :
      ( ( ( negate @ ( add @ ( negate @ ( add @ SV3 @ SV6 ) ) @ ( negate @ ( add @ SV3 @ ( negate @ SV6 ) ) ) ) )
        = SV3 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[24]) ).

thf(30,plain,
    ! [SV7: $i,SV5: $i,SV2: $i] :
      ( ( ( add @ ( add @ SV2 @ SV5 ) @ SV7 )
        = ( add @ SV2 @ ( add @ SV5 @ SV7 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[28]) ).

thf(31,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[16,30,29,27,26,25]) ).

thf(32,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ROB005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % 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.09/0.15  % Computer : n020.cluster.edu
% 0.09/0.15  % Model    : x86_64 x86_64
% 0.09/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.15  % Memory   : 8046.5625MB
% 0.09/0.15  % OS       : Linux 6.8.0-71-generic
% 0.09/0.15  % CPULimit : 300
% 0.09/0.15  % WCLimit  : 300
% 0.09/0.15  % DateTime : Tue Oct  6 14:17:21 UTC 2026
% 0.09/0.15  % CPUTime  : 
% 0.09/0.15  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 82.43/13.99  
% 82.43/13.99   No.of.Axioms: 5
% 82.43/13.99  
% 82.43/13.99   Length.of.Defs: 0
% 82.43/13.99  
% 82.43/13.99   Contains.Choice.Funs: false
% 82.43/13.99  
% 82.43/13.99  ********************************
% 82.43/13.99  *   All subproblems solved!    *
% 82.43/13.99  ********************************
% 82.43/13.99  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:5,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
% 82.43/13.99  
% 82.43/13.99  %**** Beginning of derivation protocol ****
% 82.43/13.99  % SZS output start CNFRefutation
% See solution above
% 82.43/13.99  
% 82.43/13.99  %**** End of derivation protocol ****
% 82.43/13.99  %**** no. of clauses in derivation: 32 ****
% 82.43/13.99  %**** clause counter: 31 ****
% 82.43/13.99  
% 82.43/13.99  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:5,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------