TSTP Solution File: SET884+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 04:33:10 EDT 2022
% Result : Theorem 0.80s 1.06s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 11 06:57:03 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.80/1.06 ============================== Prover9 ===============================
% 0.80/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.06 Process 5660 was started by sandbox on n027.cluster.edu,
% 0.80/1.06 Mon Jul 11 06:57:04 2022
% 0.80/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5507_n027.cluster.edu".
% 0.80/1.06 ============================== end of head ===========================
% 0.80/1.06
% 0.80/1.06 ============================== INPUT =================================
% 0.80/1.06
% 0.80/1.06 % Reading from file /tmp/Prover9_5507_n027.cluster.edu
% 0.80/1.06
% 0.80/1.06 set(prolog_style_variables).
% 0.80/1.06 set(auto2).
% 0.80/1.06 % set(auto2) -> set(auto).
% 0.80/1.06 % set(auto) -> set(auto_inference).
% 0.80/1.06 % set(auto) -> set(auto_setup).
% 0.80/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.06 % set(auto) -> set(auto_limits).
% 0.80/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.06 % set(auto) -> set(auto_denials).
% 0.80/1.06 % set(auto) -> set(auto_process).
% 0.80/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.06 % set(auto2) -> assign(stats, some).
% 0.80/1.06 % set(auto2) -> clear(echo_input).
% 0.80/1.06 % set(auto2) -> set(quiet).
% 0.80/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.06 % set(auto2) -> clear(print_given).
% 0.80/1.06 assign(lrs_ticks,-1).
% 0.80/1.06 assign(sos_limit,10000).
% 0.80/1.06 assign(order,kbo).
% 0.80/1.06 set(lex_order_vars).
% 0.80/1.06 clear(print_given).
% 0.80/1.06
% 0.80/1.06 % formulas(sos). % not echoed (9 formulas)
% 0.80/1.06
% 0.80/1.06 ============================== end of input ==========================
% 0.80/1.06
% 0.80/1.06 % From the command line: assign(max_seconds, 300).
% 0.80/1.06
% 0.80/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.06
% 0.80/1.06 % Formulas that are not ordinary clauses:
% 0.80/1.06 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.80/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.80/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.80/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.80/1.06 5 (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.80/1.06 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.06 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.06 8 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.06 9 -(all A all B all C -(subset(singleton(A),unordered_pair(B,C)) & A != B & A != C)) # label(t25_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.06
% 0.80/1.06 ============================== end of process non-clausal formulas ===
% 0.80/1.06
% 0.80/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.06
% 0.80/1.06 ============================== PREDICATE ELIMINATION =================
% 0.80/1.06 10 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.80/1.06 11 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(8)].
% 0.80/1.06 12 subset(singleton(c3),unordered_pair(c4,c5)) # label(t25_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.80/1.06 13 subset(A,B) | in(f3(A,B),A) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.80/1.06 14 subset(A,B) | -in(f3(A,B),B) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.80/1.06 Derived: -in(A,singleton(c3)) | in(A,unordered_pair(c4,c5)). [resolve(10,a,12,a)].
% 0.80/1.06 Derived: -in(A,B) | in(A,C) | in(f3(B,C),B). [resolve(10,a,13,a)].
% 0.80/1.06 Derived: -in(A,B) | in(A,C) | -in(f3(B,C),C). [resolve(10,a,14,a)].
% 0.80/1.06
% 0.80/1.06 ============================== end predicate elimination =============
% 0.80/1.06
% 0.80/1.06 Auto_denials: (non-Horn, no changes).
% 0.80/1.06
% 0.80/1.06 Term ordering decisions:
% 0.80/1.06
% 0.80/1.06 % Assigning unary symbol singleton kb_weight 0 and highest precedence (13).
% 0.80/1.06 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. unordered_pair=1. f1=1. f3=1. f2=1. singleton=0.
% 0.80/1.06
% 0.80/1.06 ============================== end of process initial clauses ========
% 0.80/1.06
% 0.80/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.06
% 0.80/1.06 ============================== end of clauses for search =============
% 0.80/1.06
% 0.80/1.06 ============================== SEARCH ================================
% 0.80/1.06
% 0.80/1.06 % Starting search at 0.01 seconds.
% 0.80/1.06
% 0.80/1.06 ============================== PROOF =================================
% 0.80/1.06 % SZS status Theorem
% 0.80/1.06 % SZS output start Refutation
% 0.80/1.06
% 0.80/1.06 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.80/1.06 % Length of proof is 17.
% 0.80/1.06 % Level of proof is 4.
% 0.80/1.06 % Maximum clause weight is 14.000.
% 0.80/1.06 % Given clauses 29.
% 0.80/1.06
% 0.80/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.80/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.80/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.80/1.06 5 (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.80/1.06 9 -(all A all B all C -(subset(singleton(A),unordered_pair(B,C)) & A != B & A != C)) # label(t25_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.06 10 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.80/1.06 12 subset(singleton(c3),unordered_pair(c4,c5)) # label(t25_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.80/1.06 16 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(2)].
% 0.80/1.06 20 c4 != c3 # label(t25_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.80/1.06 21 c5 != c3 # label(t25_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.80/1.06 24 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.80/1.06 28 unordered_pair(A,B) != C | -in(D,C) | D = A | D = B # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.80/1.06 31 -in(A,singleton(c3)) | in(A,unordered_pair(c4,c5)). [resolve(10,a,12,a)].
% 0.80/1.06 53 in(A,singleton(B)) | A != B. [xx_res(24,a)].
% 0.80/1.06 66 -in(c3,unordered_pair(c4,c5)). [ur(28,a,16,a,c,21,a(flip),d,20,a(flip))].
% 0.80/1.06 105 in(A,singleton(A)). [xx_res(53,b)].
% 0.80/1.06 109 $F. [resolve(105,a,31,a),unit_del(a,66)].
% 0.80/1.06
% 0.80/1.06 % SZS output end Refutation
% 0.80/1.06 ============================== end of proof ==========================
% 0.80/1.06
% 0.80/1.06 ============================== STATISTICS ============================
% 0.80/1.06
% 0.80/1.06 Given=29. Generated=202. Kept=94. proofs=1.
% 0.80/1.06 Usable=29. Sos=54. Demods=1. Limbo=3, Disabled=32. Hints=0.
% 0.80/1.06 Megabytes=0.12.
% 0.80/1.06 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.80/1.06
% 0.80/1.06 ============================== end of statistics =====================
% 0.80/1.06
% 0.80/1.06 ============================== end of search =========================
% 0.80/1.06
% 0.80/1.06 THEOREM PROVED
% 0.80/1.06 % SZS status Theorem
% 0.80/1.06
% 0.80/1.06 Exiting with 1 proof.
% 0.80/1.06
% 0.80/1.06 Process 5660 exit (max_proofs) Mon Jul 11 06:57:04 2022
% 0.80/1.06 Prover9 interrupted
%------------------------------------------------------------------------------