TSTP Solution File: SEU250+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU250+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:22 EDT 2022
% Result : Timeout 300.10s 300.42s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU250+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 : n018.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 11:51:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.00 ============================== Prover9 ===============================
% 0.71/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.00 Process 28718 was started by sandbox on n018.cluster.edu,
% 0.71/1.00 Mon Jun 20 11:51:06 2022
% 0.71/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28377_n018.cluster.edu".
% 0.71/1.00 ============================== end of head ===========================
% 0.71/1.00
% 0.71/1.00 ============================== INPUT =================================
% 0.71/1.00
% 0.71/1.00 % Reading from file /tmp/Prover9_28377_n018.cluster.edu
% 0.71/1.00
% 0.71/1.00 set(prolog_style_variables).
% 0.71/1.00 set(auto2).
% 0.71/1.00 % set(auto2) -> set(auto).
% 0.71/1.00 % set(auto) -> set(auto_inference).
% 0.71/1.00 % set(auto) -> set(auto_setup).
% 0.71/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.00 % set(auto) -> set(auto_limits).
% 0.71/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.00 % set(auto) -> set(auto_denials).
% 0.71/1.00 % set(auto) -> set(auto_process).
% 0.71/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.00 % set(auto2) -> assign(stats, some).
% 0.71/1.00 % set(auto2) -> clear(echo_input).
% 0.71/1.00 % set(auto2) -> set(quiet).
% 0.71/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.00 % set(auto2) -> clear(print_given).
% 0.71/1.00 assign(lrs_ticks,-1).
% 0.71/1.00 assign(sos_limit,10000).
% 0.71/1.00 assign(order,kbo).
% 0.71/1.00 set(lex_order_vars).
% 0.71/1.00 clear(print_given).
% 0.71/1.00
% 0.71/1.00 % formulas(sos). % not echoed (42 formulas)
% 0.71/1.00
% 0.71/1.00 ============================== end of input ==========================
% 0.71/1.00
% 0.71/1.00 % From the command line: assign(max_seconds, 300).
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00
% 0.71/1.00 % Formulas that are not ordinary clauses:
% 0.71/1.00 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 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.71/1.00 4 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 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.71/1.00 6 (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.71/1.00 7 (all A (relation(A) -> relation_field(A) = set_union2(relation_dom(A),relation_rng(A)))) # label(d6_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 8 (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.71/1.00 9 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 11 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 12 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 13 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 14 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 15 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 16 $T # label(dt_k3_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 17 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 18 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 19 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 20 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 21 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 22 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 23 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 24 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 25 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 26 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 28 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 29 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 30 (all A all B all C (relation(C) -> (in(A,relation_field(relation_restriction(C,B))) -> in(A,relation_field(C)) & in(A,B)))) # label(t19_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 31 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 32 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 33 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 34 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 35 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 36 (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].
% 0.71/1.01 37 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 38 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 39 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 40 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 41 -(all A all B (relation(B) -> subset(relation_field(relation_restriction(B,A)),relation_field(B)) & subset(relation_field(relation_restriction(B,A)),A))) # label(t20_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.01
% 0.71/1.01 ============================== end of process non-clausal formulas ===
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.01
% 0.71/1.01 ============================== PREDICATE ELIMINATION =================
% 0.71/1.01 42 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(3)].
% 0.71/1.01 43 function(c1) # label(rc1_funct_1) # label(axiom). [clausify(24)].
% 0.71/1.01 44 function(c3) # label(rc2_funct_1) # label(axiom). [clausify(26)].
% 0.71/1.01 45 function(c5) # label(rc3_funct_1) # label(axiom). [clausify(28)].
% 0.71/1.01 46 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom). [clausify(2)].
% 0.71/1.01 Derived: -relation(c1) | -empty(c1) | one_to_one(c1). [resolve(42,c,43,a)].
% 0.71/1.01 Derived: -relation(c3) | -empty(c3) | one_to_one(c3). [resolve(42,c,44,a)].
% 0.71/1.01 Derived: -relation(c5) | -empty(c5) | one_to_one(c5). [resolve(42,c,45,a)].
% 0.71/1.01 Derived: -relation(A) | -empty(A) | one_to_one(A) | -empty(A). [resolve(42,c,46,b)].
% 0.71/1.01
% 0.71/1.01 ============================== end predicate elimination =============
% 0.71/1.01
% 0.71/1.01 Auto_denials: (non-Horn, no changes).
% 0.71/1.01
% 0.71/1.01 Term ordering decisions:
% 0.71/1.01 FunctioCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------