TSTP Solution File: SET952+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET952+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 04:33:39 EDT 2022
% Result : Timeout 300.05s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET952+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 9 20:45:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.48/1.05 ============================== Prover9 ===============================
% 0.48/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.05 Process 28031 was started by sandbox2 on n023.cluster.edu,
% 0.48/1.05 Sat Jul 9 20:45:56 2022
% 0.48/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27878_n023.cluster.edu".
% 0.48/1.05 ============================== end of head ===========================
% 0.48/1.05
% 0.48/1.05 ============================== INPUT =================================
% 0.48/1.05
% 0.48/1.05 % Reading from file /tmp/Prover9_27878_n023.cluster.edu
% 0.48/1.05
% 0.48/1.05 set(prolog_style_variables).
% 0.48/1.05 set(auto2).
% 0.48/1.05 % set(auto2) -> set(auto).
% 0.48/1.05 % set(auto) -> set(auto_inference).
% 0.48/1.05 % set(auto) -> set(auto_setup).
% 0.48/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.05 % set(auto) -> set(auto_limits).
% 0.48/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.05 % set(auto) -> set(auto_denials).
% 0.48/1.05 % set(auto) -> set(auto_process).
% 0.48/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.05 % set(auto2) -> assign(stats, some).
% 0.48/1.05 % set(auto2) -> clear(echo_input).
% 0.48/1.05 % set(auto2) -> set(quiet).
% 0.48/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.05 % set(auto2) -> clear(print_given).
% 0.48/1.05 assign(lrs_ticks,-1).
% 0.48/1.05 assign(sos_limit,10000).
% 0.48/1.05 assign(order,kbo).
% 0.48/1.05 set(lex_order_vars).
% 0.48/1.05 clear(print_given).
% 0.48/1.05
% 0.48/1.05 % formulas(sos). % not echoed (21 formulas)
% 0.48/1.05
% 0.48/1.05 ============================== end of input ==========================
% 0.48/1.05
% 0.48/1.05 % From the command line: assign(max_seconds, 300).
% 0.48/1.05
% 0.48/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.05
% 0.48/1.05 % Formulas that are not ordinary clauses:
% 0.48/1.05 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 3 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 4 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 5 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 7 (all A all B all C (C = cartesian_product2(A,B) <-> (all D (in(D,C) <-> (exists E exists F (in(E,A) & in(F,B) & D = ordered_pair(E,F))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 8 (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.48/1.05 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.48/1.05 10 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 11 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 12 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 13 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 14 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(axiom) # label(non_Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------