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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LAT269-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:37 EDT 2022

% Result   : Unsatisfiable 0.83s 1.10s
% Output   : Refutation 0.83s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LAT269-2 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n013.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 : Thu Jun 30 13:36:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.83/1.09  ============================== Prover9 ===============================
% 0.83/1.09  Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.09  Process 14574 was started by sandbox on n013.cluster.edu,
% 0.83/1.09  Thu Jun 30 13:36:30 2022
% 0.83/1.09  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14421_n013.cluster.edu".
% 0.83/1.09  ============================== end of head ===========================
% 0.83/1.09  
% 0.83/1.09  ============================== INPUT =================================
% 0.83/1.09  
% 0.83/1.09  % Reading from file /tmp/Prover9_14421_n013.cluster.edu
% 0.83/1.09  
% 0.83/1.09  set(prolog_style_variables).
% 0.83/1.09  set(auto2).
% 0.83/1.09      % set(auto2) -> set(auto).
% 0.83/1.09      % set(auto) -> set(auto_inference).
% 0.83/1.09      % set(auto) -> set(auto_setup).
% 0.83/1.09      % set(auto_setup) -> set(predicate_elim).
% 0.83/1.09      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.09      % set(auto) -> set(auto_limits).
% 0.83/1.09      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.09      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.09      % set(auto) -> set(auto_denials).
% 0.83/1.09      % set(auto) -> set(auto_process).
% 0.83/1.09      % set(auto2) -> assign(new_constants, 1).
% 0.83/1.09      % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.09      % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.09      % set(auto2) -> assign(max_hours, 1).
% 0.83/1.09      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.09      % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.09      % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.09      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.09      % set(auto2) -> set(sort_initial_sos).
% 0.83/1.09      % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.09      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.09      % set(auto2) -> assign(max_megs, 400).
% 0.83/1.09      % set(auto2) -> assign(stats, some).
% 0.83/1.09      % set(auto2) -> clear(echo_input).
% 0.83/1.09      % set(auto2) -> set(quiet).
% 0.83/1.09      % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.09      % set(auto2) -> clear(print_given).
% 0.83/1.09  assign(lrs_ticks,-1).
% 0.83/1.09  assign(sos_limit,10000).
% 0.83/1.09  assign(order,kbo).
% 0.83/1.09  set(lex_order_vars).
% 0.83/1.09  clear(print_given).
% 0.83/1.09  
% 0.83/1.09  % formulas(sos).  % not echoed (6 formulas)
% 0.83/1.09  
% 0.83/1.09  ============================== end of input ==========================
% 0.83/1.09  
% 0.83/1.09  % From the command line: assign(max_seconds, 300).
% 0.83/1.09  
% 0.83/1.09  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.10  
% 0.83/1.10  % Formulas that are not ordinary clauses:
% 0.83/1.10  
% 0.83/1.10  ============================== end of process non-clausal formulas ===
% 0.83/1.10  
% 0.83/1.10  ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.10  
% 0.83/1.10  ============================== PREDICATE ELIMINATION =================
% 0.83/1.10  
% 0.83/1.10  ============================== end predicate elimination =============
% 0.83/1.10  
% 0.83/1.10  Auto_denials:  (non-Horn, no changes).
% 0.83/1.10  
% 0.83/1.10  Term ordering decisions:
% 0.83/1.10  Function symbol KB weights:  t_a=1. v_r=1. v_A=1. v_cl=1. tc_Product__Type_Ounit=1. v_Y=1. c_Product__Type_OUnity=1. c_Tarski_OCompleteLattice=1. c_emptyset=1. v_intY1=1. c_Tarski_OTop=1. tc_Tarski_Opotype_Opotype__ext__type=1. c_Tarski_Olub=1. c_Tarski_Oinduced=1. c_Tarski_Ointerval=1. c_Tarski_Opotype_Opotype__ext=1.
% 0.83/1.10  
% 0.83/1.10  ============================== end of process initial clauses ========
% 0.83/1.10  
% 0.83/1.10  ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.10  
% 0.83/1.10  ============================== end of clauses for search =============
% 0.83/1.10  
% 0.83/1.10  ============================== SEARCH ================================
% 0.83/1.10  
% 0.83/1.10  % Starting search at 0.01 seconds.
% 0.83/1.10  
% 0.83/1.10  ============================== PROOF =================================
% 0.83/1.10  % SZS status Unsatisfiable
% 0.83/1.10  % SZS output start Refutation
% 0.83/1.10  
% 0.83/1.10  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.83/1.10  % Length of proof is 9.
% 0.83/1.10  % Level of proof is 2.
% 0.83/1.10  % Maximum clause weight is 37.000.
% 0.83/1.10  % Given clauses 8.
% 0.83/1.10  
% 0.83/1.10  1 c_in(c_Tarski_OTop(v_cl,t_a),v_A,t_a) # label(cls_Tarski_OTop_Acl_A_58_AA_A_61_61_ATrue_0) # label(axiom).  [assumption].
% 0.83/1.10  2 c_in(c_Tarski_Olub(v_Y,v_cl,t_a),v_A,t_a) # label(cls_Tarski_Olub_AY_Acl_A_58_AA_A_61_61_ATrue_0) # label(axiom).  [assumption].
% 0.83/1.10  3 v_intY1 = c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a) # label(cls_Tarski_OintY1_A_61_61_Ainterval_Ar_A_Ilub_AY_Acl_J_A_ITop_Acl_J_0) # label(axiom).  [assumption].
% 0.83/1.10  4 -c_in(A,v_A,t_a) | c_Tarski_Ointerval(v_r,A,c_Tarski_OTop(v_cl,t_a),t_a) != c_emptyset # label(cls_Tarski_Ox1_A_58_AA_A_61_61_62_Ainterval_Ar_Ax1_A_ITop_Acl_J_A_61_A_123_125_A_61_61_AFalse_0) # label(axiom).  [assumption].
% 0.83/1.10  5 -c_in(c_Tarski_Opotype_Opotype__ext(v_intY1,c_Tarski_Oinduced(v_intY1,v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) # label(cls_conjecture_0) # label(negated_conjecture).  [assumption].
% 0.83/1.10  6 -c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).  [copy(5),rewrite([3(1),3(11)])].
% 0.83/1.10  7 -c_in(A,v_A,t_a) | -c_in(B,v_A,t_a) | c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,B,A,t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,B,A,t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) | c_Tarski_Ointerval(v_r,B,A,t_a) = c_emptyset # label(cls_Tarski_O_91_124_Aa2_A_58_AA_59_Ab2_A_58_AA_59_Ainterval_Ar_Aa2_Ab2_A_126_61_A_123_125_A_124_93_A_61_61_62_A_I_124_Apset_A_61_Ainterval_Ar_Aa2_Ab2_M_Aorder_A_61_Ainduced_A_Iinterval_Ar_Aa2_Ab2_J_Ar_A_124_J_A_58_ACompleteLattice_A_61_61_ATrue_0) # label(axiom).  [assumption].
% 0.83/1.10  9 c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a) != c_emptyset.  [resolve(4,a,2,a)].
% 0.83/1.10  17 $F.  [ur(7,b,2,a,c,6,a,d,9,a),unit_del(a,1)].
% 0.83/1.10  
% 0.83/1.10  % SZS output end Refutation
% 0.83/1.10  ============================== end of proof ==========================
% 0.83/1.10  
% 0.83/1.10  ============================== STATISTICS ============================
% 0.83/1.10  
% 0.83/1.10  Given=8. Generated=19. Kept=15. proofs=1.
% 0.83/1.10  Usable=8. Sos=7. Demods=1. Limbo=0, Disabled=6. Hints=0.
% 0.83/1.10  Megabytes=0.08.
% 0.83/1.10  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.83/1.10  
% 0.83/1.10  ============================== end of statistics =====================
% 0.83/1.10  
% 0.83/1.10  ============================== end of search =========================
% 0.83/1.10  
% 0.83/1.10  THEOREM PROVED
% 0.83/1.10  % SZS status Unsatisfiable
% 0.83/1.10  
% 0.83/1.10  Exiting with 1 proof.
% 0.83/1.10  
% 0.83/1.10  Process 14574 exit (max_proofs) Thu Jun 30 13:36:30 2022
% 0.83/1.10  Prover9 interrupted
%------------------------------------------------------------------------------