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

View Problem - Process Solution

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

% Computer : n006.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:22:07 EDT 2022

% Result   : Unsatisfiable 0.47s 1.02s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SYN724-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.36  % Computer : n006.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 : Mon Jul 11 16:03:50 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.47/1.02  ============================== Prover9 ===============================
% 0.47/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.02  Process 18917 was started by sandbox2 on n006.cluster.edu,
% 0.47/1.02  Mon Jul 11 16:03:51 2022
% 0.47/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18764_n006.cluster.edu".
% 0.47/1.02  ============================== end of head ===========================
% 0.47/1.02  
% 0.47/1.02  ============================== INPUT =================================
% 0.47/1.02  
% 0.47/1.02  % Reading from file /tmp/Prover9_18764_n006.cluster.edu
% 0.47/1.02  
% 0.47/1.02  set(prolog_style_variables).
% 0.47/1.02  set(auto2).
% 0.47/1.02      % set(auto2) -> set(auto).
% 0.47/1.02      % set(auto) -> set(auto_inference).
% 0.47/1.02      % set(auto) -> set(auto_setup).
% 0.47/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.47/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.02      % set(auto) -> set(auto_limits).
% 0.47/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.02      % set(auto) -> set(auto_denials).
% 0.47/1.02      % set(auto) -> set(auto_process).
% 0.47/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.47/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.47/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.47/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.47/1.02      % set(auto2) -> assign(stats, some).
% 0.47/1.02      % set(auto2) -> clear(echo_input).
% 0.47/1.02      % set(auto2) -> set(quiet).
% 0.47/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.02      % set(auto2) -> clear(print_given).
% 0.47/1.02  assign(lrs_ticks,-1).
% 0.47/1.02  assign(sos_limit,10000).
% 0.47/1.02  assign(order,kbo).
% 0.47/1.02  set(lex_order_vars).
% 0.47/1.02  clear(print_given).
% 0.47/1.02  
% 0.47/1.02  % formulas(sos).  % not echoed (5 formulas)
% 0.47/1.02  
% 0.47/1.02  ============================== end of input ==========================
% 0.47/1.02  
% 0.47/1.02  % From the command line: assign(max_seconds, 300).
% 0.47/1.02  
% 0.47/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.02  
% 0.47/1.02  % Formulas that are not ordinary clauses:
% 0.47/1.02  
% 0.47/1.02  ============================== end of process non-clausal formulas ===
% 0.47/1.02  
% 0.47/1.02  ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.02  
% 0.47/1.02  ============================== PREDICATE ELIMINATION =================
% 0.47/1.02  
% 0.47/1.02  ============================== end predicate elimination =============
% 0.47/1.02  
% 0.47/1.02  Auto_denials:  (non-Horn, no changes).
% 0.47/1.02  
% 0.47/1.02  Term ordering decisions:
% 0.47/1.02  Function symbol KB weights:  sk2=1. sk1=1.
% 0.47/1.02  
% 0.47/1.02  ============================== end of process initial clauses ========
% 0.47/1.02  
% 0.47/1.02  ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.02  
% 0.47/1.02  ============================== end of clauses for search =============
% 0.47/1.02  
% 0.47/1.02  ============================== SEARCH ================================
% 0.47/1.02  
% 0.47/1.02  % Starting search at 0.01 seconds.
% 0.47/1.02  
% 0.47/1.02  ============================== PROOF =================================
% 0.47/1.02  % SZS status Unsatisfiable
% 0.47/1.02  % SZS output start Refutation
% 0.47/1.02  
% 0.47/1.02  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.47/1.02  % Length of proof is 13.
% 0.47/1.02  % Level of proof is 5.
% 0.47/1.02  % Maximum clause weight is 6.000.
% 0.47/1.02  % Given clauses 10.
% 0.47/1.02  
% 0.47/1.02  1 r(sk1) | r(sk2) # label(thm31_4) # label(negated_conjecture).  [assumption].
% 0.47/1.02  2 -r(sk2) | -s(sk1) | -s(sk2) # label(thm31_15) # label(negated_conjecture).  [assumption].
% 0.47/1.02  3 s(A) | -r(A) # label(thm31_3) # label(negated_conjecture).  [assumption].
% 0.47/1.02  4 r(sk2) | -s(sk1) # label(thm31_10) # label(negated_conjecture).  [assumption].
% 0.47/1.02  5 r(sk1) | -r(sk2) | -s(sk2) # label(thm31_9) # label(negated_conjecture).  [assumption].
% 0.47/1.02  6 s(sk1) | r(sk2).  [resolve(3,b,1,a)].
% 0.47/1.02  7 r(sk2).  [resolve(6,a,4,b),merge(b)].
% 0.47/1.02  8 r(sk1) | -s(sk2).  [back_unit_del(5),unit_del(b,7)].
% 0.47/1.02  9 -s(sk1) | -s(sk2).  [back_unit_del(2),unit_del(a,7)].
% 0.47/1.02  10 s(sk2).  [resolve(7,a,3,b)].
% 0.47/1.02  11 -s(sk1).  [back_unit_del(9),unit_del(b,10)].
% 0.47/1.02  12 r(sk1).  [back_unit_del(8),unit_del(b,10)].
% 0.47/1.02  13 $F.  [resolve(12,a,3,b),unit_del(a,11)].
% 0.47/1.02  
% 0.47/1.02  % SZS output end Refutation
% 0.47/1.02  ============================== end of proof ==========================
% 0.47/1.02  
% 0.47/1.02  ============================== STATISTICS ============================
% 0.47/1.02  
% 0.47/1.02  Given=10. Generated=14. Kept=12. proofs=1.
% 0.47/1.02  Usable=4. Sos=1. Demods=0. Limbo=0, Disabled=12. Hints=0.
% 0.47/1.02  Megabytes=0.02.
% 0.47/1.02  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.02  
% 0.47/1.02  ============================== end of statistics =====================
% 0.47/1.02  
% 0.47/1.02  ============================== end of search =========================
% 0.47/1.02  
% 0.47/1.02  THEOREM PROVED
% 0.47/1.02  % SZS status Unsatisfiable
% 0.47/1.02  
% 0.47/1.02  Exiting with 1 proof.
% 0.47/1.02  
% 0.47/1.02  Process 18917 exit (max_proofs) Mon Jul 11 16:03:51 2022
% 0.47/1.02  Prover9 interrupted
%------------------------------------------------------------------------------