TSTP Solution File: SEU173+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU173+1 : TPTP v8.1.0. Released v3.3.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 13:29:38 EDT 2022
% Result : Theorem 0.64s 0.96s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU173+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 16:16:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.64/0.95 ============================== Prover9 ===============================
% 0.64/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.95 Process 7380 was started by sandbox2 on n022.cluster.edu,
% 0.64/0.95 Sun Jun 19 16:16:17 2022
% 0.64/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7016_n022.cluster.edu".
% 0.64/0.95 ============================== end of head ===========================
% 0.64/0.95
% 0.64/0.95 ============================== INPUT =================================
% 0.64/0.95
% 0.64/0.95 % Reading from file /tmp/Prover9_7016_n022.cluster.edu
% 0.64/0.95
% 0.64/0.95 set(prolog_style_variables).
% 0.64/0.95 set(auto2).
% 0.64/0.95 % set(auto2) -> set(auto).
% 0.64/0.95 % set(auto) -> set(auto_inference).
% 0.64/0.95 % set(auto) -> set(auto_setup).
% 0.64/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.95 % set(auto) -> set(auto_limits).
% 0.64/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.95 % set(auto) -> set(auto_denials).
% 0.64/0.95 % set(auto) -> set(auto_process).
% 0.64/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.95 % set(auto2) -> assign(stats, some).
% 0.64/0.95 % set(auto2) -> clear(echo_input).
% 0.64/0.95 % set(auto2) -> set(quiet).
% 0.64/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.95 % set(auto2) -> clear(print_given).
% 0.64/0.95 assign(lrs_ticks,-1).
% 0.64/0.95 assign(sos_limit,10000).
% 0.64/0.95 assign(order,kbo).
% 0.64/0.95 set(lex_order_vars).
% 0.64/0.95 clear(print_given).
% 0.64/0.95
% 0.64/0.95 % formulas(sos). % not echoed (19 formulas)
% 0.64/0.95
% 0.64/0.95 ============================== end of input ==========================
% 0.64/0.95
% 0.64/0.95 % From the command line: assign(max_seconds, 300).
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.95
% 0.64/0.95 % Formulas that are not ordinary clauses:
% 0.64/0.95 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 2 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 3 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 4 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 5 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 6 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 7 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 8 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 9 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 10 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 11 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 12 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 13 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 14 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 15 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 16 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 17 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 18 -(all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.64/0.96
% 0.64/0.96 ============================== end of process non-clausal formulas ===
% 0.64/0.96
% 0.64/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.96
% 0.64/0.96 ============================== PREDICATE ELIMINATION =================
% 0.64/0.96
% 0.64/0.96 ============================== end predicate elimination =============
% 0.64/0.96
% 0.64/0.96 Auto_denials: (non-Horn, no changes).
% 0.64/0.96
% 0.64/0.96 Term ordering decisions:
% 0.64/0.96 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. f1=1. f2=1. powerset=1. f3=1. f4=1. f5=1.
% 0.64/0.96
% 0.64/0.96 ============================== end of process initial clauses ========
% 0.64/0.96
% 0.64/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.96
% 0.64/0.96 ============================== end of clauses for search =============
% 0.64/0.96
% 0.64/0.96 ============================== SEARCH ================================
% 0.64/0.96
% 0.64/0.96 % Starting search at 0.01 seconds.
% 0.64/0.96
% 0.64/0.96 ============================== PROOF =================================
% 0.64/0.96 % SZS status Theorem
% 0.64/0.96 % SZS output start Refutation
% 0.64/0.96
% 0.64/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.64/0.96 % Length of proof is 17.
% 0.64/0.96 % Level of proof is 5.
% 0.64/0.96 % Maximum clause weight is 10.000.
% 0.64/0.96 % Given clauses 54.
% 0.64/0.96
% 0.64/0.96 2 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 3 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 4 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 9 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 18 -(all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.64/0.96 26 subset(A,B) | in(f2(A,B),A) # label(d3_tarski) # label(axiom). [clausify(4)].
% 0.64/0.96 29 -empty(powerset(A)) # label(fc1_subset_1) # label(axiom). [clausify(9)].
% 0.64/0.96 30 -element(c3,powerset(c4)) # label(l71_subset_1) # label(negated_conjecture). [clausify(18)].
% 0.64/0.96 35 -in(A,c3) | in(A,c4) # label(l71_subset_1) # label(negated_conjecture). [clausify(18)].
% 0.64/0.96 40 empty(A) | element(B,A) | -in(B,A) # label(d2_subset_1) # label(axiom). [clausify(3)].
% 0.64/0.96 41 subset(A,B) | -in(f2(A,B),B) # label(d3_tarski) # label(axiom). [clausify(4)].
% 0.64/0.96 44 powerset(A) != B | in(C,B) | -subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(2)].
% 0.64/0.96 63 -in(c3,powerset(c4)). [ur(40,a,29,a,b,30,a)].
% 0.64/0.96 86 -subset(c3,c4). [ur(44,a,xx,b,63,a)].
% 0.64/0.96 87 in(f2(c3,c4),c3). [resolve(86,a,26,a)].
% 0.64/0.96 88 -in(f2(c3,c4),c4). [ur(41,a,86,a)].
% 0.64/0.96 105 $F. [resolve(87,a,35,a),unit_del(a,88)].
% 0.64/0.96
% 0.64/0.96 % SZS output end Refutation
% 0.64/0.96 ============================== end of proof ==========================
% 0.64/0.96
% 0.64/0.96 ============================== STATISTICS ============================
% 0.64/0.96
% 0.64/0.96 Given=54. Generated=153. Kept=86. proofs=1.
% 0.64/0.96 Usable=50. Sos=23. Demods=3. Limbo=2, Disabled=38. Hints=0.
% 0.64/0.96 Megabytes=0.10.
% 0.64/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.64/0.96
% 0.64/0.96 ============================== end of statistics =====================
% 0.64/0.96
% 0.64/0.96 ============================== end of search =========================
% 0.64/0.96
% 0.64/0.96 THEOREM PROVED
% 0.64/0.96 % SZS status Theorem
% 0.64/0.96
% 0.64/0.96 Exiting with 1 proof.
% 0.64/0.96
% 0.64/0.96 Process 7380 exit (max_proofs) Sun Jun 19 16:16:17 2022
% 0.64/0.96 Prover9 interrupted
%------------------------------------------------------------------------------