TSTP Solution File: SWW409-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:58 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.12 % Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 5 16:37:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.02 ============================== Prover9 ===============================
% 0.73/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.02 Process 22406 was started by sandbox on n029.cluster.edu,
% 0.73/1.02 Sun Jun 5 16:37:49 2022
% 0.73/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22076_n029.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_22076_n029.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 (17 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: (non-Horn, no changes).
% 0.73/1.02
% 0.73/1.02 Term ordering decisions:
% 0.73/1.02 Function symbol KB weights: nil=1. x1=1. x3=1. emp=1. x2=1. sep=1. lseg=1. next=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.03 (+ 0.00) seconds.
% 0.73/1.02 % Length of proof is 11.
% 0.73/1.02 % Level of proof is 2.
% 0.73/1.02 % Maximum clause weight is 19.000.
% 0.73/1.02 % Given clauses 57.
% 0.73/1.02
% 0.73/1.02 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 0.73/1.02 3 heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))) # label(premise_5) # label(hypothesis). [assumption].
% 0.73/1.02 4 heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp)))). [copy(3),rewrite([2(13)])].
% 0.73/1.02 9 x1 != x3 # label(premise_3) # label(hypothesis). [assumption].
% 0.73/1.02 10 x3 != x1. [copy(9),flip(a)].
% 0.73/1.02 13 -heap(sep(lseg(x2,nil),emp)) # label(conclusion_1) # label(negated_conjecture). [assumption].
% 0.73/1.02 19 -heap(sep(lseg(A,B),sep(lseg(B,nil),C))) | heap(sep(lseg(A,nil),C)) # label(unfolding_3) # label(axiom). [assumption].
% 0.73/1.02 20 -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.73/1.02 48 -heap(sep(lseg(A,nil),sep(lseg(x2,A),emp))). [ur(19,b,13,a),rewrite([2(7)])].
% 0.73/1.02 55 -heap(sep(lseg(A,B),sep(next(C,A),D))) | C = A | heap(sep(lseg(C,B),D)). [para(2(a,1),20(a,1))].
% 0.73/1.02 171 $F. [ur(55,b,10,a(flip),c,48,a),rewrite([2(12)]),unit_del(a,4)].
% 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=57. Generated=546. Kept=165. proofs=1.
% 0.73/1.02 Usable=57. Sos=84. Demods=2. Limbo=2, Disabled=39. Hints=0.
% 0.73/1.02 Megabytes=0.17.
% 0.73/1.02 User_CPU=0.03, 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 22406 exit (max_proofs) Sun Jun 5 16:37:49 2022
% 0.73/1.02 Prover9 interrupted
%------------------------------------------------------------------------------