TSTP Solution File: SEU124+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:08 EDT 2022
% Result : Theorem 1.28s 1.53s
% Output : Refutation 1.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n008.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 : Mon Jun 20 10:06:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 3120 was started by sandbox on n008.cluster.edu,
% 0.43/1.00 Mon Jun 20 10:06:53 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2967_n008.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_2967_n008.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (31 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 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/1.00 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/1.00 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/1.00 5 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 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/1.00 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/1.00 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/1.00 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/1.00 10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 11 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 12 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 13 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 14 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 15 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 16 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 17 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 18 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 19 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 20 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 21 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 22 (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].
% 1.28/1.52 23 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 1.28/1.52 24 (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].
% 1.28/1.52 25 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 1.28/1.52 26 (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].
% 1.28/1.52 27 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 28 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 29 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.52 30 -(all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.28/1.52
% 1.28/1.52 ============================== end of process non-clausal formulas ===
% 1.28/1.52
% 1.28/1.52 ============================== PROCESS INITIAL CLAUSES ===============
% 1.28/1.52
% 1.28/1.52 ============================== PREDICATE ELIMINATION =================
% 1.28/1.52
% 1.28/1.52 ============================== end predicate elimination =============
% 1.28/1.53
% 1.28/1.53 Auto_denials: (non-Horn, no changes).
% 1.28/1.53
% 1.28/1.53 Term ordering decisions:
% 1.28/1.53
% 1.28/1.53 % Assigning unary symbol f1 kb_weight 0 and highest precedence (18).
% 1.28/1.53 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_intersection2=1. set_union2=1. f3=1. f5=1. f6=1. f2=1. f4=1. f1=0.
% 1.28/1.53
% 1.28/1.53 ============================== end of process initial clauses ========
% 1.28/1.53
% 1.28/1.53 ============================== CLAUSES FOR SEARCH ====================
% 1.28/1.53
% 1.28/1.53 ============================== end of clauses for search =============
% 1.28/1.53
% 1.28/1.53 ============================== SEARCH ================================
% 1.28/1.53
% 1.28/1.53 % Starting search at 0.02 seconds.
% 1.28/1.53
% 1.28/1.53 Low Water (keep): wt=25.000, iters=3376
% 1.28/1.53
% 1.28/1.53 Low Water (keep): wt=21.000, iters=3349
% 1.28/1.53
% 1.28/1.53 Low Water (keep): wt=17.000, iters=3339
% 1.28/1.53
% 1.28/1.53 Low Water (keep): wt=15.000, iters=3337
% 1.28/1.53
% 1.28/1.53 ============================== PROOF =================================
% 1.28/1.53 % SZS status Theorem
% 1.28/1.53 % SZS output start Refutation
% 1.28/1.53
% 1.28/1.53 % Proof 1 at 0.52 (+ 0.02) seconds.
% 1.28/1.53 % Length of proof is 13.
% 1.28/1.53 % Level of proof is 4.
% 1.28/1.53 % Maximum clause weight is 11.000.
% 1.28/1.53 % Given clauses 367.
% 1.28/1.53
% 1.28/1.53 2 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.28/1.53 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].
% 1.28/1.53 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].
% 1.28/1.53 30 -(all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.28/1.53 38 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(2)].
% 1.28/1.53 41 subset(A,B) | in(f3(A,B),A) # label(d3_tarski) # label(axiom). [clausify(7)].
% 1.28/1.53 50 -subset(c3,set_union2(c3,c4)) # label(t7_xboole_1) # label(negated_conjecture). [clausify(30)].
% 1.28/1.53 63 subset(A,B) | -in(f3(A,B),B) # label(d3_tarski) # label(axiom). [clausify(7)].
% 1.28/1.53 70 set_union2(A,B) != C | in(D,C) | -in(D,B) # label(d2_xboole_0) # label(axiom). [clausify(6)].
% 1.28/1.53 104 in(f3(c3,set_union2(c3,c4)),c3). [resolve(50,a,41,a)].
% 1.28/1.53 141 -in(f3(c3,set_union2(c3,c4)),set_union2(c3,c4)). [ur(63,a,50,a)].
% 1.28/1.53 6127 set_union2(c3,c4) != set_union2(A,c3). [ur(70,b,141,a,c,104,a),flip(a)].
% 1.28/1.53 6128 $F. [resolve(6127,a,38,a)].
% 1.28/1.53
% 1.28/1.53 % SZS output end Refutation
% 1.28/1.53 ============================== end of proof ==========================
% 1.28/1.53
% 1.28/1.53 ============================== STATISTICS ============================
% 1.28/1.53
% 1.28/1.53 Given=367. Generated=22594. Kept=6096. proofs=1.
% 1.28/1.53 Usable=343. Sos=5148. Demods=7. Limbo=14, Disabled=637. Hints=0.
% 1.28/1.53 Megabytes=4.86.
% 1.28/1.53 User_CPU=0.52, System_CPU=0.02, Wall_clock=0.
% 1.28/1.53
% 1.28/1.53 ============================== end of statistics =====================
% 1.28/1.53
% 1.28/1.53 ============================== end of search =========================
% 1.28/1.53
% 1.28/1.53 THEOREM PROVED
% 1.28/1.53 % SZS status Theorem
% 1.28/1.53
% 1.28/1.53 Exiting with 1 proof.
% 1.28/1.53
% 1.28/1.53 Process 3120 exit (max_proofs) Mon Jun 20 10:06:53 2022
% 1.28/1.53 Prover9 interrupted
%------------------------------------------------------------------------------