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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 0.72s 1.06s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN604-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n020.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:40:42 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.72/1.06  ============================== Prover9 ===============================
% 0.72/1.06  Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.06  Process 28105 was started by sandbox2 on n020.cluster.edu,
% 0.72/1.06  Tue Jul 12 03:40:43 2022
% 0.72/1.06  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27952_n020.cluster.edu".
% 0.72/1.06  ============================== end of head ===========================
% 0.72/1.06  
% 0.72/1.06  ============================== INPUT =================================
% 0.72/1.06  
% 0.72/1.06  % Reading from file /tmp/Prover9_27952_n020.cluster.edu
% 0.72/1.06  
% 0.72/1.06  set(prolog_style_variables).
% 0.72/1.06  set(auto2).
% 0.72/1.06      % set(auto2) -> set(auto).
% 0.72/1.06      % set(auto) -> set(auto_inference).
% 0.72/1.06      % set(auto) -> set(auto_setup).
% 0.72/1.06      % set(auto_setup) -> set(predicate_elim).
% 0.72/1.06      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.06      % set(auto) -> set(auto_limits).
% 0.72/1.06      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.06      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.06      % set(auto) -> set(auto_denials).
% 0.72/1.06      % set(auto) -> set(auto_process).
% 0.72/1.06      % set(auto2) -> assign(new_constants, 1).
% 0.72/1.06      % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.06      % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.06      % set(auto2) -> assign(max_hours, 1).
% 0.72/1.06      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.06      % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.06      % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.06      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.06      % set(auto2) -> set(sort_initial_sos).
% 0.72/1.06      % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.06      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.06      % set(auto2) -> assign(max_megs, 400).
% 0.72/1.06      % set(auto2) -> assign(stats, some).
% 0.72/1.06      % set(auto2) -> clear(echo_input).
% 0.72/1.06      % set(auto2) -> set(quiet).
% 0.72/1.06      % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.06      % set(auto2) -> clear(print_given).
% 0.72/1.06  assign(lrs_ticks,-1).
% 0.72/1.06  assign(sos_limit,10000).
% 0.72/1.06  assign(order,kbo).
% 0.72/1.06  set(lex_order_vars).
% 0.72/1.06  clear(print_given).
% 0.72/1.06  
% 0.72/1.06  % formulas(sos).  % not echoed (30 formulas)
% 0.72/1.06  
% 0.72/1.06  ============================== end of input ==========================
% 0.72/1.06  
% 0.72/1.06  % From the command line: assign(max_seconds, 300).
% 0.72/1.06  
% 0.72/1.06  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.06  
% 0.72/1.06  % Formulas that are not ordinary clauses:
% 0.72/1.06  
% 0.72/1.06  ============================== end of process non-clausal formulas ===
% 0.72/1.06  
% 0.72/1.06  ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.06  
% 0.72/1.06  ============================== PREDICATE ELIMINATION =================
% 0.72/1.06  
% 0.72/1.06  ============================== end predicate elimination =============
% 0.72/1.06  
% 0.72/1.06  Auto_denials:  (non-Horn, no changes).
% 0.72/1.06  
% 0.72/1.06  Term ordering decisions:
% 0.72/1.06  Function symbol KB weights:  c18=1. c20=1. c19=1. c21=1. c17=1. c22=1. c23=1. f6=1. f7=1. f4=1. f12=1. f10=1. f11=1. f8=1. f13=1.
% 0.72/1.06  
% 0.72/1.06  ============================== end of process initial clauses ========
% 0.72/1.06  
% 0.72/1.06  ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.06  
% 0.72/1.06  ============================== end of clauses for search =============
% 0.72/1.06  
% 0.72/1.06  ============================== SEARCH ================================
% 0.72/1.06  
% 0.72/1.06  % Starting search at 0.01 seconds.
% 0.72/1.06  
% 0.72/1.06  ============================== PROOF =================================
% 0.72/1.06  % SZS status Unsatisfiable
% 0.72/1.06  % SZS output start Refutation
% 0.72/1.06  
% 0.72/1.06  % Proof 1 at 0.08 (+ 0.01) seconds.
% 0.72/1.06  % Length of proof is 32.
% 0.72/1.06  % Level of proof is 10.
% 0.72/1.06  % Maximum clause weight is 20.000.
% 0.72/1.06  % Given clauses 221.
% 0.72/1.06  
% 0.72/1.06  4 p3(A,A) # label(p3_4) # label(negated_conjecture).  [assumption].
% 0.72/1.06  7 p3(f4(f8(A)),f12(A)) # label(p3_7) # label(negated_conjecture).  [assumption].
% 0.72/1.06  8 p3(f12(f10(A)),f10(A)) # label(p3_8) # label(negated_conjecture).  [assumption].
% 0.72/1.06  9 p16(f10(f11(c21)),f12(A)) # label(p16_9) # label(negated_conjecture).  [assumption].
% 0.72/1.06  10 p16(A,B) | p16(B,f12(A)) # label(p16_10) # label(negated_conjecture).  [assumption].
% 0.72/1.06  12 -p16(f4(f6(f7(c20,c18),A)),f4(f6(f7(c20,c18),f13(A)))) # label(not_p16_28) # label(negated_conjecture).  [assumption].
% 0.72/1.06  22 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_21) # label(negated_conjecture).  [assumption].
% 0.72/1.06  24 p16(A,B) | -p16(A,C) | -p16(C,B) # label(p16_23) # label(negated_conjecture).  [assumption].
% 0.72/1.06  26 p16(A,B) | -p3(C,A) | -p3(D,B) | -p16(C,D) # label(p16_25) # label(negated_conjecture).  [assumption].
% 0.72/1.06  29 p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),A))) | -p16(f4(A),f12(c19)) # label(p16_29) # label(negated_conjecture).  [assumption].
% 0.72/1.06  30 p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),A))) | -p16(c19,f4(A)) # label(p16_30) # label(negated_conjecture).  [assumption].
% 0.72/1.06  31 p16(A,A) | -p3(B,A) | -p16(B,B).  [factor(26,b,c)].
% 0.72/1.06  43 p3(A,B) | -p3(B,A).  [resolve(22,c,4,a)].
% 0.72/1.06  50 p16(A,f12(B)) | -p16(A,f10(f11(c21))).  [resolve(24,c,9,a)].
% 0.72/1.06  55 p16(A,B) | -p3(C,B) | -p16(A,C).  [resolve(26,b,4,a)].
% 0.72/1.06  58 p16(A,B) | -p3(C,A) | -p16(C,B).  [resolve(26,c,4,a)].
% 0.72/1.06  62 -p16(f4(f13(c23)),f12(c19)).  [ur(29,a,12,a)].
% 0.72/1.06  70 p16(c19,f4(f13(c23))).  [resolve(62,a,10,b)].
% 0.72/1.06  77 p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),f13(c23)))).  [resolve(70,a,30,b)].
% 0.72/1.06  90 p3(f10(A),f12(f10(A))).  [resolve(43,b,8,a)].
% 0.72/1.06  91 p3(f12(A),f4(f8(A))).  [resolve(43,b,7,a)].
% 0.72/1.06  94 p16(f12(f10(A)),f12(f10(A))) | -p16(f10(A),f10(A)).  [resolve(90,a,31,b)].
% 0.72/1.06  215 p16(A,f10(B)) | -p16(A,f12(f10(B))).  [resolve(55,b,8,a)].
% 0.72/1.06  229 p16(f4(f8(A)),B) | -p16(f12(A),B).  [resolve(58,b,91,a)].
% 0.72/1.06  502 p16(A,f10(B)) | p16(f10(B),A).  [resolve(215,b,10,b)].
% 0.72/1.06  504 p16(f10(A),f10(A)).  [factor(502,a,b)].
% 0.72/1.06  510 p16(f12(f10(A)),f12(f10(A))).  [back_unit_del(94),unit_del(b,504)].
% 0.72/1.06  527 p16(f12(f10(A)),f10(A)).  [resolve(510,a,215,b)].
% 0.72/1.06  529 p16(f12(f10(f11(c21))),f12(A)).  [resolve(527,a,50,b)].
% 0.72/1.06  577 p16(f4(f8(f10(f11(c21)))),f12(A)).  [resolve(229,b,529,a)].
% 0.72/1.06  593 p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),f8(f10(f11(c21)))))).  [resolve(577,a,29,b)].
% 0.72/1.06  761 $F.  [ur(24,a,12,a,c,77,a),unit_del(a,593)].
% 0.72/1.06  
% 0.72/1.06  % SZS output end Refutation
% 0.72/1.06  ============================== end of proof ==========================
% 0.72/1.06  
% 0.72/1.06  ============================== STATISTICS ============================
% 0.72/1.06  
% 0.72/1.06  Given=221. Generated=1979. Kept=760. proofs=1.
% 0.72/1.06  Usable=221. Sos=511. Demods=0. Limbo=5, Disabled=53. Hints=0.
% 0.72/1.06  Megabytes=0.71.
% 0.72/1.06  User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
% 0.72/1.06  
% 0.72/1.06  ============================== end of statistics =====================
% 0.72/1.06  
% 0.72/1.06  ============================== end of search =========================
% 0.72/1.06  
% 0.72/1.06  THEOREM PROVED
% 0.72/1.06  % SZS status Unsatisfiable
% 0.72/1.06  
% 0.72/1.06  Exiting with 1 proof.
% 0.72/1.06  
% 0.72/1.06  Process 28105 exit (max_proofs) Tue Jul 12 03:40:43 2022
% 0.72/1.06  Prover9 interrupted
%------------------------------------------------------------------------------