TSTP Solution File: SEU128+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU128+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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.73s 1.03s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU128+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 Jun 19 22:20:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 23594 was started by sandbox2 on n023.cluster.edu,
% 0.42/1.00 Sun Jun 19 22:20:04 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23441_n023.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_23441_n023.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (16 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 3 (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.42/1.00 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.42/1.00 5 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 6 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 11 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 12 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 13 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 -(all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.73/1.03
% 0.73/1.03 ============================== end predicate elimination =============
% 0.73/1.03
% 0.73/1.03 Auto_denials: (non-Horn, no changes).
% 0.73/1.03
% 0.73/1.03 Term ordering decisions:
% 0.73/1.03 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. f1=1. f2=1.
% 0.73/1.03
% 0.73/1.03 ============================== end of process initial clauses ========
% 0.73/1.03
% 0.73/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.03
% 0.73/1.03 ============================== end of clauses for search =============
% 0.73/1.03
% 0.73/1.03 ============================== SEARCH ================================
% 0.73/1.03
% 0.73/1.03 % Starting search at 0.01 seconds.
% 0.73/1.03
% 0.73/1.03 ============================== PROOF =================================
% 0.73/1.03 % SZS status Theorem
% 0.73/1.03 % SZS output start Refutation
% 0.73/1.03
% 0.73/1.03 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.73/1.03 % Length of proof is 19.
% 0.73/1.03 % Level of proof is 4.
% 0.73/1.03 % Maximum clause weight is 14.000.
% 0.73/1.03 % Given clauses 103.
% 0.73/1.03
% 0.73/1.03 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.73/1.03 3 (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.73/1.03 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.73/1.03 15 -(all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.03 19 subset(c3,c4) # label(t19_xboole_1) # label(negated_conjecture). [clausify(15)].
% 0.73/1.03 20 subset(c3,c5) # label(t19_xboole_1) # label(negated_conjecture). [clausify(15)].
% 0.73/1.03 23 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(2)].
% 0.73/1.03 24 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(3)].
% 0.73/1.03 29 -subset(c3,set_intersection2(c4,c5)) # label(t19_xboole_1) # label(negated_conjecture). [clausify(15)].
% 0.73/1.03 33 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 0.73/1.03 34 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 0.73/1.03 37 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 0.73/1.03 52 in(f1(c3,set_intersection2(c4,c5)),c3). [resolve(29,a,24,a)].
% 0.73/1.03 58 -in(f1(c3,set_intersection2(c4,c5)),set_intersection2(c4,c5)). [ur(33,a,29,a)].
% 0.73/1.03 60 -in(A,c3) | in(A,c5). [resolve(34,a,20,a)].
% 0.73/1.03 61 -in(A,c3) | in(A,c4). [resolve(34,a,19,a)].
% 0.73/1.03 146 in(f1(c3,set_intersection2(c4,c5)),c4). [resolve(52,a,61,a)].
% 0.73/1.03 147 in(f1(c3,set_intersection2(c4,c5)),c5). [resolve(52,a,60,a)].
% 0.73/1.03 403 $F. [ur(37,b,58,a,c,147,a,d,146,a),rewrite([23(3)]),xx(a)].
% 0.73/1.03
% 0.73/1.03 % SZS output end Refutation
% 0.73/1.03 ============================== end of proof ==========================
% 0.73/1.03
% 0.73/1.03 ============================== STATISTICS ============================
% 0.73/1.03
% 0.73/1.03 Given=103. Generated=1195. Kept=387. proofs=1.
% 0.73/1.03 Usable=100. Sos=280. Demods=4. Limbo=3, Disabled=27. Hints=0.
% 0.73/1.03 Megabytes=0.29.
% 0.73/1.03 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.73/1.03
% 0.73/1.03 ============================== end of statistics =====================
% 0.73/1.03
% 0.73/1.03 ============================== end of search =========================
% 0.73/1.03
% 0.73/1.03 THEOREM PROVED
% 0.73/1.03 % SZS status Theorem
% 0.73/1.03
% 0.73/1.03 Exiting with 1 proof.
% 0.73/1.03
% 0.73/1.03 Process 23594 exit (max_proofs) Sun Jun 19 22:20:04 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------