TSTP Solution File: SEU163+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:32 EDT 2022
% Result : Theorem 0.74s 1.00s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.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 : Sun Jun 19 22:00:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 331 was started by sandbox on n005.cluster.edu,
% 0.74/1.00 Sun Jun 19 22:00:09 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32448_n005.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_32448_n005.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (6 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00 1 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 2 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 3 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 4 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 5 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 6 -(all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 7 -empty(c2) # label(rc2_xboole_0) # label(axiom). [clausify(4)].
% 0.74/1.00 8 empty(c1) # label(rc1_xboole_0) # label(axiom). [clausify(3)].
% 0.74/1.00 9 -subset(c3,union(c4)) # label(t92_zfmisc_1) # label(negated_conjecture). [clausify(6)].
% 0.74/1.00 10 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(1)].
% 0.74/1.00 11 -in(A,B) | subset(A,union(B)) # label(l50_zfmisc_1) # label(axiom). [clausify(5)].
% 0.74/1.00 Derived: -in(c3,c4). [resolve(11,b,9,a)].
% 0.74/1.00
% 0.74/1.00 ============================== end predicate elimination =============
% 0.74/1.00
% 0.74/1.00 Auto_denials:
% 0.74/1.00 % copying label antisymmetry_r2_hidden to answer in negative clause
% 0.74/1.00 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.74/1.00
% 0.74/1.00 Term ordering decisions:
% 0.74/1.00 Function symbol KB weights: c3=1. c4=1.
% 0.74/1.00
% 0.74/1.00 ============================== PROOF =================================
% 0.74/1.00 % SZS status Theorem
% 0.74/1.00 % SZS output start Refutation
% 0.74/1.00
% 0.74/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/1.00 % Length of proof is 7.
% 0.74/1.00 % Level of proof is 3.
% 0.74/1.00 % Maximum clause weight is 3.000.
% 0.74/1.00 % Given clauses 0.
% 0.74/1.00
% 0.74/1.00 5 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 6 -(all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01 9 -subset(c3,union(c4)) # label(t92_zfmisc_1) # label(negated_conjecture). [clausify(6)].
% 0.74/1.01 11 -in(A,B) | subset(A,union(B)) # label(l50_zfmisc_1) # label(axiom). [clausify(5)].
% 0.74/1.01 12 in(c3,c4) # label(t92_zfmisc_1) # label(negated_conjecture). [clausify(6)].
% 0.74/1.01 14 -in(c3,c4). [resolve(11,b,9,a)].
% 0.74/1.01 15 $F. [copy(14),unit_del(a,12)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 % Disable descendants (x means already disabled):
% 0.74/1.01 9x 14x
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.01
% 0.74/1.01 ============================== end of clauses for search =============
% 0.74/1.01
% 0.74/1.01 ============================== SEARCH ================================
% 0.74/1.01
% 0.74/1.01 % Starting search at 0.01 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=3. Generated=7. Kept=3. proofs=1.
% 0.74/1.01 Usable=3. Sos=0. Demods=0. Limbo=0, Disabled=8. Hints=0.
% 0.74/1.01 Megabytes=0.02.
% 0.74/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 SEARCH FAILED
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 331 exit (sos_empty) Sun Jun 19 22:00:09 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------