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