TSTP Solution File: SEU149+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:22 EDT 2022
% Result : Theorem 0.76s 1.06s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n006.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 : Mon Jun 20 01:56:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.76/1.06 ============================== Prover9 ===============================
% 0.76/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.06 Process 22273 was started by sandbox on n006.cluster.edu,
% 0.76/1.06 Mon Jun 20 01:56:56 2022
% 0.76/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22120_n006.cluster.edu".
% 0.76/1.06 ============================== end of head ===========================
% 0.76/1.06
% 0.76/1.06 ============================== INPUT =================================
% 0.76/1.06
% 0.76/1.06 % Reading from file /tmp/Prover9_22120_n006.cluster.edu
% 0.76/1.06
% 0.76/1.06 set(prolog_style_variables).
% 0.76/1.06 set(auto2).
% 0.76/1.06 % set(auto2) -> set(auto).
% 0.76/1.06 % set(auto) -> set(auto_inference).
% 0.76/1.06 % set(auto) -> set(auto_setup).
% 0.76/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.06 % set(auto) -> set(auto_limits).
% 0.76/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.06 % set(auto) -> set(auto_denials).
% 0.76/1.06 % set(auto) -> set(auto_process).
% 0.76/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.06 % set(auto2) -> assign(stats, some).
% 0.76/1.06 % set(auto2) -> clear(echo_input).
% 0.76/1.06 % set(auto2) -> set(quiet).
% 0.76/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.06 % set(auto2) -> clear(print_given).
% 0.76/1.06 assign(lrs_ticks,-1).
% 0.76/1.06 assign(sos_limit,10000).
% 0.76/1.06 assign(order,kbo).
% 0.76/1.06 set(lex_order_vars).
% 0.76/1.06 clear(print_given).
% 0.76/1.06
% 0.76/1.06 % formulas(sos). % not echoed (7 formulas)
% 0.76/1.06
% 0.76/1.06 ============================== end of input ==========================
% 0.76/1.06
% 0.76/1.06 % From the command line: assign(max_seconds, 300).
% 0.76/1.06
% 0.76/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.06
% 0.76/1.06 % Formulas that are not ordinary clauses:
% 0.76/1.06 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 4 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 5 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 6 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 7 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.06
% 0.76/1.06 ============================== end of process non-clausal formulas ===
% 0.76/1.06
% 0.76/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.06
% 0.76/1.06 ============================== PREDICATE ELIMINATION =================
% 0.76/1.06
% 0.76/1.06 ============================== end predicate elimination =============
% 0.76/1.06
% 0.76/1.06 Auto_denials: (non-Horn, no changes).
% 0.76/1.06
% 0.76/1.06 Term ordering decisions:
% 0.76/1.06
% 0.76/1.06 % Assigning unary symbol singleton kb_weight 0 and highest precedence (9).
% 0.76/1.06 Function symbol KB weights: c1=1. c2=1. c3=1. unordered_pair=1. f1=1. f2=1. singleton=0.
% 0.76/1.06
% 0.76/1.06 ============================== end of process initial clauses ========
% 0.76/1.06
% 0.76/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.06
% 0.76/1.06 ============================== end of clauses for search =============
% 0.76/1.06
% 0.76/1.06 ============================== SEARCH ================================
% 0.76/1.06
% 0.76/1.06 % Starting search at 0.01 seconds.
% 0.76/1.06
% 0.76/1.06 ============================== PROOF =================================
% 0.76/1.06 % SZS status Theorem
% 0.76/1.06 % SZS output start Refutation
% 0.76/1.06
% 0.76/1.06 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.76/1.06 % Length of proof is 10.
% 0.76/1.06 % Level of proof is 4.
% 0.76/1.06 % Maximum clause weight is 11.000.
% 0.76/1.06 % Given clauses 19.
% 0.76/1.06
% 0.76/1.06 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 4 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 7 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.06 8 singleton(c1) = unordered_pair(c2,c3) # label(t8_zfmisc_1) # label(negated_conjecture). [clausify(7)].
% 0.76/1.06 9 unordered_pair(c2,c3) = singleton(c1). [copy(8),flip(a)].
% 0.76/1.06 13 c2 != c1 # label(t8_zfmisc_1) # label(negated_conjecture). [clausify(7)].
% 0.76/1.06 15 singleton(A) != B | -in(C,B) | C = A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.76/1.06 17 unordered_pair(A,B) != C | in(D,C) | D != A # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.76/1.06 34 -in(c2,singleton(c1)). [ur(15,a,9,a(flip),c,13,a),rewrite([9(4)])].
% 0.76/1.06 85 $F. [ur(17,a,9,a,b,34,a),xx(a)].
% 0.76/1.06
% 0.76/1.06 % SZS output end Refutation
% 0.76/1.06 ============================== end of proof ==========================
% 0.76/1.06
% 0.76/1.06 ============================== STATISTICS ============================
% 0.76/1.06
% 0.76/1.06 Given=19. Generated=162. Kept=76. proofs=1.
% 0.76/1.06 Usable=19. Sos=44. Demods=2. Limbo=2, Disabled=25. Hints=0.
% 0.76/1.06 Megabytes=0.09.
% 0.76/1.06 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.76/1.06
% 0.76/1.06 ============================== end of statistics =====================
% 0.76/1.06
% 0.76/1.06 ============================== end of search =========================
% 0.76/1.06
% 0.76/1.06 THEOREM PROVED
% 0.76/1.06 % SZS status Theorem
% 0.76/1.06
% 0.76/1.06 Exiting with 1 proof.
% 0.76/1.06
% 0.76/1.06 Process 22273 exit (max_proofs) Mon Jun 20 01:56:56 2022
% 0.76/1.06 Prover9 interrupted
%------------------------------------------------------------------------------