TSTP Solution File: SEU120+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU120+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:06 EDT 2022
% Result : Theorem 0.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.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 : Sun Jun 19 13:26:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/0.99 ============================== Prover9 ===============================
% 0.75/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.75/0.99 Process 16125 was started by sandbox on n005.cluster.edu,
% 0.75/0.99 Sun Jun 19 13:26:39 2022
% 0.75/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15971_n005.cluster.edu".
% 0.75/0.99 ============================== end of head ===========================
% 0.75/0.99
% 0.75/0.99 ============================== INPUT =================================
% 0.75/0.99
% 0.75/0.99 % Reading from file /tmp/Prover9_15971_n005.cluster.edu
% 0.75/0.99
% 0.75/0.99 set(prolog_style_variables).
% 0.75/0.99 set(auto2).
% 0.75/0.99 % set(auto2) -> set(auto).
% 0.75/0.99 % set(auto) -> set(auto_inference).
% 0.75/0.99 % set(auto) -> set(auto_setup).
% 0.75/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.75/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/0.99 % set(auto) -> set(auto_limits).
% 0.75/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/0.99 % set(auto) -> set(auto_denials).
% 0.75/0.99 % set(auto) -> set(auto_process).
% 0.75/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.75/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.75/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.75/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.75/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.75/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.75/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.75/0.99 % set(auto2) -> assign(stats, some).
% 0.75/0.99 % set(auto2) -> clear(echo_input).
% 0.75/0.99 % set(auto2) -> set(quiet).
% 0.75/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.75/0.99 % set(auto2) -> clear(print_given).
% 0.75/0.99 assign(lrs_ticks,-1).
% 0.75/0.99 assign(sos_limit,10000).
% 0.75/0.99 assign(order,kbo).
% 0.75/0.99 set(lex_order_vars).
% 0.75/0.99 clear(print_given).
% 0.75/0.99
% 0.75/0.99 % formulas(sos). % not echoed (14 formulas)
% 0.75/0.99
% 0.75/0.99 ============================== end of input ==========================
% 0.75/0.99
% 0.75/0.99 % From the command line: assign(max_seconds, 300).
% 0.75/0.99
% 0.75/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/0.99
% 0.75/0.99 % Formulas that are not ordinary clauses:
% 0.75/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 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.75/0.99 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 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.75/0.99 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.75/0.99 6 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 7 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 9 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 10 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 11 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/0.99 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(lemma) # label(non_clause). [assumption].
% 0.75/0.99 13 -(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(negated_conjecture) # label(non_clause). [assumption].
% 0.75/0.99
% 0.75/0.99 ============================== end of process non-clausal formulas ===
% 0.75/0.99
% 0.75/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/0.99
% 0.75/0.99 ============================== PREDICATE ELIMINATION =================
% 0.75/0.99
% 0.75/0.99 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials: (non-Horn, no changes).
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02
% 0.75/1.02 % Assigning unary symbol f1 kb_weight 0 and highest precedence (14).
% 0.75/1.02 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. f3=1. f2=1. f1=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.01 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.04 (+ 0.01) seconds.
% 0.75/1.02 % Length of proof is 16.
% 0.75/1.02 % Level of proof is 5.
% 0.75/1.02 % Maximum clause weight is 8.000.
% 0.75/1.02 % Given clauses 57.
% 0.75/1.02
% 0.75/1.02 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 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.75/1.02 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 13 -(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(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02 16 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(8)].
% 0.75/1.02 18 empty_set = A | in(f1(A),A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 0.75/1.02 25 empty_set != A | -in(B,A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 0.75/1.02 28 -disjoint(A,B) | set_intersection2(A,B) = empty_set # label(d7_xboole_0) # label(axiom). [clausify(5)].
% 0.75/1.02 29 disjoint(A,B) | set_intersection2(A,B) != empty_set # label(d7_xboole_0) # label(axiom). [clausify(5)].
% 0.75/1.02 30 -disjoint(c3,c4) | in(c5,set_intersection2(c3,c4)) # label(t4_xboole_0) # label(negated_conjecture). [clausify(13)].
% 0.75/1.02 31 -in(A,set_intersection2(c3,c4)) | disjoint(c3,c4) # label(t4_xboole_0) # label(negated_conjecture). [clausify(13)].
% 0.75/1.02 54 -in(A,empty_set). [ur(25,a,16,a(flip)),rewrite([16(3)])].
% 0.75/1.02 70 disjoint(c3,c4) | set_intersection2(c3,c4) = empty_set. [resolve(31,a,18,b),flip(b)].
% 0.75/1.02 164 set_intersection2(c3,c4) = empty_set. [resolve(70,a,28,a),merge(b)].
% 0.75/1.02 169 -disjoint(c3,c4). [back_rewrite(30),rewrite([164(7)]),unit_del(b,54)].
% 0.75/1.02 170 $F. [resolve(164,a,29,b),unit_del(a,169)].
% 0.75/1.02
% 0.75/1.02 % SZS output end Refutation
% 0.75/1.02 ============================== end of proof ==========================
% 0.75/1.02
% 0.75/1.02 ============================== STATISTICS ============================
% 0.75/1.02
% 0.75/1.02 Given=57. Generated=629. Kept=156. proofs=1.
% 0.75/1.02 Usable=50. Sos=84. Demods=4. Limbo=0, Disabled=45. Hints=0.
% 0.75/1.02 Megabytes=0.16.
% 0.75/1.02 User_CPU=0.04, System_CPU=0.01, Wall_clock=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of statistics =====================
% 0.75/1.02
% 0.75/1.02 ============================== end of search =========================
% 0.75/1.02
% 0.75/1.02 THEOREM PROVED
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02
% 0.75/1.02 Exiting with 1 proof.
% 0.75/1.02
% 0.75/1.02 Process 16125 exit (max_proofs) Sun Jun 19 13:26:39 2022
% 0.75/1.02 Prover9 interrupted
%------------------------------------------------------------------------------