TSTP Solution File: SET920+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET920+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:24 EDT 2022
% Result : Theorem 0.66s 0.96s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET920+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.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 : Sun Jul 10 14:42:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.95 ============================== Prover9 ===============================
% 0.66/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.95 Process 7404 was started by sandbox on n014.cluster.edu,
% 0.66/0.95 Sun Jul 10 14:42:20 2022
% 0.66/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7251_n014.cluster.edu".
% 0.66/0.95 ============================== end of head ===========================
% 0.66/0.95
% 0.66/0.95 ============================== INPUT =================================
% 0.66/0.95
% 0.66/0.95 % Reading from file /tmp/Prover9_7251_n014.cluster.edu
% 0.66/0.95
% 0.66/0.95 set(prolog_style_variables).
% 0.66/0.95 set(auto2).
% 0.66/0.95 % set(auto2) -> set(auto).
% 0.66/0.95 % set(auto) -> set(auto_inference).
% 0.66/0.95 % set(auto) -> set(auto_setup).
% 0.66/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.95 % set(auto) -> set(auto_limits).
% 0.66/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.95 % set(auto) -> set(auto_denials).
% 0.66/0.95 % set(auto) -> set(auto_process).
% 0.66/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.95 % set(auto2) -> assign(stats, some).
% 0.66/0.95 % set(auto2) -> clear(echo_input).
% 0.66/0.95 % set(auto2) -> set(quiet).
% 0.66/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.95 % set(auto2) -> clear(print_given).
% 0.66/0.95 assign(lrs_ticks,-1).
% 0.66/0.95 assign(sos_limit,10000).
% 0.66/0.95 assign(order,kbo).
% 0.66/0.95 set(lex_order_vars).
% 0.66/0.95 clear(print_given).
% 0.66/0.95
% 0.66/0.95 % formulas(sos). % not echoed (9 formulas)
% 0.66/0.95
% 0.66/0.95 ============================== end of input ==========================
% 0.66/0.95
% 0.66/0.95 % From the command line: assign(max_seconds, 300).
% 0.66/0.95
% 0.66/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.95
% 0.66/0.95 % Formulas that are not ordinary clauses:
% 0.66/0.95 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 3 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 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.66/0.95 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 6 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 7 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 8 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.95 9 -(all A all B all C (set_intersection2(unordered_pair(A,B),C) = unordered_pair(A,B) -> in(A,C))) # label(t63_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.66/0.95
% 0.66/0.95 ============================== end of process non-clausal formulas ===
% 0.66/0.95
% 0.66/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.95
% 0.66/0.95 ============================== PREDICATE ELIMINATION =================
% 0.66/0.95
% 0.66/0.95 ============================== end predicate elimination =============
% 0.66/0.95
% 0.66/0.95 Auto_denials: (non-Horn, no changes).
% 0.66/0.95
% 0.66/0.95 Term ordering decisions:
% 0.66/0.95 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. unordered_pair=1. f1=1. f2=1.
% 0.66/0.95
% 0.66/0.95 ============================== end of process initial clauses ========
% 0.66/0.95
% 0.66/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.95
% 0.66/0.95 ============================== end of clauses for search =============
% 0.66/0.95
% 0.66/0.95 ============================== SEARCH ================================
% 0.66/0.96
% 0.66/0.96 % Starting search at 0.01 seconds.
% 0.66/0.96
% 0.66/0.96 ============================== PROOF =================================
% 0.66/0.96 % SZS status Theorem
% 0.66/0.96 % SZS output start Refutation
% 0.66/0.96
% 0.66/0.96 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.66/0.96 % Length of proof is 17.
% 0.66/0.96 % Level of proof is 5.
% 0.66/0.96 % Maximum clause weight is 11.000.
% 0.66/0.96 % Given clauses 32.
% 0.66/0.96
% 0.66/0.96 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.96 3 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.96 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.66/0.96 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.96 6 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.96 9 -(all A all B all C (set_intersection2(unordered_pair(A,B),C) = unordered_pair(A,B) -> in(A,C))) # label(t63_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.66/0.96 11 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(6)].
% 0.66/0.96 12 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(2)].
% 0.66/0.96 13 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(3)].
% 0.66/0.96 14 set_intersection2(unordered_pair(c3,c4),c5) = unordered_pair(c3,c4) # label(t63_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.66/0.96 15 set_intersection2(c5,unordered_pair(c3,c4)) = unordered_pair(c3,c4). [copy(14),rewrite([13(5)])].
% 0.66/0.96 20 -in(c3,c5) # label(t63_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.66/0.96 23 unordered_pair(A,B) != C | in(D,C) | D != B # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.66/0.96 24 set_intersection2(A,B) != C | -in(D,C) | in(D,A) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 0.66/0.96 63 -in(c3,unordered_pair(c3,c4)). [ur(24,a,15,a,c,20,a)].
% 0.66/0.96 158 unordered_pair(c3,c4) != unordered_pair(A,c3). [ur(23,b,63,a,c,11,a(flip)),rewrite([11(3)]),flip(a)].
% 0.66/0.96 159 $F. [resolve(158,a,12,a)].
% 0.66/0.96
% 0.66/0.96 % SZS output end Refutation
% 0.66/0.96 ============================== end of proof ==========================
% 0.66/0.96
% 0.66/0.96 ============================== STATISTICS ============================
% 0.66/0.96
% 0.66/0.96 Given=32. Generated=377. Kept=148. proofs=1.
% 0.66/0.96 Usable=30. Sos=105. Demods=4. Limbo=1, Disabled=31. Hints=0.
% 0.66/0.96 Megabytes=0.15.
% 0.66/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.66/0.96
% 0.66/0.96 ============================== end of statistics =====================
% 0.66/0.96
% 0.66/0.96 ============================== end of search =========================
% 0.66/0.96
% 0.66/0.96 THEOREM PROVED
% 0.66/0.96 % SZS status Theorem
% 0.66/0.96
% 0.66/0.96 Exiting with 1 proof.
% 0.66/0.96
% 0.66/0.96 Process 7404 exit (max_proofs) Sun Jul 10 14:42:20 2022
% 0.66/0.96 Prover9 interrupted
%------------------------------------------------------------------------------