TSTP Solution File: SET841-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET841-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:32:40 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET841-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 : Sun Jul 10 01:37:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 9171 was started by sandbox2 on n023.cluster.edu,
% 0.43/0.99 Sun Jul 10 01:37:11 2022
% 0.43/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8971_n023.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_8971_n023.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (7 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (non-Horn, no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99
% 0.43/0.99 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (10).
% 0.43/0.99 Function symbol KB weights: t_a=1. v_m=1. v_S=1. v_x=1. c_Zorn_OTFin=1. c_Zorn_Osucc=1. tc_set=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 11.
% 0.43/0.99 % Level of proof is 3.
% 0.43/0.99 % Maximum clause weight is 34.000.
% 0.43/0.99 % Given clauses 8.
% 0.43/0.99
% 0.43/0.99 1 c_lessequals(A,A,tc_set(B)) # label(cls_Set_Osubset__refl_0) # label(axiom). [assumption].
% 0.43/0.99 2 v_m = c_Zorn_Osucc(v_S,v_m,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.43/0.99 3 c_Zorn_Osucc(v_S,v_m,t_a) = v_m. [copy(2),flip(a)].
% 0.43/0.99 4 c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.43/0.99 5 c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.43/0.99 6 c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.43/0.99 7 -c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.43/0.99 8 -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C))) | -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C))) | -c_lessequals(A,D,tc_set(tc_set(C))) | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))) | A = D # label(cls_Zorn_OTFin__subsetD_0) # label(axiom). [assumption].
% 0.43/0.99 9 -c_in(v_x,c_Zorn_OTFin(A,t_a),tc_set(tc_set(t_a))) | -c_in(v_m,c_Zorn_OTFin(A,t_a),tc_set(tc_set(t_a))) | c_lessequals(c_Zorn_Osucc(A,v_x,t_a),v_m,tc_set(tc_set(t_a))) | v_x = v_m. [resolve(8,c,4,a)].
% 0.43/0.99 10 v_x = v_m. [resolve(9,a,6,a),unit_del(a,5),unit_del(b,7)].
% 0.43/0.99 11 $F. [back_rewrite(7),rewrite([10(2),3(4)]),unit_del(a,1)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=8. Generated=13. Kept=9. proofs=1.
% 0.43/0.99 Usable=6. Sos=0. Demods=2. Limbo=1, Disabled=9. Hints=0.
% 0.43/0.99 Megabytes=0.04.
% 0.43/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/1.00
% 0.43/1.00 Process 9171 exit (max_proofs) Sun Jul 10 01:37:11 2022
% 0.43/1.00 Prover9 interrupted
%------------------------------------------------------------------------------