TSTP Solution File: SYN568-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN568-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n007.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:21:08 EDT 2022

% Result   : Unsatisfiable 0.61s 0.89s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN568-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul 12 03:24:48 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.61/0.89  ============================== Prover9 ===============================
% 0.61/0.89  Prover9 (32) version 2009-11A, November 2009.
% 0.61/0.89  Process 12127 was started by sandbox2 on n007.cluster.edu,
% 0.61/0.89  Tue Jul 12 03:24:49 2022
% 0.61/0.89  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11973_n007.cluster.edu".
% 0.61/0.89  ============================== end of head ===========================
% 0.61/0.89  
% 0.61/0.89  ============================== INPUT =================================
% 0.61/0.89  
% 0.61/0.89  % Reading from file /tmp/Prover9_11973_n007.cluster.edu
% 0.61/0.89  
% 0.61/0.89  set(prolog_style_variables).
% 0.61/0.89  set(auto2).
% 0.61/0.89      % set(auto2) -> set(auto).
% 0.61/0.89      % set(auto) -> set(auto_inference).
% 0.61/0.89      % set(auto) -> set(auto_setup).
% 0.61/0.89      % set(auto_setup) -> set(predicate_elim).
% 0.61/0.89      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.61/0.89      % set(auto) -> set(auto_limits).
% 0.61/0.89      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.61/0.89      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.61/0.89      % set(auto) -> set(auto_denials).
% 0.61/0.89      % set(auto) -> set(auto_process).
% 0.61/0.89      % set(auto2) -> assign(new_constants, 1).
% 0.61/0.89      % set(auto2) -> assign(fold_denial_max, 3).
% 0.61/0.89      % set(auto2) -> assign(max_weight, "200.000").
% 0.61/0.89      % set(auto2) -> assign(max_hours, 1).
% 0.61/0.89      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.61/0.89      % set(auto2) -> assign(max_seconds, 0).
% 0.61/0.89      % set(auto2) -> assign(max_minutes, 5).
% 0.61/0.89      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.61/0.89      % set(auto2) -> set(sort_initial_sos).
% 0.61/0.89      % set(auto2) -> assign(sos_limit, -1).
% 0.61/0.89      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.61/0.89      % set(auto2) -> assign(max_megs, 400).
% 0.61/0.89      % set(auto2) -> assign(stats, some).
% 0.61/0.89      % set(auto2) -> clear(echo_input).
% 0.61/0.89      % set(auto2) -> set(quiet).
% 0.61/0.89      % set(auto2) -> clear(print_initial_clauses).
% 0.61/0.89      % set(auto2) -> clear(print_given).
% 0.61/0.89  assign(lrs_ticks,-1).
% 0.61/0.89  assign(sos_limit,10000).
% 0.61/0.89  assign(order,kbo).
% 0.61/0.89  set(lex_order_vars).
% 0.61/0.89  clear(print_given).
% 0.61/0.89  
% 0.61/0.89  % formulas(sos).  % not echoed (20 formulas)
% 0.61/0.89  
% 0.61/0.89  ============================== end of input ==========================
% 0.61/0.89  
% 0.61/0.89  % From the command line: assign(max_seconds, 300).
% 0.61/0.89  
% 0.61/0.89  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.61/0.89  
% 0.61/0.89  % Formulas that are not ordinary clauses:
% 0.61/0.89  
% 0.61/0.89  ============================== end of process non-clausal formulas ===
% 0.61/0.89  
% 0.61/0.89  ============================== PROCESS INITIAL CLAUSES ===============
% 0.61/0.89  
% 0.61/0.89  ============================== PREDICATE ELIMINATION =================
% 0.61/0.89  
% 0.61/0.89  ============================== end predicate elimination =============
% 0.61/0.89  
% 0.61/0.89  Auto_denials:  (non-Horn, no changes).
% 0.61/0.89  
% 0.61/0.89  Term ordering decisions:
% 0.61/0.89  Function symbol KB weights:  c12=1. c13=1. c14=1. f4=1. f6=1. f5=1. f9=1. f7=1. f8=1.
% 0.61/0.89  
% 0.61/0.89  ============================== end of process initial clauses ========
% 0.61/0.89  
% 0.61/0.89  ============================== CLAUSES FOR SEARCH ====================
% 0.61/0.89  
% 0.61/0.89  ============================== end of clauses for search =============
% 0.61/0.89  
% 0.61/0.89  ============================== SEARCH ================================
% 0.61/0.89  
% 0.61/0.89  % Starting search at 0.01 seconds.
% 0.61/0.89  
% 0.61/0.89  ============================== PROOF =================================
% 0.61/0.89  % SZS status Unsatisfiable
% 0.61/0.89  % SZS output start Refutation
% 0.61/0.89  
% 0.61/0.89  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.61/0.89  % Length of proof is 10.
% 0.61/0.89  % Level of proof is 3.
% 0.61/0.89  % Maximum clause weight is 19.000.
% 0.61/0.89  % Given clauses 26.
% 0.61/0.89  
% 0.61/0.89  3 p11(f5(f6(c12)),f9(A)) # label(p11_4) # label(negated_conjecture).  [assumption].
% 0.61/0.89  4 p10(A,B) | p11(B,A) # label(p10_5) # label(negated_conjecture).  [assumption].
% 0.61/0.89  5 p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))) # label(p11_18) # label(negated_conjecture).  [assumption].
% 0.61/0.89  6 -p11(f9(c13),f9(c14)) # label(not_p11_3) # label(negated_conjecture).  [assumption].
% 0.61/0.89  7 -p10(A,B) | -p11(B,A) # label(not_p10_6) # label(negated_conjecture).  [assumption].
% 0.61/0.89  8 -p3(f6(f7(f8(c12))),f6(c12)) # label(not_p3_7) # label(negated_conjecture).  [assumption].
% 0.61/0.89  20 p3(A,f6(c12)) | p10(f4(B,A),f4(C,A)) | -p10(B,C) | -p11(f5(f6(c12)),B) # label(p3_20) # label(negated_conjecture).  [assumption].
% 0.61/0.89  24 -p10(f4(f9(c14),f6(f7(f8(c12)))),f4(f9(c13),f6(f7(f8(c12))))).  [ur(7,b,5,a)].
% 0.61/0.89  40 -p10(f9(c14),f9(c13)).  [ur(20,a,8,a,b,24,a,d,3,a)].
% 0.61/0.89  42 $F.  [resolve(40,a,4,a),unit_del(a,6)].
% 0.61/0.89  
% 0.61/0.89  % SZS output end Refutation
% 0.61/0.89  ============================== end of proof ==========================
% 0.61/0.89  
% 0.61/0.89  ============================== STATISTICS ============================
% 0.61/0.89  
% 0.61/0.89  Given=26. Generated=58. Kept=41. proofs=1.
% 0.61/0.89  Usable=26. Sos=15. Demods=0. Limbo=0, Disabled=20. Hints=0.
% 0.61/0.89  Megabytes=0.08.
% 0.61/0.89  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.61/0.89  
% 0.61/0.89  ============================== end of statistics =====================
% 0.61/0.89  
% 0.61/0.89  ============================== end of search =========================
% 0.61/0.89  
% 0.61/0.89  THEOREM PROVED
% 0.61/0.89  % SZS status Unsatisfiable
% 0.61/0.89  
% 0.61/0.89  Exiting with 1 proof.
% 0.61/0.89  
% 0.61/0.89  Process 12127 exit (max_proofs) Tue Jul 12 03:24:49 2022
% 0.61/0.89  Prover9 interrupted
%------------------------------------------------------------------------------