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