TSTP Solution File: SWW425-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW425-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 30.51s 30.83s
% Output : Refutation 30.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW425-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.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 07:39:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 30.51/30.83 ============================== Prover9 ===============================
% 30.51/30.83 Prover9 (32) version 2009-11A, November 2009.
% 30.51/30.83 Process 12839 was started by sandbox2 on n017.cluster.edu,
% 30.51/30.83 Sun Jun 5 07:39:01 2022
% 30.51/30.83 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12558_n017.cluster.edu".
% 30.51/30.83 ============================== end of head ===========================
% 30.51/30.83
% 30.51/30.83 ============================== INPUT =================================
% 30.51/30.83
% 30.51/30.83 % Reading from file /tmp/Prover9_12558_n017.cluster.edu
% 30.51/30.83
% 30.51/30.83 set(prolog_style_variables).
% 30.51/30.83 set(auto2).
% 30.51/30.83 % set(auto2) -> set(auto).
% 30.51/30.83 % set(auto) -> set(auto_inference).
% 30.51/30.83 % set(auto) -> set(auto_setup).
% 30.51/30.83 % set(auto_setup) -> set(predicate_elim).
% 30.51/30.83 % set(auto_setup) -> assign(eq_defs, unfold).
% 30.51/30.83 % set(auto) -> set(auto_limits).
% 30.51/30.83 % set(auto_limits) -> assign(max_weight, "100.000").
% 30.51/30.83 % set(auto_limits) -> assign(sos_limit, 20000).
% 30.51/30.83 % set(auto) -> set(auto_denials).
% 30.51/30.83 % set(auto) -> set(auto_process).
% 30.51/30.83 % set(auto2) -> assign(new_constants, 1).
% 30.51/30.83 % set(auto2) -> assign(fold_denial_max, 3).
% 30.51/30.83 % set(auto2) -> assign(max_weight, "200.000").
% 30.51/30.83 % set(auto2) -> assign(max_hours, 1).
% 30.51/30.83 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 30.51/30.83 % set(auto2) -> assign(max_seconds, 0).
% 30.51/30.83 % set(auto2) -> assign(max_minutes, 5).
% 30.51/30.83 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 30.51/30.83 % set(auto2) -> set(sort_initial_sos).
% 30.51/30.83 % set(auto2) -> assign(sos_limit, -1).
% 30.51/30.83 % set(auto2) -> assign(lrs_ticks, 3000).
% 30.51/30.83 % set(auto2) -> assign(max_megs, 400).
% 30.51/30.83 % set(auto2) -> assign(stats, some).
% 30.51/30.83 % set(auto2) -> clear(echo_input).
% 30.51/30.83 % set(auto2) -> set(quiet).
% 30.51/30.83 % set(auto2) -> clear(print_initial_clauses).
% 30.51/30.83 % set(auto2) -> clear(print_given).
% 30.51/30.83 assign(lrs_ticks,-1).
% 30.51/30.83 assign(sos_limit,10000).
% 30.51/30.83 assign(order,kbo).
% 30.51/30.83 set(lex_order_vars).
% 30.51/30.83 clear(print_given).
% 30.51/30.83
% 30.51/30.83 % formulas(sos). % not echoed (24 formulas)
% 30.51/30.83
% 30.51/30.83 ============================== end of input ==========================
% 30.51/30.83
% 30.51/30.83 % From the command line: assign(max_seconds, 300).
% 30.51/30.83
% 30.51/30.83 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 30.51/30.83
% 30.51/30.83 % Formulas that are not ordinary clauses:
% 30.51/30.83
% 30.51/30.83 ============================== end of process non-clausal formulas ===
% 30.51/30.83
% 30.51/30.83 ============================== PROCESS INITIAL CLAUSES ===============
% 30.51/30.83
% 30.51/30.83 ============================== PREDICATE ELIMINATION =================
% 30.51/30.83
% 30.51/30.83 ============================== end predicate elimination =============
% 30.51/30.83
% 30.51/30.83 Auto_denials: (non-Horn, no changes).
% 30.51/30.83
% 30.51/30.83 Term ordering decisions:
% 30.51/30.83 Function symbol KB weights: nil=1. x1=1. x2=1. emp=1. x10=1. x5=1. x6=1. x7=1. x9=1. x3=1. x4=1. x8=1. sep=1. lseg=1. next=1.
% 30.51/30.83
% 30.51/30.83 ============================== end of process initial clauses ========
% 30.51/30.83
% 30.51/30.83 ============================== CLAUSES FOR SEARCH ====================
% 30.51/30.83
% 30.51/30.83 ============================== end of clauses for search =============
% 30.51/30.83
% 30.51/30.83 ============================== SEARCH ================================
% 30.51/30.83
% 30.51/30.83 % Starting search at 0.01 seconds.
% 30.51/30.83
% 30.51/30.83 Low Water (keep): wt=22.000, iters=4080
% 30.51/30.83
% 30.51/30.83 Low Water (keep): wt=20.000, iters=3529
% 30.51/30.83
% 30.51/30.83 Low Water (keep): wt=18.000, iters=3333
% 30.51/30.83
% 30.51/30.83 ============================== PROOF =================================
% 30.51/30.83 % SZS status Unsatisfiable
% 30.51/30.83 % SZS output start Refutation
% 30.51/30.83
% 30.51/30.83 % Proof 1 at 29.32 (+ 0.52) seconds.
% 30.51/30.83 % Length of proof is 26.
% 30.51/30.83 % Level of proof is 8.
% 30.51/30.83 % Maximum clause weight is 37.000.
% 30.51/30.83 % Given clauses 13858.
% 30.51/30.83
% 30.51/30.83 1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom). [assumption].
% 30.51/30.83 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 30.51/30.83 3 heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))) # label(premise_12) # label(hypothesis). [assumption].
% 30.51/30.83 4 heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x10),emp))))))))). [copy(3),rewrite([2(27),2(28),2(29),2(28),2(31),2(32),2(31),2(33),2(32),2(31)])].
% 30.51/30.83 9 x1 != x10 # label(premise_3) # label(hypothesis). [assumption].
% 30.51/30.83 10 x10 != x1. [copy(9),flip(a)].
% 30.51/30.83 17 x7 != x10 # label(premise_8) # label(hypothesis). [assumption].
% 30.51/30.83 22 x2 != x7 # label(premise_11) # label(hypothesis). [assumption].
% 30.51/30.83 23 x7 != x2. [copy(22),flip(a)].
% 30.51/30.83 29 -heap(sep(lseg(A,B),sep(lseg(A,C),D))) | A = B | A = C # label(wellformedness_5) # label(axiom). [assumption].
% 30.51/30.83 62 x2 = x1 | x10 = x2. [resolve(29,a,4,a),flip(b)].
% 30.51/30.83 83 -heap(sep(lseg(x10,x1),sep(lseg(x10,x7),A))). [ur(29,b,10,a,c,17,a(flip))].
% 30.51/30.83 104 -heap(sep(A,sep(lseg(B,C),sep(lseg(B,D),E)))) | B = C | B = D. [para(2(a,1),29(a,1,2)),rewrite([2(5)])].
% 30.51/30.83 149 x2 = x1 | heap(sep(lseg(x2,x1),sep(lseg(x2,x5),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x10),emp)))))))). [para(62(b,1),4(a,1,2,1,2)),rewrite([1(35)])].
% 30.51/30.83 150 x2 = x1 | heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x2),emp))))))))). [para(62(b,1),4(a,1,2,2,2,2,2,2,2,1,2))].
% 30.51/30.83 453 x10 = x2 | x5 = x2. [resolve(104,a,4,a),flip(a),flip(b)].
% 30.51/30.83 503 x10 = x2 | heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x10),emp)))))))). [para(453(b,1),4(a,1,2,2,1,2)),rewrite([1(34)])].
% 30.51/30.83 931 x2 = x1 | x5 = x2. [resolve(149,b,29,a),flip(c),merge(b)].
% 30.51/30.83 944 x2 = x1 | heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x2),emp)))))))). [para(931(b,1),150(b,1,2,2,1,2)),rewrite([1(37)]),merge(b)].
% 30.51/30.83 4728 x10 = x2 | heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x10),emp)))))))). [para(453(b,1),503(b,1,2,2,1,1)),merge(b)].
% 30.51/30.83 9337 x2 = x1 | heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x2),emp)))))))). [para(931(b,1),944(b,1,2,2,1,1)),merge(b)].
% 30.51/30.83 21349 x10 = x2. [resolve(4728,b,104,a),flip(b),flip(c),merge(b),unit_del(b,23)].
% 30.51/30.83 22505 x2 = x1 | heap(sep(lseg(x2,x1),sep(lseg(x2,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),sep(lseg(x3,x2),emp))))))). [back_rewrite(9337),rewrite([21349(8),1(31)])].
% 30.51/30.83 23302 -heap(sep(lseg(x2,x1),sep(lseg(x2,x7),A))). [back_rewrite(83),rewrite([21349(1),21349(4)])].
% 30.51/30.83 23306 x2 != x1. [back_rewrite(10),rewrite([21349(1)])].
% 30.51/30.83 23308 $F. [back_unit_del(22505),unit_del(a,23306),unit_del(b,23302)].
% 30.51/30.83
% 30.51/30.83 % SZS output end Refutation
% 30.51/30.83 ============================== end of proof ==========================
% 30.51/30.83
% 30.51/30.83 ============================== STATISTICS ============================
% 30.51/30.83
% 30.51/30.83 Given=13858. Generated=1039816. Kept=23297. proofs=1.
% 30.51/30.83 Usable=5746. Sos=4912. Demods=3. Limbo=6, Disabled=12657. Hints=0.
% 30.51/30.83 Megabytes=22.98.
% 30.51/30.83 User_CPU=29.32, System_CPU=0.52, Wall_clock=30.
% 30.51/30.83
% 30.51/30.83 ============================== end of statistics =====================
% 30.51/30.83
% 30.51/30.83 ============================== end of search =========================
% 30.51/30.83
% 30.51/30.83 THEOREM PROVED
% 30.51/30.83 % SZS status Unsatisfiable
% 30.51/30.83
% 30.51/30.83 Exiting with 1 proof.
% 30.51/30.83
% 30.51/30.83 Process 12839 exit (max_proofs) Sun Jun 5 07:39:31 2022
% 30.51/30.83 Prover9 interrupted
%------------------------------------------------------------------------------