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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWW423-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n032.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 01:16:59 EDT 2022

% Result   : Unsatisfiable 0.48s 0.80s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SWW423-1 : TPTP v8.1.0. Released v5.2.0.
% 0.02/0.10  % Command  : tptp2X_and_run_prover9 %d %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Sun Jun  5 08:06:48 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.48/0.80  ============================== Prover9 ===============================
% 0.48/0.80  Prover9 (32) version 2009-11A, November 2009.
% 0.48/0.80  Process 3540 was started by sandbox on n032.cluster.edu,
% 0.48/0.80  Sun Jun  5 08:06:49 2022
% 0.48/0.80  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3387_n032.cluster.edu".
% 0.48/0.80  ============================== end of head ===========================
% 0.48/0.80  
% 0.48/0.80  ============================== INPUT =================================
% 0.48/0.80  
% 0.48/0.80  % Reading from file /tmp/Prover9_3387_n032.cluster.edu
% 0.48/0.80  
% 0.48/0.80  set(prolog_style_variables).
% 0.48/0.80  set(auto2).
% 0.48/0.80      % set(auto2) -> set(auto).
% 0.48/0.80      % set(auto) -> set(auto_inference).
% 0.48/0.80      % set(auto) -> set(auto_setup).
% 0.48/0.80      % set(auto_setup) -> set(predicate_elim).
% 0.48/0.80      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/0.80      % set(auto) -> set(auto_limits).
% 0.48/0.80      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/0.80      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/0.80      % set(auto) -> set(auto_denials).
% 0.48/0.80      % set(auto) -> set(auto_process).
% 0.48/0.80      % set(auto2) -> assign(new_constants, 1).
% 0.48/0.80      % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/0.80      % set(auto2) -> assign(max_weight, "200.000").
% 0.48/0.80      % set(auto2) -> assign(max_hours, 1).
% 0.48/0.80      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/0.80      % set(auto2) -> assign(max_seconds, 0).
% 0.48/0.80      % set(auto2) -> assign(max_minutes, 5).
% 0.48/0.80      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/0.80      % set(auto2) -> set(sort_initial_sos).
% 0.48/0.80      % set(auto2) -> assign(sos_limit, -1).
% 0.48/0.80      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/0.80      % set(auto2) -> assign(max_megs, 400).
% 0.48/0.80      % set(auto2) -> assign(stats, some).
% 0.48/0.80      % set(auto2) -> clear(echo_input).
% 0.48/0.80      % set(auto2) -> set(quiet).
% 0.48/0.80      % set(auto2) -> clear(print_initial_clauses).
% 0.48/0.80      % set(auto2) -> clear(print_given).
% 0.48/0.80  assign(lrs_ticks,-1).
% 0.48/0.80  assign(sos_limit,10000).
% 0.48/0.80  assign(order,kbo).
% 0.48/0.80  set(lex_order_vars).
% 0.48/0.80  clear(print_given).
% 0.48/0.80  
% 0.48/0.80  % formulas(sos).  % not echoed (16 formulas)
% 0.48/0.80  
% 0.48/0.80  ============================== end of input ==========================
% 0.48/0.80  
% 0.48/0.80  % From the command line: assign(max_seconds, 300).
% 0.48/0.80  
% 0.48/0.80  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/0.80  
% 0.48/0.80  % Formulas that are not ordinary clauses:
% 0.48/0.80  
% 0.48/0.80  ============================== end of process non-clausal formulas ===
% 0.48/0.80  
% 0.48/0.80  ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/0.80  
% 0.48/0.80  ============================== PREDICATE ELIMINATION =================
% 0.48/0.80  
% 0.48/0.80  ============================== end predicate elimination =============
% 0.48/0.80  
% 0.48/0.80  Auto_denials:  (non-Horn, no changes).
% 0.48/0.80  
% 0.48/0.80  Term ordering decisions:
% 0.48/0.80  Function symbol KB weights:  nil=1. x2=1. emp=1. x1=1. x3=1. sep=1. lseg=1. next=1.
% 0.48/0.80  
% 0.48/0.80  ============================== end of process initial clauses ========
% 0.48/0.80  
% 0.48/0.80  ============================== CLAUSES FOR SEARCH ====================
% 0.48/0.80  
% 0.48/0.80  ============================== end of clauses for search =============
% 0.48/0.80  
% 0.48/0.80  ============================== SEARCH ================================
% 0.48/0.80  
% 0.48/0.80  % Starting search at 0.01 seconds.
% 0.48/0.80  
% 0.48/0.80  ============================== PROOF =================================
% 0.48/0.80  % SZS status Unsatisfiable
% 0.48/0.80  % SZS output start Refutation
% 0.48/0.80  
% 0.48/0.80  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.48/0.80  % Length of proof is 7.
% 0.48/0.80  % Level of proof is 2.
% 0.48/0.80  % Maximum clause weight is 19.000.
% 0.48/0.80  % Given clauses 14.
% 0.48/0.80  
% 0.48/0.80  2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom).  [assumption].
% 0.48/0.80  3 heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))) # label(premise_4) # label(hypothesis).  [assumption].
% 0.48/0.80  6 x2 != x1 # label(premise_2) # label(hypothesis).  [assumption].
% 0.48/0.80  7 x1 != x2.  [copy(6),flip(a)].
% 0.48/0.80  12 -heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))) # label(conclusion_1) # label(negated_conjecture).  [assumption].
% 0.48/0.80  18 -heap(sep(next(A,B),sep(lseg(B,C),D))) | A = B | heap(sep(lseg(A,C),D)) # label(unfolding_2) # label(axiom).  [assumption].
% 0.48/0.80  46 $F.  [ur(18,b,7,a,c,12,a),rewrite([2(13),2(12)]),unit_del(a,3)].
% 0.48/0.80  
% 0.48/0.80  % SZS output end Refutation
% 0.48/0.80  ============================== end of proof ==========================
% 0.48/0.80  
% 0.48/0.80  ============================== STATISTICS ============================
% 0.48/0.80  
% 0.48/0.80  Given=14. Generated=70. Kept=41. proofs=1.
% 0.48/0.80  Usable=14. Sos=27. Demods=2. Limbo=0, Disabled=16. Hints=0.
% 0.48/0.80  Megabytes=0.07.
% 0.48/0.80  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.48/0.80  
% 0.48/0.80  ============================== end of statistics =====================
% 0.48/0.80  
% 0.48/0.80  ============================== end of search =========================
% 0.48/0.80  
% 0.48/0.80  THEOREM PROVED
% 0.48/0.80  % SZS status Unsatisfiable
% 0.48/0.80  
% 0.48/0.80  Exiting with 1 proof.
% 0.48/0.80  
% 0.48/0.80  Process 3540 exit (max_proofs) Sun Jun  5 08:06:49 2022
% 0.48/0.80  Prover9 interrupted
%------------------------------------------------------------------------------