TSTP Solution File: SEU127+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:10 EDT 2022
% Result : Theorem 0.91s 1.18s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 13:34:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 29373 was started by sandbox on n005.cluster.edu,
% 0.43/0.99 Sun Jun 19 13:34:39 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29220_n005.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_29220_n005.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (35 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 2 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 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.43/0.99 4 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 5 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 6 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 7 (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.43/0.99 8 (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.43/0.99 9 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 11 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 12 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 13 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 14 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 15 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 16 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 17 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 18 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 19 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 20 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 21 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 22 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 23 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 24 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 25 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 26 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 27 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 28 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 29 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 30 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 31 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 32 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.91/1.18 33 (all A all B all C (subset(A,B) & subset(C,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.91/1.18 34 -(all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.91/1.18
% 0.91/1.18 ============================== end of process non-clausal formulas ===
% 0.91/1.18
% 0.91/1.18 ============================== PROCESS INITIAL CLAUSES ===============
% 0.91/1.18
% 0.91/1.18 ============================== PREDICATE ELIMINATION =================
% 0.91/1.18
% 0.91/1.18 ============================== end predicate elimination =============
% 0.91/1.18
% 0.91/1.18 Auto_denials: (non-Horn, no changes).
% 0.91/1.18
% 0.91/1.18 Term ordering decisions:
% 0.91/1.18
% 0.91/1.18 % Assigning unary symbol f1 kb_weight 0 and highest precedence (18).
% 0.91/1.18 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_union2=1. set_intersection2=1. f3=1. f5=1. f6=1. f2=1. f4=1. f1=0.
% 0.91/1.18
% 0.91/1.18 ============================== end of process initial clauses ========
% 0.91/1.18
% 0.91/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.91/1.18
% 0.91/1.18 ============================== end of clauses for search =============
% 0.91/1.18
% 0.91/1.18 ============================== SEARCH ================================
% 0.91/1.18
% 0.91/1.18 % Starting search at 0.02 seconds.
% 0.91/1.18
% 0.91/1.18 ============================== PROOF =================================
% 0.91/1.18 % SZS status Theorem
% 0.91/1.18 % SZS output start Refutation
% 0.91/1.18
% 0.91/1.18 % Proof 1 at 0.20 (+ 0.00) seconds.
% 0.91/1.18 % Length of proof is 13.
% 0.91/1.18 % Level of proof is 4.
% 0.91/1.18 % Maximum clause weight is 11.000.
% 0.91/1.18 % Given clauses 238.
% 0.91/1.18
% 0.91/1.18 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.91/1.18 7 (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.91/1.18 8 (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.91/1.18 34 -(all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.91/1.18 45 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(3)].
% 0.91/1.18 47 subset(A,B) | in(f3(A,B),A) # label(d3_tarski) # label(axiom). [clausify(7)].
% 0.91/1.18 56 -subset(set_intersection2(c3,c4),c3) # label(t17_xboole_1) # label(negated_conjecture). [clausify(34)].
% 0.91/1.18 69 subset(A,B) | -in(f3(A,B),B) # label(d3_tarski) # label(axiom). [clausify(7)].
% 0.91/1.18 79 set_intersection2(A,B) != C | -in(D,C) | in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(8)].
% 0.91/1.18 112 in(f3(set_intersection2(c3,c4),c3),set_intersection2(c3,c4)). [resolve(56,a,47,a)].
% 0.91/1.18 149 -in(f3(set_intersection2(c3,c4),c3),c3). [ur(69,a,56,a)].
% 0.91/1.18 1966 set_intersection2(c3,c4) != set_intersection2(A,c3). [ur(79,b,112,a,c,149,a),flip(a)].
% 0.91/1.18 1967 $F. [resolve(1966,a,45,a)].
% 0.91/1.18
% 0.91/1.18 % SZS output end Refutation
% 0.91/1.18 ============================== end of proof ==========================
% 0.91/1.18
% 0.91/1.18 ============================== STATISTICS ============================
% 0.91/1.18
% 0.91/1.18 Given=238. Generated=7808. Kept=1931. proofs=1.
% 0.91/1.18 Usable=233. Sos=1644. Demods=9. Limbo=8, Disabled=96. Hints=0.
% 0.91/1.18 Megabytes=1.38.
% 0.91/1.18 User_CPU=0.20, System_CPU=0.00, Wall_clock=0.
% 0.91/1.18
% 0.91/1.18 ============================== end of statistics =====================
% 0.91/1.18
% 0.91/1.18 ============================== end of search =========================
% 0.91/1.18
% 0.91/1.18 THEOREM PROVED
% 0.91/1.18 % SZS status Theorem
% 0.91/1.18
% 0.91/1.18 Exiting with 1 proof.
% 0.91/1.18
% 0.91/1.18 Process 29373 exit (max_proofs) Sun Jun 19 13:34:39 2022
% 0.91/1.18 Prover9 interrupted
%------------------------------------------------------------------------------