TSTP Solution File: SWW410-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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.82s 1.26s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 5 13:22:14 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.82/1.26 ============================== Prover9 ===============================
% 0.82/1.26 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.26 Process 12537 was started by sandbox on n026.cluster.edu,
% 0.82/1.26 Sun Jun 5 13:22:15 2022
% 0.82/1.26 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12384_n026.cluster.edu".
% 0.82/1.26 ============================== end of head ===========================
% 0.82/1.26
% 0.82/1.26 ============================== INPUT =================================
% 0.82/1.26
% 0.82/1.26 % Reading from file /tmp/Prover9_12384_n026.cluster.edu
% 0.82/1.26
% 0.82/1.26 set(prolog_style_variables).
% 0.82/1.26 set(auto2).
% 0.82/1.26 % set(auto2) -> set(auto).
% 0.82/1.26 % set(auto) -> set(auto_inference).
% 0.82/1.26 % set(auto) -> set(auto_setup).
% 0.82/1.26 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.26 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.26 % set(auto) -> set(auto_limits).
% 0.82/1.26 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.26 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.26 % set(auto) -> set(auto_denials).
% 0.82/1.26 % set(auto) -> set(auto_process).
% 0.82/1.26 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.26 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.26 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.26 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.26 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.26 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.26 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.26 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.26 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.26 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.26 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.26 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.26 % set(auto2) -> assign(stats, some).
% 0.82/1.26 % set(auto2) -> clear(echo_input).
% 0.82/1.26 % set(auto2) -> set(quiet).
% 0.82/1.26 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.26 % set(auto2) -> clear(print_given).
% 0.82/1.26 assign(lrs_ticks,-1).
% 0.82/1.26 assign(sos_limit,10000).
% 0.82/1.26 assign(order,kbo).
% 0.82/1.26 set(lex_order_vars).
% 0.82/1.26 clear(print_given).
% 0.82/1.26
% 0.82/1.26 % formulas(sos). % not echoed (17 formulas)
% 0.82/1.26
% 0.82/1.26 ============================== end of input ==========================
% 0.82/1.26
% 0.82/1.26 % From the command line: assign(max_seconds, 300).
% 0.82/1.26
% 0.82/1.26 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.26
% 0.82/1.26 % Formulas that are not ordinary clauses:
% 0.82/1.26
% 0.82/1.26 ============================== end of process non-clausal formulas ===
% 0.82/1.26
% 0.82/1.26 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.26
% 0.82/1.26 ============================== PREDICATE ELIMINATION =================
% 0.82/1.26
% 0.82/1.26 ============================== end predicate elimination =============
% 0.82/1.26
% 0.82/1.26 Auto_denials: (non-Horn, no changes).
% 0.82/1.26
% 0.82/1.26 Term ordering decisions:
% 0.82/1.26 Function symbol KB weights: nil=1. x1=1. x3=1. emp=1. x2=1. sep=1. lseg=1. next=1.
% 0.82/1.26
% 0.82/1.26 ============================== end of process initial clauses ========
% 0.82/1.26
% 0.82/1.26 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.26
% 0.82/1.26 ============================== end of clauses for search =============
% 0.82/1.26
% 0.82/1.26 ============================== SEARCH ================================
% 0.82/1.26
% 0.82/1.26 % Starting search at 0.01 seconds.
% 0.82/1.26
% 0.82/1.26 ============================== PROOF =================================
% 0.82/1.26 % SZS status Unsatisfiable
% 0.82/1.26 % SZS output start Refutation
% 0.82/1.26
% 0.82/1.26 % Proof 1 at 0.18 (+ 0.01) seconds.
% 0.82/1.26 % Length of proof is 21.
% 0.82/1.26 % Level of proof is 7.
% 0.82/1.26 % Maximum clause weight is 27.000.
% 0.82/1.26 % Given clauses 152.
% 0.82/1.26
% 0.82/1.26 1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom). [assumption].
% 0.82/1.26 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 0.82/1.26 3 heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))) # label(premise_5) # label(hypothesis). [assumption].
% 0.82/1.26 4 heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp)))). [copy(3),rewrite([2(13)])].
% 0.82/1.26 9 x1 != x3 # label(premise_3) # label(hypothesis). [assumption].
% 0.82/1.26 10 x3 != x1. [copy(9),flip(a)].
% 0.82/1.26 15 -heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))) # label(conclusion_1) # label(negated_conjecture). [assumption].
% 0.82/1.26 20 -heap(sep(lseg(A,B),sep(lseg(B,nil),C))) | heap(sep(lseg(A,nil),C)) # label(unfolding_3) # label(axiom). [assumption].
% 0.82/1.26 21 -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.82/1.26 23 -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(C,D),E)))) | C = D | heap(sep(lseg(A,C),sep(lseg(C,D),E))) # label(unfolding_5) # label(axiom). [assumption].
% 0.82/1.26 51 -heap(sep(lseg(A,nil),sep(lseg(B,A),C))) | heap(sep(lseg(B,nil),C)). [para(2(a,1),20(a,1))].
% 0.82/1.26 53 -heap(sep(next(A,B),C)) | A = B | heap(sep(lseg(A,B),C)). [para(1(a,1),21(a,1,2))].
% 0.82/1.26 61 -heap(sep(lseg(A,B),sep(lseg(C,A),sep(lseg(B,D),E)))) | B = D | heap(sep(lseg(C,B),sep(lseg(B,D),E))). [para(2(a,1),23(a,1))].
% 0.82/1.26 126 -heap(sep(A,sep(next(B,C),D))) | B = C | heap(sep(A,sep(lseg(B,C),D))). [para(2(a,1),53(a,1)),rewrite([2(8)])].
% 0.82/1.26 176 -heap(sep(A,sep(B,sep(next(C,D),E)))) | C = D | heap(sep(A,sep(B,sep(lseg(C,D),E)))). [para(2(a,1),126(a,1,2)),rewrite([2(9)])].
% 0.82/1.26 286 heap(sep(lseg(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))). [resolve(176,a,4,a),rewrite([2(15),2(16)]),flip(a),unit_del(a,10)].
% 0.82/1.26 288 heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))). [resolve(286,a,20,a)].
% 0.82/1.26 289 heap(sep(lseg(x2,nil),emp)). [resolve(288,a,51,a)].
% 0.82/1.26 529 -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(D,A),E)))) | B = C | heap(sep(lseg(D,B),sep(lseg(B,C),E))). [para(2(a,1),61(a,1,2))].
% 0.82/1.26 704 x3 = nil. [resolve(529,a,286,a),rewrite([2(12)]),unit_del(b,15)].
% 0.82/1.26 721 $F. [back_rewrite(15),rewrite([704(1),704(5),1(9)]),unit_del(a,289)].
% 0.82/1.26
% 0.82/1.26 % SZS output end Refutation
% 0.82/1.26 ============================== end of proof ==========================
% 0.82/1.26
% 0.82/1.26 ============================== STATISTICS ============================
% 0.82/1.26
% 0.82/1.26 Given=152. Generated=5636. Kept=714. proofs=1.
% 0.82/1.26 Usable=111. Sos=131. Demods=3. Limbo=17, Disabled=472. Hints=0.
% 0.82/1.26 Megabytes=0.64.
% 0.82/1.26 User_CPU=0.18, System_CPU=0.01, Wall_clock=0.
% 0.82/1.26
% 0.82/1.26 ============================== end of statistics =====================
% 0.82/1.26
% 0.82/1.26 ============================== end of search =========================
% 0.82/1.26
% 0.82/1.26 THEOREM PROVED
% 0.82/1.26 % SZS status Unsatisfiable
% 0.82/1.26
% 0.82/1.26 Exiting with 1 proof.
% 0.82/1.26
% 0.82/1.26 Process 12537 exit (max_proofs) Sun Jun 5 13:22:15 2022
% 0.82/1.26 Prover9 interrupted
%------------------------------------------------------------------------------