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