TSTP Solution File: SYN004-1.007 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN004-1.007 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n028.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:15:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN004-1.007 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n028.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 : Tue Jul 12 02:49:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/0.96  ============================== Prover9 ===============================
% 0.41/0.96  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96  Process 20821 was started by sandbox on n028.cluster.edu,
% 0.41/0.96  Tue Jul 12 02:49:45 2022
% 0.41/0.96  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20650_n028.cluster.edu".
% 0.41/0.96  ============================== end of head ===========================
% 0.41/0.96  
% 0.41/0.96  ============================== INPUT =================================
% 0.41/0.96  
% 0.41/0.96  % Reading from file /tmp/Prover9_20650_n028.cluster.edu
% 0.41/0.96  
% 0.41/0.96  set(prolog_style_variables).
% 0.41/0.96  set(auto2).
% 0.41/0.96      % set(auto2) -> set(auto).
% 0.41/0.96      % set(auto) -> set(auto_inference).
% 0.41/0.96      % set(auto) -> set(auto_setup).
% 0.41/0.96      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96      % set(auto) -> set(auto_limits).
% 0.41/0.96      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96      % set(auto) -> set(auto_denials).
% 0.41/0.96      % set(auto) -> set(auto_process).
% 0.41/0.96      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96      % set(auto2) -> assign(stats, some).
% 0.41/0.96      % set(auto2) -> clear(echo_input).
% 0.41/0.96      % set(auto2) -> set(quiet).
% 0.41/0.96      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96      % set(auto2) -> clear(print_given).
% 0.41/0.96  assign(lrs_ticks,-1).
% 0.41/0.96  assign(sos_limit,10000).
% 0.41/0.96  assign(order,kbo).
% 0.41/0.96  set(lex_order_vars).
% 0.41/0.96  clear(print_given).
% 0.41/0.96  
% 0.41/0.96  % formulas(sos).  % not echoed (15 formulas)
% 0.41/0.96  
% 0.41/0.96  ============================== end of input ==========================
% 0.41/0.96  
% 0.41/0.96  % From the command line: assign(max_seconds, 300).
% 0.41/0.96  
% 0.41/0.96  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96  
% 0.41/0.96  % Formulas that are not ordinary clauses:
% 0.41/0.96  
% 0.41/0.96  ============================== end of process non-clausal formulas ===
% 0.41/0.96  
% 0.41/0.96  ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96  
% 0.41/0.96  ============================== PREDICATE ELIMINATION =================
% 0.41/0.96  
% 0.41/0.96  ============================== end predicate elimination =============
% 0.41/0.96  
% 0.41/0.96  Auto_denials:
% 0.41/0.96    % copying label base_3 to answer in negative clause
% 0.41/0.96  
% 0.41/0.96  Term ordering decisions:
% 0.41/0.96  Function symbol KB weights: 
% 0.41/0.96  
% 0.41/0.96  ============================== PROOF =================================
% 0.41/0.96  % SZS status Unsatisfiable
% 0.41/0.96  % SZS output start Refutation
% 0.41/0.96  
% 0.41/0.96  % Proof 1 at 0.01 (+ 0.00) seconds: base_3.
% 0.41/0.96  % Length of proof is 30.
% 0.41/0.96  % Level of proof is 8.
% 0.41/0.96  % Maximum clause weight is 3.000.
% 0.41/0.96  % Given clauses 0.
% 0.41/0.96  
% 0.41/0.96  1 p_1 # label(base_1) # label(negated_conjecture).  [assumption].
% 0.41/0.96  2 q_1 # label(base_2) # label(negated_conjecture).  [assumption].
% 0.41/0.96  3 -p_7 | -q_7 # label(base_3) # label(negated_conjecture) # answer(base_3).  [assumption].
% 0.41/0.96  4 -p_1 | -q_1 | p_2 # label(pqp_1) # label(negated_conjecture).  [assumption].
% 0.41/0.96  5 p_2.  [copy(4),unit_del(a,1),unit_del(b,2)].
% 0.41/0.96  6 -p_2 | -q_2 | p_3 # label(pqp_2) # label(negated_conjecture).  [assumption].
% 0.41/0.96  7 -q_2 | p_3.  [copy(6),unit_del(a,5)].
% 0.41/0.96  8 -p_3 | -q_3 | p_4 # label(pqp_3) # label(negated_conjecture).  [assumption].
% 0.41/0.96  9 -p_4 | -q_4 | p_5 # label(pqp_4) # label(negated_conjecture).  [assumption].
% 0.41/0.96  10 -p_5 | -q_5 | p_6 # label(pqp_5) # label(negated_conjecture).  [assumption].
% 0.41/0.96  11 -p_6 | -q_6 | p_7 # label(pqp_6) # label(negated_conjecture).  [assumption].
% 0.41/0.96  12 -p_1 | -q_1 | q_2 # label(pqq_1) # label(negated_conjecture).  [assumption].
% 0.41/0.96  13 q_2.  [copy(12),unit_del(a,1),unit_del(b,2)].
% 0.41/0.96  14 -p_2 | -q_2 | q_3 # label(pqq_2) # label(negated_conjecture).  [assumption].
% 0.41/0.96  15 q_3.  [copy(14),unit_del(a,5),unit_del(b,13)].
% 0.41/0.96  16 -p_3 | -q_3 | q_4 # label(pqq_3) # label(negated_conjecture).  [assumption].
% 0.41/0.96  17 -p_3 | q_4.  [copy(16),unit_del(b,15)].
% 0.41/0.96  18 -p_4 | -q_4 | q_5 # label(pqq_4) # label(negated_conjecture).  [assumption].
% 0.41/0.96  19 -p_5 | -q_5 | q_6 # label(pqq_5) # label(negated_conjecture).  [assumption].
% 0.41/0.96  20 -p_6 | -q_6 | q_7 # label(pqq_6) # label(negated_conjecture).  [assumption].
% 0.41/0.96  21 p_3.  [back_unit_del(7),unit_del(a,13)].
% 0.41/0.96  22 p_4.  [back_unit_del(8),unit_del(a,21),unit_del(b,15)].
% 0.41/0.96  23 q_4.  [back_unit_del(17),unit_del(a,21)].
% 0.41/0.96  24 q_5.  [back_unit_del(18),unit_del(a,22),unit_del(b,23)].
% 0.41/0.96  25 p_5.  [back_unit_del(9),unit_del(a,22),unit_del(b,23)].
% 0.41/0.96  26 q_6.  [back_unit_del(19),unit_del(a,25),unit_del(b,24)].
% 0.41/0.96  27 p_6.  [back_unit_del(10),unit_del(a,25),unit_del(b,24)].
% 0.41/0.96  28 q_7.  [back_unit_del(20),unit_del(a,27),unit_del(b,26)].
% 0.41/0.96  29 p_7.  [back_unit_del(11),unit_del(a,27),unit_del(b,26)].
% 0.41/0.96  30 $F # answer(base_3).  [back_unit_del(3),unit_del(a,29),unit_del(b,28)].
% 0.41/0.96  
% 0.41/0.96  % SZS output end Refutation
% 0.41/0.96  ============================== end of proof ==========================
% 0.41/0.96  
% 0.41/0.96  ============================== STATISTICS ============================
% 0.41/0.96  
% 0.41/0.96  Given=0. Generated=25. Kept=24. proofs=1.
% 0.41/0.96  Usable=0. Sos=12. Demods=0. Limbo=2, Disabled=25. Hints=0.
% 0.41/0.96  Megabytes=0.03.
% 0.41/0.96  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96  
% 0.41/0.96  ============================== end of statistics =====================
% 0.41/0.96  
% 0.41/0.96  ============================== end of search =========================
% 0.41/0.96  
% 0.41/0.96  THEOREM PROVED
% 0.41/0.96  % SZS status Unsatisfiable
% 0.41/0.96  
% 0.41/0.96  Exiting with 1 proof.
% 0.41/0.96  
% 0.41/0.96  Process 20821 exit (max_proofs) Tue Jul 12 02:49:45 2022
% 0.41/0.96  Prover9 interrupted
%------------------------------------------------------------------------------