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

View Problem - Process Solution

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

% Computer : n004.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:32 EDT 2022

% Result   : Unsatisfiable 0.47s 1.03s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN632-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jul 12 04:31:07 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.47/1.03  ============================== Prover9 ===============================
% 0.47/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.03  Process 4072 was started by sandbox on n004.cluster.edu,
% 0.47/1.03  Tue Jul 12 04:31:08 2022
% 0.47/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3919_n004.cluster.edu".
% 0.47/1.03  ============================== end of head ===========================
% 0.47/1.03  
% 0.47/1.03  ============================== INPUT =================================
% 0.47/1.03  
% 0.47/1.03  % Reading from file /tmp/Prover9_3919_n004.cluster.edu
% 0.47/1.03  
% 0.47/1.03  set(prolog_style_variables).
% 0.47/1.03  set(auto2).
% 0.47/1.03      % set(auto2) -> set(auto).
% 0.47/1.03      % set(auto) -> set(auto_inference).
% 0.47/1.03      % set(auto) -> set(auto_setup).
% 0.47/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.47/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.03      % set(auto) -> set(auto_limits).
% 0.47/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.03      % set(auto) -> set(auto_denials).
% 0.47/1.03      % set(auto) -> set(auto_process).
% 0.47/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.47/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.47/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.47/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.47/1.03      % set(auto2) -> assign(stats, some).
% 0.47/1.03      % set(auto2) -> clear(echo_input).
% 0.47/1.03      % set(auto2) -> set(quiet).
% 0.47/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.03      % set(auto2) -> clear(print_given).
% 0.47/1.03  assign(lrs_ticks,-1).
% 0.47/1.03  assign(sos_limit,10000).
% 0.47/1.03  assign(order,kbo).
% 0.47/1.03  set(lex_order_vars).
% 0.47/1.03  clear(print_given).
% 0.47/1.03  
% 0.47/1.03  % formulas(sos).  % not echoed (38 formulas)
% 0.47/1.03  
% 0.47/1.03  ============================== end of input ==========================
% 0.47/1.03  
% 0.47/1.03  % From the command line: assign(max_seconds, 300).
% 0.47/1.03  
% 0.47/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.03  
% 0.47/1.03  % Formulas that are not ordinary clauses:
% 0.47/1.03  
% 0.47/1.03  ============================== end of process non-clausal formulas ===
% 0.47/1.03  
% 0.47/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.03  
% 0.47/1.03  ============================== PREDICATE ELIMINATION =================
% 0.47/1.03  
% 0.47/1.03  ============================== end predicate elimination =============
% 0.47/1.03  
% 0.47/1.03  Auto_denials:
% 0.47/1.03    % copying label not_p21_35 to answer in negative clause
% 0.47/1.03  
% 0.47/1.03  Term ordering decisions:
% 0.47/1.03  Function symbol KB weights:  c24=1. c28=1. c25=1. c26=1. c29=1. c22=1. c23=1. c27=1. f5=1. f10=1. f7=1. f12=1. f14=1. f16=1. f18=1. f20=1.
% 0.47/1.03  
% 0.47/1.03  ============================== end of process initial clauses ========
% 0.47/1.03  
% 0.47/1.03  ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.03  
% 0.47/1.03  ============================== end of clauses for search =============
% 0.47/1.03  
% 0.47/1.03  ============================== SEARCH ================================
% 0.47/1.03  
% 0.47/1.03  % Starting search at 0.01 seconds.
% 0.47/1.03  
% 0.47/1.03  ============================== PROOF =================================
% 0.47/1.03  % SZS status Unsatisfiable
% 0.47/1.03  % SZS output start Refutation
% 0.47/1.03  
% 0.47/1.03  % Proof 1 at 0.02 (+ 0.00) seconds: not_p21_35.
% 0.47/1.03  % Length of proof is 21.
% 0.47/1.03  % Level of proof is 7.
% 0.47/1.03  % Maximum clause weight is 28.000.
% 0.47/1.03  % Given clauses 53.
% 0.47/1.03  
% 0.47/1.03  6 p3(A,A) # label(p3_6) # label(negated_conjecture).  [assumption].
% 0.47/1.03  7 p2(A,A) # label(p2_7) # label(negated_conjecture).  [assumption].
% 0.47/1.03  12 p21(f5(f7(f10(c24,f12(c28,f12(c25,c26))),c22),c23),c27) # label(p21_24) # label(negated_conjecture).  [assumption].
% 0.47/1.03  13 -p21(f5(c22,c23),A) | -p21(f5(f7(f10(c24,f12(c25,c26)),c22),A),c27) # label(not_p21_35) # label(negated_conjecture) # answer(not_p21_35).  [assumption].
% 0.47/1.03  19 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_17) # label(negated_conjecture).  [assumption].
% 0.47/1.03  25 p21(A,B) | -p3(C,B) | -p4(D,A) | -p21(D,C) # label(p21_23) # label(negated_conjecture).  [assumption].
% 0.47/1.03  32 p4(f5(A,B),f5(C,D)) | -p2(A,C) | -p3(B,D) # label(p4_31) # label(negated_conjecture).  [assumption].
% 0.47/1.03  34 p3(A,B) | -p21(f5(f7(f10(c24,f12(c25,c26)),C),A),B) # label(p3_33) # label(negated_conjecture).  [assumption].
% 0.47/1.03  35 p21(f5(f7(f10(c24,f12(c25,c26)),A),B),C) | -p3(B,C) # label(p21_34) # label(negated_conjecture).  [assumption].
% 0.47/1.03  36 p21(f5(A,f14(f16(f18(f20(c29,B),C),A),D)),D) | -p21(f5(f7(f10(c24,f12(c28,B)),A),C),D) # label(p21_36) # label(negated_conjecture).  [assumption].
% 0.47/1.03  38 p21(f5(f7(f10(c24,A),B),C),f14(f16(f18(f20(c29,A),C),B),D)) | -p21(f5(f7(f10(c24,f12(c28,A)),B),C),D) # label(p21_38) # label(negated_conjecture).  [assumption].
% 0.47/1.03  41 -p3(A,c27) | -p21(f5(c22,c23),A) # answer(not_p21_35).  [resolve(35,a,13,b)].
% 0.47/1.03  44 p21(f5(c22,f14(f16(f18(f20(c29,f12(c25,c26)),c23),c22),c27)),c27).  [ur(36,b,12,a)].
% 0.47/1.03  45 p21(f5(f7(f10(c24,f12(c25,c26)),c22),c23),f14(f16(f18(f20(c29,f12(c25,c26)),c23),c22),c27)).  [ur(38,b,12,a)].
% 0.47/1.03  61 -p21(f5(c22,c23),c27) # answer(not_p21_35).  [resolve(41,a,6,a)].
% 0.47/1.03  63 -p3(A,c27) | -p4(B,f5(c22,c23)) | -p21(B,A) # answer(not_p21_35).  [resolve(61,a,25,a)].
% 0.47/1.03  90 p3(c23,f14(f16(f18(f20(c29,f12(c25,c26)),c23),c22),c27)).  [ur(34,b,45,a)].
% 0.47/1.03  109 -p4(A,f5(c22,c23)) | -p21(A,c27) # answer(not_p21_35).  [resolve(63,a,6,a)].
% 0.47/1.03  120 -p21(f5(A,B),c27) | -p2(A,c22) | -p3(B,c23) # answer(not_p21_35).  [resolve(109,a,32,a)].
% 0.47/1.03  126 -p3(f14(f16(f18(f20(c29,f12(c25,c26)),c23),c22),c27),c23) # answer(not_p21_35).  [resolve(120,a,44,a),unit_del(a,7)].
% 0.47/1.03  149 $F # answer(not_p21_35).  [ur(19,b,90,a,c,6,a),unit_del(a,126)].
% 0.47/1.03  
% 0.47/1.03  % SZS output end Refutation
% 0.47/1.03  ============================== end of proof ==========================
% 0.47/1.03  
% 0.47/1.03  ============================== STATISTICS ============================
% 0.47/1.03  
% 0.47/1.03  Given=53. Generated=224. Kept=148. proofs=1.
% 0.47/1.03  Usable=52. Sos=87. Demods=0. Limbo=7, Disabled=40. Hints=0.
% 0.47/1.03  Megabytes=0.29.
% 0.47/1.03  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.03  
% 0.47/1.03  ============================== end of statistics =====================
% 0.47/1.03  
% 0.47/1.03  ============================== end of search =========================
% 0.47/1.03  
% 0.47/1.03  THEOREM PROVED
% 0.47/1.03  % SZS status Unsatisfiable
% 0.47/1.03  
% 0.47/1.03  Exiting with 1 proof.
% 0.47/1.03  
% 0.47/1.03  Process 4072 exit (max_proofs) Tue Jul 12 04:31:08 2022
% 0.47/1.03  Prover9 interrupted
%------------------------------------------------------------------------------