TSTP Solution File: SEU143+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU143+1 : TPTP v8.1.0. Released v3.3.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:18 EDT 2022
% Result : Theorem 0.69s 0.99s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU143+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 : 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 : Mon Jun 20 09:37:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.99 ============================== Prover9 ===============================
% 0.69/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.99 Process 9191 was started by sandbox2 on n008.cluster.edu,
% 0.69/0.99 Mon Jun 20 09:37:38 2022
% 0.69/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9038_n008.cluster.edu".
% 0.69/0.99 ============================== end of head ===========================
% 0.69/0.99
% 0.69/0.99 ============================== INPUT =================================
% 0.69/0.99
% 0.69/0.99 % Reading from file /tmp/Prover9_9038_n008.cluster.edu
% 0.69/0.99
% 0.69/0.99 set(prolog_style_variables).
% 0.69/0.99 set(auto2).
% 0.69/0.99 % set(auto2) -> set(auto).
% 0.69/0.99 % set(auto) -> set(auto_inference).
% 0.69/0.99 % set(auto) -> set(auto_setup).
% 0.69/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.99 % set(auto) -> set(auto_limits).
% 0.69/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.99 % set(auto) -> set(auto_denials).
% 0.69/0.99 % set(auto) -> set(auto_process).
% 0.69/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.99 % set(auto2) -> assign(stats, some).
% 0.69/0.99 % set(auto2) -> clear(echo_input).
% 0.69/0.99 % set(auto2) -> set(quiet).
% 0.69/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.99 % set(auto2) -> clear(print_given).
% 0.69/0.99 assign(lrs_ticks,-1).
% 0.69/0.99 assign(sos_limit,10000).
% 0.69/0.99 assign(order,kbo).
% 0.69/0.99 set(lex_order_vars).
% 0.69/0.99 clear(print_given).
% 0.69/0.99
% 0.69/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.69/0.99
% 0.69/0.99 ============================== end of input ==========================
% 0.69/0.99
% 0.69/0.99 % From the command line: assign(max_seconds, 300).
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.99
% 0.69/0.99 % Formulas that are not ordinary clauses:
% 0.69/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 2 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 4 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 5 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 8 -(all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.99
% 0.69/0.99 ============================== end of process non-clausal formulas ===
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.99
% 0.69/0.99 ============================== PREDICATE ELIMINATION =================
% 0.69/0.99
% 0.69/0.99 ============================== end predicate elimination =============
% 0.69/0.99
% 0.69/0.99 Auto_denials: (non-Horn, no changes).
% 0.69/0.99
% 0.69/0.99 Term ordering decisions:
% 0.69/0.99 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. f1=1. singleton=1. f2=1.
% 0.69/0.99
% 0.69/0.99 ============================== end of process initial clauses ========
% 0.69/0.99
% 0.69/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99
% 0.69/0.99 ============================== end of clauses for search =============
% 0.69/0.99
% 0.69/0.99 ============================== SEARCH ================================
% 0.69/0.99
% 0.69/0.99 % Starting search at 0.01 seconds.
% 0.69/0.99
% 0.69/0.99 ============================== PROOF =================================
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99 % SZS output start Refutation
% 0.69/0.99
% 0.69/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.69/0.99 % Length of proof is 11.
% 0.69/0.99 % Level of proof is 6.
% 0.69/0.99 % Maximum clause weight is 10.000.
% 0.69/0.99 % Given clauses 14.
% 0.69/0.99
% 0.69/0.99 2 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 8 -(all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.99 11 singleton(c3) = empty_set # label(l1_zfmisc_1) # label(negated_conjecture). [clausify(8)].
% 0.69/0.99 12 empty_set = singleton(c3). [copy(11),flip(a)].
% 0.69/0.99 18 empty_set != A | -in(B,A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 0.69/0.99 19 singleton(c3) != A | -in(B,A). [copy(18),rewrite([12(1)])].
% 0.69/0.99 21 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(2)].
% 0.69/0.99 29 -in(A,singleton(c3)). [ur(19,a,12,a(flip)),rewrite([12(1)])].
% 0.69/0.99 32 c3 != A. [resolve(21,a,12,a(flip)),rewrite([12(1)]),flip(b),unit_del(a,29)].
% 0.69/0.99 38 $F. [xx_res(32,a)].
% 0.69/0.99
% 0.69/0.99 % SZS output end Refutation
% 0.69/0.99 ============================== end of proof ==========================
% 0.69/0.99
% 0.69/0.99 ============================== STATISTICS ============================
% 0.69/0.99
% 0.69/0.99 Given=14. Generated=38. Kept=26. proofs=1.
% 0.69/0.99 Usable=14. Sos=8. Demods=1. Limbo=0, Disabled=15. Hints=0.
% 0.69/0.99 Megabytes=0.05.
% 0.69/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99
% 0.69/0.99 ============================== end of statistics =====================
% 0.69/0.99
% 0.69/0.99 ============================== end of search =========================
% 0.69/0.99
% 0.69/0.99 THEOREM PROVED
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99
% 0.69/0.99 Exiting with 1 proof.
% 0.69/0.99
% 0.69/0.99 Process 9191 exit (max_proofs) Mon Jun 20 09:37:38 2022
% 0.69/0.99 Prover9 interrupted
%------------------------------------------------------------------------------