TSTP Solution File: SEU106+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU106+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:02 EDT 2022
% Result : Timeout 300.03s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU106+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n020.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 11:53:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.03 ============================== Prover9 ===============================
% 0.44/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.03 Process 30131 was started by sandbox2 on n020.cluster.edu,
% 0.44/1.03 Mon Jun 20 11:53:34 2022
% 0.44/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29975_n020.cluster.edu".
% 0.44/1.03 ============================== end of head ===========================
% 0.44/1.03
% 0.44/1.03 ============================== INPUT =================================
% 0.44/1.03
% 0.44/1.03 % Reading from file /tmp/Prover9_29975_n020.cluster.edu
% 0.44/1.03
% 0.44/1.03 set(prolog_style_variables).
% 0.44/1.03 set(auto2).
% 0.44/1.03 % set(auto2) -> set(auto).
% 0.44/1.03 % set(auto) -> set(auto_inference).
% 0.44/1.03 % set(auto) -> set(auto_setup).
% 0.44/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.03 % set(auto) -> set(auto_limits).
% 0.44/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.03 % set(auto) -> set(auto_denials).
% 0.44/1.03 % set(auto) -> set(auto_process).
% 0.44/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.03 % set(auto2) -> assign(stats, some).
% 0.44/1.03 % set(auto2) -> clear(echo_input).
% 0.44/1.03 % set(auto2) -> set(quiet).
% 0.44/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.03 % set(auto2) -> clear(print_given).
% 0.44/1.03 assign(lrs_ticks,-1).
% 0.44/1.03 assign(sos_limit,10000).
% 0.44/1.03 assign(order,kbo).
% 0.44/1.03 set(lex_order_vars).
% 0.44/1.03 clear(print_given).
% 0.44/1.03
% 0.44/1.03 % formulas(sos). % not echoed (48 formulas)
% 0.44/1.03
% 0.44/1.03 ============================== end of input ==========================
% 0.44/1.03
% 0.44/1.03 % From the command line: assign(max_seconds, 300).
% 0.44/1.03
% 0.44/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.03
% 0.44/1.03 % Formulas that are not ordinary clauses:
% 0.44/1.03 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 2 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 3 (all A (preboolean(A) -> cup_closed(A) & diff_closed(A))) # label(cc1_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 4 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 5 (all A (cup_closed(A) & diff_closed(A) -> preboolean(A))) # label(cc2_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 6 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 7 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 8 (all A all B symmetric_difference(A,B) = symmetric_difference(B,A)) # label(commutativity_k5_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 9 (all A all B symmetric_difference(A,B) = set_union2(set_difference(A,B),set_difference(B,A))) # label(d6_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 10 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 11 (all A all B (finite(B) -> finite(set_intersection2(A,B)))) # label(fc10_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 12 (all A all B (finite(A) -> finite(set_intersection2(A,B)))) # label(fc11_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 13 (all A all B (finite(A) -> finite(set_difference(A,B)))) # label(fc12_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 14 (all A all B (finite(A) & finite(B) -> finite(symmetric_difference(A,B)))) # label(fc17_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 15 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 16 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 17 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 18 (all A all B (finite(A) & finite(B) -> finite(set_union2(A,B)))) # label(fc9_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 19 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 20 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 21 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 22 (exists A (-empty(A) & cup_closed(A) & cap_closed(A) & diff_closed(A) & preboolean(A))) # label(rc1_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 23 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 24 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 25 (all A exists B (element(B,powerset(A)) & empty(B) & relation(B) & function(B) & one_to_one(B) & epsilon_transitive(B) & epsilon_connected(B) & ordinal(B) & natural(B) & finite(B))) # label(rc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 26 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 28 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 29 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 30 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 31 (all A all B set_difference(A,B) = symmetric_difference(A,set_intersection2(A,B))) # label(t100_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 32 (all A (preboolean(A) <-> (all B all C (in(B,A) & in(C,A) -> in(set_union2(B,C),A) & in(set_difference(B,C),A))))) # label(t10_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 33 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 34 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 35 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 36 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 37 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 38 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 39 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 40 (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.44/1.04 41 (all A symmetric_difference(A,empty_set) = A) # label(t5_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 42 (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.44/1.04 43 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 44 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 45 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 46 (all A all B set_intersection2(ACputime limit exceeded (core dumped)
%------------------------------------------------------------------------------