TSTP Solution File: LAT263-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %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 : Sun Jul 17 06:26:31 EDT 2022

% Result   : Unsatisfiable 0.67s 0.97s
% Output   : Refutation 0.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 29 05:39:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.67/0.97  ============================== Prover9 ===============================
% 0.67/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97  Process 10323 was started by sandbox2 on n013.cluster.edu,
% 0.67/0.97  Wed Jun 29 05:40:00 2022
% 0.67/0.97  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10170_n013.cluster.edu".
% 0.67/0.97  ============================== end of head ===========================
% 0.67/0.97  
% 0.67/0.97  ============================== INPUT =================================
% 0.67/0.97  
% 0.67/0.97  % Reading from file /tmp/Prover9_10170_n013.cluster.edu
% 0.67/0.97  
% 0.67/0.97  set(prolog_style_variables).
% 0.67/0.97  set(auto2).
% 0.67/0.97      % set(auto2) -> set(auto).
% 0.67/0.97      % set(auto) -> set(auto_inference).
% 0.67/0.97      % set(auto) -> set(auto_setup).
% 0.67/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97      % set(auto) -> set(auto_limits).
% 0.67/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97      % set(auto) -> set(auto_denials).
% 0.67/0.97      % set(auto) -> set(auto_process).
% 0.67/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97      % set(auto2) -> assign(stats, some).
% 0.67/0.97      % set(auto2) -> clear(echo_input).
% 0.67/0.97      % set(auto2) -> set(quiet).
% 0.67/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97      % set(auto2) -> clear(print_given).
% 0.67/0.97  assign(lrs_ticks,-1).
% 0.67/0.97  assign(sos_limit,10000).
% 0.67/0.97  assign(order,kbo).
% 0.67/0.97  set(lex_order_vars).
% 0.67/0.97  clear(print_given).
% 0.67/0.97  
% 0.67/0.97  % formulas(sos).  % not echoed (8 formulas)
% 0.67/0.97  
% 0.67/0.97  ============================== end of input ==========================
% 0.67/0.97  
% 0.67/0.97  % From the command line: assign(max_seconds, 300).
% 0.67/0.97  
% 0.67/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97  
% 0.67/0.97  % Formulas that are not ordinary clauses:
% 0.67/0.97  
% 0.67/0.97  ============================== end of process non-clausal formulas ===
% 0.67/0.97  
% 0.67/0.97  ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.97  
% 0.67/0.97  ============================== PREDICATE ELIMINATION =================
% 0.67/0.97  
% 0.67/0.97  ============================== end predicate elimination =============
% 0.67/0.97  
% 0.67/0.97  Auto_denials:
% 0.67/0.97    % copying label cls_conjecture_1 to answer in negative clause
% 0.67/0.97  
% 0.67/0.97  Term ordering decisions:
% 0.67/0.97  
% 0.67/0.97  % Assigning unary symbol tc_set kb_weight 0 and highest precedence (16).
% 0.67/0.97  Function symbol KB weights:  tc_Product__Type_Ounit=1. t_a=1. v_cl=1. c_Tarski_OCompleteLattice=1. c_Tarski_OPartialOrder=1. v_A=1. v_S=1. c_Tarski_Odual=1. tc_Tarski_Opotype_Opotype__ext__type=1. c_Tarski_Opotype_Opset=1. c_Tarski_Olub=1. c_Tarski_Oglb=1. tc_set=0.
% 0.67/0.97  
% 0.67/0.97  ============================== end of process initial clauses ========
% 0.67/0.97  
% 0.67/0.97  ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.97  
% 0.67/0.97  ============================== end of clauses for search =============
% 0.67/0.97  
% 0.67/0.97  ============================== SEARCH ================================
% 0.67/0.97  
% 0.67/0.97  % Starting search at 0.01 seconds.
% 0.67/0.97  
% 0.67/0.97  ============================== PROOF =================================
% 0.67/0.97  % SZS status Unsatisfiable
% 0.67/0.97  % SZS output start Refutation
% 0.67/0.97  
% 0.67/0.97  % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_1.
% 0.67/0.97  % Length of proof is 13.
% 0.67/0.97  % Level of proof is 3.
% 0.67/0.97  % Maximum clause weight is 36.000.
% 0.67/0.97  % Given clauses 9.
% 0.67/0.97  
% 0.67/0.97  1 c_lessequals(v_S,v_A,tc_set(t_a)) # label(cls_conjecture_0) # label(negated_conjecture).  [assumption].
% 0.67/0.97  2 v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) # label(cls_Tarski_OA_A_61_61_Apset_Acl_0) # label(axiom).  [assumption].
% 0.67/0.97  3 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) # label(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) # label(axiom).  [assumption].
% 0.67/0.97  4 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) # label(cls_Tarski_Odual_Acl_A_58_APartialOrder_0) # label(axiom).  [assumption].
% 0.67/0.97  5 c_Tarski_Oglb(A,B,C) = c_Tarski_Olub(A,c_Tarski_Odual(B,C),C) # label(cls_Tarski_Oglb__dual__lub_0) # label(axiom).  [assumption].
% 0.67/0.97  6 c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit) # label(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) # label(axiom).  [assumption].
% 0.67/0.97  7 -c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a) # label(cls_conjecture_1) # label(negated_conjecture) # answer(cls_conjecture_1).  [assumption].
% 0.67/0.97  8 -c_in(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a) # answer(cls_conjecture_1).  [copy(7),rewrite([5(4),2(7)])].
% 0.67/0.97  9 -c_in(A,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit)) | -c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit)) | -c_lessequals(C,c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),tc_set(B)) | c_in(c_Tarski_Olub(C,A,B),c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),B) # label(cls_Tarski_OCL_Olub__in__lattice_0) # label(axiom).  [assumption].
% 0.67/0.97  10 c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)).  [back_rewrite(1),rewrite([2(2)])].
% 0.67/0.97  11 -c_in(c_Tarski_Odual(A,B),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit)) | -c_in(c_Tarski_Odual(A,B),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit)) | -c_lessequals(C,c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),tc_set(B)) | c_in(c_Tarski_Olub(C,c_Tarski_Odual(A,B),B),c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),B).  [para(6(a,1),9(c,2)),rewrite([6(19)])].
% 0.67/0.97  12 c_in(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a).  [hyper(11,a,3,a,b,4,a,c,10,a)].
% 0.67/0.97  13 $F # answer(cls_conjecture_1).  [resolve(12,a,8,a)].
% 0.67/0.97  
% 0.67/0.97  % SZS output end Refutation
% 0.67/0.97  ============================== end of proof ==========================
% 0.67/0.97  
% 0.67/0.97  ============================== STATISTICS ============================
% 0.67/0.97  
% 0.67/0.97  Given=9. Generated=16. Kept=11. proofs=1.
% 0.67/0.97  Usable=9. Sos=0. Demods=3. Limbo=0, Disabled=9. Hints=0.
% 0.67/0.97  Megabytes=0.05.
% 0.67/0.97  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.67/0.97  
% 0.67/0.97  ============================== end of statistics =====================
% 0.67/0.97  
% 0.67/0.97  ============================== end of search =========================
% 0.67/0.97  
% 0.67/0.97  THEOREM PROVED
% 0.67/0.97  % SZS status Unsatisfiable
% 0.67/0.97  
% 0.67/0.97  Exiting with 1 proof.
% 0.67/0.97  
% 0.67/0.97  Process 10323 exit (max_proofs) Wed Jun 29 05:40:00 2022
% 0.67/0.97  Prover9 interrupted
%------------------------------------------------------------------------------