TSTP Solution File: SET694+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET694+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:31:27 EDT 2022
% Result : Timeout 300.01s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET694+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 Jul 10 09:08:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.98 ============================== Prover9 ===============================
% 0.71/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.98 Process 590 was started by sandbox on n003.cluster.edu,
% 0.71/0.98 Sun Jul 10 09:08:15 2022
% 0.71/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_418_n003.cluster.edu".
% 0.71/0.98 ============================== end of head ===========================
% 0.71/0.98
% 0.71/0.98 ============================== INPUT =================================
% 0.71/0.98
% 0.71/0.98 % Reading from file /tmp/Prover9_418_n003.cluster.edu
% 0.71/0.98
% 0.71/0.98 set(prolog_style_variables).
% 0.71/0.98 set(auto2).
% 0.71/0.98 % set(auto2) -> set(auto).
% 0.71/0.98 % set(auto) -> set(auto_inference).
% 0.71/0.98 % set(auto) -> set(auto_setup).
% 0.71/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.98 % set(auto) -> set(auto_limits).
% 0.71/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.98 % set(auto) -> set(auto_denials).
% 0.71/0.98 % set(auto) -> set(auto_process).
% 0.71/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.98 % set(auto2) -> assign(stats, some).
% 0.71/0.98 % set(auto2) -> clear(echo_input).
% 0.71/0.98 % set(auto2) -> set(quiet).
% 0.71/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.98 % set(auto2) -> clear(print_given).
% 0.71/0.98 assign(lrs_ticks,-1).
% 0.71/0.98 assign(sos_limit,10000).
% 0.71/0.98 assign(order,kbo).
% 0.71/0.98 set(lex_order_vars).
% 0.71/0.98 clear(print_given).
% 0.71/0.98
% 0.71/0.98 % formulas(sos). % not echoed (12 formulas)
% 0.71/0.98
% 0.71/0.98 ============================== end of input ==========================
% 0.71/0.98
% 0.71/0.98 % From the command line: assign(max_seconds, 300).
% 0.71/0.98
% 0.71/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.98
% 0.71/0.98 % Formulas that are not ordinary clauses:
% 0.71/0.98 1 (all A all B (subset(A,B) <-> (all X (member(X,A) -> member(X,B))))) # label(subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 2 (all A all B (equal_set(A,B) <-> subset(A,B) & subset(B,A))) # label(equal_set) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 3 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 4 (all X all A all B (member(X,intersection(A,B)) <-> member(X,A) & member(X,B))) # label(intersection) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 5 (all X all A all B (member(X,union(A,B)) <-> member(X,A) | member(X,B))) # label(union) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 6 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 7 (all B all A all E (member(B,difference(E,A)) <-> member(B,E) & -member(B,A))) # label(difference) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 8 (all X all A (member(X,singleton(A)) <-> X = A)) # label(singleton) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 9 (all X all A all B (member(X,unordered_pair(A,B)) <-> X = A | X = B)) # label(unordered_pair) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 10 (all X all A (member(X,sum(A)) <-> (exists Y (member(Y,A) & member(X,Y))))) # label(sum) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 11 (all X all A (member(X,product(A)) <-> (all Y (member(Y,A) -> member(X,Y))))) # label(product) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.98 12 -(all A all B subset(union(power_set(A),power_set(B)),power_set(union(A,B)))) # label(thI22) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.98
% 0.71/0.98 ============================== end of process non-clausal formulas ===
% 0.71/0.98
% 0.71/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.98
% 0.71/0.98 ============================== PREDICATE ELIMINATION =================
% 0.71/0.98 13 equal_set(A,B) | -subset(A,B) | -subset(B,A) # label(equal_set) # label(axiom). [Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------