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

View Problem - Process Solution

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

% Computer : n022.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:29 EDT 2022

% Result   : Unsatisfiable 0.75s 1.10s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SYN622-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul 11 13:04:40 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.75/1.10  ============================== Prover9 ===============================
% 0.75/1.10  Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.10  Process 9098 was started by sandbox on n022.cluster.edu,
% 0.75/1.10  Mon Jul 11 13:04:41 2022
% 0.75/1.10  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8945_n022.cluster.edu".
% 0.75/1.10  ============================== end of head ===========================
% 0.75/1.10  
% 0.75/1.10  ============================== INPUT =================================
% 0.75/1.10  
% 0.75/1.10  % Reading from file /tmp/Prover9_8945_n022.cluster.edu
% 0.75/1.10  
% 0.75/1.10  set(prolog_style_variables).
% 0.75/1.10  set(auto2).
% 0.75/1.10      % set(auto2) -> set(auto).
% 0.75/1.10      % set(auto) -> set(auto_inference).
% 0.75/1.10      % set(auto) -> set(auto_setup).
% 0.75/1.10      % set(auto_setup) -> set(predicate_elim).
% 0.75/1.10      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.10      % set(auto) -> set(auto_limits).
% 0.75/1.10      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.10      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.10      % set(auto) -> set(auto_denials).
% 0.75/1.10      % set(auto) -> set(auto_process).
% 0.75/1.10      % set(auto2) -> assign(new_constants, 1).
% 0.75/1.10      % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.10      % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.10      % set(auto2) -> assign(max_hours, 1).
% 0.75/1.10      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.10      % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.10      % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.10      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.10      % set(auto2) -> set(sort_initial_sos).
% 0.75/1.10      % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.10      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.10      % set(auto2) -> assign(max_megs, 400).
% 0.75/1.10      % set(auto2) -> assign(stats, some).
% 0.75/1.10      % set(auto2) -> clear(echo_input).
% 0.75/1.10      % set(auto2) -> set(quiet).
% 0.75/1.10      % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.10      % set(auto2) -> clear(print_given).
% 0.75/1.10  assign(lrs_ticks,-1).
% 0.75/1.10  assign(sos_limit,10000).
% 0.75/1.10  assign(order,kbo).
% 0.75/1.10  set(lex_order_vars).
% 0.75/1.10  clear(print_given).
% 0.75/1.10  
% 0.75/1.10  % formulas(sos).  % not echoed (34 formulas)
% 0.75/1.10  
% 0.75/1.10  ============================== end of input ==========================
% 0.75/1.10  
% 0.75/1.10  % From the command line: assign(max_seconds, 300).
% 0.75/1.10  
% 0.75/1.10  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.10  
% 0.75/1.10  % Formulas that are not ordinary clauses:
% 0.75/1.10  
% 0.75/1.10  ============================== end of process non-clausal formulas ===
% 0.75/1.10  
% 0.75/1.10  ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.10  
% 0.75/1.10  ============================== PREDICATE ELIMINATION =================
% 0.75/1.10  
% 0.75/1.10  ============================== end predicate elimination =============
% 0.75/1.10  
% 0.75/1.10  Auto_denials:  (non-Horn, no changes).
% 0.75/1.10  
% 0.75/1.10  Term ordering decisions:
% 0.75/1.10  Function symbol KB weights:  c24=1. c26=1. c23=1. c25=1. c27=1. c28=1. f12=1. f16=1. f17=1. f18=1. f13=1. f10=1. f4=1. f5=1. f14=1. f15=1. f6=1. f7=1.
% 0.75/1.10  
% 0.75/1.10  ============================== end of process initial clauses ========
% 0.75/1.10  
% 0.75/1.10  ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.10  
% 0.75/1.10  ============================== end of clauses for search =============
% 0.75/1.10  
% 0.75/1.10  ============================== SEARCH ================================
% 0.75/1.10  
% 0.75/1.10  % Starting search at 0.01 seconds.
% 0.75/1.10  
% 0.75/1.10  ============================== PROOF =================================
% 0.75/1.10  % SZS status Unsatisfiable
% 0.75/1.10  % SZS output start Refutation
% 0.75/1.10  
% 0.75/1.10  % Proof 1 at 0.08 (+ 0.01) seconds.
% 0.75/1.10  % Length of proof is 13.
% 0.75/1.10  % Level of proof is 3.
% 0.75/1.10  % Maximum clause weight is 13.000.
% 0.75/1.10  % Given clauses 265.
% 0.75/1.10  
% 0.75/1.10  1 p11(A,A) # label(p11_1) # label(negated_conjecture).  [assumption].
% 0.75/1.10  3 p8(A,A) # label(p8_3) # label(negated_conjecture).  [assumption].
% 0.75/1.10  8 p8(f16(A,f17(B,A)),B) # label(p8_8) # label(negated_conjecture).  [assumption].
% 0.75/1.10  9 p8(f12(f13(c23),A),f12(f13(c26),f16(c27,A))) # label(p8_24) # label(negated_conjecture).  [assumption].
% 0.75/1.10  12 -p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)) # label(not_p8_26) # label(negated_conjecture).  [assumption].
% 0.75/1.10  24 p8(A,B) | -p8(C,A) | -p8(C,B) # label(p8_21) # label(negated_conjecture).  [assumption].
% 0.75/1.10  31 p8(f12(A,B),f12(C,D)) | -p11(A,C) | -p8(B,D) # label(p8_31) # label(negated_conjecture).  [assumption].
% 0.75/1.10  52 p8(A,B) | -p8(B,A).  [resolve(24,c,3,a)].
% 0.75/1.10  54 -p8(f12(f13(c26),c28),f12(f13(c23),f17(c28,c27))).  [ur(24,a,12,a,c,3,a)].
% 0.75/1.10  67 p8(f12(A,B),f12(A,C)) | -p8(B,C).  [resolve(31,b,1,a)].
% 0.75/1.10  122 p8(f12(f13(c26),f16(c27,A)),f12(f13(c23),A)).  [resolve(52,b,9,a)].
% 0.75/1.10  414 p8(f12(A,f16(B,f17(C,B))),f12(A,C)).  [resolve(67,b,8,a)].
% 0.75/1.10  965 $F.  [ur(24,a,54,a,c,122,a),unit_del(a,414)].
% 0.75/1.10  
% 0.75/1.10  % SZS output end Refutation
% 0.75/1.10  ============================== end of proof ==========================
% 0.75/1.10  
% 0.75/1.10  ============================== STATISTICS ============================
% 0.75/1.10  
% 0.75/1.10  Given=265. Generated=1937. Kept=964. proofs=1.
% 0.75/1.10  Usable=265. Sos=663. Demods=0. Limbo=32, Disabled=38. Hints=0.
% 0.75/1.10  Megabytes=1.10.
% 0.75/1.10  User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
% 0.75/1.10  
% 0.75/1.10  ============================== end of statistics =====================
% 0.75/1.10  
% 0.75/1.10  ============================== end of search =========================
% 0.75/1.10  
% 0.75/1.10  THEOREM PROVED
% 0.75/1.10  % SZS status Unsatisfiable
% 0.75/1.10  
% 0.75/1.10  Exiting with 1 proof.
% 0.75/1.10  
% 0.75/1.10  Process 9098 exit (max_proofs) Mon Jul 11 13:04:41 2022
% 0.75/1.10  Prover9 interrupted
%------------------------------------------------------------------------------