TSTP Solution File: COL116-2 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n019.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 : Fri Jul 15 00:34:53 EDT 2022

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   26 (  17 unt;   9 typ;   0 def)
%            Number of atoms       :   43 (  13 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :  117 (   6   ~;   0   |;   0   &; 111   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (   9 usr;   7 con; 0-4 aty)
%            Number of variables   :    9 (   0   ^   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_c_Comb_Ocomb_Oop_A_D_D,type,
    c_Comb_Ocomb_Oop_A_D_D: $i > $i > $i ).

thf(tp_c_Comb_Oparcontract,type,
    c_Comb_Oparcontract: $i ).

thf(tp_c_Pair,type,
    c_Pair: $i > $i > $i > $i > $i ).

thf(tp_c_in,type,
    c_in: $i > $i > $i > $o ).

thf(tp_tc_Comb_Ocomb,type,
    tc_Comb_Ocomb: $i ).

thf(tp_tc_prod,type,
    tc_prod: $i > $i > $i ).

thf(tp_v_xb,type,
    v_xb: $i ).

thf(tp_v_yb,type,
    v_yb: $i ).

thf(tp_v_z,type,
    v_z: $i ).

thf(1,axiom,
    ! [V_x: $i] : ( c_in @ ( c_Pair @ V_x @ V_x @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Comb_Oparcontract_Ointros__1_0) ).

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,
    ! [V_U: $i] :
      ~ ( c_in @ ( c_Pair @ ( c_Comb_Ocomb_Oop_A_D_D @ ( c_Comb_Ocomb_Oop_A_D_D @ v_xb @ v_z ) @ ( c_Comb_Ocomb_Oop_A_D_D @ v_yb @ v_z ) ) @ V_U @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

thf(6,plain,
    ( ( ! [V_x: $i] : ( c_in @ ( c_Pair @ V_x @ V_x @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(7,plain,
    ( ( ! [V_U: $i] :
          ~ ( c_in @ ( c_Pair @ ( c_Comb_Ocomb_Oop_A_D_D @ ( c_Comb_Ocomb_Oop_A_D_D @ v_xb @ v_z ) @ ( c_Comb_Ocomb_Oop_A_D_D @ v_yb @ v_z ) ) @ V_U @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[4]) ).

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

thf(9,plain,
    ( ( ! [V_U: $i] :
          ~ ( c_in @ ( c_Pair @ ( c_Comb_Ocomb_Oop_A_D_D @ ( c_Comb_Ocomb_Oop_A_D_D @ v_xb @ v_z ) @ ( c_Comb_Ocomb_Oop_A_D_D @ v_yb @ v_z ) ) @ V_U @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(10,plain,
    ( ( ! [V_x: $i] : ( c_in @ ( c_Pair @ V_x @ V_x @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

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

thf(12,plain,
    ! [SV1: $i] :
      ( ( ~ ( c_in @ ( c_Pair @ ( c_Comb_Ocomb_Oop_A_D_D @ ( c_Comb_Ocomb_Oop_A_D_D @ v_xb @ v_z ) @ ( c_Comb_Ocomb_Oop_A_D_D @ v_yb @ v_z ) ) @ SV1 @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[9]) ).

thf(13,plain,
    ! [SV2: $i] :
      ( ( c_in @ ( c_Pair @ SV2 @ SV2 @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[10]) ).

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

thf(15,plain,
    ! [SV1: $i] :
      ( ( c_in @ ( c_Pair @ ( c_Comb_Ocomb_Oop_A_D_D @ ( c_Comb_Ocomb_Oop_A_D_D @ v_xb @ v_z ) @ ( c_Comb_Ocomb_Oop_A_D_D @ v_yb @ v_z ) ) @ SV1 @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) @ c_Comb_Oparcontract @ ( tc_prod @ tc_Comb_Ocomb @ tc_Comb_Ocomb ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

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

thf(17,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COL116-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue May 31 10:00:55 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  
% 0.14/0.36   No.of.Axioms: 2
% 0.14/0.36  
% 0.14/0.36   Length.of.Defs: 0
% 0.14/0.36  
% 0.14/0.36   Contains.Choice.Funs: false
% 0.14/0.36  (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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.20/0.39  ********************************
% 0.20/0.39  *   All subproblems solved!    *
% 0.20/0.39  ********************************
% 0.20/0.39  % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.39  
% 0.20/0.39  %**** Beginning of derivation protocol ****
% 0.20/0.39  % SZS output start CNFRefutation
% See solution above
% 0.20/0.39  
% 0.20/0.39  %**** End of derivation protocol ****
% 0.20/0.39  %**** no. of clauses in derivation: 17 ****
% 0.20/0.39  %**** clause counter: 16 ****
% 0.20/0.39  
% 0.20/0.39  % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------