↑ 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  : LCL097-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 : 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:27:58 AM UTC 2026

% Result   : Unsatisfiable 9.22s 1.75s
% Output   : CNFRefutation 9.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (  31 unt;   0 typ;   0 def)
%            Number of atoms       :  126 (  36 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  415 (  19   ~;  18   |;   0   &; 378   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   7 con; 0-2 aty)
%            Number of variables   :   86 (   0   ^;  86   !;   0   ?;  86   :)

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

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

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

thf(tp_e,type,
    e: $i ).

thf(tp_equivalent,type,
    equivalent: $i > $i > $i ).

thf(tp_falsehood,type,
    falsehood: $i ).

thf(tp_is_a_theorem,type,
    is_a_theorem: $i > $o ).

thf(1,axiom,
    ! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ U ) @ ( equivalent @ ( equivalent @ Y @ Z ) @ U ) ) @ V ) @ V ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).

thf(2,axiom,
    ! [X: $i,Y: $i,Z: $i,U: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ ( equivalent @ Y @ Z ) ) @ U ) @ U ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).

thf(3,axiom,
    ! [X: $i,Y: $i] :
      ( ~ ( is_a_theorem @ ( equivalent @ X @ Y ) )
      | ~ ( is_a_theorem @ X )
      | ( is_a_theorem @ Y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

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

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

thf(6,negated_conjecture,
    ~ ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ a @ b ) @ c ) @ e ) @ ( equivalent @ ( equivalent @ ( equivalent @ a @ falsehood ) @ c ) @ ( equivalent @ ( equivalent @ b @ falsehood ) @ e ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).

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

thf(8,plain,
    ( ( ! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ U ) @ ( equivalent @ ( equivalent @ Y @ Z ) @ U ) ) @ V ) @ V ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(9,plain,
    ( ( ! [X: $i,Y: $i,Z: $i,U: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ ( equivalent @ Y @ Z ) ) @ U ) @ U ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(10,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ~ ( is_a_theorem @ ( equivalent @ X @ Y ) )
          | ~ ( is_a_theorem @ X )
          | ( is_a_theorem @ Y ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[3]) ).

thf(11,plain,
    ( ( ~ ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ a @ b ) @ c ) @ e ) @ ( equivalent @ ( equivalent @ ( equivalent @ a @ falsehood ) @ c ) @ ( equivalent @ ( equivalent @ b @ falsehood ) @ e ) ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[6]) ).

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

thf(13,plain,
    ( ( ~ ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ a @ b ) @ c ) @ e ) @ ( equivalent @ ( equivalent @ ( equivalent @ a @ falsehood ) @ c ) @ ( equivalent @ ( equivalent @ b @ falsehood ) @ e ) ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(14,plain,
    ( ( ! [X: $i,Y: $i] :
          ( ~ ( is_a_theorem @ ( equivalent @ X @ Y ) )
          | ~ ( is_a_theorem @ X )
          | ( is_a_theorem @ Y ) ) )
    = $true ),
    inference(copy,[status(thm)],[10]) ).

thf(15,plain,
    ( ( ! [X: $i,Y: $i,Z: $i,U: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ ( equivalent @ Y @ Z ) ) @ U ) @ U ) ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

thf(16,plain,
    ( ( ! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ X @ Y ) @ ( equivalent @ X @ Z ) ) @ U ) @ ( equivalent @ ( equivalent @ Y @ Z ) @ U ) ) @ V ) @ V ) ) )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

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

thf(18,plain,
    ( ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ a @ b ) @ c ) @ e ) @ ( equivalent @ ( equivalent @ ( equivalent @ a @ falsehood ) @ c ) @ ( equivalent @ ( equivalent @ b @ falsehood ) @ e ) ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[13]) ).

thf(19,plain,
    ! [SV1: $i] :
      ( ( ! [SY11: $i] :
            ( ~ ( is_a_theorem @ ( equivalent @ SV1 @ SY11 ) )
            | ~ ( is_a_theorem @ SV1 )
            | ( is_a_theorem @ SY11 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[14]) ).

thf(20,plain,
    ! [SV2: $i] :
      ( ( ! [SY12: $i,SY13: $i,SY14: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV2 @ SY12 ) @ ( equivalent @ SV2 @ SY13 ) ) @ ( equivalent @ SY12 @ SY13 ) ) @ SY14 ) @ SY14 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[15]) ).

thf(21,plain,
    ! [SV3: $i] :
      ( ( ! [SY15: $i,SY16: $i,SY17: $i,SY18: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV3 @ SY15 ) @ ( equivalent @ SV3 @ SY16 ) ) @ SY17 ) @ ( equivalent @ ( equivalent @ SY15 @ SY16 ) @ SY17 ) ) @ SY18 ) @ SY18 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[16]) ).

thf(22,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(23,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ~ ( is_a_theorem @ ( equivalent @ SV1 @ SV4 ) )
        | ~ ( is_a_theorem @ SV1 )
        | ( is_a_theorem @ SV4 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[19]) ).

thf(24,plain,
    ! [SV5: $i,SV2: $i] :
      ( ( ! [SY19: $i,SY20: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV2 @ SV5 ) @ ( equivalent @ SV2 @ SY19 ) ) @ ( equivalent @ SV5 @ SY19 ) ) @ SY20 ) @ SY20 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[20]) ).

thf(25,plain,
    ! [SV6: $i,SV3: $i] :
      ( ( ! [SY21: $i,SY22: $i,SY23: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV3 @ SV6 ) @ ( equivalent @ SV3 @ SY21 ) ) @ SY22 ) @ ( equivalent @ ( equivalent @ SV6 @ SY21 ) @ SY22 ) ) @ SY23 ) @ SY23 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[21]) ).

thf(26,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ( ~ ( is_a_theorem @ ( equivalent @ SV1 @ SV4 ) ) )
        = $true )
      | ( ( ~ ( is_a_theorem @ SV1 )
          | ( is_a_theorem @ SV4 ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[23]) ).

thf(27,plain,
    ! [SV7: $i,SV5: $i,SV2: $i] :
      ( ( ! [SY24: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV2 @ SV5 ) @ ( equivalent @ SV2 @ SV7 ) ) @ ( equivalent @ SV5 @ SV7 ) ) @ SY24 ) @ SY24 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[24]) ).

thf(28,plain,
    ! [SV8: $i,SV6: $i,SV3: $i] :
      ( ( ! [SY25: $i,SY26: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV3 @ SV6 ) @ ( equivalent @ SV3 @ SV8 ) ) @ SY25 ) @ ( equivalent @ ( equivalent @ SV6 @ SV8 ) @ SY25 ) ) @ SY26 ) @ SY26 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[25]) ).

thf(29,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ( is_a_theorem @ ( equivalent @ SV1 @ SV4 ) )
        = $false )
      | ( ( ~ ( is_a_theorem @ SV1 )
          | ( is_a_theorem @ SV4 ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[26]) ).

thf(30,plain,
    ! [SV9: $i,SV7: $i,SV5: $i,SV2: $i] :
      ( ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV2 @ SV5 ) @ ( equivalent @ SV2 @ SV7 ) ) @ ( equivalent @ SV5 @ SV7 ) ) @ SV9 ) @ SV9 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[27]) ).

thf(31,plain,
    ! [SV10: $i,SV8: $i,SV6: $i,SV3: $i] :
      ( ( ! [SY27: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV3 @ SV6 ) @ ( equivalent @ SV3 @ SV8 ) ) @ SV10 ) @ ( equivalent @ ( equivalent @ SV6 @ SV8 ) @ SV10 ) ) @ SY27 ) @ SY27 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[28]) ).

thf(32,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ( ~ ( is_a_theorem @ SV1 ) )
        = $true )
      | ( ( is_a_theorem @ SV4 )
        = $true )
      | ( ( is_a_theorem @ ( equivalent @ SV1 @ SV4 ) )
        = $false ) ),
    inference(extcnf_or_pos,[status(thm)],[29]) ).

thf(33,plain,
    ! [SV11: $i,SV10: $i,SV8: $i,SV6: $i,SV3: $i] :
      ( ( is_a_theorem @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ ( equivalent @ SV3 @ SV6 ) @ ( equivalent @ SV3 @ SV8 ) ) @ SV10 ) @ ( equivalent @ ( equivalent @ SV6 @ SV8 ) @ SV10 ) ) @ SV11 ) @ SV11 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[31]) ).

thf(34,plain,
    ! [SV4: $i,SV1: $i] :
      ( ( ( is_a_theorem @ SV1 )
        = $false )
      | ( ( is_a_theorem @ SV4 )
        = $true )
      | ( ( is_a_theorem @ ( equivalent @ SV1 @ SV4 ) )
        = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[32]) ).

thf(35,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[18,34,33,30,22]) ).

thf(36,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL097-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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.15  % Computer : n009.cluster.edu
% 0.10/0.15  % Model    : x86_64 x86_64
% 0.10/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15  % Memory   : 8046.5625MB
% 0.10/0.15  % OS       : Linux 6.8.0-71-generic
% 0.10/0.15  % CPULimit : 300
% 0.10/0.15  % WCLimit  : 300
% 0.10/0.15  % DateTime : Tue Oct  6 12:09:25 UTC 2026
% 0.10/0.15  % CPUTime  : 
% 0.10/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
% 9.22/1.75  
% 9.22/1.75   No.of.Axioms: 4
% 9.22/1.75  
% 9.22/1.75   Length.of.Defs: 0
% 9.22/1.75  
% 9.22/1.75   Contains.Choice.Funs: false
% 9.22/1.75  .
% 9.22/1.75  
% 9.22/1.75  ********************************
% 9.22/1.75  *   All subproblems solved!    *
% 9.22/1.75  ********************************
% 9.22/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:35,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 9.22/1.75  
% 9.22/1.75  %**** Beginning of derivation protocol ****
% 9.22/1.75  % SZS output start CNFRefutation
% See solution above
% 9.22/1.75  
% 9.22/1.75  %**** End of derivation protocol ****
% 9.22/1.75  %**** no. of clauses in derivation: 36 ****
% 9.22/1.75  %**** clause counter: 35 ****
% 9.22/1.75  
% 9.22/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:35,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------