TSTP Solution File: COL114-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : COL114-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n019.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 : Fri Jul 15 00:40:07 EDT 2022

% Result   : Unsatisfiable 0.73s 1.02s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COL114-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue May 31 04:12:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.73/1.02  ============================== Prover9 ===============================
% 0.73/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.02  Process 2843 was started by sandbox on n019.cluster.edu,
% 0.73/1.02  Tue May 31 04:12:11 2022
% 0.73/1.02  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2690_n019.cluster.edu".
% 0.73/1.02  ============================== end of head ===========================
% 0.73/1.02  
% 0.73/1.02  ============================== INPUT =================================
% 0.73/1.02  
% 0.73/1.02  % Reading from file /tmp/Prover9_2690_n019.cluster.edu
% 0.73/1.02  
% 0.73/1.02  set(prolog_style_variables).
% 0.73/1.02  set(auto2).
% 0.73/1.02      % set(auto2) -> set(auto).
% 0.73/1.02      % set(auto) -> set(auto_inference).
% 0.73/1.02      % set(auto) -> set(auto_setup).
% 0.73/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.73/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.02      % set(auto) -> set(auto_limits).
% 0.73/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.02      % set(auto) -> set(auto_denials).
% 0.73/1.02      % set(auto) -> set(auto_process).
% 0.73/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.73/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.73/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.73/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.73/1.02      % set(auto2) -> assign(stats, some).
% 0.73/1.02      % set(auto2) -> clear(echo_input).
% 0.73/1.02      % set(auto2) -> set(quiet).
% 0.73/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.02      % set(auto2) -> clear(print_given).
% 0.73/1.02  assign(lrs_ticks,-1).
% 0.73/1.02  assign(sos_limit,10000).
% 0.73/1.02  assign(order,kbo).
% 0.73/1.02  set(lex_order_vars).
% 0.73/1.02  clear(print_given).
% 0.73/1.02  
% 0.73/1.02  % formulas(sos).  % not echoed (3 formulas)
% 0.73/1.02  
% 0.73/1.02  ============================== end of input ==========================
% 0.73/1.02  
% 0.73/1.02  % From the command line: assign(max_seconds, 300).
% 0.73/1.02  
% 0.73/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.02  
% 0.73/1.02  % Formulas that are not ordinary clauses:
% 0.73/1.02  
% 0.73/1.02  ============================== end of process non-clausal formulas ===
% 0.73/1.02  
% 0.73/1.02  ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.02  
% 0.73/1.02  ============================== PREDICATE ELIMINATION =================
% 0.73/1.02  
% 0.73/1.02  ============================== end predicate elimination =============
% 0.73/1.02  
% 0.73/1.02  Auto_denials:
% 0.73/1.02    % copying label cls_conjecture_2 to answer in negative clause
% 0.73/1.02  
% 0.73/1.02  Term ordering decisions:
% 0.73/1.02  Function symbol KB weights:  tc_Comb_Ocomb=1. c_Comb_Oparcontract=1. c_Comb_Ocomb_OK=1. v_x=1. v_x_H=1. v_w=1. c_Comb_Ocomb_Oop_A_D_D=1. tc_prod=1. c_Pair=1.
% 0.73/1.02  
% 0.73/1.02  ============================== end of process initial clauses ========
% 0.73/1.02  
% 0.73/1.02  ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.02  
% 0.73/1.02  ============================== end of clauses for search =============
% 0.73/1.02  
% 0.73/1.02  ============================== SEARCH ================================
% 0.73/1.02  
% 0.73/1.02  % Starting search at 0.01 seconds.
% 0.73/1.02  
% 0.73/1.02  ============================== PROOF =================================
% 0.73/1.02  % SZS status Unsatisfiable
% 0.73/1.02  % SZS output start Refutation
% 0.73/1.02  
% 0.73/1.02  % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_2.
% 0.73/1.02  % Length of proof is 4.
% 0.73/1.02  % Level of proof is 1.
% 0.73/1.02  % Maximum clause weight is 24.000.
% 0.73/1.02  % Given clauses 3.
% 0.73/1.02  
% 0.73/1.02  1 c_in(c_Pair(v_x,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) # label(cls_conjecture_1) # label(negated_conjecture).  [assumption].
% 0.73/1.02  2 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) # label(cls_Comb_Oparcontract_Ointros__2_0) # label(axiom).  [assumption].
% 0.73/1.02  3 -c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) | -c_in(c_Pair(v_x,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2).  [assumption].
% 0.73/1.02  4 $F # answer(cls_conjecture_2).  [resolve(3,a,2,a),unit_del(a,1)].
% 0.73/1.02  
% 0.73/1.02  % SZS output end Refutation
% 0.73/1.02  ============================== end of proof ==========================
% 0.73/1.02  
% 0.73/1.02  ============================== STATISTICS ============================
% 0.73/1.02  
% 0.73/1.02  Given=3. Generated=4. Kept=3. proofs=1.
% 0.73/1.02  Usable=3. Sos=0. Demods=0. Limbo=0, Disabled=3. Hints=0.
% 0.73/1.02  Megabytes=0.03.
% 0.73/1.02  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.73/1.02  
% 0.73/1.02  ============================== end of statistics =====================
% 0.73/1.02  
% 0.73/1.02  ============================== end of search =========================
% 0.73/1.02  
% 0.73/1.02  THEOREM PROVED
% 0.73/1.02  % SZS status Unsatisfiable
% 0.73/1.02  
% 0.73/1.02  Exiting with 1 proof.
% 0.73/1.02  
% 0.73/1.02  Process 2843 exit (max_proofs) Tue May 31 04:12:11 2022
% 0.73/1.02  Prover9 interrupted
%------------------------------------------------------------------------------