TSTP Solution File: SEU183+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU183+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:43 EDT 2022
% Result : Timeout 300.03s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU183+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 : Mon Jun 20 08:55:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 27929 was started by sandbox on n027.cluster.edu,
% 0.43/1.04 Mon Jun 20 08:55:25 2022
% 0.43/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27776_n027.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_27776_n027.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (35 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.04
% 0.43/1.04 % Formulas that are not ordinary clauses:
% 0.43/1.04 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 3 (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.43/1.04 4 (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.43/1.04 5 (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.43/1.04 6 (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.43/1.04 7 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 10 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 11 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 12 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 13 (all A all B (relation(A) & relation(B) -> relation(relation_composition(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 14 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 15 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 16 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 17 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 18 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 19 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 20 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 21 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 22 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 23 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 24 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 25 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 26 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 27 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 28 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 29 (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].
% 238.96/239.23 30 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 31 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 32 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 33 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 238.96/239.23 34 -(all A (relation(A) -> (all B (relation(B) -> subset(relation_rng(relation_composition(A,B)),relation_rng(B)))))) # label(t45_relat_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 238.96/239.23
% 238.96/239.23 ============================== end of process non-clausal formulas ===
% 238.96/239.23
% 238.96/239.23 ============================== PROCESS INITIAL CLAUSES ===============
% 238.96/239.23
% 238.96/239.23 ============================== PREDICATE ELIMINATION =================
% 238.96/239.23
% 238.96/239.23 ============================== end predicate elimination =============
% 238.96/239.23
% 238.96/239.23 Auto_denials: (non-Horn, no changes).
% 238.96/239.23
% 238.96/239.23 Term ordering decisions:
% 238.96/239.23 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. powerset=1. relation_rng=1. singleton=1. f9=1. f10=1. f11=1. f2=1. f6=1. f7=1. f8=1. f5=1.
% 238.96/239.23
% 238.96/239.23 ============================== end of process initial clauses ========
% 238.96/239.23
% 238.96/239.23 ============================== CLAUSES FOR SEARCH ====================
% 238.96/239.23
% 238.96/239.23 ============================== end of clauses for search =============
% 238.96/239.23
% 238.96/239.23 ============================== SEARCH ================================
% 238.96/239.23
% 238.96/239.23 % Starting search at 0.02 seconds.
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=135.000, iters=3335
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=131.000, iters=3382
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=129.000, iters=3376
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=91.000, iters=3345
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=89.000, iters=3366
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=87.000, iters=3337
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=85.000, iters=3372
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=83.000, iters=3342
% 238.96/239.23
% 238.96/239.23 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 91 (0.00 of 157.17 sec).
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=81.000, iters=3344
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=76.000, iters=3412
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=69.000, iters=3921
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=61.000, iters=3440
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=59.000, iters=3683
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=53.000, iters=3615
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=40.000, iters=3570
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=36.000, iters=3592
% 238.96/239.23
% 238.96/239.23 Low Water (keep): wt=14.000, iters=3413
% 238.96/239.23
% 238.96/239.23 Low Water (displace): id=6151, wt=177.000
% 238.96/239.23
% 238.96/239.23 Low Water (displace): id=6161, wt=137.000
% 238.96/239.23
% 238.96/239.23 Low Water (displace): id=6131, wt=135.000
% 238.96/239.23
% 238.96/239.23 Low Water (displace): id=6355, wt=131Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------