TSTP Solution File: SET849-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET849-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:47 EDT 2022
% Result : Unsatisfiable 0.71s 1.02s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET849-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 14:56:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.02 ============================== Prover9 ===============================
% 0.71/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.02 Process 16290 was started by sandbox on n026.cluster.edu,
% 0.71/1.02 Sun Jul 10 14:56:12 2022
% 0.71/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15910_n026.cluster.edu".
% 0.71/1.02 ============================== end of head ===========================
% 0.71/1.02
% 0.71/1.02 ============================== INPUT =================================
% 0.71/1.02
% 0.71/1.02 % Reading from file /tmp/Prover9_15910_n026.cluster.edu
% 0.71/1.02
% 0.71/1.02 set(prolog_style_variables).
% 0.71/1.02 set(auto2).
% 0.71/1.02 % set(auto2) -> set(auto).
% 0.71/1.02 % set(auto) -> set(auto_inference).
% 0.71/1.02 % set(auto) -> set(auto_setup).
% 0.71/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.02 % set(auto) -> set(auto_limits).
% 0.71/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.02 % set(auto) -> set(auto_denials).
% 0.71/1.02 % set(auto) -> set(auto_process).
% 0.71/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.02 % set(auto2) -> assign(stats, some).
% 0.71/1.02 % set(auto2) -> clear(echo_input).
% 0.71/1.02 % set(auto2) -> set(quiet).
% 0.71/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.02 % set(auto2) -> clear(print_given).
% 0.71/1.02 assign(lrs_ticks,-1).
% 0.71/1.02 assign(sos_limit,10000).
% 0.71/1.02 assign(order,kbo).
% 0.71/1.02 set(lex_order_vars).
% 0.71/1.02 clear(print_given).
% 0.71/1.02
% 0.71/1.02 % formulas(sos). % not echoed (4 formulas)
% 0.71/1.02
% 0.71/1.02 ============================== end of input ==========================
% 0.71/1.02
% 0.71/1.02 % From the command line: assign(max_seconds, 300).
% 0.71/1.02
% 0.71/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.02
% 0.71/1.02 % Formulas that are not ordinary clauses:
% 0.71/1.02
% 0.71/1.02 ============================== end of process non-clausal formulas ===
% 0.71/1.02
% 0.71/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.02
% 0.71/1.02 ============================== PREDICATE ELIMINATION =================
% 0.71/1.02
% 0.71/1.02 ============================== end predicate elimination =============
% 0.71/1.02
% 0.71/1.02 Auto_denials:
% 0.71/1.02 % copying label cls_conjecture_1 to answer in negative clause
% 0.71/1.02
% 0.71/1.02 Term ordering decisions:
% 0.71/1.02
% 0.71/1.02 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (9).
% 0.71/1.02 Function symbol KB weights: t_a=1. v_S=1. c_Zorn_OTFin=1. c_Union=1. c_Zorn_Osucc=1. tc_set=0.
% 0.71/1.02
% 0.71/1.02 ============================== end of process initial clauses ========
% 0.71/1.02
% 0.71/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.02
% 0.71/1.02 ============================== end of clauses for search =============
% 0.71/1.02
% 0.71/1.02 ============================== SEARCH ================================
% 0.71/1.02
% 0.71/1.02 % Starting search at 0.01 seconds.
% 0.71/1.02
% 0.71/1.02 ============================== PROOF =================================
% 0.71/1.02 % SZS status Unsatisfiable
% 0.71/1.02 % SZS output start Refutation
% 0.71/1.02
% 0.71/1.02 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_1.
% 0.71/1.02 % Length of proof is 8.
% 0.71/1.02 % Level of proof is 3.
% 0.71/1.02 % Maximum clause weight is 29.000.
% 0.71/1.02 % Given clauses 4.
% 0.71/1.02
% 0.71/1.02 1 c_lessequals(A,A,tc_set(B)) # label(cls_Set_Osubset__refl_0) # label(axiom). [assumption].
% 0.71/1.02 2 c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) # label(cls_conjecture_1) # label(negated_conjecture) # answer(cls_conjecture_1). [assumption].
% 0.71/1.02 3 -c_lessequals(A,c_Zorn_OTFin(B,C),tc_set(tc_set(tc_set(C)))) | c_in(c_Union(A,tc_set(C)),c_Zorn_OTFin(B,C),tc_set(tc_set(C))) # label(cls_Zorn_OTFin__UnionI_0) # label(axiom). [assumption].
% 0.71/1.02 4 -c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))) | c_Union(c_Zorn_OTFin(A,B),tc_set(B)) = c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B) # label(cls_Zorn_Oequal__succ__Union_1) # label(axiom). [assumption].
% 0.71/1.02 5 -c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))) | c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B) = c_Union(c_Zorn_OTFin(A,B),tc_set(B)). [copy(4),flip(b)].
% 0.71/1.02 6 c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))). [hyper(3,a,1,a)].
% 0.71/1.02 7 -c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) # answer(cls_conjecture_1). [ur(5,b,2,a)].
% 0.71/1.02 8 $F # answer(cls_conjecture_1). [resolve(7,a,6,a)].
% 0.71/1.02
% 0.71/1.02 % SZS output end Refutation
% 0.71/1.02 ============================== end of proof ==========================
% 0.71/1.02
% 0.71/1.02 ============================== STATISTICS ============================
% 0.71/1.02
% 0.71/1.02 Given=4. Generated=6. Kept=6. proofs=1.
% 0.71/1.02 Usable=4. Sos=1. Demods=0. Limbo=0, Disabled=4. Hints=0.
% 0.71/1.02 Megabytes=0.04.
% 0.71/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/1.02
% 0.71/1.02 ============================== end of statistics =====================
% 0.71/1.02
% 0.71/1.02 ============================== end of search =========================
% 0.71/1.02
% 0.71/1.02 THEOREM PROVED
% 0.71/1.02 % SZS status Unsatisfiable
% 0.71/1.02
% 0.71/1.02 Exiting with 1 proof.
% 0.71/1.02
% 0.71/1.02 Process 16290 exit (max_proofs) Sun Jul 10 14:56:12 2022
% 0.71/1.02 Prover9 interrupted
%------------------------------------------------------------------------------