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

View Problem - Process Solution

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

% Computer : n029.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:53 EDT 2022

% Result   : Unsatisfiable 0.41s 0.99s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN687-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 16:20:02 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/0.99  ============================== Prover9 ===============================
% 0.41/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99  Process 5153 was started by sandbox2 on n029.cluster.edu,
% 0.41/0.99  Mon Jul 11 16:20:02 2022
% 0.41/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4998_n029.cluster.edu".
% 0.41/0.99  ============================== end of head ===========================
% 0.41/0.99  
% 0.41/0.99  ============================== INPUT =================================
% 0.41/0.99  
% 0.41/0.99  % Reading from file /tmp/Prover9_4998_n029.cluster.edu
% 0.41/0.99  
% 0.41/0.99  set(prolog_style_variables).
% 0.41/0.99  set(auto2).
% 0.41/0.99      % set(auto2) -> set(auto).
% 0.41/0.99      % set(auto) -> set(auto_inference).
% 0.41/0.99      % set(auto) -> set(auto_setup).
% 0.41/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99      % set(auto) -> set(auto_limits).
% 0.41/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99      % set(auto) -> set(auto_denials).
% 0.41/0.99      % set(auto) -> set(auto_process).
% 0.41/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99      % set(auto2) -> assign(stats, some).
% 0.41/0.99      % set(auto2) -> clear(echo_input).
% 0.41/0.99      % set(auto2) -> set(quiet).
% 0.41/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99      % set(auto2) -> clear(print_given).
% 0.41/0.99  assign(lrs_ticks,-1).
% 0.41/0.99  assign(sos_limit,10000).
% 0.41/0.99  assign(order,kbo).
% 0.41/0.99  set(lex_order_vars).
% 0.41/0.99  clear(print_given).
% 0.41/0.99  
% 0.41/0.99  % formulas(sos).  % not echoed (60 formulas)
% 0.41/0.99  
% 0.41/0.99  ============================== end of input ==========================
% 0.41/0.99  
% 0.41/0.99  % From the command line: assign(max_seconds, 300).
% 0.41/0.99  
% 0.41/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99  
% 0.41/0.99  % Formulas that are not ordinary clauses:
% 0.41/0.99  
% 0.41/0.99  ============================== end of process non-clausal formulas ===
% 0.41/0.99  
% 0.41/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.99  
% 0.41/0.99  ============================== PREDICATE ELIMINATION =================
% 0.41/0.99  
% 0.41/0.99  ============================== end predicate elimination =============
% 0.41/0.99  
% 0.41/0.99  Auto_denials:  (non-Horn, no changes).
% 0.41/0.99  
% 0.41/0.99  Term ordering decisions:
% 0.41/0.99  Function symbol KB weights:  c44=1. c46=1. c36=1. c39=1. c40=1. c41=1. c45=1. c37=1. c42=1. c43=1. c47=1. c38=1. f5=1. f9=1. f26=1. f28=1. f20=1. f22=1. f24=1. f7=1. f30=1. f32=1. f12=1. f14=1. f16=1. f18=1.
% 0.41/0.99  
% 0.41/0.99  ============================== end of process initial clauses ========
% 0.41/0.99  
% 0.41/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.99  
% 0.41/0.99  ============================== end of clauses for search =============
% 0.41/0.99  
% 0.41/0.99  ============================== SEARCH ================================
% 0.41/0.99  
% 0.41/0.99  % Starting search at 0.02 seconds.
% 0.41/0.99  
% 0.41/0.99  ============================== PROOF =================================
% 0.41/0.99  % SZS status Unsatisfiable
% 0.41/0.99  % SZS output start Refutation
% 0.41/0.99  
% 0.41/0.99  % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.41/0.99  % Length of proof is 16.
% 0.41/0.99  % Level of proof is 5.
% 0.41/0.99  % Maximum clause weight is 51.000.
% 0.41/0.99  % Given clauses 100.
% 0.41/0.99  
% 0.41/0.99  4 p4(A,A) # label(p4_4) # label(negated_conjecture).  [assumption].
% 0.41/0.99  19 p34(c36,c37) # label(p34_19) # label(negated_conjecture).  [assumption].
% 0.41/0.99  20 p4(f5(f9(c39,A),B),f5(f9(c39,C),B)) | p35(f12(c37,f14(f16(f18(c40,A),C),B)),B) # label(p4_55) # label(negated_conjecture).  [assumption].
% 0.41/0.99  21 -p4(f5(A,f7(c38,A)),f5(f9(c39,A),f7(c38,A))) # label(not_p4_40) # label(negated_conjecture).  [assumption].
% 0.41/0.99  25 p4(A,B) | -p4(C,A) | -p4(C,B) # label(p4_23) # label(negated_conjecture).  [assumption].
% 0.41/0.99  56 p4(f5(f9(c39,A),B),f5(f9(c39,C),B)) | -p4(f5(A,f14(f16(f18(c40,A),C),B)),f5(C,f14(f16(f18(c40,A),C),B))) # label(p4_56) # label(negated_conjecture).  [assumption].
% 0.41/0.99  57 p4(f5(f26(f28(c46,A),B),C),f5(f26(f28(c47,A),B),C)) | p4(f5(f26(f28(c46,A),B),D),f5(f9(B,f26(f28(c46,A),B)),D)) | -p34(c36,A) | -p35(f12(A,C),f30(f32(c45,A),B)) # label(p4_57) # label(negated_conjecture).  [assumption].
% 0.41/0.99  58 p4(f5(f26(f28(c46,A),B),C),f5(f9(B,f26(f28(c46,A),B)),C)) | -p34(c36,A) | -p4(f5(f9(B,f26(f28(c46,A),B)),f30(f32(c45,A),B)),f5(f9(B,f26(f28(c47,A),B)),f30(f32(c45,A),B))) # label(p4_58) # label(negated_conjecture).  [assumption].
% 0.41/0.99  64 p4(A,B) | -p4(B,A).  [resolve(25,c,4,a)].
% 0.41/0.99  65 -p4(f5(f9(c39,A),f7(c38,A)),f5(A,f7(c38,A))).  [ur(25,a,21,a,c,4,a)].
% 0.41/0.99  100 -p4(f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)),f5(f9(c39,f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))).  [ur(58,a,21,a,b,19,a)].
% 0.41/0.99  104 -p4(f5(f9(c39,A),f14(f16(f18(c40,f9(c39,A)),A),f7(c38,f9(c39,A)))),f5(A,f14(f16(f18(c40,f9(c39,A)),A),f7(c38,f9(c39,A))))).  [ur(56,a,65,a)].
% 0.41/0.99  105 -p4(f5(f26(f28(c46,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f5(f26(f28(c47,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39)))).  [ur(56,a,100,a)].
% 0.41/0.99  118 -p4(f5(A,f14(f16(f18(c40,f9(c39,A)),A),f7(c38,f9(c39,A)))),f5(f9(c39,A),f14(f16(f18(c40,f9(c39,A)),A),f7(c38,f9(c39,A))))).  [ur(64,a,104,a)].
% 0.41/0.99  125 -p35(f12(c37,f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f30(f32(c45,c37),c39)).  [ur(57,a,105,a,b,118,a,c,19,a)].
% 0.41/0.99  126 $F.  [resolve(125,a,20,b),unit_del(a,100)].
% 0.41/0.99  
% 0.41/0.99  % SZS output end Refutation
% 0.41/0.99  ============================== end of proof ==========================
% 0.41/0.99  
% 0.41/0.99  ============================== STATISTICS ============================
% 0.41/0.99  
% 0.41/0.99  Given=100. Generated=249. Kept=125. proofs=1.
% 0.41/0.99  Usable=100. Sos=25. Demods=0. Limbo=0, Disabled=60. Hints=0.
% 0.41/0.99  Megabytes=0.36.
% 0.41/0.99  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.41/0.99  
% 0.41/0.99  ============================== end of statistics =====================
% 0.41/0.99  
% 0.41/0.99  ============================== end of search =========================
% 0.41/0.99  
% 0.41/0.99  THEOREM PROVED
% 0.41/0.99  % SZS status Unsatisfiable
% 0.41/0.99  
% 0.41/0.99  Exiting with 1 proof.
% 0.41/0.99  
% 0.41/0.99  Process 5153 exit (max_proofs) Mon Jul 11 16:20:02 2022
% 0.41/0.99  Prover9 interrupted
%------------------------------------------------------------------------------