TSTP Solution File: SEU138+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU138+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:16 EDT 2022
% Result : Timeout 300.03s 300.41s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU138+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 23:18:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 4695 was started by sandbox on n017.cluster.edu,
% 0.41/0.99 Sun Jun 19 23:18:29 2022
% 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4541_n017.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_4541_n017.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (51 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 2 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 3 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 4 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 5 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 6 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 7 (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.41/0.99 8 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 9 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 10 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 11 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 12 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 13 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 14 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 15 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 16 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 17 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 18 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 19 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 20 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 21 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 22 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 23 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 24 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 25 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 26 (all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 27 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 28 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 29 (all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 30 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 31 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 32 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 33 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 34 (all A all B all C (subset(A,B) -> subset(set_difference(A,C),set_difference(B,C)))) # label(t33_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 35 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 36 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 37 (all A all B set_union2(A,set_difference(B,A)) = set_union2(A,B)) # label(t39_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 38 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 39 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 40 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 41 (all A all B set_difference(set_union2(A,B),B) = set_difference(A,B)) # label(t40_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 42 (all A all B (subset(A,B) -> B = set_union2(A,set_difference(B,A)))) # label(t45_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 43 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 44 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.41/0.99 45 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 46 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 47 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clausCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------