TSTP Solution File: SEU164+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:32 EDT 2022
% Result : Theorem 1.16s 1.47s
% Output : Refutation 1.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 06:10:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 16033 was started by sandbox on n021.cluster.edu,
% 0.44/1.01 Mon Jun 20 06:10:04 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15880_n021.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_15880_n021.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (12 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 3 (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.44/1.01 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.44/1.01 5 (all A all B (B = union(A) <-> (all C (in(C,B) <-> (exists D (in(C,D) & in(D,A))))))) # label(d4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 8 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 9 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 10 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 11 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 12 -(all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: c1=1. f1=1. f2=1. f3=1. f5=1. f6=1. f7=1. singleton=1. union=1. powerset=1. f4=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 1.16/1.47
% 1.16/1.47 ============================== end of clauses for search =============
% 1.16/1.47
% 1.16/1.47 ============================== SEARCH ================================
% 1.16/1.47
% 1.16/1.47 % Starting search at 0.01 seconds.
% 1.16/1.47
% 1.16/1.47 Low Water (keep): wt=15.000, iters=3350
% 1.16/1.47
% 1.16/1.47 Low Water (keep): wt=14.000, iters=3358
% 1.16/1.47
% 1.16/1.47 Low Water (keep): wt=13.000, iters=3350
% 1.16/1.47
% 1.16/1.47 Low Water (keep): wt=12.000, iters=3339
% 1.16/1.47
% 1.16/1.47 ============================== PROOF =================================
% 1.16/1.47 % SZS status Theorem
% 1.16/1.47 % SZS output start Refutation
% 1.16/1.47
% 1.16/1.47 % Proof 1 at 0.45 (+ 0.02) seconds.
% 1.16/1.47 % Length of proof is 22.
% 1.16/1.47 % Level of proof is 9.
% 1.16/1.47 % Maximum clause weight is 17.000.
% 1.16/1.47 % Given clauses 303.
% 1.16/1.47
% 1.16/1.47 3 (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].
% 1.16/1.47 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].
% 1.16/1.47 5 (all A all B (B = union(A) <-> (all C (in(C,B) <-> (exists D (in(C,D) & in(D,A))))))) # label(d4_tarski) # label(axiom) # label(non_clause). [assumption].
% 1.16/1.47 10 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 1.16/1.47 12 -(all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.16/1.47 13 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(10)].
% 1.16/1.47 18 union(A) = B | in(f5(A,B),B) | in(f6(A,B),A) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.16/1.47 19 union(A) = B | in(f5(A,B),B) | in(f5(A,B),f6(A,B)) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.16/1.47 20 union(powerset(c1)) != c1 # label(t99_zfmisc_1) # label(negated_conjecture). [clausify(12)].
% 1.16/1.47 25 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(4)].
% 1.16/1.47 28 powerset(A) != B | -in(C,B) | subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 1.16/1.47 29 powerset(A) != B | in(C,B) | -subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 1.16/1.47 36 union(A) = B | -in(f5(A,B),B) | -in(f5(A,B),C) | -in(C,A) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.22/1.47 39 union(A) = B | -in(f5(A,B),B) | -in(B,A). [factor(36,b,c)].
% 1.22/1.47 74 powerset(A) != B | in(A,B). [resolve(29,c,13,a)].
% 1.22/1.47 132 in(A,powerset(A)). [xx_res(74,a)].
% 1.22/1.47 156 -in(f5(powerset(c1),c1),c1). [ur(39,a,20,a,c,132,a)].
% 1.22/1.47 920 in(f6(powerset(c1),c1),powerset(c1)). [resolve(156,a,18,b),unit_del(a,20)].
% 1.22/1.47 935 powerset(c1) != powerset(A) | subset(f6(powerset(c1),c1),A). [resolve(920,a,28,b),flip(a)].
% 1.22/1.47 6088 subset(f6(powerset(c1),c1),c1). [xx_res(935,a)].
% 1.22/1.47 6175 -in(A,f6(powerset(c1),c1)) | in(A,c1). [resolve(6088,a,25,a)].
% 1.22/1.47 6208 $F. [resolve(6175,a,19,c),merge(c),unit_del(a,156),unit_del(b,20)].
% 1.22/1.47
% 1.22/1.47 % SZS output end Refutation
% 1.22/1.47 ============================== end of proof ==========================
% 1.22/1.47
% 1.22/1.47 ============================== STATISTICS ============================
% 1.22/1.47
% 1.22/1.47 Given=303. Generated=18371. Kept=6195. proofs=1.
% 1.22/1.47 Usable=282. Sos=5193. Demods=1. Limbo=1, Disabled=743. Hints=0.
% 1.22/1.47 Megabytes=4.31.
% 1.22/1.47 User_CPU=0.45, System_CPU=0.02, Wall_clock=0.
% 1.22/1.47
% 1.22/1.47 ============================== end of statistics =====================
% 1.22/1.47
% 1.22/1.47 ============================== end of search =========================
% 1.22/1.47
% 1.22/1.47 THEOREM PROVED
% 1.22/1.47 % SZS status Theorem
% 1.22/1.47
% 1.22/1.47 Exiting with 1 proof.
% 1.22/1.47
% 1.22/1.47 Process 16033 exit (max_proofs) Mon Jun 20 06:10:04 2022
% 1.22/1.47 Prover9 interrupted
%------------------------------------------------------------------------------