TSTP Solution File: SEU161+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:30 EDT 2022
% Result : Theorem 27.26s 27.54s
% Output : Refutation 27.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 17:22:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/0.98 ============================== Prover9 ===============================
% 0.72/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.72/0.98 Process 3358 was started by sandbox2 on n008.cluster.edu,
% 0.72/0.98 Sun Jun 19 17:22:38 2022
% 0.72/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3205_n008.cluster.edu".
% 0.72/0.98 ============================== end of head ===========================
% 0.72/0.98
% 0.72/0.98 ============================== INPUT =================================
% 0.72/0.98
% 0.72/0.98 % Reading from file /tmp/Prover9_3205_n008.cluster.edu
% 0.72/0.98
% 0.72/0.98 set(prolog_style_variables).
% 0.72/0.98 set(auto2).
% 0.72/0.98 % set(auto2) -> set(auto).
% 0.72/0.98 % set(auto) -> set(auto_inference).
% 0.72/0.98 % set(auto) -> set(auto_setup).
% 0.72/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.72/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/0.98 % set(auto) -> set(auto_limits).
% 0.72/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/0.98 % set(auto) -> set(auto_denials).
% 0.72/0.98 % set(auto) -> set(auto_process).
% 0.72/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.72/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.72/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.72/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.72/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.72/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.72/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.72/0.98 % set(auto2) -> assign(stats, some).
% 0.72/0.98 % set(auto2) -> clear(echo_input).
% 0.72/0.98 % set(auto2) -> set(quiet).
% 0.72/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.72/0.98 % set(auto2) -> clear(print_given).
% 0.72/0.98 assign(lrs_ticks,-1).
% 0.72/0.98 assign(sos_limit,10000).
% 0.72/0.98 assign(order,kbo).
% 0.72/0.98 set(lex_order_vars).
% 0.72/0.98 clear(print_given).
% 0.72/0.98
% 0.72/0.98 % formulas(sos). % not echoed (9 formulas)
% 0.72/0.98
% 0.72/0.98 ============================== end of input ==========================
% 0.72/0.98
% 0.72/0.98 % From the command line: assign(max_seconds, 300).
% 0.72/0.98
% 0.72/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/0.98
% 0.72/0.98 % Formulas that are not ordinary clauses:
% 0.72/0.98 1 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 2 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 4 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 5 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 8 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 9 -(all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(t46_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/0.98
% 0.72/0.98 ============================== end of process non-clausal formulas ===
% 0.72/0.98
% 0.72/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/0.98
% 0.72/0.98 ============================== PREDICATE ELIMINATION =================
% 0.72/0.98
% 0.72/0.98 ============================== end predicate elimination =============
% 0.72/0.98
% 0.72/0.98 Auto_denials:
% 0.72/0.98 % copying label rc2_xboole_0 to answer in negative clause
% 0.72/0.98 % copying label antisymmetry_r2_hidden to answer in negative clause
% 0.72/0.98 % copying label t46_zfmisc_1 to answer in negative clause
% 0.72/0.98 % assign(max_proofs, 3). % (Horn set with more than one neg. clause)
% 0.72/0.98
% 0.72/0.98 Term ordering decisions:
% 0.72/0.98
% 0.72/0.98 % Assigning unary symbol singleton kb_weight 0 and highest precedence (9).
% 0.72/0.98 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. set_union2=1. singleton=0.
% 0.72/0.98
% 0.72/0.98 ============================== end of process initial clauses ========
% 0.72/0.98
% 0.72/0.98 ============================== CLAUSES FOR SEARCH ====================
% 27.26/27.54
% 27.26/27.54 ============================== end of clauses for search =============
% 27.26/27.54
% 27.26/27.54 ============================== SEARCH ================================
% 27.26/27.54
% 27.26/27.54 % Starting search at 0.01 seconds.
% 27.26/27.54
% 27.26/27.54 ============================== PROOF =================================
% 27.26/27.54 % SZS status Theorem
% 27.26/27.54 % SZS output start Refutation
% 27.26/27.54
% 27.26/27.54 % Proof 1 at 0.01 (+ 0.00) seconds: t46_zfmisc_1.
% 27.26/27.54 % Length of proof is 10.
% 27.26/27.54 % Level of proof is 3.
% 27.26/27.54 % Maximum clause weight is 9.000.
% 27.26/27.54 % Given clauses 9.
% 27.26/27.54
% 27.26/27.54 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 27.26/27.54 8 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 27.26/27.54 9 -(all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(t46_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 27.26/27.54 11 in(c3,c4) # label(t46_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 27.26/27.54 13 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(3)].
% 27.26/27.54 16 set_union2(singleton(c3),c4) != c4 # label(t46_zfmisc_1) # label(negated_conjecture) # answer(t46_zfmisc_1). [clausify(9)].
% 27.26/27.54 17 set_union2(c4,singleton(c3)) != c4 # answer(t46_zfmisc_1). [copy(16),rewrite([13(4)])].
% 27.26/27.54 20 -in(A,B) | set_union2(singleton(A),B) = B # label(l23_zfmisc_1) # label(axiom). [clausify(8)].
% 27.26/27.54 21 -in(A,B) | set_union2(B,singleton(A)) = B. [copy(20),rewrite([13(3)])].
% 27.26/27.54 24 $F # answer(t46_zfmisc_1). [hyper(21,a,11,a),unit_del(a,17)].
% 27.26/27.54
% 27.26/27.54 % SZS output end Refutation
% 27.26/27.54 ============================== end of proof ==========================
% 27.26/27.54 % Redundant proof: 25 $F # answer(t46_zfmisc_1). [ur(21,b,17,a),unit_del(a,11)].
% 27.26/27.54
% 27.26/27.54 % Disable descendants (x means already disabled):
% 27.26/27.54 16x 17
% 27.26/27.54
% 27.26/27.54 ============================== STATISTICS ============================
% 27.26/27.54
% 27.26/27.54 Given=109. Generated=10023. Kept=109. proofs=1.
% 27.26/27.54 Usable=108. Sos=0. Demods=2. Limbo=0, Disabled=11. Hints=0.
% 27.26/27.54 Megabytes=0.63.
% 27.26/27.54 User_CPU=26.57, System_CPU=0.01, Wall_clock=27.
% 27.26/27.54
% 27.26/27.54 ============================== end of statistics =====================
% 27.26/27.54
% 27.26/27.54 ============================== end of search =========================
% 27.26/27.54
% 27.26/27.54 SEARCH FAILED
% 27.26/27.54
% 27.26/27.54 Exiting with 1 proof.
% 27.26/27.54
% 27.26/27.54 Process 3358 exit (sos_empty) Sun Jun 19 17:23:05 2022
% 27.26/27.54 Prover9 interrupted
%------------------------------------------------------------------------------