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

View Problem - Process Solution

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

% Computer : n005.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:30 EDT 2022

% Result   : Unsatisfiable 0.44s 1.01s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN625-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 06:05:36 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.44/1.01  ============================== Prover9 ===============================
% 0.44/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01  Process 5567 was started by sandbox on n005.cluster.edu,
% 0.44/1.01  Tue Jul 12 06:05:37 2022
% 0.44/1.01  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5188_n005.cluster.edu".
% 0.44/1.01  ============================== end of head ===========================
% 0.44/1.01  
% 0.44/1.01  ============================== INPUT =================================
% 0.44/1.01  
% 0.44/1.01  % Reading from file /tmp/Prover9_5188_n005.cluster.edu
% 0.44/1.01  
% 0.44/1.01  set(prolog_style_variables).
% 0.44/1.01  set(auto2).
% 0.44/1.01      % set(auto2) -> set(auto).
% 0.44/1.01      % set(auto) -> set(auto_inference).
% 0.44/1.01      % set(auto) -> set(auto_setup).
% 0.44/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01      % set(auto) -> set(auto_limits).
% 0.44/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01      % set(auto) -> set(auto_denials).
% 0.44/1.01      % set(auto) -> set(auto_process).
% 0.44/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01      % set(auto2) -> assign(stats, some).
% 0.44/1.01      % set(auto2) -> clear(echo_input).
% 0.44/1.01      % set(auto2) -> set(quiet).
% 0.44/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01      % set(auto2) -> clear(print_given).
% 0.44/1.01  assign(lrs_ticks,-1).
% 0.44/1.01  assign(sos_limit,10000).
% 0.44/1.01  assign(order,kbo).
% 0.44/1.01  set(lex_order_vars).
% 0.44/1.01  clear(print_given).
% 0.44/1.01  
% 0.44/1.01  % formulas(sos).  % not echoed (35 formulas)
% 0.44/1.01  
% 0.44/1.01  ============================== end of input ==========================
% 0.44/1.01  
% 0.44/1.01  % From the command line: assign(max_seconds, 300).
% 0.44/1.01  
% 0.44/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01  
% 0.44/1.01  % Formulas that are not ordinary clauses:
% 0.44/1.01  
% 0.44/1.01  ============================== end of process non-clausal formulas ===
% 0.44/1.01  
% 0.44/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01  
% 0.44/1.01  ============================== PREDICATE ELIMINATION =================
% 0.44/1.01  
% 0.44/1.01  ============================== end predicate elimination =============
% 0.44/1.01  
% 0.44/1.01  Auto_denials:  (non-Horn, no changes).
% 0.44/1.01  
% 0.44/1.01  Term ordering decisions:
% 0.44/1.01  Function symbol KB weights:  c21=1. c19=1. c20=1. f4=1. f7=1. f9=1. f14=1. f11=1. f13=1. f12=1.
% 0.44/1.01  
% 0.44/1.01  ============================== end of process initial clauses ========
% 0.44/1.01  
% 0.44/1.01  ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01  
% 0.44/1.01  ============================== end of clauses for search =============
% 0.44/1.01  
% 0.44/1.01  ============================== SEARCH ================================
% 0.44/1.01  
% 0.44/1.01  % Starting search at 0.01 seconds.
% 0.44/1.01  
% 0.44/1.01  ============================== PROOF =================================
% 0.44/1.01  % SZS status Unsatisfiable
% 0.44/1.01  % SZS output start Refutation
% 0.44/1.01  
% 0.44/1.01  % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.44/1.01  % Length of proof is 20.
% 0.44/1.01  % Level of proof is 6.
% 0.44/1.01  % Maximum clause weight is 46.000.
% 0.44/1.01  % Given clauses 116.
% 0.44/1.01  
% 0.44/1.01  1 p15(c21) # label(c21_is_p15_1) # label(negated_conjecture).  [assumption].
% 0.44/1.01  8 p15(A) | p18(f9(A),f14(A),f14(A)) # label(p15_15) # label(negated_conjecture).  [assumption].
% 0.44/1.01  9 -p15(f4(f7(c19,c20),c21)) # label(f4_is_not_p15_8) # label(negated_conjecture).  [assumption].
% 0.44/1.01  10 -p15(A) | -p18(f9(A),B,B) # label(not_p15_10) # label(negated_conjecture).  [assumption].
% 0.44/1.01  11 -p17(A,f11(c20)) | -p16(f9(c21),A,c19) # label(not_p17_16) # label(negated_conjecture).  [assumption].
% 0.44/1.01  23 p16(A,B,C) | -p16(A,B,D) | -p16(A,D,C) # label(p16_23) # label(negated_conjecture).  [assumption].
% 0.44/1.01  32 p16(f9(A),B,C) | p18(f9(A),B,D) | -p18(f9(f4(f7(C,E),A)),B,D) # label(p16_32) # label(negated_conjecture).  [assumption].
% 0.44/1.01  33 p18(f9(A),B,C) | p17(f12(A,D,E,B,C),f11(E)) | -p18(f9(f4(f7(D,E),A)),B,C) # label(p18_33) # label(negated_conjecture).  [assumption].
% 0.44/1.01  34 p18(f9(A),B,C) | p16(f9(A),f12(A,D,E,B,C),C) | -p18(f9(f4(f7(D,E),A)),B,C) # label(p18_34) # label(negated_conjecture).  [assumption].
% 0.44/1.01  43 -p18(f9(c21),A,A).  [ur(10,a,1,a)].
% 0.44/1.01  58 p16(f9(A),f14(f4(f7(B,C),A)),B) | p18(f9(A),f14(f4(f7(B,C),A)),f14(f4(f7(B,C),A))) | p15(f4(f7(B,C),A)).  [resolve(32,c,8,b)].
% 0.44/1.01  59 p18(f9(A),f14(f4(f7(B,C),A)),f14(f4(f7(B,C),A))) | p17(f12(A,B,C,f14(f4(f7(B,C),A)),f14(f4(f7(B,C),A))),f11(C)) | p15(f4(f7(B,C),A)).  [resolve(33,c,8,b)].
% 0.44/1.01  60 p18(f9(A),f14(f4(f7(B,C),A)),f14(f4(f7(B,C),A))) | p16(f9(A),f12(A,B,C,f14(f4(f7(B,C),A)),f14(f4(f7(B,C),A))),f14(f4(f7(B,C),A))) | p15(f4(f7(B,C),A)).  [resolve(34,c,8,b)].
% 0.44/1.01  77 p16(f9(c21),f14(f4(f7(A,B),c21)),A) | p15(f4(f7(A,B),c21)).  [resolve(58,b,43,a)].
% 0.44/1.01  89 p15(f4(f7(A,B),c21)) | p16(f9(c21),C,A) | -p16(f9(c21),C,f14(f4(f7(A,B),c21))).  [resolve(77,a,23,c)].
% 0.44/1.01  92 p17(f12(c21,A,B,f14(f4(f7(A,B),c21)),f14(f4(f7(A,B),c21))),f11(B)) | p15(f4(f7(A,B),c21)).  [resolve(59,a,43,a)].
% 0.44/1.01  101 p16(f9(c21),f12(c21,A,B,f14(f4(f7(A,B),c21)),f14(f4(f7(A,B),c21))),f14(f4(f7(A,B),c21))) | p15(f4(f7(A,B),c21)).  [resolve(60,a,43,a)].
% 0.44/1.01  160 p15(f4(f7(A,B),c21)) | p16(f9(c21),f12(c21,A,B,f14(f4(f7(A,B),c21)),f14(f4(f7(A,B),c21))),A).  [resolve(101,a,89,c),merge(b)].
% 0.44/1.01  173 p15(f4(f7(c19,A),c21)) | -p17(f12(c21,c19,A,f14(f4(f7(c19,A),c21)),f14(f4(f7(c19,A),c21))),f11(c20)).  [resolve(160,b,11,b)].
% 0.44/1.01  174 $F.  [resolve(173,b,92,a),merge(b),unit_del(a,9)].
% 0.44/1.01  
% 0.44/1.01  % SZS output end Refutation
% 0.44/1.01  ============================== end of proof ==========================
% 0.44/1.01  
% 0.44/1.01  ============================== STATISTICS ============================
% 0.44/1.01  
% 0.44/1.01  Given=116. Generated=281. Kept=173. proofs=1.
% 0.44/1.01  Usable=112. Sos=56. Demods=0. Limbo=0, Disabled=40. Hints=0.
% 0.44/1.01  Megabytes=0.37.
% 0.44/1.01  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01  
% 0.44/1.01  ============================== end of statistics =====================
% 0.44/1.01  
% 0.44/1.01  ============================== end of search =========================
% 0.44/1.01  
% 0.44/1.01  THEOREM PROVED
% 0.44/1.01  % SZS status Unsatisfiable
% 0.44/1.01  
% 0.44/1.01  Exiting with 1 proof.
% 0.44/1.01  
% 0.44/1.01  Process 5567 exit (max_proofs) Tue Jul 12 06:05:37 2022
% 0.44/1.01  Prover9 interrupted
%------------------------------------------------------------------------------