TSTP Solution File: SET613+3 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n028.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:30:46 EDT 2022

% Result   : Timeout 300.03s 300.28s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET613+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 03:49:27 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.04  ============================== Prover9 ===============================
% 0.45/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.04  Process 32619 was started by sandbox2 on n028.cluster.edu,
% 0.45/1.04  Sun Jul 10 03:49:27 2022
% 0.45/1.04  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32450_n028.cluster.edu".
% 0.45/1.04  ============================== end of head ===========================
% 0.45/1.04  
% 0.45/1.04  ============================== INPUT =================================
% 0.45/1.04  
% 0.45/1.04  % Reading from file /tmp/Prover9_32450_n028.cluster.edu
% 0.45/1.04  
% 0.45/1.04  set(prolog_style_variables).
% 0.45/1.04  set(auto2).
% 0.45/1.04      % set(auto2) -> set(auto).
% 0.45/1.04      % set(auto) -> set(auto_inference).
% 0.45/1.04      % set(auto) -> set(auto_setup).
% 0.45/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.04      % set(auto) -> set(auto_limits).
% 0.45/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.04      % set(auto) -> set(auto_denials).
% 0.45/1.04      % set(auto) -> set(auto_process).
% 0.45/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.04      % set(auto2) -> assign(stats, some).
% 0.45/1.04      % set(auto2) -> clear(echo_input).
% 0.45/1.04      % set(auto2) -> set(quiet).
% 0.45/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.04      % set(auto2) -> clear(print_given).
% 0.45/1.04  assign(lrs_ticks,-1).
% 0.45/1.04  assign(sos_limit,10000).
% 0.45/1.04  assign(order,kbo).
% 0.45/1.04  set(lex_order_vars).
% 0.45/1.04  clear(print_given).
% 0.45/1.04  
% 0.45/1.04  % formulas(sos).  % not echoed (11 formulas)
% 0.45/1.04  
% 0.45/1.04  ============================== end of input ==========================
% 0.45/1.04  
% 0.45/1.04  % From the command line: assign(max_seconds, 300).
% 0.45/1.04  
% 0.45/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.04  
% 0.45/1.04  % Formulas that are not ordinary clauses:
% 0.45/1.04  1 (all B all C ((all D (member(D,B) <-> member(D,C))) -> B = C)) # label(member_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  2 (all B all C all D (member(D,union(B,C)) <-> member(D,B) | member(D,C))) # label(union_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  3 (all B all C all D (member(D,intersection(B,C)) <-> member(D,B) & member(D,C))) # label(intersection_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  4 (all B all C all D (member(D,difference(B,C)) <-> member(D,B) & -member(D,C))) # label(difference_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  5 (all B all C (B = C <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  6 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  7 (all B all C intersection(B,C) = intersection(C,B)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  8 (all B all C (B = C <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  9 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  10 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  11 -(all B all C difference(union(B,C),intersection(B,C)) = union(difference(B,C),difference(C,B))) # label(prove_difference_union_intersection) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.04  
% 0.45/1.04  ============================== end of process non-clausal formulas ===
% 0.45/1.04  
% 0.45/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.04  
% 0.45/1.04  ============================== PREDICATE ELIMINATION =================
% 0.45/1.04  
% 0.45/1.04  ============================== end predicate elimination =============
% 0.45/1.04  
% 0.45/1.04  Auto_denials:  (non-Horn, no changes).
% 0.45/1.04  
% 0.45/1.04  Term ordering decisions:
% 0.45/1.04  Function symCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------