TSTP Solution File: SET858-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET858-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:56 EDT 2022
% Result : Unsatisfiable 0.83s 1.09s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET858-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.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 : Mon Jul 11 00:58:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.09 ============================== Prover9 ===============================
% 0.83/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.09 Process 23689 was started by sandbox on n011.cluster.edu,
% 0.83/1.09 Mon Jul 11 00:58:12 2022
% 0.83/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23536_n011.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_23536_n011.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 (11 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.09
% 0.83/1.09 % Formulas that are not ordinary clauses:
% 0.83/1.09
% 0.83/1.09 ============================== end of process non-clausal formulas ===
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.09
% 0.83/1.09 ============================== PREDICATE ELIMINATION =================
% 0.83/1.09
% 0.83/1.09 ============================== end predicate elimination =============
% 0.83/1.09
% 0.83/1.09 Auto_denials: (non-Horn, no changes).
% 0.83/1.09
% 0.83/1.09 Term ordering decisions:
% 0.83/1.09
% 0.83/1.09 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (11).
% 0.83/1.09 Function symbol KB weights: t_a=1. v_S=1. v_m=1. v_n=1. c_Zorn_OTFin=1. c_Zorn_Osucc=1. c_Zorn_OTFin__linear__lemma1__1=1. tc_set=0.
% 0.83/1.09
% 0.83/1.09 ============================== end of process initial clauses ========
% 0.83/1.09
% 0.83/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.09
% 0.83/1.09 ============================== end of clauses for search =============
% 0.83/1.09
% 0.83/1.09 ============================== SEARCH ================================
% 0.83/1.09
% 0.83/1.09 % Starting search at 0.01 seconds.
% 0.83/1.09
% 0.83/1.09 ============================== PROOF =================================
% 0.83/1.09 % SZS status Unsatisfiable
% 0.83/1.09 % SZS output start Refutation
% 0.83/1.09
% 0.83/1.09 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.83/1.09 % Length of proof is 19.
% 0.83/1.09 % Level of proof is 4.
% 0.83/1.09 % Maximum clause weight is 43.000.
% 0.83/1.09 % Given clauses 91.
% 0.83/1.09
% 0.83/1.09 1 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.83/1.09 2 c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.83/1.09 3 c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))) # label(cls_Zorn_OAbrial__axiom1_0) # label(axiom). [assumption].
% 0.83/1.09 4 -c_lessequals(v_n,v_m,tc_set(tc_set(t_a))) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.83/1.09 5 -c_lessequals(v_m,v_n,tc_set(tc_set(t_a))) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.83/1.09 6 -c_lessequals(A,B,tc_set(C)) | -c_lessequals(D,A,tc_set(C)) | c_lessequals(D,B,tc_set(C)) # label(cls_Set_Osubset__trans_0) # label(axiom). [assumption].
% 0.83/1.09 7 -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__linear__lemma2_0) # label(axiom). [assumption].
% 0.83/1.09 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_Zorn_OTFin__linear__lemma1__1(B,A,C) != A | c_lessequals(D,A,tc_set(tc_set(C))) | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))) # label(cls_Zorn_OTFin__linear__lemma1_2) # label(axiom). [assumption].
% 0.83/1.09 9 -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(D,A,tc_set(tc_set(C))) | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(B,A,C),A,tc_set(tc_set(C))) | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))) # label(cls_Zorn_OTFin__linear__lemma1_1) # label(axiom). [assumption].
% 0.83/1.09 10 -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_in(c_Zorn_OTFin__linear__lemma1__1(B,A,C),c_Zorn_OTFin(B,C),tc_set(tc_set(C))) | c_lessequals(D,A,tc_set(tc_set(C))) | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))) # label(cls_Zorn_OTFin__linear__lemma1_0) # label(axiom). [assumption].
% 0.83/1.09 11 -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(c_Zorn_Osucc(B,c_Zorn_OTFin__linear__lemma1__1(B,A,C),C),A,tc_set(tc_set(C))) | c_lessequals(D,A,tc_set(tc_set(C))) | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))) # label(cls_Zorn_OTFin__linear__lemma1_3) # label(axiom). [assumption].
% 0.83/1.09 20 -c_lessequals(c_Zorn_Osucc(A,v_n,t_a),v_m,tc_set(tc_set(t_a))). [ur(6,b,3,a,c,4,a)].
% 0.83/1.09 23 -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) | -c_lessequals(A,v_n,tc_set(tc_set(t_a))) | c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_n,tc_set(tc_set(t_a))) | v_n = A. [resolve(7,b,2,a),flip(d)].
% 0.83/1.09 29 -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) | c_lessequals(A,v_n,tc_set(tc_set(t_a))) | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),v_n,tc_set(tc_set(t_a))) | c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),A,tc_set(tc_set(t_a))). [resolve(9,a,2,a)].
% 0.83/1.09 55 -c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),t_a),v_n,tc_set(tc_set(t_a))). [ur(11,a,2,a,b,1,a,d,5,a,e,20,a)].
% 0.83/1.09 56 c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a) != v_n. [ur(8,a,2,a,b,1,a,d,5,a,e,20,a)].
% 0.83/1.09 198 c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),v_n,tc_set(tc_set(t_a))). [resolve(29,a,1,a),unit_del(a,5),unit_del(c,20)].
% 0.83/1.09 210 -c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))). [ur(23,b,198,a,c,55,a,d,56,a(flip))].
% 0.83/1.09 236 $F. [ur(10,b,1,a,c,210,a,d,5,a,e,20,a),unit_del(a,2)].
% 0.83/1.09
% 0.83/1.09 % SZS output end Refutation
% 0.83/1.09 ============================== end of proof ==========================
% 0.83/1.09
% 0.83/1.09 ============================== STATISTICS ============================
% 0.83/1.09
% 0.83/1.09 Given=91. Generated=769. Kept=235. proofs=1.
% 0.83/1.09 Usable=79. Sos=78. Demods=0. Limbo=0, Disabled=89. Hints=0.
% 0.83/1.09 Megabytes=0.39.
% 0.83/1.09 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.83/1.09
% 0.83/1.09 ============================== end of statistics =====================
% 0.83/1.09
% 0.83/1.09 ============================== end of search =========================
% 0.83/1.09
% 0.83/1.09 THEOREM PROVED
% 0.83/1.09 % SZS status Unsatisfiable
% 0.83/1.09
% 0.83/1.09 Exiting with 1 proof.
% 0.83/1.09
% 0.83/1.09 Process 23689 exit (max_proofs) Mon Jul 11 00:58:12 2022
% 0.83/1.09 Prover9 interrupted
%------------------------------------------------------------------------------