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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN644-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:37 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN644-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 16:13:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/1.04  ============================== Prover9 ===============================
% 0.44/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.04  Process 15753 was started by sandbox on n020.cluster.edu,
% 0.44/1.04  Mon Jul 11 16:13:13 2022
% 0.44/1.04  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15600_n020.cluster.edu".
% 0.44/1.04  ============================== end of head ===========================
% 0.44/1.04  
% 0.44/1.04  ============================== INPUT =================================
% 0.44/1.04  
% 0.44/1.04  % Reading from file /tmp/Prover9_15600_n020.cluster.edu
% 0.44/1.04  
% 0.44/1.04  set(prolog_style_variables).
% 0.44/1.04  set(auto2).
% 0.44/1.04      % set(auto2) -> set(auto).
% 0.44/1.04      % set(auto) -> set(auto_inference).
% 0.44/1.04      % set(auto) -> set(auto_setup).
% 0.44/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.04      % set(auto) -> set(auto_limits).
% 0.44/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.04      % set(auto) -> set(auto_denials).
% 0.44/1.04      % set(auto) -> set(auto_process).
% 0.44/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.04      % set(auto2) -> assign(stats, some).
% 0.44/1.04      % set(auto2) -> clear(echo_input).
% 0.44/1.04      % set(auto2) -> set(quiet).
% 0.44/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.04      % set(auto2) -> clear(print_given).
% 0.44/1.04  assign(lrs_ticks,-1).
% 0.44/1.04  assign(sos_limit,10000).
% 0.44/1.04  assign(order,kbo).
% 0.44/1.04  set(lex_order_vars).
% 0.44/1.04  clear(print_given).
% 0.44/1.04  
% 0.44/1.04  % formulas(sos).  % not echoed (42 formulas)
% 0.44/1.04  
% 0.44/1.04  ============================== end of input ==========================
% 0.44/1.04  
% 0.44/1.04  % From the command line: assign(max_seconds, 300).
% 0.44/1.04  
% 0.44/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.04  
% 0.44/1.04  % Formulas that are not ordinary clauses:
% 0.44/1.04  
% 0.44/1.04  ============================== end of process non-clausal formulas ===
% 0.44/1.04  
% 0.44/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.04  
% 0.44/1.04  ============================== PREDICATE ELIMINATION =================
% 0.44/1.04  
% 0.44/1.04  ============================== end predicate elimination =============
% 0.44/1.04  
% 0.44/1.04  Auto_denials:  (non-Horn, no changes).
% 0.44/1.04  
% 0.44/1.04  Term ordering decisions:
% 0.44/1.04  Function symbol KB weights:  c32=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. f10=1. f11=1. f14=1. f17=1. f18=1. f20=1. f13=1. f3=1. f4=1. f5=1. f8=1. f19=1. f16=1. f21=1.
% 0.44/1.04  
% 0.44/1.04  ============================== end of process initial clauses ========
% 0.44/1.04  
% 0.44/1.04  ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.04  
% 0.44/1.04  ============================== end of clauses for search =============
% 0.44/1.04  
% 0.44/1.04  ============================== SEARCH ================================
% 0.44/1.04  
% 0.44/1.04  % Starting search at 0.02 seconds.
% 0.44/1.04  
% 0.44/1.04  ============================== PROOF =================================
% 0.44/1.04  % SZS status Unsatisfiable
% 0.44/1.04  % SZS output start Refutation
% 0.44/1.04  
% 0.44/1.04  % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.44/1.04  % Length of proof is 17.
% 0.44/1.04  % Level of proof is 5.
% 0.44/1.04  % Maximum clause weight is 46.000.
% 0.44/1.04  % Given clauses 91.
% 0.44/1.04  
% 0.44/1.04  1 p12(A,A) # label(p12_1) # label(negated_conjecture).  [assumption].
% 0.44/1.04  7 p22(f3(f4(f5(c26))),c27) # label(p22_7) # label(negated_conjecture).  [assumption].
% 0.44/1.04  8 p24(f17(f10(c29,f11(c27,c30)),c28)) # label(f17_is_p24_9) # label(negated_conjecture).  [assumption].
% 0.44/1.04  9 p23(c28,f8(f10(c29,f11(c27,c30)))) # label(p23_10) # label(negated_conjecture).  [assumption].
% 0.44/1.04  10 p12(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31)))) # label(p12_33) # label(negated_conjecture).  [assumption].
% 0.44/1.04  11 -p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31)) # label(not_p12_23) # label(negated_conjecture).  [assumption].
% 0.44/1.04  19 p12(A,B) | -p12(C,A) | -p12(C,B) # label(p12_17) # label(negated_conjecture).  [assumption].
% 0.44/1.04  26 p25(A,B) | -p12(C,B) | -p25(D,C) | -p12(D,A) # label(p25_25) # label(negated_conjecture).  [assumption].
% 0.44/1.04  37 p25(f13(f14(A,f16(f10(B,f11(C,D)),c32,A))),f13(f14(A,E))) | -p22(f3(f4(f5(c26))),C) | -p23(E,f8(f10(B,f11(C,D)))) # label(p25_37) # label(negated_conjecture).  [assumption].
% 0.44/1.04  39 p12(A,f16(f10(B,f11(C,D)),c32,E)) | p23(f21(B,C,D,E,A),f8(f10(B,f11(C,D)))) | -p22(f3(f4(f5(c26))),C) | -p24(f17(f10(B,f11(C,D)),A)) | -p23(A,f8(f10(B,f11(C,D)))) # label(p12_39) # label(negated_conjecture).  [assumption].
% 0.44/1.04  40 p12(A,f16(f10(B,f11(C,D)),c32,E)) | -p22(f3(f4(f5(c26))),C) | -p24(f17(f10(B,f11(C,D)),A)) | -p23(A,f8(f10(B,f11(C,D)))) | -p25(f13(f14(E,A)),f13(f14(E,f21(B,C,D,E,A)))) # label(p12_40) # label(negated_conjecture).  [assumption].
% 0.44/1.04  60 p12(A,B) | -p12(B,A).  [resolve(19,c,1,a)].
% 0.44/1.04  99 -p25(f13(f14(c31,c28)),f13(f14(c31,f21(c29,c27,c30,c31,c28)))).  [ur(40,a,11,a,b,7,a,c,8,a,d,9,a)].
% 0.44/1.04  121 p12(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,c28))).  [resolve(60,b,10,a)].
% 0.44/1.04  163 -p25(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,f21(c29,c27,c30,c31,c28)))).  [ur(26,a,99,a,b,1,a,d,121,a)].
% 0.44/1.04  166 -p23(f21(c29,c27,c30,c31,c28),f8(f10(c29,f11(c27,c30)))).  [ur(37,a,163,a,b,7,a)].
% 0.44/1.04  169 $F.  [ur(39,a,11,a,b,166,a,d,8,a,e,9,a),unit_del(a,7)].
% 0.44/1.04  
% 0.44/1.04  % SZS output end Refutation
% 0.44/1.04  ============================== end of proof ==========================
% 0.44/1.04  
% 0.44/1.04  ============================== STATISTICS ============================
% 0.44/1.04  
% 0.44/1.04  Given=91. Generated=257. Kept=168. proofs=1.
% 0.44/1.04  Usable=91. Sos=75. Demods=0. Limbo=2, Disabled=42. Hints=0.
% 0.44/1.04  Megabytes=0.37.
% 0.44/1.04  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.44/1.04  
% 0.44/1.04  ============================== end of statistics =====================
% 0.44/1.04  
% 0.44/1.04  ============================== end of search =========================
% 0.44/1.04  
% 0.44/1.04  THEOREM PROVED
% 0.44/1.04  % SZS status Unsatisfiable
% 0.44/1.04  
% 0.44/1.04  Exiting with 1 proof.
% 0.44/1.04  
% 0.44/1.04  Process 15753 exit (max_proofs) Mon Jul 11 16:13:13 2022
% 0.44/1.04  Prover9 interrupted
%------------------------------------------------------------------------------