TSTP Solution File: SET986+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SET986+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n015.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:51 EDT 2022

% Result   : Timeout 300.02s 300.41s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET986+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 : n015.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 : Sat Jul  9 20:10:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.86/1.14  ============================== Prover9 ===============================
% 0.86/1.14  Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.14  Process 23309 was started by sandbox2 on n015.cluster.edu,
% 0.86/1.14  Sat Jul  9 20:10:23 2022
% 0.86/1.14  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23156_n015.cluster.edu".
% 0.86/1.14  ============================== end of head ===========================
% 0.86/1.14  
% 0.86/1.14  ============================== INPUT =================================
% 0.86/1.14  
% 0.86/1.14  % Reading from file /tmp/Prover9_23156_n015.cluster.edu
% 0.86/1.14  
% 0.86/1.14  set(prolog_style_variables).
% 0.86/1.14  set(auto2).
% 0.86/1.14      % set(auto2) -> set(auto).
% 0.86/1.14      % set(auto) -> set(auto_inference).
% 0.86/1.14      % set(auto) -> set(auto_setup).
% 0.86/1.14      % set(auto_setup) -> set(predicate_elim).
% 0.86/1.14      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.14      % set(auto) -> set(auto_limits).
% 0.86/1.14      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.14      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.14      % set(auto) -> set(auto_denials).
% 0.86/1.14      % set(auto) -> set(auto_process).
% 0.86/1.14      % set(auto2) -> assign(new_constants, 1).
% 0.86/1.14      % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.14      % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.14      % set(auto2) -> assign(max_hours, 1).
% 0.86/1.14      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.14      % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.14      % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.14      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.14      % set(auto2) -> set(sort_initial_sos).
% 0.86/1.14      % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.14      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.14      % set(auto2) -> assign(max_megs, 400).
% 0.86/1.14      % set(auto2) -> assign(stats, some).
% 0.86/1.14      % set(auto2) -> clear(echo_input).
% 0.86/1.14      % set(auto2) -> set(quiet).
% 0.86/1.14      % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.14      % set(auto2) -> clear(print_given).
% 0.86/1.14  assign(lrs_ticks,-1).
% 0.86/1.14  assign(sos_limit,10000).
% 0.86/1.14  assign(order,kbo).
% 0.86/1.14  set(lex_order_vars).
% 0.86/1.14  clear(print_given).
% 0.86/1.14  
% 0.86/1.14  % formulas(sos).  % not echoed (15 formulas)
% 0.86/1.14  
% 0.86/1.14  ============================== end of input ==========================
% 0.86/1.14  
% 0.86/1.14  % From the command line: assign(max_seconds, 300).
% 0.86/1.14  
% 0.86/1.14  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.14  
% 0.86/1.14  % Formulas that are not ordinary clauses:
% 0.86/1.14  1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  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.86/1.14  3 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  4 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  5 (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.86/1.14  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.86/1.14  7 (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.86/1.14  8 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  9 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  10 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  11 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  12 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  13 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  14 (all A all B all C (in(A,set_difference(B,singleton(C))) <-> in(A,B) & A != C)) # label(t64_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.86/1.14  15 -(all A all B (in(A,B) -> set_union2(set_difference(B,singleton(A)),singleton(A)) = B)) # label(t140_zfmisc_1) # label(negated_conjecture) # Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------