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

View Problem - Process Solution

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

% Computer : n013.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 13:29:16 EDT 2022

% Result   : Theorem 0.51s 1.07s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.36  % Computer : n013.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jun 19 13:36:14 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.51/1.07  ============================== Prover9 ===============================
% 0.51/1.07  Prover9 (32) version 2009-11A, November 2009.
% 0.51/1.07  Process 16261 was started by sandbox2 on n013.cluster.edu,
% 0.51/1.07  Sun Jun 19 13:36:14 2022
% 0.51/1.07  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16108_n013.cluster.edu".
% 0.51/1.07  ============================== end of head ===========================
% 0.51/1.07  
% 0.51/1.07  ============================== INPUT =================================
% 0.51/1.07  
% 0.51/1.07  % Reading from file /tmp/Prover9_16108_n013.cluster.edu
% 0.51/1.07  
% 0.51/1.07  set(prolog_style_variables).
% 0.51/1.07  set(auto2).
% 0.51/1.07      % set(auto2) -> set(auto).
% 0.51/1.07      % set(auto) -> set(auto_inference).
% 0.51/1.07      % set(auto) -> set(auto_setup).
% 0.51/1.07      % set(auto_setup) -> set(predicate_elim).
% 0.51/1.07      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/1.07      % set(auto) -> set(auto_limits).
% 0.51/1.07      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/1.07      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/1.07      % set(auto) -> set(auto_denials).
% 0.51/1.07      % set(auto) -> set(auto_process).
% 0.51/1.07      % set(auto2) -> assign(new_constants, 1).
% 0.51/1.07      % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/1.07      % set(auto2) -> assign(max_weight, "200.000").
% 0.51/1.07      % set(auto2) -> assign(max_hours, 1).
% 0.51/1.07      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/1.07      % set(auto2) -> assign(max_seconds, 0).
% 0.51/1.07      % set(auto2) -> assign(max_minutes, 5).
% 0.51/1.07      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/1.07      % set(auto2) -> set(sort_initial_sos).
% 0.51/1.07      % set(auto2) -> assign(sos_limit, -1).
% 0.51/1.07      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/1.07      % set(auto2) -> assign(max_megs, 400).
% 0.51/1.07      % set(auto2) -> assign(stats, some).
% 0.51/1.07      % set(auto2) -> clear(echo_input).
% 0.51/1.07      % set(auto2) -> set(quiet).
% 0.51/1.07      % set(auto2) -> clear(print_initial_clauses).
% 0.51/1.07      % set(auto2) -> clear(print_given).
% 0.51/1.07  assign(lrs_ticks,-1).
% 0.51/1.07  assign(sos_limit,10000).
% 0.51/1.07  assign(order,kbo).
% 0.51/1.07  set(lex_order_vars).
% 0.51/1.07  clear(print_given).
% 0.51/1.07  
% 0.51/1.07  % formulas(sos).  % not echoed (6 formulas)
% 0.51/1.07  
% 0.51/1.07  ============================== end of input ==========================
% 0.51/1.07  
% 0.51/1.07  % From the command line: assign(max_seconds, 300).
% 0.51/1.07  
% 0.51/1.07  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/1.07  
% 0.51/1.07  % Formulas that are not ordinary clauses:
% 0.51/1.07  1 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  2 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  3 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  4 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  5 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  6 -(all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.51/1.07  
% 0.51/1.07  ============================== end of process non-clausal formulas ===
% 0.51/1.07  
% 0.51/1.07  ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/1.07  
% 0.51/1.07  ============================== PREDICATE ELIMINATION =================
% 0.51/1.07  
% 0.51/1.07  ============================== end predicate elimination =============
% 0.51/1.07  
% 0.51/1.07  Auto_denials:  (non-Horn, no changes).
% 0.51/1.07  
% 0.51/1.07  Term ordering decisions:
% 0.51/1.07  Function symbol KB weights:  c1=1. c2=1.
% 0.51/1.07  
% 0.51/1.07  ============================== end of process initial clauses ========
% 0.51/1.07  
% 0.51/1.07  ============================== CLAUSES FOR SEARCH ====================
% 0.51/1.07  
% 0.51/1.07  ============================== end of clauses for search =============
% 0.51/1.07  
% 0.51/1.07  ============================== SEARCH ================================
% 0.51/1.07  
% 0.51/1.07  % Starting search at 0.01 seconds.
% 0.51/1.07  
% 0.51/1.07  ============================== PROOF =================================
% 0.51/1.07  % SZS status Theorem
% 0.51/1.07  % SZS output start Refutation
% 0.51/1.07  
% 0.51/1.07  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.51/1.07  % Length of proof is 11.
% 0.51/1.07  % Level of proof is 3.
% 0.51/1.07  % Maximum clause weight is 9.000.
% 0.51/1.07  % Given clauses 10.
% 0.51/1.07  
% 0.51/1.07  2 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  3 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.51/1.07  6 -(all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.51/1.07  8 subset(c1,c2) # label(t60_xboole_1) # label(negated_conjecture).  [clausify(6)].
% 0.51/1.07  9 proper_subset(c2,c1) # label(t60_xboole_1) # label(negated_conjecture).  [clausify(6)].
% 0.51/1.07  12 -proper_subset(A,B) | B != A # label(d8_xboole_0) # label(axiom).  [clausify(3)].
% 0.51/1.07  15 -proper_subset(A,B) | subset(A,B) # label(d8_xboole_0) # label(axiom).  [clausify(3)].
% 0.51/1.07  16 A = B | -subset(B,A) | -subset(A,B) # label(d10_xboole_0) # label(axiom).  [clausify(2)].
% 0.51/1.07  19 c2 != c1.  [resolve(12,a,9,a),flip(a)].
% 0.51/1.07  20 subset(c2,c1).  [resolve(15,a,9,a)].
% 0.51/1.07  21 $F.  [resolve(16,b,8,a),unit_del(a,19),unit_del(b,20)].
% 0.51/1.07  
% 0.51/1.07  % SZS output end Refutation
% 0.51/1.07  ============================== end of proof ==========================
% 0.51/1.07  
% 0.51/1.07  ============================== STATISTICS ============================
% 0.51/1.07  
% 0.51/1.07  Given=10. Generated=24. Kept=14. proofs=1.
% 0.51/1.07  Usable=10. Sos=4. Demods=0. Limbo=0, Disabled=11. Hints=0.
% 0.51/1.07  Megabytes=0.03.
% 0.51/1.07  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.51/1.07  
% 0.51/1.07  ============================== end of statistics =====================
% 0.51/1.07  
% 0.51/1.07  ============================== end of search =========================
% 0.51/1.07  
% 0.51/1.07  THEOREM PROVED
% 0.51/1.07  % SZS status Theorem
% 0.51/1.07  
% 0.51/1.07  Exiting with 1 proof.
% 0.51/1.07  
% 0.51/1.07  Process 16261 exit (max_proofs) Sun Jun 19 13:36:14 2022
% 0.51/1.07  Prover9 interrupted
%------------------------------------------------------------------------------