TSTP Solution File: SWW427-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW427-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:17:00 EDT 2022
% Result : Unsatisfiable 0.51s 1.14s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWW427-1 : TPTP v8.1.0. Released v5.2.0.
% 0.09/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 5 22:08:19 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.51/1.14 ============================== Prover9 ===============================
% 0.51/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.51/1.14 Process 19653 was started by sandbox2 on n032.cluster.edu,
% 0.51/1.14 Sun Jun 5 22:08:19 2022
% 0.51/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19500_n032.cluster.edu".
% 0.51/1.14 ============================== end of head ===========================
% 0.51/1.14
% 0.51/1.14 ============================== INPUT =================================
% 0.51/1.14
% 0.51/1.14 % Reading from file /tmp/Prover9_19500_n032.cluster.edu
% 0.51/1.14
% 0.51/1.14 set(prolog_style_variables).
% 0.51/1.14 set(auto2).
% 0.51/1.14 % set(auto2) -> set(auto).
% 0.51/1.14 % set(auto) -> set(auto_inference).
% 0.51/1.14 % set(auto) -> set(auto_setup).
% 0.51/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.51/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/1.14 % set(auto) -> set(auto_limits).
% 0.51/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/1.14 % set(auto) -> set(auto_denials).
% 0.51/1.14 % set(auto) -> set(auto_process).
% 0.51/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.51/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.51/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.51/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.51/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.51/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.51/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.51/1.14 % set(auto2) -> assign(stats, some).
% 0.51/1.14 % set(auto2) -> clear(echo_input).
% 0.51/1.14 % set(auto2) -> set(quiet).
% 0.51/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.51/1.14 % set(auto2) -> clear(print_given).
% 0.51/1.14 assign(lrs_ticks,-1).
% 0.51/1.14 assign(sos_limit,10000).
% 0.51/1.14 assign(order,kbo).
% 0.51/1.14 set(lex_order_vars).
% 0.51/1.14 clear(print_given).
% 0.51/1.14
% 0.51/1.14 % formulas(sos). % not echoed (22 formulas)
% 0.51/1.14
% 0.51/1.14 ============================== end of input ==========================
% 0.51/1.14
% 0.51/1.14 % From the command line: assign(max_seconds, 300).
% 0.51/1.14
% 0.51/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/1.14
% 0.51/1.14 % Formulas that are not ordinary clauses:
% 0.51/1.14
% 0.51/1.14 ============================== end of process non-clausal formulas ===
% 0.51/1.14
% 0.51/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/1.14
% 0.51/1.14 ============================== PREDICATE ELIMINATION =================
% 0.51/1.14
% 0.51/1.14 ============================== end predicate elimination =============
% 0.51/1.14
% 0.51/1.14 Auto_denials: (non-Horn, no changes).
% 0.51/1.14
% 0.51/1.14 Term ordering decisions:
% 0.51/1.14 Function symbol KB weights: nil=1. x11=1. x1=1. x7=1. x9=1. emp=1. x10=1. x2=1. x3=1. x4=1. x5=1. x6=1. x8=1. sep=1. lseg=1. next=1.
% 0.51/1.14
% 0.51/1.14 ============================== end of process initial clauses ========
% 0.51/1.14
% 0.51/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.51/1.14
% 0.51/1.14 ============================== end of clauses for search =============
% 0.51/1.14
% 0.51/1.14 ============================== SEARCH ================================
% 0.51/1.14
% 0.51/1.14 % Starting search at 0.01 seconds.
% 0.51/1.14
% 0.51/1.14 ============================== PROOF =================================
% 0.51/1.14 % SZS status Unsatisfiable
% 0.51/1.14 % SZS output start Refutation
% 0.51/1.14
% 0.51/1.14 % Proof 1 at 0.34 (+ 0.02) seconds.
% 0.51/1.14 % Length of proof is 26.
% 0.51/1.14 % Level of proof is 9.
% 0.51/1.14 % Maximum clause weight is 41.000.
% 0.51/1.14 % Given clauses 372.
% 0.51/1.14
% 0.51/1.14 1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom). [assumption].
% 0.51/1.14 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 0.51/1.14 3 heap(sep(lseg(x10,x1),sep(lseg(x9,x2),sep(lseg(x9,x7),sep(lseg(x7,x10),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x4,x5),emp)))))))))) # label(premise_10) # label(hypothesis). [assumption].
% 0.51/1.14 4 heap(sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x9,x7),sep(lseg(x9,x2),sep(lseg(x10,x1),sep(lseg(x4,x5),emp)))))))))). [copy(3),rewrite([2(33),2(34),2(33),2(32),2(31),2(35),2(34),2(33),2(32),2(31),2(36),2(35),2(34),2(33),2(32),2(31),2(37),2(36),2(35),2(34),2(33),2(32),2(31)])].
% 0.51/1.14 6 x1 != x11 # label(premise_2) # label(hypothesis). [assumption].
% 0.51/1.14 15 x7 != x9 # label(premise_8) # label(hypothesis). [assumption].
% 0.51/1.14 16 x9 != x7. [copy(15),flip(a)].
% 0.51/1.14 23 -heap(sep(lseg(A,B),sep(lseg(A,C),D))) | A = B | A = C # label(wellformedness_5) # label(axiom). [assumption].
% 0.51/1.14 52 x7 = x11 | x9 = x11. [resolve(23,a,4,a),flip(a),flip(b)].
% 0.51/1.14 54 -heap(sep(lseg(x9,x7),sep(lseg(x9,x7),A))). [ur(23,b,16,a,c,16,a)].
% 0.51/1.14 85 -heap(sep(A,sep(lseg(B,C),sep(lseg(B,D),E)))) | B = C | B = D. [para(2(a,1),23(a,1,2)),rewrite([2(5)])].
% 0.51/1.14 127 x7 = x11 | heap(sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x9,x2),sep(lseg(x10,x1),sep(lseg(x4,x5),emp)))))))))). [para(52(b,1),4(a,1,2,2,2,2,2,1,1)),rewrite([2(36),2(37),2(38),2(39)])].
% 0.51/1.14 211 x7 = x11 | -heap(sep(lseg(x11,x7),sep(lseg(x9,x7),A))). [para(52(b,1),54(a,1,1,1))].
% 0.51/1.14 223 x7 = x11 | -heap(sep(lseg(x11,x7),sep(lseg(x11,x7),A))). [para(52(b,1),211(b,1,2,1,1)),merge(b)].
% 0.51/1.14 392 x9 = x11 | x3 = x11. [resolve(85,a,4,a),flip(a),flip(b)].
% 0.51/1.14 393 -heap(sep(A,sep(B,sep(lseg(C,D),sep(lseg(C,E),F))))) | C = D | C = E. [para(2(a,1),85(a,1,2,2)),rewrite([2(5)])].
% 0.51/1.14 394 x9 = x11 | heap(sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x9,x7),sep(lseg(x9,x2),sep(lseg(x10,x1),sep(lseg(x4,x5),emp))))))))). [para(392(b,1),4(a,1,2,2,1,2)),rewrite([1(38)])].
% 0.51/1.14 1745 x7 = x11. [resolve(127,b,223,b),merge(b)].
% 0.51/1.14 1857 x9 = x11 | heap(sep(lseg(x11,x9),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x10,x1),sep(lseg(x4,x5),emp)))))))). [back_rewrite(394),rewrite([1745(5),1745(13),1745(17),2(34),1(36)])].
% 0.51/1.14 1908 x9 != x11. [back_rewrite(16),rewrite([1745(2)])].
% 0.51/1.14 1911 heap(sep(lseg(x11,x9),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x10,x1),sep(lseg(x4,x5),emp)))))))). [back_unit_del(1857),unit_del(a,1908)].
% 0.51/1.14 1959 -heap(sep(lseg(x11,x1),sep(lseg(x11,x9),A))). [ur(23,b,6,a(flip),c,1908,a(flip))].
% 0.51/1.14 2136 -heap(sep(A,sep(B,sep(C,sep(lseg(D,E),sep(lseg(D,F),V6)))))) | D = E | D = F. [para(2(a,1),393(a,1,2,2,2)),rewrite([2(5)])].
% 0.51/1.14 3315 x2 = x9. [resolve(1911,a,2136,a),flip(b),unit_del(a,1908)].
% 0.51/1.14 3317 x10 = x11. [resolve(1911,a,23,a),flip(a),flip(b),unit_del(a,1908)].
% 0.51/1.14 3318 $F. [para(2(a,1),1911(a,1,2,2,2,2,2)),rewrite([3317(5),3315(14),3317(19),2(24),2(25),1(24),2(22),2(23),1(24),2(21)]),unit_del(a,1959)].
% 0.51/1.14
% 0.51/1.14 % SZS output end Refutation
% 0.51/1.14 ============================== end of proof ==========================
% 0.51/1.14
% 0.51/1.14 ============================== STATISTICS ============================
% 0.51/1.14
% 0.51/1.14 Given=372. Generated=13414. Kept=3311. proofs=1.
% 0.51/1.14 Usable=216. Sos=1372. Demods=6. Limbo=3, Disabled=1742. Hints=0.
% 0.51/1.14 Megabytes=2.39.
% 0.51/1.14 User_CPU=0.34, System_CPU=0.02, Wall_clock=1.
% 0.51/1.14
% 0.51/1.14 ============================== end of statistics =====================
% 0.51/1.14
% 0.51/1.14 ============================== end of search =========================
% 0.51/1.14
% 0.51/1.14 THEOREM PROVED
% 0.51/1.14 % SZS status Unsatisfiable
% 0.51/1.14
% 0.51/1.14 Exiting with 1 proof.
% 0.51/1.14
% 0.51/1.14 Process 19653 exit (max_proofs) Sun Jun 5 22:08:20 2022
% 0.51/1.14 Prover9 interrupted
%------------------------------------------------------------------------------