TSTP Solution File: SEU185+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU185+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:44 EDT 2022
% Result : Timeout 300.04s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU185+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 08:35:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.98 ============================== Prover9 ===============================
% 0.40/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.40/0.98 Process 31166 was started by sandbox2 on n017.cluster.edu,
% 0.40/0.98 Sun Jun 19 08:35:29 2022
% 0.40/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31012_n017.cluster.edu".
% 0.40/0.98 ============================== end of head ===========================
% 0.40/0.98
% 0.40/0.98 ============================== INPUT =================================
% 0.40/0.98
% 0.40/0.98 % Reading from file /tmp/Prover9_31012_n017.cluster.edu
% 0.40/0.98
% 0.40/0.98 set(prolog_style_variables).
% 0.40/0.98 set(auto2).
% 0.40/0.98 % set(auto2) -> set(auto).
% 0.40/0.98 % set(auto) -> set(auto_inference).
% 0.40/0.98 % set(auto) -> set(auto_setup).
% 0.40/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.40/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/0.98 % set(auto) -> set(auto_limits).
% 0.40/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/0.98 % set(auto) -> set(auto_denials).
% 0.40/0.98 % set(auto) -> set(auto_process).
% 0.40/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.40/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.40/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.40/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.40/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.40/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.40/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.40/0.98 % set(auto2) -> assign(stats, some).
% 0.40/0.98 % set(auto2) -> clear(echo_input).
% 0.40/0.98 % set(auto2) -> set(quiet).
% 0.40/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.40/0.98 % set(auto2) -> clear(print_given).
% 0.40/0.98 assign(lrs_ticks,-1).
% 0.40/0.98 assign(sos_limit,10000).
% 0.40/0.98 assign(order,kbo).
% 0.40/0.98 set(lex_order_vars).
% 0.40/0.98 clear(print_given).
% 0.40/0.98
% 0.40/0.98 % formulas(sos). % not echoed (39 formulas)
% 0.40/0.98
% 0.40/0.98 ============================== end of input ==========================
% 0.40/0.98
% 0.40/0.98 % From the command line: assign(max_seconds, 300).
% 0.40/0.98
% 0.40/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/0.98
% 0.40/0.98 % Formulas that are not ordinary clauses:
% 0.40/0.98 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 3 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 4 (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.40/0.98 5 (all A (relation(A) -> (all B (B = relation_dom(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(C,D),A)))))))) # label(d4_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 6 (all A (relation(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(D,C),A)))))))) # label(d5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 7 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 8 (all A (relation(A) -> (all B (relation(B) -> (all C (relation(C) -> (C = relation_composition(A,B) <-> (all D all E (in(ordered_pair(D,E),C) <-> (exists F (in(ordered_pair(D,F),A) & in(ordered_pair(F,E),B)))))))))))) # label(d8_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 9 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 10 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 11 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 12 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 13 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 14 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 15 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 16 (all A all B (relation(A) & relation(B) -> relation(relation_composition(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 17 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 18 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 19 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 20 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 21 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 22 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 23 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 24 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 25 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 26 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 28 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 29 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 30 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 31 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 32 (all A (relation(A) -> (all B (relation(B) -> subset(relation_rng(relation_composition(A,B)),relation_rng(B)))))) # label(t45_relat_1) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 33 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 34 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 35 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 36 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 37 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 65.23/65.59 38 -(all A (relation(A) -> (all B (relation(B) -> (subset(relation_dom(A),relation_rng(B)) -> relation_rng(relation_composition(B,A)) = relation_rng(A)))))) # label(t47_relat_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 65.23/65.59
% 65.23/65.59 ============================== end of process non-clausal formulas ===
% 65.23/65.59
% 65.23/65.59 ============================== PROCESS INITIAL CLAUSES ===============
% 65.23/65.59
% 65.23/65.59 ============================== PREDICATE ELIMINATION =================
% 65.23/65.59
% 65.23/65.59 ============================== end predicate elimination =============
% 65.23/65.59
% 65.23/65.59 Auto_denials: (non-Horn, no changes).
% 65.23/65.59
% 65.23/65.59 Term ordering decisions:
% 65.23/65.59 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. relation_composition=1. unordered_pair=1. f1=1. f3=1. f4=1. f6=1. f7=1. relation_rng=1. powerset=1. relation_dom=1. singleton=1. f12=1. f13=1. f14=1. f2=1. f5=1. f9=1. f10=1. f11=1. f8=1.
% 65.23/65.59
% 65.23/65.59 ============================== end of process initial clauses ========
% 65.23/65.59
% 65.23/65.59 ============================== CLAUSES FOR SEARCH ====================
% 65.23/65.59
% 65.23/65.59 ============================== end of clauses for search =============
% 65.23/65.59
% 65.23/65.59 ============================== SEARCH ================================
% 65.23/65.59
% 65.23/65.59 % Starting search at 0.02 seconds.
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=177.000, iters=3388
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=137.000, iters=3345
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=135.000, iters=3378
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=131.000, iters=3333
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=129.000, iters=3367
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=91.000, iters=3422
% 65.23/65.59
% 65.23/65.59 Low Water (keep): wt=89.000, iters=3372
% 65.23/65.59
% 65.23/65.59 LoCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------