TSTP Solution File: SEU130+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:11 EDT 2022
% Result : Theorem 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 03:45:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.06 ============================== Prover9 ===============================
% 0.43/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.06 Process 22449 was started by sandbox2 on n027.cluster.edu,
% 0.43/1.06 Mon Jun 20 03:45:10 2022
% 0.43/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22188_n027.cluster.edu".
% 0.43/1.06 ============================== end of head ===========================
% 0.43/1.06
% 0.43/1.06 ============================== INPUT =================================
% 0.43/1.06
% 0.43/1.06 % Reading from file /tmp/Prover9_22188_n027.cluster.edu
% 0.43/1.06
% 0.43/1.06 set(prolog_style_variables).
% 0.43/1.06 set(auto2).
% 0.43/1.06 % set(auto2) -> set(auto).
% 0.43/1.06 % set(auto) -> set(auto_inference).
% 0.43/1.06 % set(auto) -> set(auto_setup).
% 0.43/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.06 % set(auto) -> set(auto_limits).
% 0.43/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.06 % set(auto) -> set(auto_denials).
% 0.43/1.06 % set(auto) -> set(auto_process).
% 0.43/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.06 % set(auto2) -> assign(stats, some).
% 0.43/1.06 % set(auto2) -> clear(echo_input).
% 0.43/1.06 % set(auto2) -> set(quiet).
% 0.43/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.06 % set(auto2) -> clear(print_given).
% 0.43/1.06 assign(lrs_ticks,-1).
% 0.43/1.06 assign(sos_limit,10000).
% 0.43/1.06 assign(order,kbo).
% 0.43/1.06 set(lex_order_vars).
% 0.43/1.06 clear(print_given).
% 0.43/1.06
% 0.43/1.06 % formulas(sos). % not echoed (18 formulas)
% 0.43/1.06
% 0.43/1.06 ============================== end of input ==========================
% 0.43/1.06
% 0.43/1.06 % From the command line: assign(max_seconds, 300).
% 0.43/1.06
% 0.43/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.06
% 0.43/1.06 % Formulas that are not ordinary clauses:
% 0.43/1.06 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 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.43/1.06 3 (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.06 4 (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.06 5 (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.06 6 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 7 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 9 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 10 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 11 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 12 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 13 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 14 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 15 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 16 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.06 17 -(all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.07
% 0.43/1.07 ============================== end of process non-clausal formulas ===
% 0.43/1.07
% 0.43/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.07
% 0.43/1.07 ============================== PREDICATE ELIMINATION =================
% 0.43/1.07
% 0.43/1.07 ============================== end predicate elimination =============
% 0.43/1.07
% 0.43/1.07 Auto_denials: (non-Horn, no changes).
% 0.43/1.07
% 0.43/1.07 Term ordering decisions:
% 0.43/1.07 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_intersection2=1. f1=1. f2=1.
% 0.43/1.07
% 0.43/1.07 ============================== end of process initial clauses ========
% 0.43/1.07
% 0.43/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.07
% 0.43/1.07 ============================== end of clauses for search =============
% 0.43/1.07
% 0.43/1.07 ============================== SEARCH ================================
% 0.43/1.07
% 0.43/1.07 % Starting search at 0.01 seconds.
% 0.43/1.07
% 0.43/1.07 ============================== PROOF =================================
% 0.43/1.07 % SZS status Theorem
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.07 % Length of proof is 21.
% 0.43/1.07 % Level of proof is 5.
% 0.43/1.07 % Maximum clause weight is 14.000.
% 0.43/1.07 % Given clauses 51.
% 0.43/1.07
% 0.43/1.07 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.43/1.07 3 (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.07 4 (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.07 5 (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.07 12 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 17 -(all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.07 21 subset(c3,c4) # label(t28_xboole_1) # label(negated_conjecture). [clausify(17)].
% 0.43/1.07 23 subset(set_intersection2(A,B),A) # label(t17_xboole_1) # label(axiom). [clausify(12)].
% 0.43/1.07 25 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(2)].
% 0.43/1.07 26 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(4)].
% 0.43/1.07 31 set_intersection2(c3,c4) != c3 # label(t28_xboole_1) # label(negated_conjecture). [clausify(17)].
% 0.43/1.07 37 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(4)].
% 0.43/1.07 38 A = B | -subset(B,A) | -subset(A,B) # label(d10_xboole_0) # label(axiom). [clausify(3)].
% 0.43/1.07 39 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(4)].
% 0.43/1.07 42 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 0.43/1.07 68 -subset(c3,set_intersection2(c3,c4)). [ur(38,a,31,a,c,23,a)].
% 0.43/1.07 71 -in(A,c3) | in(A,c4). [resolve(39,a,21,a)].
% 0.43/1.07 134 in(f1(c3,set_intersection2(c3,c4)),c3). [resolve(68,a,26,a)].
% 0.43/1.07 135 -in(f1(c3,set_intersection2(c3,c4)),set_intersection2(c3,c4)). [ur(37,a,68,a)].
% 0.43/1.07 156 in(f1(c3,set_intersection2(c3,c4)),c4). [resolve(134,a,71,a)].
% 0.43/1.07 167 $F. [ur(42,a,25,a,b,135,a,d,134,a),unit_del(a,156)].
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 ============================== end of proof ==========================
% 0.43/1.07
% 0.43/1.07 ============================== STATISTICS ============================
% 0.43/1.07
% 0.43/1.07 Given=51. Generated=457. Kept=149. proofs=1.
% 0.43/1.07 Usable=48. Sos=86. Demods=4. Limbo=11, Disabled=30. Hints=0.
% 0.43/1.07 Megabytes=0.14.
% 0.43/1.07 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.07
% 0.43/1.07 ============================== end of statistics =====================
% 0.43/1.07
% 0.43/1.07 ============================== end of search =========================
% 0.43/1.07
% 0.43/1.07 THEOREM PROVED
% 0.43/1.07 % SZS status Theorem
% 0.43/1.07
% 0.43/1.07 Exiting with 1 proof.
% 0.43/1.07
% 0.43/1.07 Process 22449 exit (max_proofs) Mon Jun 20 03:45:10 2022
% 0.43/1.07 Prover9 interrupted
%------------------------------------------------------------------------------