TSTP Solution File: SEU147+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU147+3 : TPTP v8.1.0. Bugfixed v4.0.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:20 EDT 2022
% Result : Theorem 0.75s 1.06s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU147+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 22:21:07 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.75/1.06 ============================== Prover9 ===============================
% 0.75/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.06 Process 25789 was started by sandbox2 on n008.cluster.edu,
% 0.75/1.06 Sat Jun 18 22:21:08 2022
% 0.75/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25635_n008.cluster.edu".
% 0.75/1.06 ============================== end of head ===========================
% 0.75/1.06
% 0.75/1.06 ============================== INPUT =================================
% 0.75/1.06
% 0.75/1.06 % Reading from file /tmp/Prover9_25635_n008.cluster.edu
% 0.75/1.06
% 0.75/1.06 set(prolog_style_variables).
% 0.75/1.06 set(auto2).
% 0.75/1.06 % set(auto2) -> set(auto).
% 0.75/1.06 % set(auto) -> set(auto_inference).
% 0.75/1.06 % set(auto) -> set(auto_setup).
% 0.75/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.06 % set(auto) -> set(auto_limits).
% 0.75/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.06 % set(auto) -> set(auto_denials).
% 0.75/1.06 % set(auto) -> set(auto_process).
% 0.75/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.06 % set(auto2) -> assign(stats, some).
% 0.75/1.06 % set(auto2) -> clear(echo_input).
% 0.75/1.06 % set(auto2) -> set(quiet).
% 0.75/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.06 % set(auto2) -> clear(print_given).
% 0.75/1.06 assign(lrs_ticks,-1).
% 0.75/1.06 assign(sos_limit,10000).
% 0.75/1.06 assign(order,kbo).
% 0.75/1.06 set(lex_order_vars).
% 0.75/1.06 clear(print_given).
% 0.75/1.06
% 0.75/1.06 % formulas(sos). % not echoed (10 formulas)
% 0.75/1.06
% 0.75/1.06 ============================== end of input ==========================
% 0.75/1.06
% 0.75/1.06 % From the command line: assign(max_seconds, 300).
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.06
% 0.75/1.06 % Formulas that are not ordinary clauses:
% 0.75/1.06 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 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.75/1.06 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.75/1.06 4 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 5 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 6 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 7 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 8 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06
% 0.75/1.06 ============================== end of process non-clausal formulas ===
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.06
% 0.75/1.06 ============================== PREDICATE ELIMINATION =================
% 0.75/1.06
% 0.75/1.06 ============================== end predicate elimination =============
% 0.75/1.06
% 0.75/1.06 Auto_denials: (non-Horn, no changes).
% 0.75/1.06
% 0.75/1.06 Term ordering decisions:
% 0.75/1.06 Function symbol KB weights: empty_set=1. c1=1. c2=1. f1=1. f2=1. f3=1. powerset=1. singleton=1.
% 0.75/1.06
% 0.75/1.06 ============================== end of process initial clauses ========
% 0.75/1.06
% 0.75/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.06
% 0.75/1.06 ============================== end of clauses for search =============
% 0.75/1.06
% 0.75/1.06 ============================== SEARCH ================================
% 0.75/1.06
% 0.75/1.06 % Starting search at 0.01 seconds.
% 0.75/1.06
% 0.75/1.06 ============================== PROOF =================================
% 0.75/1.06 % SZS status Theorem
% 0.75/1.06 % SZS output start Refutation
% 0.75/1.06
% 0.75/1.06 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.06 % Length of proof is 21.
% 0.75/1.06 % Level of proof is 6.
% 0.75/1.06 % Maximum clause weight is 18.000.
% 0.75/1.06 % Given clauses 62.
% 0.75/1.06
% 0.75/1.06 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.75/1.06 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.75/1.06 6 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 8 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 11 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(6)].
% 0.75/1.06 14 powerset(A) = B | in(f2(A,B),B) | subset(f2(A,B),A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 0.75/1.06 16 powerset(empty_set) != singleton(empty_set) # label(t1_zfmisc_1) # label(negated_conjecture). [assumption].
% 0.75/1.06 17 singleton(empty_set) != powerset(empty_set). [copy(16),flip(a)].
% 0.75/1.06 19 -subset(A,empty_set) | empty_set = A # label(t3_xboole_1) # label(axiom). [clausify(8)].
% 0.75/1.06 20 singleton(A) != B | -in(C,B) | C = A # label(d1_tarski) # label(axiom). [clausify(2)].
% 0.75/1.06 21 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(2)].
% 0.75/1.06 26 powerset(A) = B | -in(f2(A,B),B) | -subset(f2(A,B),A) # label(d1_zfmisc_1) # label(axiom). [clausify(3)].
% 0.75/1.06 27 singleton(empty_set) = c_0. [new_symbol(17)].
% 0.75/1.06 30 powerset(empty_set) != c_0. [back_rewrite(17),rewrite([27(2)]),flip(a)].
% 0.75/1.06 34 f2(empty_set,A) = empty_set | powerset(empty_set) = A | in(f2(empty_set,A),A). [resolve(19,a,14,c),flip(a)].
% 0.75/1.06 45 in(A,c_0) | empty_set != A. [resolve(27,a,21,a),flip(b)].
% 0.75/1.06 60 in(empty_set,c_0). [xx_res(45,b)].
% 0.75/1.06 99 f2(empty_set,A) = empty_set | powerset(empty_set) = A | singleton(B) != A | f2(empty_set,A) = B. [resolve(34,c,20,b)].
% 0.75/1.06 101 f2(empty_set,A) = empty_set | powerset(empty_set) = A | c_0 != A. [factor(99,a,d),rewrite([27(9)])].
% 0.75/1.06 118 f2(empty_set,c_0) = empty_set. [resolve(101,c,27,a(flip)),rewrite([27(3),27(9)]),unit_del(b,30)].
% 0.75/1.06 119 $F. [para(118(a,1),26(c,1)),rewrite([118(7)]),unit_del(a,30),unit_del(b,60),unit_del(c,11)].
% 0.75/1.06
% 0.75/1.06 % SZS output end Refutation
% 0.75/1.06 ============================== end of proof ==========================
% 0.75/1.06
% 0.75/1.06 ============================== STATISTICS ============================
% 0.75/1.06
% 0.75/1.06 Given=62. Generated=334. Kept=109. proofs=1.
% 0.75/1.06 Usable=62. Sos=41. Demods=2. Limbo=0, Disabled=23. Hints=0.
% 0.75/1.06 Megabytes=0.11.
% 0.75/1.06 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.06
% 0.75/1.06 ============================== end of statistics =====================
% 0.75/1.06
% 0.75/1.06 ============================== end of search =========================
% 0.75/1.06
% 0.75/1.06 THEOREM PROVED
% 0.75/1.06 % SZS status Theorem
% 0.75/1.06
% 0.75/1.06 Exiting with 1 proof.
% 0.75/1.06
% 0.75/1.06 Process 25789 exit (max_proofs) Sat Jun 18 22:21:08 2022
% 0.75/1.06 Prover9 interrupted
%------------------------------------------------------------------------------