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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYN081-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 : n013.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 : Thu Jul 21 08:23:26 EDT 2022

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (  17 unt;   2 typ;   0 def)
%            Number of atoms       :   98 (  27 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   90 (  18   ~;  18   |;   0   &;  54   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^  18   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_big_f,type,
    big_f: $i > $o ).

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

thf(1,axiom,
    ! [X: $i] :
      ( ( big_f @ ( f @ X ) )
      | ( big_f @ X ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

thf(2,axiom,
    ! [X: $i] :
      ( ~ ( big_f @ X )
      | ~ ( big_f @ ( f @ X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

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,
    ! [X: $i] :
      ( ~ ( big_f @ X )
      | ( big_f @ ( f @ X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

thf(7,plain,
    ( ( ! [X: $i] :
          ( ( big_f @ ( f @ X ) )
          | ( big_f @ X ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(8,plain,
    ( ( ! [X: $i] :
          ( ~ ( big_f @ X )
          | ~ ( big_f @ ( f @ X ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(9,plain,
    ( ( ! [X: $i] :
          ( ~ ( big_f @ X )
          | ( big_f @ ( f @ X ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[5]) ).

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

thf(11,plain,
    ( ( ! [X: $i] :
          ( ~ ( big_f @ X )
          | ( big_f @ ( f @ X ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[9]) ).

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

thf(13,plain,
    ( ( ! [X: $i] :
          ( ( big_f @ ( f @ X ) )
          | ( big_f @ X ) ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

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

thf(15,plain,
    ! [SV1: $i] :
      ( ( ~ ( big_f @ SV1 )
        | ( big_f @ ( f @ SV1 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[11]) ).

thf(16,plain,
    ! [SV2: $i] :
      ( ( ~ ( big_f @ SV2 )
        | ~ ( big_f @ ( f @ SV2 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[12]) ).

thf(17,plain,
    ! [SV3: $i] :
      ( ( ( big_f @ ( f @ SV3 ) )
        | ( big_f @ SV3 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[13]) ).

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

thf(19,plain,
    ! [SV1: $i] :
      ( ( ( ~ ( big_f @ SV1 ) )
        = $true )
      | ( ( big_f @ ( f @ SV1 ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[15]) ).

thf(20,plain,
    ! [SV2: $i] :
      ( ( ( ~ ( big_f @ SV2 ) )
        = $true )
      | ( ( ~ ( big_f @ ( f @ SV2 ) ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[16]) ).

thf(21,plain,
    ! [SV3: $i] :
      ( ( ( big_f @ ( f @ SV3 ) )
        = $true )
      | ( ( big_f @ SV3 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[17]) ).

thf(22,plain,
    ! [SV1: $i] :
      ( ( ( big_f @ SV1 )
        = $false )
      | ( ( big_f @ ( f @ SV1 ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[19]) ).

thf(23,plain,
    ! [SV2: $i] :
      ( ( ( big_f @ SV2 )
        = $false )
      | ( ( ~ ( big_f @ ( f @ SV2 ) ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[20]) ).

thf(24,plain,
    ! [SV2: $i] :
      ( ( ( big_f @ ( f @ SV2 ) )
        = $false )
      | ( ( big_f @ SV2 )
        = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[23]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN081-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 13:20:14 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  
% 0.13/0.35   No.of.Axioms: 3
% 0.13/0.35  
% 0.13/0.35   Length.of.Defs: 0
% 0.13/0.35  
% 0.13/0.35   Contains.Choice.Funs: false
% 0.13/0.35  (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)
% 0.13/0.38  ********************************
% 0.13/0.38  *   All subproblems solved!    *
% 0.13/0.38  ********************************
% 0.13/0.38  % 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:25,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38  
% 0.13/0.38  %**** Beginning of derivation protocol ****
% 0.13/0.38  % SZS output start CNFRefutation
% See solution above
% 0.13/0.38  
% 0.13/0.38  %**** End of derivation protocol ****
% 0.13/0.38  %**** no. of clauses in derivation: 26 ****
% 0.13/0.38  %**** clause counter: 25 ****
% 0.13/0.38  
% 0.13/0.38  % 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:25,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------