TSTP Solution File: LCL011-1 by LEO-II---1.7.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 12:19:57 EDT 2022

% Result   : Unsatisfiable 2.32s 2.52s
% Output   : CNFRefutation 2.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   32 (  22 unt;   5 typ;   0 def)
%            Number of atoms       :  101 (  28 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  192 (  19   ~;  18   |;   0   &; 155   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^  36   !;   0   ?;  36   :)

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

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

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

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

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

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

thf(2,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(3,conjecture,
    $false,
    file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).

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

thf(5,negated_conjecture,
    ~ ( is_a_theorem @ ( equivalent @ ( equivalent @ a @ b ) @ ( equivalent @ ( equivalent @ a @ c ) @ ( equivalent @ c @ b ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqf) ).

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

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

thf(8,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)],[2]) ).

thf(9,plain,
    ( ( ~ ( is_a_theorem @ ( equivalent @ ( equivalent @ a @ b ) @ ( equivalent @ ( equivalent @ a @ c ) @ ( equivalent @ c @ b ) ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[5]) ).

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

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

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

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

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

thf(15,plain,
    ( ( is_a_theorem @ ( equivalent @ ( equivalent @ a @ b ) @ ( equivalent @ ( equivalent @ a @ c ) @ ( equivalent @ c @ b ) ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

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

thf(17,plain,
    ! [SV2: $i] :
      ( ( ! [SY6: $i,SY7: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ SV2 @ SY6 ) @ ( equivalent @ ( equivalent @ SY7 @ SV2 ) @ ( equivalent @ SY6 @ SY7 ) ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[13]) ).

thf(18,plain,
    $false = $false,
    inference(extcnf_not_pos,[status(thm)],[14]) ).

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

thf(20,plain,
    ! [SV4: $i,SV2: $i] :
      ( ( ! [SY8: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ SV2 @ SV4 ) @ ( equivalent @ ( equivalent @ SY8 @ SV2 ) @ ( equivalent @ SV4 @ SY8 ) ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[17]) ).

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

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

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

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

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

thf(26,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[15,25,22,18]) ).

thf(27,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.11/0.32  % Computer : n025.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jul  3 22:18:41 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  
% 0.11/0.33   No.of.Axioms: 3
% 0.11/0.33  
% 0.11/0.33   Length.of.Defs: 0
% 0.11/0.33  
% 0.11/0.33   Contains.Choice.Funs: false
% 0.11/0.33  (rf:0,axioms:3,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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:5,loop_count:0,foatp_calls:0,translation:fof_full).
% 2.32/2.52  
% 2.32/2.52  ********************************
% 2.32/2.52  *   All subproblems solved!    *
% 2.32/2.52  ********************************
% 2.32/2.52  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
% 2.32/2.52  
% 2.32/2.52  %**** Beginning of derivation protocol ****
% 2.32/2.52  % SZS output start CNFRefutation
% See solution above
% 2.32/2.52  
% 2.32/2.52  %**** End of derivation protocol ****
% 2.32/2.52  %**** no. of clauses in derivation: 27 ****
% 2.32/2.52  %**** clause counter: 26 ****
% 2.32/2.52  
% 2.32/2.52  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------