TSTP Solution File: SWW443-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW443-1 : TPTP v8.1.0. Released v5.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 : Thu Jul 21 01:17:01 EDT 2022
% Result : Unsatisfiable 17.39s 17.68s
% Output : Refutation 17.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW443-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 5 13:41:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 17.39/17.68 ============================== Prover9 ===============================
% 17.39/17.68 Prover9 (32) version 2009-11A, November 2009.
% 17.39/17.68 Process 23556 was started by sandbox on n023.cluster.edu,
% 17.39/17.68 Sun Jun 5 13:41:55 2022
% 17.39/17.68 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23403_n023.cluster.edu".
% 17.39/17.68 ============================== end of head ===========================
% 17.39/17.68
% 17.39/17.68 ============================== INPUT =================================
% 17.39/17.68
% 17.39/17.68 % Reading from file /tmp/Prover9_23403_n023.cluster.edu
% 17.39/17.68
% 17.39/17.68 set(prolog_style_variables).
% 17.39/17.68 set(auto2).
% 17.39/17.68 % set(auto2) -> set(auto).
% 17.39/17.68 % set(auto) -> set(auto_inference).
% 17.39/17.68 % set(auto) -> set(auto_setup).
% 17.39/17.68 % set(auto_setup) -> set(predicate_elim).
% 17.39/17.68 % set(auto_setup) -> assign(eq_defs, unfold).
% 17.39/17.68 % set(auto) -> set(auto_limits).
% 17.39/17.68 % set(auto_limits) -> assign(max_weight, "100.000").
% 17.39/17.68 % set(auto_limits) -> assign(sos_limit, 20000).
% 17.39/17.68 % set(auto) -> set(auto_denials).
% 17.39/17.68 % set(auto) -> set(auto_process).
% 17.39/17.68 % set(auto2) -> assign(new_constants, 1).
% 17.39/17.68 % set(auto2) -> assign(fold_denial_max, 3).
% 17.39/17.68 % set(auto2) -> assign(max_weight, "200.000").
% 17.39/17.68 % set(auto2) -> assign(max_hours, 1).
% 17.39/17.68 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 17.39/17.68 % set(auto2) -> assign(max_seconds, 0).
% 17.39/17.68 % set(auto2) -> assign(max_minutes, 5).
% 17.39/17.68 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 17.39/17.68 % set(auto2) -> set(sort_initial_sos).
% 17.39/17.68 % set(auto2) -> assign(sos_limit, -1).
% 17.39/17.68 % set(auto2) -> assign(lrs_ticks, 3000).
% 17.39/17.68 % set(auto2) -> assign(max_megs, 400).
% 17.39/17.68 % set(auto2) -> assign(stats, some).
% 17.39/17.68 % set(auto2) -> clear(echo_input).
% 17.39/17.68 % set(auto2) -> set(quiet).
% 17.39/17.68 % set(auto2) -> clear(print_initial_clauses).
% 17.39/17.68 % set(auto2) -> clear(print_given).
% 17.39/17.68 assign(lrs_ticks,-1).
% 17.39/17.68 assign(sos_limit,10000).
% 17.39/17.68 assign(order,kbo).
% 17.39/17.68 set(lex_order_vars).
% 17.39/17.68 clear(print_given).
% 17.39/17.68
% 17.39/17.68 % formulas(sos). % not echoed (35 formulas)
% 17.39/17.68
% 17.39/17.68 ============================== end of input ==========================
% 17.39/17.68
% 17.39/17.68 % From the command line: assign(max_seconds, 300).
% 17.39/17.68
% 17.39/17.68 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 17.39/17.68
% 17.39/17.68 % Formulas that are not ordinary clauses:
% 17.39/17.68
% 17.39/17.68 ============================== end of process non-clausal formulas ===
% 17.39/17.68
% 17.39/17.68 ============================== PROCESS INITIAL CLAUSES ===============
% 17.39/17.68
% 17.39/17.68 ============================== PREDICATE ELIMINATION =================
% 17.39/17.68
% 17.39/17.68 ============================== end predicate elimination =============
% 17.39/17.68
% 17.39/17.68 Auto_denials: (non-Horn, no changes).
% 17.39/17.68
% 17.39/17.68 Term ordering decisions:
% 17.39/17.68 Function symbol KB weights: x1=1. nil=1. x2=1. x5=1. emp=1. x11=1. x12=1. x18=1. x7=1. x9=1. x10=1. x13=1. x14=1. x15=1. x3=1. x8=1. x16=1. x17=1. x19=1. x4=1. x6=1. sep=1. lseg=1. next=1.
% 17.39/17.68
% 17.39/17.68 ============================== end of process initial clauses ========
% 17.39/17.68
% 17.39/17.68 ============================== CLAUSES FOR SEARCH ====================
% 17.39/17.68
% 17.39/17.68 ============================== end of clauses for search =============
% 17.39/17.68
% 17.39/17.68 ============================== SEARCH ================================
% 17.39/17.68
% 17.39/17.68 % Starting search at 0.01 seconds.
% 17.39/17.68
% 17.39/17.68 Low Water (keep): wt=18.000, iters=3975
% 17.39/17.68
% 17.39/17.68 Low Water (keep): wt=16.000, iters=3346
% 17.39/17.68
% 17.39/17.68 ============================== PROOF =================================
% 17.39/17.68 % SZS status Unsatisfiable
% 17.39/17.68 % SZS output start Refutation
% 17.39/17.68
% 17.39/17.68 % Proof 1 at 16.26 (+ 0.42) seconds.
% 17.39/17.68 % Length of proof is 35.
% 17.39/17.68 % Level of proof is 11.
% 17.39/17.68 % Maximum clause weight is 54.000.
% 17.39/17.68 % Given clauses 986.
% 17.39/17.68
% 17.39/17.68 1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom). [assumption].
% 17.39/17.68 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 17.39/17.68 3 heap(sep(lseg(x10,x1),sep(lseg(x18,x15),sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x12,x13),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x9,x5),sep(lseg(x7,x5),sep(lseg(x11,x9),sep(lseg(x11,x7),emp)))))))))))))) # label(premise_23) # label(hypothesis). [assumption].
% 17.39/17.68 4 heap(sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x12,x13),sep(lseg(x18,x15),sep(lseg(x7,x5),sep(lseg(x9,x5),sep(lseg(x10,x1),emp)))))))))))))). [copy(3),rewrite([2(42),2(43),2(42),2(44),2(43),2(42),2(49),2(48),2(47),2(46),2(45),2(44),2(52),2(51),2(50),2(49),2(48),2(47),2(46),2(45),2(44),2(53),2(52),2(51),2(50),2(49),2(48),2(47),2(46),2(45),2(44),2(43),2(42)])].
% 17.39/17.68 16 x2 != x8 # label(premise_8) # label(hypothesis). [assumption].
% 17.39/17.68 17 x8 != x2. [copy(16),flip(a)].
% 17.39/17.68 18 x2 != x13 # label(premise_9) # label(hypothesis). [assumption].
% 17.39/17.68 19 x13 != x2. [copy(18),flip(a)].
% 17.39/17.68 34 x1 != x14 # label(premise_19) # label(hypothesis). [assumption].
% 17.39/17.68 35 x14 != x1. [copy(34),flip(a)].
% 17.39/17.68 40 x5 != x15 # label(premise_22) # label(hypothesis). [assumption].
% 17.39/17.68 41 x15 != x5. [copy(40),flip(a)].
% 17.39/17.68 47 -heap(sep(lseg(A,B),sep(lseg(A,C),D))) | A = B | A = C # label(wellformedness_5) # label(axiom). [assumption].
% 17.39/17.68 102 x3 = x1. [resolve(47,a,4,a),flip(a),flip(b),unit_del(a,35)].
% 17.39/17.68 194 -heap(sep(A,sep(lseg(B,C),sep(lseg(B,D),E)))) | B = C | B = D. [para(2(a,1),47(a,1,2)),rewrite([2(5)])].
% 17.39/17.68 201 heap(sep(lseg(x1,x14),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x12,x13),sep(lseg(x18,x15),sep(lseg(x7,x5),sep(lseg(x9,x5),sep(lseg(x10,x1),emp))))))))))))). [back_rewrite(4),rewrite([102(5),1(52)])].
% 17.39/17.68 202 -heap(sep(A,sep(lseg(B,C),sep(lseg(B,C),D)))) | B = C. [factor(194,b,c)].
% 17.39/17.68 447 -heap(sep(A,sep(B,sep(lseg(C,D),sep(lseg(C,D),E))))) | C = D. [para(2(a,1),202(a,1,2,2)),rewrite([2(5)])].
% 17.39/17.68 585 -heap(sep(A,sep(B,sep(C,sep(lseg(D,E),sep(lseg(D,E),F)))))) | D = E. [para(2(a,1),447(a,1,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 687 -heap(sep(A,sep(B,sep(lseg(C,D),sep(lseg(C,E),F))))) | C = D | C = E. [para(2(a,1),194(a,1,2,2)),rewrite([2(5)])].
% 17.39/17.68 779 -heap(sep(A,sep(B,sep(C,sep(D,sep(lseg(E,F),sep(lseg(E,F),V6))))))) | E = F. [para(2(a,1),585(a,1,2,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 883 -heap(sep(A,sep(B,sep(C,sep(lseg(D,E),sep(lseg(D,F),V6)))))) | D = E | D = F. [para(2(a,1),687(a,1,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 973 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(lseg(F,V6),sep(lseg(F,V6),V7)))))))) | F = V6. [para(2(a,1),779(a,1,2,2,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 1071 -heap(sep(A,sep(B,sep(C,sep(lseg(x2,x13),sep(lseg(x2,x8),D)))))). [ur(883,b,19,a(flip),c,17,a(flip))].
% 17.39/17.68 1264 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(lseg(V6,V7),sep(lseg(V6,V7),V8))))))))) | V6 = V7. [para(2(a,1),973(a,1,2,2,2,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 1544 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(lseg(V7,V8),sep(lseg(V7,V8),V9)))))))))) | V7 = V8. [para(2(a,1),1264(a,1,2,2,2,2,2,2,2)),rewrite([2(5)])].
% 17.39/17.68 1751 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(lseg(x5,x15),sep(lseg(x5,x15),V7)))))))))). [ur(1544,b,41,a(flip))].
% 17.39/17.68 4832 x18 = x2. [resolve(201,a,883,a),flip(a),flip(b),unit_del(b,17)].
% 17.39/17.68 4833 x5 = x2 | x12 = x2. [resolve(201,a,194,a),flip(a),flip(b)].
% 17.39/17.68 4834 heap(sep(lseg(x1,x14),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x15),sep(lseg(x2,x8),sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x9,x5),sep(lseg(x10,x1),emp)))))))))))). [para(2(a,1),201(a,1,2,2,2,2,2,2,2,2,2,2)),rewrite([4832(11),4832(25),2(39),2(42),2(43),2(44),2(45),1(46)])].
% 17.39/17.68 7578 x15 = x2. [resolve(4834,a,883,a),flip(a),flip(b),unit_del(b,17)].
% 17.39/17.68 7583 x5 = x2. [para(4833(b,1),4834(a,1,2,2,2,2,2,2,2,1,1)),rewrite([7578(14),2(42),2(43),2(44),1(45)]),unit_del(b,1071)].
% 17.39/17.68 7949 heap(sep(lseg(x1,x14),sep(lseg(x2,x12),sep(lseg(x2,x8),sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x12,x13),sep(lseg(x7,x2),sep(lseg(x9,x2),sep(lseg(x10,x1),emp)))))))))). [back_rewrite(4834),rewrite([7583(5),7578(11),7583(26),7583(29),1(42),1(40)])].
% 17.39/17.68 8041 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,V7)))))))). [back_rewrite(1751),rewrite([7583(1),7578(2),7583(4),7578(5),1(7),1(4)])].
% 17.39/17.68 8042 $F. [resolve(8041,a,7949,a)].
% 17.39/17.68
% 17.39/17.68 % SZS output end Refutation
% 17.39/17.68 ============================== end of proof ==========================
% 17.39/17.68
% 17.39/17.68 ============================== STATISTICS ============================
% 17.39/17.68
% 17.39/17.68 Given=986. Generated=789655. Kept=8024. proofs=1.
% 17.39/17.68 Usable=958. Sos=4381. Demods=6. Limbo=463, Disabled=2256. Hints=0.
% 17.39/17.68 Megabytes=6.72.
% 17.39/17.68 User_CPU=16.26, System_CPU=0.42, Wall_clock=16.
% 17.39/17.68
% 17.39/17.68 ============================== end of statistics =====================
% 17.39/17.68
% 17.39/17.68 ============================== end of search =========================
% 17.39/17.68
% 17.39/17.68 THEOREM PROVED
% 17.39/17.68 % SZS status Unsatisfiable
% 17.39/17.68
% 17.39/17.68 Exiting with 1 proof.
% 17.39/17.68
% 17.39/17.68 Process 23556 exit (max_proofs) Sun Jun 5 13:42:11 2022
% 17.39/17.68 Prover9 interrupted
%------------------------------------------------------------------------------