TSTP Solution File: SYN014-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN014-2 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 21 11:15:28 EDT 2022

% Result   : Unsatisfiable 0.69s 0.99s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n013.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 : Mon Jul 11 23:21:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/0.99  ============================== Prover9 ===============================
% 0.69/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.99  Process 5909 was started by sandbox on n013.cluster.edu,
% 0.69/0.99  Mon Jul 11 23:21:45 2022
% 0.69/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5756_n013.cluster.edu".
% 0.69/0.99  ============================== end of head ===========================
% 0.69/0.99  
% 0.69/0.99  ============================== INPUT =================================
% 0.69/0.99  
% 0.69/0.99  % Reading from file /tmp/Prover9_5756_n013.cluster.edu
% 0.69/0.99  
% 0.69/0.99  set(prolog_style_variables).
% 0.69/0.99  set(auto2).
% 0.69/0.99      % set(auto2) -> set(auto).
% 0.69/0.99      % set(auto) -> set(auto_inference).
% 0.69/0.99      % set(auto) -> set(auto_setup).
% 0.69/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.69/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.99      % set(auto) -> set(auto_limits).
% 0.69/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.99      % set(auto) -> set(auto_denials).
% 0.69/0.99      % set(auto) -> set(auto_process).
% 0.69/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.69/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.69/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.69/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.69/0.99      % set(auto2) -> assign(stats, some).
% 0.69/0.99      % set(auto2) -> clear(echo_input).
% 0.69/0.99      % set(auto2) -> set(quiet).
% 0.69/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.99      % set(auto2) -> clear(print_given).
% 0.69/0.99  assign(lrs_ticks,-1).
% 0.69/0.99  assign(sos_limit,10000).
% 0.69/0.99  assign(order,kbo).
% 0.69/0.99  set(lex_order_vars).
% 0.69/0.99  clear(print_given).
% 0.69/0.99  
% 0.69/0.99  % formulas(sos).  % not echoed (26 formulas)
% 0.69/0.99  
% 0.69/0.99  ============================== end of input ==========================
% 0.69/0.99  
% 0.69/0.99  % From the command line: assign(max_seconds, 300).
% 0.69/0.99  
% 0.69/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.99  
% 0.69/0.99  % Formulas that are not ordinary clauses:
% 0.69/0.99  
% 0.69/0.99  ============================== end of process non-clausal formulas ===
% 0.69/0.99  
% 0.69/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.99  
% 0.69/0.99  ============================== PREDICATE ELIMINATION =================
% 0.69/0.99  
% 0.69/0.99  ============================== end predicate elimination =============
% 0.69/0.99  
% 0.69/0.99  Auto_denials:  (non-Horn, no changes).
% 0.69/0.99  
% 0.69/0.99  Term ordering decisions:
% 0.69/0.99  Function symbol KB weights:  m=1. n=1. k=1. a=1. f=1. g=1.
% 0.69/0.99  
% 0.69/0.99  ============================== end of process initial clauses ========
% 0.69/0.99  
% 0.69/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99  
% 0.69/0.99  ============================== end of clauses for search =============
% 0.69/0.99  
% 0.69/0.99  ============================== SEARCH ================================
% 0.69/0.99  
% 0.69/0.99  % Starting search at 0.01 seconds.
% 0.69/0.99  
% 0.69/0.99  ============================== PROOF =================================
% 0.69/0.99  % SZS status Unsatisfiable
% 0.69/0.99  % SZS output start Refutation
% 0.69/0.99  
% 0.69/0.99  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.69/0.99  % Length of proof is 7.
% 0.69/0.99  % Level of proof is 2.
% 0.69/0.99  % Maximum clause weight is 9.000.
% 0.69/0.99  % Given clauses 11.
% 0.69/0.99  
% 0.69/0.99  2 equalish(n,k) # label(c_20) # label(negated_conjecture).  [assumption].
% 0.69/0.99  3 equalish(m,k) # label(c_23) # label(negated_conjecture).  [assumption].
% 0.69/0.99  7 -equalish(m,n) # label(c_19) # label(negated_conjecture).  [assumption].
% 0.69/0.99  10 -equalish(A,B) | equalish(B,A) # label(symmetryish) # label(axiom).  [assumption].
% 0.69/0.99  11 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivityish) # label(axiom).  [assumption].
% 0.69/0.99  28 equalish(k,n).  [resolve(10,a,2,a)].
% 0.69/0.99  37 $F.  [ur(11,a,3,a,c,7,a),unit_del(a,28)].
% 0.69/0.99  
% 0.69/0.99  % SZS output end Refutation
% 0.69/0.99  ============================== end of proof ==========================
% 0.69/0.99  
% 0.69/0.99  ============================== STATISTICS ============================
% 0.69/0.99  
% 0.69/0.99  Given=11. Generated=56. Kept=36. proofs=1.
% 0.69/0.99  Usable=11. Sos=21. Demods=0. Limbo=4, Disabled=26. Hints=0.
% 0.69/0.99  Megabytes=0.05.
% 0.69/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99  
% 0.69/0.99  ============================== end of statistics =====================
% 0.69/0.99  
% 0.69/0.99  ============================== end of search =========================
% 0.69/0.99  
% 0.69/0.99  THEOREM PROVED
% 0.69/0.99  % SZS status Unsatisfiable
% 0.69/0.99  
% 0.69/0.99  Exiting with 1 proof.
% 0.69/0.99  
% 0.69/0.99  Process 5909 exit (max_proofs) Mon Jul 11 23:21:45 2022
% 0.69/0.99  Prover9 interrupted
%------------------------------------------------------------------------------