TSTP Solution File: SEU152+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:24 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 02:53:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 5169 was started by sandbox2 on n028.cluster.edu,
% 0.44/0.99 Mon Jun 20 02:53:02 2022
% 0.44/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5008_n028.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_5008_n028.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 5 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 6 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 7 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 8 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 9 -(all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials:
% 0.44/0.99 % copying label antisymmetry_r2_hidden to answer in negative clause
% 0.44/0.99 % copying label l23_zfmisc_1 to answer in negative clause
% 0.44/0.99 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99
% 0.44/0.99 % Assigning unary symbol singleton kb_weight 0 and highest precedence (7).
% 0.44/0.99 Function symbol KB weights: c1=1. c2=1. set_union2=1. singleton=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: l23_zfmisc_1.
% 0.44/0.99 % Length of proof is 12.
% 0.44/0.99 % Level of proof is 3.
% 0.44/0.99 % Maximum clause weight is 8.000.
% 0.44/0.99 % Given clauses 13.
% 0.44/0.99
% 0.44/0.99 2 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 6 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 8 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 9 -(all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 11 in(c1,c2) # label(l23_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.44/0.99 13 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(2)].
% 0.44/0.99 15 set_union2(singleton(c1),c2) != c2 # label(l23_zfmisc_1) # label(negated_conjecture) # answer(l23_zfmisc_1). [clausify(9)].
% 0.44/0.99 16 set_union2(c2,singleton(c1)) != c2 # answer(l23_zfmisc_1). [copy(15),rewrite([13(4)])].
% 0.44/0.99 18 subset(singleton(A),B) | -in(A,B) # label(l2_zfmisc_1) # label(axiom). [clausify(6)].
% 0.44/0.99 19 -subset(A,B) | set_union2(A,B) = B # label(t12_xboole_1) # label(axiom). [clausify(8)].
% 0.44/0.99 22 subset(singleton(c1),c2). [hyper(18,b,11,a)].
% 0.44/0.99 25 $F # answer(l23_zfmisc_1). [hyper(19,a,22,a),rewrite([13(4)]),unit_del(a,16)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 % Disable descendants (x means already disabled):
% 0.44/0.99 15x 16
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=15. Generated=30. Kept=15. proofs=1.
% 0.44/0.99 Usable=14. Sos=0. Demods=2. Limbo=0, Disabled=10. Hints=0.
% 0.44/0.99 Megabytes=0.04.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 SEARCH FAILED
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 5169 exit (sos_empty) Mon Jun 20 02:53:02 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------