TSTP Solution File: SEU150+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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 13:29:22 EDT 2022
% Result : Theorem 0.69s 0.97s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.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 Jun 19 11:47:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.97 ============================== Prover9 ===============================
% 0.69/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.97 Process 16140 was started by sandbox2 on n014.cluster.edu,
% 0.69/0.97 Sun Jun 19 11:47:49 2022
% 0.69/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15987_n014.cluster.edu".
% 0.69/0.97 ============================== end of head ===========================
% 0.69/0.97
% 0.69/0.97 ============================== INPUT =================================
% 0.69/0.97
% 0.69/0.97 % Reading from file /tmp/Prover9_15987_n014.cluster.edu
% 0.69/0.97
% 0.69/0.97 set(prolog_style_variables).
% 0.69/0.97 set(auto2).
% 0.69/0.97 % set(auto2) -> set(auto).
% 0.69/0.97 % set(auto) -> set(auto_inference).
% 0.69/0.97 % set(auto) -> set(auto_setup).
% 0.69/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.97 % set(auto) -> set(auto_limits).
% 0.69/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.97 % set(auto) -> set(auto_denials).
% 0.69/0.97 % set(auto) -> set(auto_process).
% 0.69/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.97 % set(auto2) -> assign(stats, some).
% 0.69/0.97 % set(auto2) -> clear(echo_input).
% 0.69/0.97 % set(auto2) -> set(quiet).
% 0.69/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.97 % set(auto2) -> clear(print_given).
% 0.69/0.97 assign(lrs_ticks,-1).
% 0.69/0.97 assign(sos_limit,10000).
% 0.69/0.97 assign(order,kbo).
% 0.69/0.97 set(lex_order_vars).
% 0.69/0.97 clear(print_given).
% 0.69/0.97
% 0.69/0.97 % formulas(sos). % not echoed (5 formulas)
% 0.69/0.97
% 0.69/0.97 ============================== end of input ==========================
% 0.69/0.97
% 0.69/0.97 % From the command line: assign(max_seconds, 300).
% 0.69/0.97
% 0.69/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.97
% 0.69/0.97 % Formulas that are not ordinary clauses:
% 0.69/0.97 1 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 2 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 3 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 4 (all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 5 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> B = C)) # label(t9_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.97
% 0.69/0.97 ============================== end of process non-clausal formulas ===
% 0.69/0.97
% 0.69/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.97
% 0.69/0.97 ============================== PREDICATE ELIMINATION =================
% 0.69/0.97
% 0.69/0.97 ============================== end predicate elimination =============
% 0.69/0.97
% 0.69/0.97 Auto_denials:
% 0.69/0.97 % copying label t9_zfmisc_1 to answer in negative clause
% 0.69/0.97
% 0.69/0.97 Term ordering decisions:
% 0.69/0.97
% 0.69/0.97 % Assigning unary symbol singleton kb_weight 0 and highest precedence (6).
% 0.69/0.97 Function symbol KB weights: c1=1. c2=1. c3=1. unordered_pair=1. singleton=0.
% 0.69/0.97
% 0.69/0.97 ============================== end of process initial clauses ========
% 0.69/0.97
% 0.69/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.97
% 0.69/0.97 ============================== end of clauses for search =============
% 0.69/0.97
% 0.69/0.97 ============================== SEARCH ================================
% 0.69/0.97
% 0.69/0.97 % Starting search at 0.01 seconds.
% 0.69/0.97
% 0.69/0.97 ============================== PROOF =================================
% 0.69/0.97 % SZS status Theorem
% 0.69/0.97 % SZS output start Refutation
% 0.69/0.97
% 0.69/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: t9_zfmisc_1.
% 0.69/0.97 % Length of proof is 11.
% 0.69/0.97 % Level of proof is 5.
% 0.69/0.97 % Maximum clause weight is 9.000.
% 0.69/0.97 % Given clauses 4.
% 0.69/0.97
% 0.69/0.97 1 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 4 (all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.97 5 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> B = C)) # label(t9_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.97 6 singleton(c1) = unordered_pair(c2,c3) # label(t9_zfmisc_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.97 7 unordered_pair(c2,c3) = singleton(c1). [copy(6),flip(a)].
% 0.69/0.97 8 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(1)].
% 0.69/0.97 9 c3 != c2 # label(t9_zfmisc_1) # label(negated_conjecture) # answer(t9_zfmisc_1). [clausify(5)].
% 0.69/0.97 10 singleton(A) != unordered_pair(B,C) | B = A # label(t8_zfmisc_1) # label(axiom). [clausify(4)].
% 0.69/0.97 11 c2 = c1. [hyper(10,a,7,a(flip))].
% 0.69/0.97 12 unordered_pair(A,c3) != singleton(c1) # answer(t9_zfmisc_1). [ur(10,b,9,a),rewrite([11(1),8(4)]),flip(a)].
% 0.69/0.97 13 $F # answer(t9_zfmisc_1). [resolve(12,a,7,a)].
% 0.69/0.97
% 0.69/0.97 % SZS output end Refutation
% 0.69/0.97 ============================== end of proof ==========================
% 0.69/0.97
% 0.69/0.97 ============================== STATISTICS ============================
% 0.69/0.97
% 0.69/0.97 Given=4. Generated=12. Kept=6. proofs=1.
% 0.69/0.97 Usable=4. Sos=0. Demods=3. Limbo=1, Disabled=4. Hints=0.
% 0.69/0.97 Megabytes=0.03.
% 0.69/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.97
% 0.69/0.97 ============================== end of statistics =====================
% 0.69/0.97
% 0.69/0.97 ============================== end of search =========================
% 0.69/0.97
% 0.69/0.97 THEOREM PROVED
% 0.69/0.97 % SZS status Theorem
% 0.69/0.97
% 0.69/0.97 Exiting with 1 proof.
% 0.69/0.97
% 0.69/0.97 Process 16140 exit (max_proofs) Sun Jun 19 11:47:49 2022
% 0.69/0.97 Prover9 interrupted
%------------------------------------------------------------------------------