TSTP Solution File: SEU164+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:33 EDT 2022
% Result : Theorem 1.10s 1.41s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 03:16:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.67/0.94 ============================== Prover9 ===============================
% 0.67/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.94 Process 3530 was started by sandbox on n003.cluster.edu,
% 0.67/0.94 Sun Jun 19 03:16:29 2022
% 0.67/0.94 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3187_n003.cluster.edu".
% 0.67/0.94 ============================== end of head ===========================
% 0.67/0.94
% 0.67/0.94 ============================== INPUT =================================
% 0.67/0.94
% 0.67/0.94 % Reading from file /tmp/Prover9_3187_n003.cluster.edu
% 0.67/0.94
% 0.67/0.94 set(prolog_style_variables).
% 0.67/0.94 set(auto2).
% 0.67/0.94 % set(auto2) -> set(auto).
% 0.67/0.94 % set(auto) -> set(auto_inference).
% 0.67/0.94 % set(auto) -> set(auto_setup).
% 0.67/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.94 % set(auto) -> set(auto_limits).
% 0.67/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.94 % set(auto) -> set(auto_denials).
% 0.67/0.94 % set(auto) -> set(auto_process).
% 0.67/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.94 % set(auto2) -> assign(stats, some).
% 0.67/0.94 % set(auto2) -> clear(echo_input).
% 0.67/0.94 % set(auto2) -> set(quiet).
% 0.67/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.94 % set(auto2) -> clear(print_given).
% 0.67/0.94 assign(lrs_ticks,-1).
% 0.67/0.94 assign(sos_limit,10000).
% 0.67/0.94 assign(order,kbo).
% 0.67/0.94 set(lex_order_vars).
% 0.67/0.94 clear(print_given).
% 0.67/0.94
% 0.67/0.94 % formulas(sos). % not echoed (11 formulas)
% 0.67/0.94
% 0.67/0.94 ============================== end of input ==========================
% 0.67/0.94
% 0.67/0.94 % From the command line: assign(max_seconds, 300).
% 0.67/0.94
% 0.67/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.94
% 0.67/0.94 % Formulas that are not ordinary clauses:
% 0.67/0.94 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 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.67/0.94 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.67/0.94 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.67/0.94 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.67/0.94 6 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 7 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 8 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 9 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 10 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.94 11 -(all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.94
% 0.67/0.94 ============================== end of process non-clausal formulas ===
% 0.67/0.94
% 0.67/0.94 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.94
% 0.67/0.94 ============================== PREDICATE ELIMINATION =================
% 0.67/0.94
% 0.67/0.94 ============================== end predicate elimination =============
% 0.67/0.94
% 0.67/0.94 Auto_denials: (non-Horn, no changes).
% 0.67/0.94
% 0.67/0.94 Term ordering decisions:
% 0.67/0.94 Function symbol KB weights: c1=1. c2=1. c3=1. f1=1. f2=1. f3=1. f5=1. f6=1. f7=1. singleton=1. union=1. powerset=1. f4=1.
% 0.67/0.94
% 0.67/0.94 ============================== end of process initial clauses ========
% 0.67/0.94
% 0.67/0.94 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.41
% 1.10/1.41 ============================== end of clauses for search =============
% 1.10/1.41
% 1.10/1.41 ============================== SEARCH ================================
% 1.10/1.41
% 1.10/1.41 % Starting search at 0.01 seconds.
% 1.10/1.41
% 1.10/1.41 Low Water (keep): wt=15.000, iters=3350
% 1.10/1.41
% 1.10/1.41 Low Water (keep): wt=14.000, iters=3358
% 1.10/1.41
% 1.10/1.41 Low Water (keep): wt=13.000, iters=3350
% 1.10/1.41
% 1.10/1.41 Low Water (keep): wt=12.000, iters=3339
% 1.10/1.41
% 1.10/1.41 ============================== PROOF =================================
% 1.10/1.41 % SZS status Theorem
% 1.10/1.41 % SZS output start Refutation
% 1.10/1.41
% 1.10/1.41 % Proof 1 at 0.47 (+ 0.02) seconds.
% 1.10/1.41 % Length of proof is 22.
% 1.10/1.41 % Level of proof is 9.
% 1.10/1.41 % Maximum clause weight is 17.000.
% 1.10/1.41 % Given clauses 305.
% 1.10/1.41
% 1.10/1.41 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.10/1.41 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.10/1.41 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.10/1.41 9 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 1.10/1.41 11 -(all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.10/1.41 13 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(9)].
% 1.10/1.41 18 union(A) = B | in(f5(A,B),B) | in(f6(A,B),A) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.10/1.41 19 union(A) = B | in(f5(A,B),B) | in(f5(A,B),f6(A,B)) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.10/1.41 21 union(powerset(c3)) != c3 # label(t99_zfmisc_1) # label(negated_conjecture). [clausify(11)].
% 1.10/1.41 26 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(4)].
% 1.10/1.41 29 powerset(A) != B | -in(C,B) | subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 1.10/1.41 30 powerset(A) != B | in(C,B) | -subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 1.10/1.41 37 union(A) = B | -in(f5(A,B),B) | -in(f5(A,B),C) | -in(C,A) # label(d4_tarski) # label(axiom). [clausify(5)].
% 1.10/1.41 40 union(A) = B | -in(f5(A,B),B) | -in(B,A). [factor(37,b,c)].
% 1.10/1.41 75 powerset(A) != B | in(A,B). [resolve(30,c,13,a)].
% 1.10/1.41 133 in(A,powerset(A)). [xx_res(75,a)].
% 1.10/1.41 157 -in(f5(powerset(c3),c3),c3). [ur(40,a,21,a,c,133,a)].
% 1.10/1.41 921 in(f6(powerset(c3),c3),powerset(c3)). [resolve(157,a,18,b),unit_del(a,21)].
% 1.10/1.41 936 powerset(c3) != powerset(A) | subset(f6(powerset(c3),c3),A). [resolve(921,a,29,b),flip(a)].
% 1.10/1.41 6089 subset(f6(powerset(c3),c3),c3). [xx_res(936,a)].
% 1.10/1.41 6176 -in(A,f6(powerset(c3),c3)) | in(A,c3). [resolve(6089,a,26,a)].
% 1.10/1.41 6209 $F. [resolve(6176,a,19,c),merge(c),unit_del(a,157),unit_del(b,21)].
% 1.10/1.41
% 1.10/1.41 % SZS output end Refutation
% 1.10/1.41 ============================== end of proof ==========================
% 1.10/1.41
% 1.10/1.41 ============================== STATISTICS ============================
% 1.10/1.41
% 1.10/1.41 Given=305. Generated=18373. Kept=6197. proofs=1.
% 1.10/1.41 Usable=284. Sos=5193. Demods=1. Limbo=1, Disabled=745. Hints=0.
% 1.10/1.41 Megabytes=4.34.
% 1.10/1.41 User_CPU=0.47, System_CPU=0.02, Wall_clock=0.
% 1.10/1.41
% 1.10/1.41 ============================== end of statistics =====================
% 1.10/1.41
% 1.10/1.41 ============================== end of search =========================
% 1.10/1.41
% 1.10/1.41 THEOREM PROVED
% 1.10/1.41 % SZS status Theorem
% 1.10/1.41
% 1.10/1.41 Exiting with 1 proof.
% 1.10/1.41
% 1.10/1.41 Process 3530 exit (max_proofs) Sun Jun 19 03:16:29 2022
% 1.10/1.41 Prover9 interrupted
%------------------------------------------------------------------------------