TSTP Solution File: SEU133+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:13 EDT 2022
% Result : Theorem 0.65s 0.97s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n004.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 12:28:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/0.96 ============================== Prover9 ===============================
% 0.65/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.96 Process 3265 was started by sandbox2 on n004.cluster.edu,
% 0.65/0.96 Sun Jun 19 12:28:09 2022
% 0.65/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3112_n004.cluster.edu".
% 0.65/0.96 ============================== end of head ===========================
% 0.65/0.96
% 0.65/0.96 ============================== INPUT =================================
% 0.65/0.96
% 0.65/0.96 % Reading from file /tmp/Prover9_3112_n004.cluster.edu
% 0.65/0.96
% 0.65/0.96 set(prolog_style_variables).
% 0.65/0.96 set(auto2).
% 0.65/0.96 % set(auto2) -> set(auto).
% 0.65/0.96 % set(auto) -> set(auto_inference).
% 0.65/0.96 % set(auto) -> set(auto_setup).
% 0.65/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.96 % set(auto) -> set(auto_limits).
% 0.65/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.96 % set(auto) -> set(auto_denials).
% 0.65/0.96 % set(auto) -> set(auto_process).
% 0.65/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.96 % set(auto2) -> assign(stats, some).
% 0.65/0.96 % set(auto2) -> clear(echo_input).
% 0.65/0.96 % set(auto2) -> set(quiet).
% 0.65/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.96 % set(auto2) -> clear(print_given).
% 0.65/0.96 assign(lrs_ticks,-1).
% 0.65/0.96 assign(sos_limit,10000).
% 0.65/0.96 assign(order,kbo).
% 0.65/0.96 set(lex_order_vars).
% 0.65/0.96 clear(print_given).
% 0.65/0.96
% 0.65/0.96 % formulas(sos). % not echoed (15 formulas)
% 0.65/0.96
% 0.65/0.96 ============================== end of input ==========================
% 0.65/0.96
% 0.65/0.96 % From the command line: assign(max_seconds, 300).
% 0.65/0.96
% 0.65/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.96
% 0.65/0.96 % Formulas that are not ordinary clauses:
% 0.65/0.96 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 2 (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.65/0.96 3 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 4 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 5 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 8 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 9 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 10 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 11 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 12 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 13 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.96 14 -(all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.96
% 0.65/0.96 ============================== end of process non-clausal formulas ===
% 0.65/0.96
% 0.65/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.96
% 0.65/0.96 ============================== PREDICATE ELIMINATION =================
% 0.65/0.96
% 0.65/0.96 ============================== end predicate elimination =============
% 0.65/0.96
% 0.65/0.96 Auto_denials: (non-Horn, no changes).
% 0.65/0.96
% 0.65/0.96 Term ordering decisions:
% 0.65/0.96 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_difference=1. f1=1. f2=1.
% 0.65/0.97
% 0.65/0.97 ============================== end of process initial clauses ========
% 0.65/0.97
% 0.65/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.97
% 0.65/0.97 ============================== end of clauses for search =============
% 0.65/0.97
% 0.65/0.97 ============================== SEARCH ================================
% 0.65/0.97
% 0.65/0.97 % Starting search at 0.01 seconds.
% 0.65/0.97
% 0.65/0.97 ============================== PROOF =================================
% 0.65/0.97 % SZS status Theorem
% 0.65/0.97 % SZS output start Refutation
% 0.65/0.97
% 0.65/0.97 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.65/0.97 % Length of proof is 13.
% 0.65/0.97 % Level of proof is 4.
% 0.65/0.97 % Maximum clause weight is 11.000.
% 0.65/0.97 % Given clauses 29.
% 0.65/0.97
% 0.65/0.97 2 (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.65/0.97 3 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.97 9 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.97 14 -(all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.97 18 set_difference(A,empty_set) = A # label(t3_boole) # label(axiom). [clausify(9)].
% 0.65/0.97 20 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(2)].
% 0.65/0.97 24 -subset(set_difference(c3,c4),c3) # label(t36_xboole_1) # label(negated_conjecture). [clausify(14)].
% 0.65/0.97 29 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(2)].
% 0.65/0.97 31 set_difference(A,B) != C | -in(D,C) | in(D,A) # label(d4_xboole_0) # label(axiom). [clausify(3)].
% 0.65/0.97 44 in(f1(set_difference(c3,c4),c3),set_difference(c3,c4)). [resolve(24,a,20,a)].
% 0.65/0.97 52 -in(f1(set_difference(c3,c4),c3),c3). [ur(29,a,24,a)].
% 0.65/0.97 84 -in(f1(set_difference(c3,c4),c3),set_difference(c3,A)). [ur(31,a,18,a(flip),c,52,a),rewrite([18(9)])].
% 0.65/0.97 85 $F. [resolve(84,a,44,a)].
% 0.65/0.97
% 0.65/0.97 % SZS output end Refutation
% 0.65/0.97 ============================== end of proof ==========================
% 0.65/0.97
% 0.65/0.97 ============================== STATISTICS ============================
% 0.65/0.97
% 0.65/0.97 Given=29. Generated=150. Kept=70. proofs=1.
% 0.65/0.97 Usable=27. Sos=39. Demods=3. Limbo=0, Disabled=23. Hints=0.
% 0.65/0.97 Megabytes=0.09.
% 0.65/0.97 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.65/0.97
% 0.65/0.97 ============================== end of statistics =====================
% 0.65/0.97
% 0.65/0.97 ============================== end of search =========================
% 0.65/0.97
% 0.65/0.97 THEOREM PROVED
% 0.65/0.97 % SZS status Theorem
% 0.65/0.97
% 0.65/0.97 Exiting with 1 proof.
% 0.65/0.97
% 0.65/0.97 Process 3265 exit (max_proofs) Sun Jun 19 12:28:09 2022
% 0.65/0.97 Prover9 interrupted
%------------------------------------------------------------------------------