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

View Problem - Process Solution

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

% Computer : n023.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 : Tue Jul 19 04:32:32 EDT 2022

% Result   : Unsatisfiable 0.45s 1.01s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

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