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

View Problem - Process Solution

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

% Computer : n024.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:39 EDT 2022

% Result   : Unsatisfiable 0.98s 1.27s
% Output   : Refutation 0.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN650-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n024.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.34  % DateTime : Tue Jul 12 03:43:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.98/1.27  ============================== Prover9 ===============================
% 0.98/1.27  Prover9 (32) version 2009-11A, November 2009.
% 0.98/1.27  Process 15340 was started by sandbox2 on n024.cluster.edu,
% 0.98/1.27  Tue Jul 12 03:43:29 2022
% 0.98/1.27  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15187_n024.cluster.edu".
% 0.98/1.27  ============================== end of head ===========================
% 0.98/1.27  
% 0.98/1.27  ============================== INPUT =================================
% 0.98/1.27  
% 0.98/1.27  % Reading from file /tmp/Prover9_15187_n024.cluster.edu
% 0.98/1.27  
% 0.98/1.27  set(prolog_style_variables).
% 0.98/1.27  set(auto2).
% 0.98/1.27      % set(auto2) -> set(auto).
% 0.98/1.27      % set(auto) -> set(auto_inference).
% 0.98/1.27      % set(auto) -> set(auto_setup).
% 0.98/1.27      % set(auto_setup) -> set(predicate_elim).
% 0.98/1.27      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.98/1.27      % set(auto) -> set(auto_limits).
% 0.98/1.27      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.98/1.27      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.98/1.27      % set(auto) -> set(auto_denials).
% 0.98/1.27      % set(auto) -> set(auto_process).
% 0.98/1.27      % set(auto2) -> assign(new_constants, 1).
% 0.98/1.27      % set(auto2) -> assign(fold_denial_max, 3).
% 0.98/1.27      % set(auto2) -> assign(max_weight, "200.000").
% 0.98/1.27      % set(auto2) -> assign(max_hours, 1).
% 0.98/1.27      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.98/1.27      % set(auto2) -> assign(max_seconds, 0).
% 0.98/1.27      % set(auto2) -> assign(max_minutes, 5).
% 0.98/1.27      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.98/1.27      % set(auto2) -> set(sort_initial_sos).
% 0.98/1.27      % set(auto2) -> assign(sos_limit, -1).
% 0.98/1.27      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.98/1.27      % set(auto2) -> assign(max_megs, 400).
% 0.98/1.27      % set(auto2) -> assign(stats, some).
% 0.98/1.27      % set(auto2) -> clear(echo_input).
% 0.98/1.27      % set(auto2) -> set(quiet).
% 0.98/1.27      % set(auto2) -> clear(print_initial_clauses).
% 0.98/1.27      % set(auto2) -> clear(print_given).
% 0.98/1.27  assign(lrs_ticks,-1).
% 0.98/1.27  assign(sos_limit,10000).
% 0.98/1.27  assign(order,kbo).
% 0.98/1.27  set(lex_order_vars).
% 0.98/1.27  clear(print_given).
% 0.98/1.27  
% 0.98/1.27  % formulas(sos).  % not echoed (45 formulas)
% 0.98/1.27  
% 0.98/1.27  ============================== end of input ==========================
% 0.98/1.27  
% 0.98/1.27  % From the command line: assign(max_seconds, 300).
% 0.98/1.27  
% 0.98/1.27  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.98/1.27  
% 0.98/1.27  % Formulas that are not ordinary clauses:
% 0.98/1.27  
% 0.98/1.27  ============================== end of process non-clausal formulas ===
% 0.98/1.27  
% 0.98/1.27  ============================== PROCESS INITIAL CLAUSES ===============
% 0.98/1.27  
% 0.98/1.27  ============================== PREDICATE ELIMINATION =================
% 0.98/1.27  
% 0.98/1.27  ============================== end predicate elimination =============
% 0.98/1.27  
% 0.98/1.27  Auto_denials:  (non-Horn, no changes).
% 0.98/1.27  
% 0.98/1.27  Term ordering decisions:
% 0.98/1.27  Function symbol KB weights:  c26=1. c31=1. c27=1. c32=1. c29=1. c30=1. c33=1. c28=1. f11=1. f12=1. f17=1. f18=1. f13=1. f15=1. f3=1. f4=1. f5=1. f16=1. f20=1. f14=1. f9=1. f21=1.
% 0.98/1.27  
% 0.98/1.27  ============================== end of process initial clauses ========
% 0.98/1.27  
% 0.98/1.27  ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.27  
% 0.98/1.27  ============================== end of clauses for search =============
% 0.98/1.27  
% 0.98/1.27  ============================== SEARCH ================================
% 0.98/1.27  
% 0.98/1.27  % Starting search at 0.02 seconds.
% 0.98/1.27  
% 0.98/1.27  ============================== PROOF =================================
% 0.98/1.27  % SZS status Unsatisfiable
% 0.98/1.27  % SZS output start Refutation
% 0.98/1.27  
% 0.98/1.27  % Proof 1 at 0.27 (+ 0.01) seconds.
% 0.98/1.27  % Length of proof is 20.
% 0.98/1.27  % Level of proof is 6.
% 0.98/1.27  % Maximum clause weight is 53.000.
% 0.98/1.27  % Given clauses 229.
% 0.98/1.27  
% 0.98/1.27  2 p8(A,A) # label(p8_2) # label(negated_conjecture).  [assumption].
% 0.98/1.27  7 p22(f3(f4(f5(c26))),c27) # label(p22_8) # label(negated_conjecture).  [assumption].
% 0.98/1.27  8 p24(c33,f20(f11(c29,f12(c27,c30)))) # label(p24_10) # label(negated_conjecture).  [assumption].
% 0.98/1.27  10 p8(f16(f17(c32,c33)),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))) # label(p8_35) # label(negated_conjecture).  [assumption].
% 0.98/1.27  11 p8(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))) # label(p8_38) # label(negated_conjecture).  [assumption].
% 0.98/1.27  13 -p8(c33,f9(f11(c29,f12(c27,c30)),c31,c32)) # label(not_p8_24) # label(negated_conjecture).  [assumption].
% 0.98/1.27  14 -p23(f18(f11(c29,f12(c27,c30)),f9(f11(c29,f12(c27,c30)),c31,c32))) # label(f18_is_not_p23_34) # label(negated_conjecture).  [assumption].
% 0.98/1.27  23 p8(A,B) | -p8(C,A) | -p8(C,B) # label(p8_18) # label(negated_conjecture).  [assumption].
% 0.98/1.27  28 p25(A,B) | -p8(C,A) | -p8(D,B) | -p25(C,D) # label(p25_25) # label(negated_conjecture).  [assumption].
% 0.98/1.27  40 p25(f16(f17(A,f9(f11(B,f12(C,D)),c31,A))),f16(f17(A,E))) | -p22(f3(f4(f5(c26))),C) | -p24(E,f20(f11(B,f12(C,D)))) # label(p25_40) # label(negated_conjecture).  [assumption].
% 0.98/1.27  44 p8(A,f9(f11(B,f12(C,D)),c31,E)) | p24(f21(B,C,D,E,A),f20(f11(B,f12(C,D)))) | p23(f18(f11(B,f12(C,D)),f9(f11(B,f12(C,D)),c31,E))) | -p22(f3(f4(f5(c26))),C) | -p24(A,f20(f11(B,f12(C,D)))) # label(p8_44) # label(negated_conjecture).  [assumption].
% 0.98/1.27  45 p8(A,f9(f11(B,f12(C,D)),c31,E)) | p23(f18(f11(B,f12(C,D)),f9(f11(B,f12(C,D)),c31,E))) | -p22(f3(f4(f5(c26))),C) | -p24(A,f20(f11(B,f12(C,D)))) | -p25(f16(f17(E,A)),f16(f17(E,f21(B,C,D,E,A)))) # label(p8_45) # label(negated_conjecture).  [assumption].
% 0.98/1.27  70 p8(A,B) | -p8(B,A).  [resolve(23,c,2,a)].
% 0.98/1.27  115 p25(f16(f17(A,f9(f11(B,f12(c27,C)),c31,A))),f16(f17(A,D))) | -p24(D,f20(f11(B,f12(c27,C)))).  [resolve(40,b,7,a)].
% 0.98/1.27  119 -p25(f16(f17(c32,c33)),f16(f17(c32,f21(c29,c27,c30,c32,c33)))).  [ur(45,a,13,a,b,14,a,c,7,a,d,8,a)].
% 0.98/1.27  146 p8(f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26))))),f16(f17(c32,c33))).  [resolve(70,b,10,a)].
% 0.98/1.27  2293 -p25(f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26))))),f16(f17(c32,f21(c29,c27,c30,c32,c33)))).  [ur(28,a,119,a,b,146,a,c,2,a)].
% 0.98/1.27  2347 -p25(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f16(f17(c32,f21(c29,c27,c30,c32,c33)))).  [ur(28,a,2293,a,b,11,a,c,2,a)].
% 0.98/1.27  2348 -p24(f21(c29,c27,c30,c32,c33),f20(f11(c29,f12(c27,c30)))).  [ur(115,a,2347,a)].
% 0.98/1.27  2352 $F.  [ur(44,a,13,a,b,2348,a,c,14,a,e,8,a),unit_del(a,7)].
% 0.98/1.27  
% 0.98/1.27  % SZS output end Refutation
% 0.98/1.27  ============================== end of proof ==========================
% 0.98/1.27  
% 0.98/1.27  ============================== STATISTICS ============================
% 0.98/1.27  
% 0.98/1.27  Given=229. Generated=2996. Kept=2351. proofs=1.
% 0.98/1.27  Usable=228. Sos=2067. Demods=0. Limbo=2, Disabled=99. Hints=0.
% 0.98/1.27  Megabytes=4.14.
% 0.98/1.27  User_CPU=0.27, System_CPU=0.01, Wall_clock=0.
% 0.98/1.27  
% 0.98/1.27  ============================== end of statistics =====================
% 0.98/1.27  
% 0.98/1.27  ============================== end of search =========================
% 0.98/1.27  
% 0.98/1.27  THEOREM PROVED
% 0.98/1.27  % SZS status Unsatisfiable
% 0.98/1.27  
% 0.98/1.27  Exiting with 1 proof.
% 0.98/1.27  
% 0.98/1.27  Process 15340 exit (max_proofs) Tue Jul 12 03:43:29 2022
% 0.98/1.27  Prover9 interrupted
%------------------------------------------------------------------------------