TSTP Solution File: SEU160+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.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:29 EDT 2022
% Result : Theorem 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n022.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 : Sun Jun 19 07:54:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 14466 was started by sandbox on n022.cluster.edu,
% 0.45/0.99 Sun Jun 19 07:54:47 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14121_n022.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_14121_n022.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99 1 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 2 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 3 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 4 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(l4_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 5 -(all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(t39_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials: (non-Horn, no changes).
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99
% 0.45/0.99 % Assigning unary symbol singleton kb_weight 0 and highest precedence (9).
% 0.45/0.99 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. singleton=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/0.99 % Length of proof is 16.
% 0.45/0.99 % Level of proof is 6.
% 0.45/0.99 % Maximum clause weight is 11.000.
% 0.45/0.99 % Given clauses 15.
% 0.45/0.99
% 0.45/0.99 1 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 4 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(l4_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 5 -(all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(t39_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99 8 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(1)].
% 0.45/0.99 9 subset(c3,singleton(c4)) | empty_set = c3 | singleton(c4) = c3 # label(t39_zfmisc_1) # label(negated_conjecture). [clausify(5)].
% 0.45/0.99 10 subset(c3,singleton(c4)) | c3 = empty_set | singleton(c4) = c3. [copy(9),flip(b)].
% 0.45/0.99 12 -subset(c3,singleton(c4)) | empty_set != c3 # label(t39_zfmisc_1) # label(negated_conjecture). [clausify(5)].
% 0.45/0.99 13 -subset(c3,singleton(c4)) | c3 != empty_set. [copy(12),flip(b)].
% 0.45/0.99 14 -subset(c3,singleton(c4)) | singleton(c4) != c3 # label(t39_zfmisc_1) # label(negated_conjecture). [clausify(5)].
% 0.45/0.99 15 subset(A,singleton(B)) | empty_set != A # label(l4_zfmisc_1) # label(axiom). [clausify(4)].
% 0.45/0.99 17 -subset(A,singleton(B)) | empty_set = A | singleton(B) = A # label(l4_zfmisc_1) # label(axiom). [clausify(4)].
% 0.45/0.99 18 subset(empty_set,singleton(A)). [xx_res(15,b)].
% 0.45/0.99 19 c3 = empty_set | singleton(c4) = c3. [resolve(17,a,10,a),flip(a),merge(c),merge(d)].
% 0.45/0.99 21 c3 = empty_set | singleton(c4) != c3. [para(19(b,1),14(a,2)),unit_del(b,8)].
% 0.45/0.99 25 c3 = empty_set. [resolve(21,b,19,b),merge(b)].
% 0.45/0.99 27 $F. [back_rewrite(13),rewrite([25(1),25(5)]),xx(b),unit_del(a,18)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=15. Generated=32. Kept=19. proofs=1.
% 0.45/0.99 Usable=8. Sos=0. Demods=1. Limbo=2, Disabled=19. Hints=0.
% 0.45/0.99 Megabytes=0.04.
% 0.45/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 14466 exit (max_proofs) Sun Jun 19 07:54:47 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------