TSTP Solution File: SEU129+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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 1.60s 1.91s
% Output : Refutation 1.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n003.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 : Sun Jun 19 12:30:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 26283 was started by sandbox on n003.cluster.edu,
% 0.43/0.99 Sun Jun 19 12:30:29 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26126_n003.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_26126_n003.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (16 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/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.43/0.99 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.43/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.43/0.99 5 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 6 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 7 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 8 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 9 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 10 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 11 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 12 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 13 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 14 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 15 -(all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 1.60/1.91
% 1.60/1.91 ============================== end predicate elimination =============
% 1.60/1.91
% 1.60/1.91 Auto_denials: (non-Horn, no changes).
% 1.60/1.91
% 1.60/1.91 Term ordering decisions:
% 1.60/1.91 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. f1=1. f2=1.
% 1.60/1.91
% 1.60/1.91 ============================== end of process initial clauses ========
% 1.60/1.91
% 1.60/1.91 ============================== CLAUSES FOR SEARCH ====================
% 1.60/1.91
% 1.60/1.91 ============================== end of clauses for search =============
% 1.60/1.91
% 1.60/1.91 ============================== SEARCH ================================
% 1.60/1.91
% 1.60/1.91 % Starting search at 0.01 seconds.
% 1.60/1.91
% 1.60/1.91 ============================== PROOF =================================
% 1.60/1.91 % SZS status Theorem
% 1.60/1.91 % SZS output start Refutation
% 1.60/1.91
% 1.60/1.91 % Proof 1 at 0.91 (+ 0.03) seconds.
% 1.60/1.91 % Length of proof is 23.
% 1.60/1.91 % Level of proof is 6.
% 1.60/1.91 % Maximum clause weight is 16.000.
% 1.60/1.91 % Given clauses 675.
% 1.60/1.91
% 1.60/1.91 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.60/1.91 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].
% 1.60/1.91 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].
% 1.60/1.91 7 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.60/1.91 15 -(all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.60/1.91 19 subset(c3,c4) # label(t26_xboole_1) # label(negated_conjecture). [clausify(15)].
% 1.60/1.91 20 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(7)].
% 1.60/1.91 22 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(2)].
% 1.60/1.91 23 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(3)].
% 1.60/1.91 29 -subset(set_intersection2(c3,c5),set_intersection2(c4,c5)) # label(t26_xboole_1) # label(negated_conjecture). [clausify(15)].
% 1.60/1.91 32 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 1.60/1.91 33 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 1.60/1.91 35 set_intersection2(A,B) != C | -in(D,C) | in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 1.60/1.91 36 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(4)].
% 1.60/1.91 55 in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),set_intersection2(c3,c5)). [resolve(29,a,23,a)].
% 1.60/1.91 57 -in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),set_intersection2(c4,c5)). [ur(32,a,29,a)].
% 1.60/1.91 59 -in(A,c3) | in(A,c4). [resolve(33,a,19,a)].
% 1.60/1.91 155 -in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),set_intersection2(A,set_intersection2(c4,c5))). [ur(35,a,22,a,c,57,a),rewrite([22(11)])].
% 1.60/1.91 170 set_intersection2(c3,c5) != set_intersection2(A,B) | in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),B). [resolve(55,a,35,b),flip(a)].
% 1.60/1.91 5021 in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),c3). [resolve(170,a,22,a)].
% 1.60/1.91 5022 in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),c5). [xx_res(170,a)].
% 1.60/1.91 5054 in(f1(set_intersection2(c3,c5),set_intersection2(c4,c5)),c4). [resolve(5021,a,59,a)].
% 1.60/1.91 5133 $F. [ur(36,a,20,a(flip),b,155,a,d,5022,a),unit_del(a,5054)].
% 1.60/1.91
% 1.60/1.91 % SZS output end Refutation
% 1.60/1.91 ============================== end of proof ==========================
% 1.60/1.91
% 1.60/1.91 ============================== STATISTICS ============================
% 1.60/1.91
% 1.60/1.91 Given=675. Generated=22817. Kept=5117. proofs=1.
% 1.60/1.91 Usable=658. Sos=4119. Demods=5. Limbo=33, Disabled=329. Hints=0.
% 1.60/1.91 Megabytes=4.93.
% 1.60/1.91 User_CPU=0.91, System_CPU=0.03, Wall_clock=1.
% 1.60/1.91
% 1.60/1.91 ============================== end of statistics =====================
% 1.60/1.91
% 1.60/1.91 ============================== end of search =========================
% 1.60/1.91
% 1.60/1.91 THEOREM PROVED
% 1.60/1.91 % SZS status Theorem
% 1.60/1.91
% 1.60/1.91 Exiting with 1 proof.
% 1.60/1.91
% 1.60/1.91 Process 26283 exit (max_proofs) Sun Jun 19 12:30:30 2022
% 1.60/1.91 Prover9 interrupted
%------------------------------------------------------------------------------