TSTP Solution File: SEU134+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:14 EDT 2022
% Result : Theorem 0.75s 1.03s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU134+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 : n015.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 12:17:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 31624 was started by sandbox on n015.cluster.edu,
% 0.75/1.02 Mon Jun 20 12:17:16 2022
% 0.75/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31471_n015.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_31471_n015.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (14 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 2 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 3 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 4 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 5 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 6 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 7 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 8 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 9 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 10 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 11 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 12 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 13 -(all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02
% 0.75/1.02 ============================== 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 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_difference=1.
% 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.03
% 0.75/1.03 ============================== end of clauses for search =============
% 0.75/1.03
% 0.75/1.03 ============================== SEARCH ================================
% 0.75/1.03
% 0.75/1.03 % Starting search at 0.01 seconds.
% 0.75/1.03
% 0.75/1.03 ============================== PROOF =================================
% 0.75/1.03 % SZS status Theorem
% 0.75/1.03 % SZS output start Refutation
% 0.75/1.03
% 0.75/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.75/1.03 % Length of proof is 9.
% 0.75/1.03 % Level of proof is 4.
% 0.75/1.03 % Maximum clause weight is 8.000.
% 0.75/1.03 % Given clauses 17.
% 0.75/1.03
% 0.75/1.03 12 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 13 -(all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.03 19 set_difference(c3,c4) = empty_set | subset(c3,c4) # label(t37_xboole_1) # label(negated_conjecture). [clausify(13)].
% 0.75/1.03 23 set_difference(c3,c4) != empty_set | -subset(c3,c4) # label(t37_xboole_1) # label(negated_conjecture). [clausify(13)].
% 0.75/1.03 26 set_difference(A,B) != empty_set | subset(A,B) # label(l32_xboole_1) # label(axiom). [clausify(12)].
% 0.75/1.03 27 set_difference(A,B) = empty_set | -subset(A,B) # label(l32_xboole_1) # label(axiom). [clausify(12)].
% 0.75/1.03 34 set_difference(c3,c4) = empty_set. [resolve(27,b,19,b),merge(b)].
% 0.75/1.03 36 -subset(c3,c4). [back_rewrite(23),rewrite([34(3)]),xx(a)].
% 0.75/1.03 37 $F. [ur(26,b,36,a),rewrite([34(3)]),xx(a)].
% 0.75/1.03
% 0.75/1.03 % SZS output end Refutation
% 0.75/1.03 ============================== end of proof ==========================
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=17. Generated=36. Kept=23. proofs=1.
% 0.75/1.03 Usable=14. Sos=5. Demods=5. Limbo=0, Disabled=18. Hints=0.
% 0.75/1.03 Megabytes=0.04.
% 0.75/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 THEOREM PROVED
% 0.75/1.03 % SZS status Theorem
% 0.75/1.03
% 0.75/1.03 Exiting with 1 proof.
% 0.75/1.03
% 0.75/1.03 Process 31624 exit (max_proofs) Mon Jun 20 12:17:16 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------