TSTP Solution File: SEU246+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU246+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:30:19 EDT 2022
% Result : Timeout 300.10s 300.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU246+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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 14:42:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.88/1.19 ============================== Prover9 ===============================
% 0.88/1.19 Prover9 (32) version 2009-11A, November 2009.
% 0.88/1.19 Process 11861 was started by sandbox on n015.cluster.edu,
% 0.88/1.19 Sun Jun 19 14:42:30 2022
% 0.88/1.19 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11691_n015.cluster.edu".
% 0.88/1.19 ============================== end of head ===========================
% 0.88/1.19
% 0.88/1.19 ============================== INPUT =================================
% 0.88/1.19
% 0.88/1.19 % Reading from file /tmp/Prover9_11691_n015.cluster.edu
% 0.88/1.19
% 0.88/1.19 set(prolog_style_variables).
% 0.88/1.19 set(auto2).
% 0.88/1.19 % set(auto2) -> set(auto).
% 0.88/1.19 % set(auto) -> set(auto_inference).
% 0.88/1.19 % set(auto) -> set(auto_setup).
% 0.88/1.19 % set(auto_setup) -> set(predicate_elim).
% 0.88/1.19 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.88/1.19 % set(auto) -> set(auto_limits).
% 0.88/1.19 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.88/1.19 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.88/1.19 % set(auto) -> set(auto_denials).
% 0.88/1.19 % set(auto) -> set(auto_process).
% 0.88/1.19 % set(auto2) -> assign(new_constants, 1).
% 0.88/1.19 % set(auto2) -> assign(fold_denial_max, 3).
% 0.88/1.19 % set(auto2) -> assign(max_weight, "200.000").
% 0.88/1.19 % set(auto2) -> assign(max_hours, 1).
% 0.88/1.19 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.88/1.19 % set(auto2) -> assign(max_seconds, 0).
% 0.88/1.19 % set(auto2) -> assign(max_minutes, 5).
% 0.88/1.19 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.88/1.19 % set(auto2) -> set(sort_initial_sos).
% 0.88/1.19 % set(auto2) -> assign(sos_limit, -1).
% 0.88/1.19 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.88/1.19 % set(auto2) -> assign(max_megs, 400).
% 0.88/1.19 % set(auto2) -> assign(stats, some).
% 0.88/1.19 % set(auto2) -> clear(echo_input).
% 0.88/1.19 % set(auto2) -> set(quiet).
% 0.88/1.19 % set(auto2) -> clear(print_initial_clauses).
% 0.88/1.19 % set(auto2) -> clear(print_given).
% 0.88/1.19 assign(lrs_ticks,-1).
% 0.88/1.19 assign(sos_limit,10000).
% 0.88/1.19 assign(order,kbo).
% 0.88/1.19 set(lex_order_vars).
% 0.88/1.19 clear(print_given).
% 0.88/1.19
% 0.88/1.19 % formulas(sos). % not echoed (40 formulas)
% 0.88/1.19
% 0.88/1.19 ============================== end of input ==========================
% 0.88/1.19
% 0.88/1.19 % From the command line: assign(max_seconds, 300).
% 0.88/1.19
% 0.88/1.19 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.88/1.19
% 0.88/1.19 % Formulas that are not ordinary clauses:
% 0.88/1.19 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 3 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 5 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 6 (all A (relation(A) -> (all B all C (relation(C) -> (C = relation_dom_restriction(A,B) <-> (all D all E (in(ordered_pair(D,E),C) <-> in(D,B) & in(ordered_pair(D,E),A)))))))) # label(d11_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 7 (all A all B (relation(B) -> (all C (relation(C) -> (C = relation_rng_restriction(A,B) <-> (all D all E (in(ordered_pair(D,E),C) <-> in(E,A) & in(ordered_pair(D,E),B)))))))) # label(d12_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 8 (all A (relation(A) -> (all B (relation(B) -> (A = B <-> (all C all D (in(ordered_pair(C,D),A) <-> in(ordered_pair(C,D),B)))))))) # label(d2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 9 (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.88/1.19 10 (all A (relation(A) -> (all B relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B))))) # label(d6_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 11 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 12 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 13 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 14 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 15 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 16 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 17 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 18 (all A all B (relation(A) -> relation(relation_dom_restriction(A,B)))) # label(dt_k7_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 19 (all A all B (relation(B) -> relation(relation_rng_restriction(A,B)))) # label(dt_k8_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 20 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 21 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 22 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 23 (all A all B (relation(A) & function(A) -> relation(relation_dom_restriction(A,B)) & function(relation_dom_restriction(A,B)))) # label(fc4_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 24 (all A all B (relation(B) & function(B) -> relation(relation_rng_restriction(A,B)) & function(relation_rng_restriction(A,B)))) # label(fc5_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 25 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 26 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 27 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 28 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 29 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 30 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 31 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 32 (all A all B all C (relation(C) -> (in(A,relation_restriction(C,B)) <-> in(A,C) & in(A,cartesian_product2(B,B))))) # label(t16_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 33 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 34 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 35 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 36 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 37 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 38 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.88/1.19 39 -(all A all B (relation(B) -> relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A))) # label(t17_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.88/1.19
% 0.88/1.19 ============================== end of process non-clausal formulas ===
% 0.88/1.19
% 0.88/1.19 ============================== PROCESS INITIAL CLAUSES ===============
% 0.88/1.19
% 0.88/1.19 ============================== PREDICATE ELIMINATION =================
% 0.88/1.19 40 -element(A,B) | empty(B) | in(A,B) # label(t2_subset) # label(axiom). [clausify(35)].
% 0.88/1.19 41 element(f7(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(21)].
% 0.88/1.19 42 -in(A,B) | element(A,B) # label(t1_subset) # label(axiom). [clausify(33)].
% 0.88/1.19 Derived: empty(A) | in(f7(A),A). [resolve(40,a,41,a)].
% 0.88/1.19
% 0.88/1.19 ============================== end predicate elimination =============
% 0.88/1.19
% 0.88/1.19 Auto_denials: (non-Horn, no changes).
% 0.88/1.19
% 0.88/1.19 Term ordering decisions:
% 0.88/1.19 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------