↑ 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  : SYN083-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/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n017.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:02:55 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.19s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   49 (  26 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :  114 (   6   ~;   0   |;   0   &; 108   @)
%                                         (   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;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;  18   !;   0   ?;  18   :)

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

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

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

thf(tp_d,type,
    d: $i ).

thf(tp_f,type,
    f: $i > $i > $i ).

thf(1,axiom,
    ! [X: $i,Y: $i,Z: $i] :
      ( ( f @ X @ ( f @ Y @ Z ) )
      = ( f @ ( f @ X @ Y ) @ Z ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative) ).

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

thf(3,negated_conjecture,
    $false = $false,
    inference(negate_conjecture,[status(cth)],[2]) ).

thf(4,negated_conjecture,
    ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
   != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(5,plain,
    $false = $false,
    inference(unfold_def,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ! [X: $i,Y: $i,Z: $i] :
          ( ( f @ X @ ( f @ Y @ Z ) )
          = ( f @ ( f @ X @ Y ) @ Z ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(7,plain,
    ( ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
     != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

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

thf(9,plain,
    ( ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
     != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[7]) ).

thf(10,plain,
    ( ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
     != ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

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

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

thf(13,plain,
    ( ( ( f @ a @ ( f @ b @ ( f @ c @ d ) ) )
      = ( f @ ( f @ ( f @ a @ b ) @ c ) @ d ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(14,plain,
    ! [SV1: $i] :
      ( ( ! [SY3: $i,SY4: $i] :
            ( ( f @ SV1 @ ( f @ SY3 @ SY4 ) )
            = ( f @ ( f @ SV1 @ SY3 ) @ SY4 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[11]) ).

thf(15,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[12]) ).

thf(16,plain,
    ! [SV2: $i,SV1: $i] :
      ( ( ! [SY5: $i] :
            ( ( f @ SV1 @ ( f @ SV2 @ SY5 ) )
            = ( f @ ( f @ SV1 @ SV2 ) @ SY5 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[14]) ).

thf(17,plain,
    ! [SV3: $i,SV2: $i,SV1: $i] :
      ( ( ( f @ SV1 @ ( f @ SV2 @ SV3 ) )
        = ( f @ ( f @ SV1 @ SV2 ) @ SV3 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[16]) ).

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

thf(19,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN083-1 : TPTP v9.3.1. Released v1.0.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.10/0.16  % Computer : n017.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Oct  6 17:11:46 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  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.10/0.19  
% 0.10/0.19   No.of.Axioms: 2
% 0.10/0.19  
% 0.10/0.19   Length.of.Defs: 0
% 0.10/0.19  
% 0.10/0.19   Contains.Choice.Funs: false
% 0.10/0.19  
% 0.10/0.19  ********************************
% 0.10/0.19  *   All subproblems solved!    *
% 0.10/0.19  ********************************
% 0.10/0.19  % SZS status Unsatisfiable 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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.19  
% 0.10/0.19  %**** Beginning of derivation protocol ****
% 0.10/0.19  % SZS output start CNFRefutation
% See solution above
% 0.10/0.20  
% 0.10/0.20  %**** End of derivation protocol ****
% 0.10/0.20  %**** no. of clauses in derivation: 19 ****
% 0.10/0.20  %**** clause counter: 18 ****
% 0.10/0.20  
% 0.10/0.20  % SZS status Unsatisfiable 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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------