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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SET865-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 : Tue Jul 19 04:33:03 EDT 2022

% Result   : Unsatisfiable 0.69s 0.99s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET865-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : Sat Jul  9 17:34:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/0.99  ============================== Prover9 ===============================
% 0.69/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.99  Process 7332 was started by sandbox2 on n013.cluster.edu,
% 0.69/0.99  Sat Jul  9 17:34:30 2022
% 0.69/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7179_n013.cluster.edu".
% 0.69/0.99  ============================== end of head ===========================
% 0.69/0.99  
% 0.69/0.99  ============================== INPUT =================================
% 0.69/0.99  
% 0.69/0.99  % Reading from file /tmp/Prover9_7179_n013.cluster.edu
% 0.69/0.99  
% 0.69/0.99  set(prolog_style_variables).
% 0.69/0.99  set(auto2).
% 0.69/0.99      % set(auto2) -> set(auto).
% 0.69/0.99      % set(auto) -> set(auto_inference).
% 0.69/0.99      % set(auto) -> set(auto_setup).
% 0.69/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.69/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.99      % set(auto) -> set(auto_limits).
% 0.69/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.99      % set(auto) -> set(auto_denials).
% 0.69/0.99      % set(auto) -> set(auto_process).
% 0.69/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.69/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.69/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.69/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.69/0.99      % set(auto2) -> assign(stats, some).
% 0.69/0.99      % set(auto2) -> clear(echo_input).
% 0.69/0.99      % set(auto2) -> set(quiet).
% 0.69/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.99      % set(auto2) -> clear(print_given).
% 0.69/0.99  assign(lrs_ticks,-1).
% 0.69/0.99  assign(sos_limit,10000).
% 0.69/0.99  assign(order,kbo).
% 0.69/0.99  set(lex_order_vars).
% 0.69/0.99  clear(print_given).
% 0.69/0.99  
% 0.69/0.99  % formulas(sos).  % not echoed (8 formulas)
% 0.69/0.99  
% 0.69/0.99  ============================== end of input ==========================
% 0.69/0.99  
% 0.69/0.99  % From the command line: assign(max_seconds, 300).
% 0.69/0.99  
% 0.69/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.99  
% 0.69/0.99  % Formulas that are not ordinary clauses:
% 0.69/0.99  
% 0.69/0.99  ============================== end of process non-clausal formulas ===
% 0.69/0.99  
% 0.69/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.99  
% 0.69/0.99  ============================== PREDICATE ELIMINATION =================
% 0.69/0.99  
% 0.69/0.99  ============================== end predicate elimination =============
% 0.69/0.99  
% 0.69/0.99  Auto_denials:
% 0.69/0.99    % copying label cls_conjecture_3 to answer in negative clause
% 0.69/0.99  
% 0.69/0.99  Term ordering decisions:
% 0.69/0.99  Function symbol KB weights:  t_a=1. v_S=1. c_Union=1. c_Zorn_Omaxchain=1. c_Zorn_Ochain=1. c_Zorn_OHausdorff__1=1. tc_set=1. v_x=1.
% 0.69/0.99  
% 0.69/0.99  ============================== end of process initial clauses ========
% 0.69/0.99  
% 0.69/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99  
% 0.69/0.99  ============================== end of clauses for search =============
% 0.69/0.99  
% 0.69/0.99  ============================== SEARCH ================================
% 0.69/0.99  
% 0.69/0.99  % Starting search at 0.01 seconds.
% 0.69/0.99  
% 0.69/0.99  ============================== PROOF =================================
% 0.69/0.99  % SZS status Unsatisfiable
% 0.69/0.99  % SZS output start Refutation
% 0.69/0.99  
% 0.69/0.99  % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_3.
% 0.69/0.99  % Length of proof is 15.
% 0.69/0.99  % Level of proof is 4.
% 0.69/0.99  % Maximum clause weight is 25.000.
% 0.69/0.99  % Given clauses 14.
% 0.69/0.99  
% 0.69/0.99  1 c_in(c_Zorn_OHausdorff__1(A,B),c_Zorn_Omaxchain(A,B),tc_set(tc_set(B))) # label(cls_Zorn_OHausdorff_0) # label(axiom).  [assumption].
% 0.69/0.99  2 c_lessequals(c_Zorn_Omaxchain(A,B),c_Zorn_Ochain(A,B),tc_set(tc_set(tc_set(B)))) # label(cls_Zorn_Omaxchain__subset__chain_0) # label(axiom).  [assumption].
% 0.69/0.99  3 A != v_x(A) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_3) # label(negated_conjecture) # answer(cls_conjecture_3).  [assumption].
% 0.69/0.99  4 v_x(A) != A | -c_in(A,v_S,tc_set(t_a)) # answer(cls_conjecture_3).  [copy(3),flip(a)].
% 0.69/0.99  5 c_in(v_x(A),v_S,tc_set(t_a)) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_1) # label(negated_conjecture).  [assumption].
% 0.69/0.99  6 c_lessequals(A,v_x(A),tc_set(t_a)) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_2) # label(negated_conjecture).  [assumption].
% 0.69/0.99  7 -c_in(A,B,C) | -c_lessequals(B,D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_OsubsetD_0) # label(axiom).  [assumption].
% 0.69/0.99  8 c_in(c_Union(A,t_a),v_S,tc_set(t_a)) | -c_in(A,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_0) # label(negated_conjecture).  [assumption].
% 0.69/0.99  9 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Omaxchain(B,C),tc_set(tc_set(C))) | -c_lessequals(c_Union(D,C),A,tc_set(C)) | c_Union(D,C) = A # label(cls_Zorn_Omaxchain__Zorn_0) # label(axiom).  [assumption].
% 0.69/0.99  10 c_in(c_Zorn_OHausdorff__1(A,B),c_Zorn_Ochain(A,B),tc_set(tc_set(B))).  [hyper(7,a,1,a,b,2,a)].
% 0.69/0.99  11 c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)).  [hyper(8,b,10,a)].
% 0.69/0.99  12 c_lessequals(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),tc_set(t_a)).  [hyper(6,b,11,a)].
% 0.69/0.99  13 c_in(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),v_S,tc_set(t_a)).  [hyper(5,b,11,a)].
% 0.69/0.99  14 v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)) != c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a) # answer(cls_conjecture_3).  [ur(4,b,11,a)].
% 0.69/0.99  24 $F # answer(cls_conjecture_3).  [hyper(9,a,13,a,b,1,a,c,12,a),flip(a),unit_del(a,14)].
% 0.69/0.99  
% 0.69/0.99  % SZS output end Refutation
% 0.69/0.99  ============================== end of proof ==========================
% 0.69/0.99  
% 0.69/0.99  ============================== STATISTICS ============================
% 0.69/0.99  
% 0.69/0.99  Given=14. Generated=23. Kept=22. proofs=1.
% 0.69/0.99  Usable=14. Sos=8. Demods=0. Limbo=0, Disabled=8. Hints=0.
% 0.69/0.99  Megabytes=0.06.
% 0.69/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99  
% 0.69/0.99  ============================== end of statistics =====================
% 0.69/0.99  
% 0.69/0.99  ============================== end of search =========================
% 0.69/0.99  
% 0.69/0.99  THEOREM PROVED
% 0.69/0.99  % SZS status Unsatisfiable
% 0.69/0.99  
% 0.69/0.99  Exiting with 1 proof.
% 0.69/0.99  
% 0.69/0.99  Process 7332 exit (max_proofs) Sat Jul  9 17:34:30 2022
% 0.69/0.99  Prover9 interrupted
%------------------------------------------------------------------------------