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

View Problem - Process Solution

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

% Computer : n020.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:28:09 EDT 2022

% Result   : Theorem 0.44s 1.00s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET194+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n020.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 : Sun Jul 10 13:24:58 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.44/1.00  ============================== Prover9 ===============================
% 0.44/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00  Process 11699 was started by sandbox2 on n020.cluster.edu,
% 0.44/1.00  Sun Jul 10 13:24:58 2022
% 0.44/1.00  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11545_n020.cluster.edu".
% 0.44/1.00  ============================== end of head ===========================
% 0.44/1.00  
% 0.44/1.00  ============================== INPUT =================================
% 0.44/1.00  
% 0.44/1.00  % Reading from file /tmp/Prover9_11545_n020.cluster.edu
% 0.44/1.00  
% 0.44/1.00  set(prolog_style_variables).
% 0.44/1.00  set(auto2).
% 0.44/1.00      % set(auto2) -> set(auto).
% 0.44/1.00      % set(auto) -> set(auto_inference).
% 0.44/1.00      % set(auto) -> set(auto_setup).
% 0.44/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00      % set(auto) -> set(auto_limits).
% 0.44/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00      % set(auto) -> set(auto_denials).
% 0.44/1.00      % set(auto) -> set(auto_process).
% 0.44/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00      % set(auto2) -> assign(stats, some).
% 0.44/1.00      % set(auto2) -> clear(echo_input).
% 0.44/1.00      % set(auto2) -> set(quiet).
% 0.44/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00      % set(auto2) -> clear(print_given).
% 0.44/1.00  assign(lrs_ticks,-1).
% 0.44/1.00  assign(sos_limit,10000).
% 0.44/1.00  assign(order,kbo).
% 0.44/1.00  set(lex_order_vars).
% 0.44/1.00  clear(print_given).
% 0.44/1.00  
% 0.44/1.00  % formulas(sos).  % not echoed (6 formulas)
% 0.44/1.00  
% 0.44/1.00  ============================== end of input ==========================
% 0.44/1.00  
% 0.44/1.00  % From the command line: assign(max_seconds, 300).
% 0.44/1.00  
% 0.44/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00  
% 0.44/1.00  % Formulas that are not ordinary clauses:
% 0.44/1.00  1 (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.44/1.00  2 (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.44/1.00  3 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.00  4 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.00  5 (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.44/1.00  6 -(all B all C subset(B,union(B,C))) # label(prove_subset_of_union) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.44/1.00  
% 0.44/1.00  ============================== end of process non-clausal formulas ===
% 0.44/1.00  
% 0.44/1.00  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00  
% 0.44/1.00  ============================== PREDICATE ELIMINATION =================
% 0.44/1.00  
% 0.44/1.00  ============================== end predicate elimination =============
% 0.44/1.00  
% 0.44/1.00  Auto_denials:  (non-Horn, no changes).
% 0.44/1.00  
% 0.44/1.00  Term ordering decisions:
% 0.44/1.00  Function symbol KB weights:  c1=1. c2=1. union=1. f1=1. f2=1.
% 0.44/1.00  
% 0.44/1.00  ============================== end of process initial clauses ========
% 0.44/1.00  
% 0.44/1.00  ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.00  
% 0.44/1.00  ============================== end of clauses for search =============
% 0.44/1.00  
% 0.44/1.00  ============================== SEARCH ================================
% 0.44/1.00  
% 0.44/1.00  % Starting search at 0.01 seconds.
% 0.44/1.00  
% 0.44/1.00  ============================== PROOF =================================
% 0.44/1.00  % SZS status Theorem
% 0.44/1.00  % SZS output start Refutation
% 0.44/1.00  
% 0.44/1.00  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.00  % Length of proof is 10.
% 0.44/1.00  % Level of proof is 3.
% 0.44/1.00  % Maximum clause weight is 9.000.
% 0.44/1.00  % Given clauses 16.
% 0.44/1.00  
% 0.44/1.00  1 (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.44/1.00  2 (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.44/1.00  6 -(all B all C subset(B,union(B,C))) # label(prove_subset_of_union) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.44/1.00  9 subset(A,B) | member(f1(A,B),A) # label(subset_defn) # label(axiom).  [clausify(2)].
% 0.44/1.00  11 -subset(c1,union(c1,c2)) # label(prove_subset_of_union) # label(negated_conjecture).  [clausify(6)].
% 0.44/1.00  12 member(A,union(B,C)) | -member(A,B) # label(union_defn) # label(axiom).  [clausify(1)].
% 0.44/1.00  14 subset(A,B) | -member(f1(A,B),B) # label(subset_defn) # label(axiom).  [clausify(2)].
% 0.44/1.00  21 member(f1(c1,union(c1,c2)),c1).  [resolve(11,a,9,a)].
% 0.44/1.00  26 -member(f1(c1,union(c1,c2)),union(c1,c2)).  [ur(14,a,11,a)].
% 0.44/1.00  48 $F.  [ur(12,a,26,a),unit_del(a,21)].
% 0.44/1.00  
% 0.44/1.00  % SZS output end Refutation
% 0.44/1.00  ============================== end of proof ==========================
% 0.44/1.00  
% 0.44/1.00  ============================== STATISTICS ============================
% 0.44/1.00  
% 0.44/1.00  Given=16. Generated=80. Kept=41. proofs=1.
% 0.44/1.00  Usable=16. Sos=22. Demods=1. Limbo=3, Disabled=13. Hints=0.
% 0.44/1.00  Megabytes=0.06.
% 0.44/1.00  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.00  
% 0.44/1.00  ============================== end of statistics =====================
% 0.44/1.00  
% 0.44/1.00  ============================== end of search =========================
% 0.44/1.00  
% 0.44/1.00  THEOREM PROVED
% 0.44/1.00  % SZS status Theorem
% 0.44/1.00  
% 0.44/1.00  Exiting with 1 proof.
% 0.44/1.00  
% 0.44/1.00  Process 11699 exit (max_proofs) Sun Jul 10 13:24:58 2022
% 0.44/1.00  Prover9 interrupted
%------------------------------------------------------------------------------