TSTP Solution File: SEU254+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:23 EDT 2022
% Result : Timeout 300.05s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 00:31:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.03 ============================== Prover9 ===============================
% 0.76/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.03 Process 25263 was started by sandbox on n026.cluster.edu,
% 0.76/1.03 Mon Jun 20 00:31:41 2022
% 0.76/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25110_n026.cluster.edu".
% 0.76/1.03 ============================== end of head ===========================
% 0.76/1.03
% 0.76/1.03 ============================== INPUT =================================
% 0.76/1.03
% 0.76/1.03 % Reading from file /tmp/Prover9_25110_n026.cluster.edu
% 0.76/1.03
% 0.76/1.03 set(prolog_style_variables).
% 0.76/1.03 set(auto2).
% 0.76/1.03 % set(auto2) -> set(auto).
% 0.76/1.03 % set(auto) -> set(auto_inference).
% 0.76/1.03 % set(auto) -> set(auto_setup).
% 0.76/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.03 % set(auto) -> set(auto_limits).
% 0.76/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.03 % set(auto) -> set(auto_denials).
% 0.76/1.03 % set(auto) -> set(auto_process).
% 0.76/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.03 % set(auto2) -> assign(stats, some).
% 0.76/1.03 % set(auto2) -> clear(echo_input).
% 0.76/1.03 % set(auto2) -> set(quiet).
% 0.76/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.03 % set(auto2) -> clear(print_given).
% 0.76/1.03 assign(lrs_ticks,-1).
% 0.76/1.03 assign(sos_limit,10000).
% 0.76/1.03 assign(order,kbo).
% 0.76/1.03 set(lex_order_vars).
% 0.76/1.03 clear(print_given).
% 0.76/1.03
% 0.76/1.03 % formulas(sos). % not echoed (34 formulas)
% 0.76/1.03
% 0.76/1.03 ============================== end of input ==========================
% 0.76/1.03
% 0.76/1.03 % From the command line: assign(max_seconds, 300).
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.03
% 0.76/1.03 % Formulas that are not ordinary clauses:
% 0.76/1.03 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 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.76/1.03 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 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.76/1.03 6 (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.76/1.03 7 (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.76/1.03 8 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 9 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 10 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 11 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 12 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 13 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 14 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 15 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 16 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 17 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 18 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 19 (all A (relation(A) -> (transitive(A) <-> (all B all C all D (in(ordered_pair(B,C),A) & in(ordered_pair(C,D),A) -> in(ordered_pair(B,D),A)))))) # label(l2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 20 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 21 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 22 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 23 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 24 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.31 25 (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].
% 1.04/1.32 26 (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].
% 1.04/1.32 27 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 28 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 29 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 30 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 31 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 32 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 1.04/1.32 33 -(all A all B (relation(B) -> (transitive(B) -> transitive(relation_restriction(B,A))))) # label(t24_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.04/1.32
% 1.04/1.32 ============================== end of process non-clausal formulas ===
% 1.04/1.32
% 1.04/1.32 ============================== PROCESS INITIAL CLAUSES ===============
% 1.04/1.32
% 1.04/1.32 ============================== PREDICATE ELIMINATION =================
% 1.04/1.32 34 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(3)].
% 1.04/1.32 35 function(c1) # label(rc1_funct_1) # label(axiom). [clausify(20)].
% 1.04/1.32 36 function(c3) # label(rc2_funct_1) # label(axiom). [clausify(22)].
% 1.04/1.32 37 function(c5) # label(rc3_funct_1) # label(axiom). [clausify(24)].
% 1.04/1.32 38 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom). [clausify(2)].
% 1.04/1.32 Derived: -relation(c1) | -empty(c1) | one_to_one(c1). [resolve(34,c,35,a)].
% 1.04/1.32 Derived: -relation(c3) | -empty(c3) | one_to_one(c3). [resolve(34,c,36,a)].
% 1.04/1.32 Derived: -relation(c5) | -empty(c5) | one_to_one(c5). [resolve(34,c,37,a)].
% 1.04/1.32 Derived: -relation(A) | -empty(A) | one_to_one(A) | -empty(A). [resolve(34,c,38,b)].
% 1.04/1.32 39 -element(A,B) | empty(B) | in(A,B) # label(t2_subset) # label(axiom). [clausify(29)].
% 1.04/1.32 40 element(f1(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(16)].
% 1.04/1.32 41 -in(A,B) | element(A,B) # label(t1_subset) # label(axiom). [clausify(27)].
% 1.04/1.32 Derived: empty(A) | in(f1(A),A). [resolve(39,a,40,a)].
% 1.04/1.32
% 1.04/1.32 ============================== end predicate elimination =============
% 1.04/1.32
% 1.04/1.32 Auto_denials: (non-Horn, no changes).
% 1.04/1.32
% 1.04/1.32 Term ordering decisions:
% 1.04/1.32 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. ordered_pair=1. cartesian_product2=1. relation_restriction=1. set_intersection2=1. unordered_pair=1. singleton=1. f1=1. f2=1. f3=1. f4=1.
% 1.04/1.32
% 1.04/1.32 ============================== end of process initial clauses ========
% 1.04/1.32
% 1.04/1.32 ============================== CLAUSES FOR SEARCH ====================
% 1.04/1.32
% 1.04/1.32 ============================== end of clauses for search =============
% 1.04/1.32
% 1.04/1.32 ============================== SEARCH ================================
% 1.04/1.32
% 1.04/1.32 % Starting search at 0.02 seconds.
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=39.000Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------