TSTP Solution File: SEU119+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:06 EDT 2022
% Result : Theorem 3.79s 4.12s
% Output : Refutation 3.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 12:27:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 7046 was started by sandbox on n025.cluster.edu,
% 0.44/1.01 Mon Jun 20 12:27:15 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6893_n025.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_6893_n025.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (13 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 4 (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.44/1.01 5 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 9 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 10 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 11 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 12 -(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(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01
% 0.44/1.01 % Assigning unary symbol f1 kb_weight 0 and highest precedence (13).
% 0.44/1.01 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. f2=1. f1=0.
% 3.79/4.12
% 3.79/4.12 ============================== end of process initial clauses ========
% 3.79/4.12
% 3.79/4.12 ============================== CLAUSES FOR SEARCH ====================
% 3.79/4.12
% 3.79/4.12 ============================== end of clauses for search =============
% 3.79/4.12
% 3.79/4.12 ============================== SEARCH ================================
% 3.79/4.12
% 3.79/4.12 % Starting search at 0.01 seconds.
% 3.79/4.12
% 3.79/4.12 ============================== PROOF =================================
% 3.79/4.12 % SZS status Theorem
% 3.79/4.12 % SZS output start Refutation
% 3.79/4.12
% 3.79/4.12 % Proof 1 at 3.11 (+ 0.00) seconds.
% 3.79/4.12 % Length of proof is 30.
% 3.79/4.12 % Level of proof is 10.
% 3.79/4.12 % Maximum clause weight is 20.000.
% 3.79/4.12 % Given clauses 161.
% 3.79/4.12
% 3.79/4.12 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 3.79/4.12 4 (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].
% 3.79/4.12 5 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 3.79/4.12 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 3.79/4.12 12 -(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(negated_conjecture) # label(non_clause). [assumption].
% 3.79/4.12 15 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(8)].
% 3.79/4.12 18 set_intersection2(A,B) = C | in(f2(A,B,C),C) | in(f2(A,B,C),A) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 3.79/4.12 19 set_intersection2(A,B) = C | in(f2(A,B,C),C) | in(f2(A,B,C),B) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 3.79/4.12 22 empty_set != A | -in(B,A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 3.79/4.12 24 -disjoint(c3,c4) | in(c5,c3) # label(t3_xboole_0) # label(negated_conjecture). [clausify(12)].
% 3.79/4.12 25 -disjoint(c3,c4) | in(c5,c4) # label(t3_xboole_0) # label(negated_conjecture). [clausify(12)].
% 3.79/4.12 26 -disjoint(A,B) | set_intersection2(A,B) = empty_set # label(d7_xboole_0) # label(axiom). [clausify(5)].
% 3.79/4.12 27 disjoint(A,B) | set_intersection2(A,B) != empty_set # label(d7_xboole_0) # label(axiom). [clausify(5)].
% 3.79/4.12 28 -in(A,c3) | -in(A,c4) | in(c5,c3) # label(t3_xboole_0) # label(negated_conjecture). [clausify(12)].
% 3.79/4.12 29 -in(A,c3) | -in(A,c4) | in(c5,c4) # label(t3_xboole_0) # label(negated_conjecture). [clausify(12)].
% 3.79/4.12 30 -in(A,c3) | -in(A,c4) | disjoint(c3,c4) # label(t3_xboole_0) # label(negated_conjecture). [clausify(12)].
% 3.79/4.12 33 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 3.79/4.12 51 -in(A,empty_set). [ur(22,a,15,a(flip)),rewrite([15(3)])].
% 3.79/4.12 54 -in(f2(A,c4,B),c3) | in(c5,c3) | set_intersection2(A,c4) = B | in(f2(A,c4,B),B). [resolve(28,b,19,c)].
% 3.79/4.12 59 -in(f2(A,c4,B),c3) | in(c5,c4) | set_intersection2(A,c4) = B | in(f2(A,c4,B),B). [resolve(29,b,19,c)].
% 3.79/4.12 139 set_intersection2(A,B) = empty_set | in(f2(A,B,empty_set),A). [resolve(51,a,18,b)].
% 3.79/4.12 224 in(c5,c3) | set_intersection2(c3,c4) = empty_set. [resolve(54,a,139,b),merge(d),unit_del(c,51)].
% 3.79/4.12 269 in(c5,c4) | set_intersection2(c3,c4) = empty_set. [resolve(59,a,139,b),merge(d),unit_del(c,51)].
% 3.79/4.12 280 set_intersection2(c3,c4) = empty_set | -in(c5,c3) | disjoint(c3,c4). [resolve(269,a,30,b)].
% 3.79/4.12 288 set_intersection2(c3,c4) = empty_set | disjoint(c3,c4). [resolve(280,b,224,a),merge(c)].
% 3.79/4.12 289 set_intersection2(c3,c4) = empty_set. [resolve(288,b,26,a),merge(b)].
% 3.79/4.12 293 disjoint(c3,c4). [resolve(289,a,27,b)].
% 3.79/4.12 294 in(c5,c4). [back_unit_del(25),unit_del(a,293)].
% 3.79/4.12 295 in(c5,c3). [back_unit_del(24),unit_del(a,293)].
% 3.79/4.12 373 $F. [ur(33,a,289,a,b,51,a,d,294,a),unit_del(a,295)].
% 3.79/4.12
% 3.79/4.12 % SZS output end Refutation
% 3.79/4.12 ============================== end of proof ==========================
% 3.79/4.12
% 3.79/4.12 ============================== STATISTICS ============================
% 3.79/4.12
% 3.79/4.12 Given=161. Generated=5322. Kept=360. proofs=1.
% 3.79/4.12 Usable=126. Sos=87. Demods=4. Limbo=66, Disabled=103. Hints=0.
% 3.79/4.12 Megabytes=0.48.
% 3.79/4.12 User_CPU=3.11, System_CPU=0.00, Wall_clock=3.
% 3.79/4.12
% 3.79/4.12 ============================== end of statistics =====================
% 3.79/4.12
% 3.79/4.12 ============================== end of search =========================
% 3.79/4.12
% 3.79/4.12 THEOREM PROVED
% 3.79/4.12 % SZS status Theorem
% 3.79/4.12
% 3.79/4.12 Exiting with 1 proof.
% 3.79/4.12
% 3.79/4.12 Process 7046 exit (max_proofs) Mon Jun 20 12:27:18 2022
% 3.85/4.12 Prover9 interrupted
%------------------------------------------------------------------------------