TSTP Solution File: SWW412-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW412-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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.75s 1.05s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWW412-1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 4 10:32:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 7517 was started by sandbox2 on n022.cluster.edu,
% 0.75/1.05 Sat Jun 4 10:32:21 2022
% 0.75/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7364_n022.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_7364_n022.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (20 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials: (non-Horn, no changes).
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 Function symbol KB weights: nil=1. x3=1. x4=1. emp=1. x1=1. x2=1. sep=1. lseg=1. next=1.
% 0.75/1.05
% 0.75/1.05 ============================== end of process initial clauses ========
% 0.75/1.05
% 0.75/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.05
% 0.75/1.05 ============================== end of clauses for search =============
% 0.75/1.05
% 0.75/1.05 ============================== SEARCH ================================
% 0.75/1.05
% 0.75/1.05 % Starting search at 0.01 seconds.
% 0.75/1.05
% 0.75/1.05 ============================== PROOF =================================
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05 % SZS output start Refutation
% 0.75/1.05
% 0.75/1.05 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.75/1.05 % Length of proof is 13.
% 0.75/1.05 % Level of proof is 3.
% 0.75/1.05 % Maximum clause weight is 23.000.
% 0.75/1.05 % Given clauses 91.
% 0.75/1.05
% 0.75/1.05 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 0.75/1.05 3 heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),sep(next(x2,x3),emp))))) # label(premise_8) # label(hypothesis). [assumption].
% 0.75/1.05 10 x3 != x2 # label(premise_4) # label(hypothesis). [assumption].
% 0.75/1.05 11 x2 != x3. [copy(10),flip(a)].
% 0.75/1.05 14 x1 != x4 # label(premise_6) # label(hypothesis). [assumption].
% 0.75/1.05 18 -heap(sep(lseg(x2,nil),sep(lseg(x1,nil),emp))) # label(conclusion_1) # label(negated_conjecture). [assumption].
% 0.75/1.05 19 -heap(sep(lseg(x1,nil),sep(lseg(x2,nil),emp))). [copy(18),rewrite([2(9)])].
% 0.75/1.05 25 -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.75/1.05 83 -heap(sep(A,sep(next(B,C),sep(lseg(C,D),E)))) | B = C | heap(sep(A,sep(lseg(B,D),E))). [para(2(a,1),25(a,1,2)),rewrite([2(5),2(10)])].
% 0.75/1.05 84 -heap(sep(lseg(A,B),sep(next(C,A),D))) | C = A | heap(sep(lseg(C,B),D)). [para(2(a,1),25(a,1))].
% 0.75/1.05 276 -heap(sep(A,sep(lseg(B,C),sep(next(D,B),E)))) | D = B | heap(sep(A,sep(lseg(D,C),E))). [para(2(a,1),84(a,1,2)),rewrite([2(5),2(10)])].
% 0.75/1.05 433 -heap(sep(lseg(x3,nil),sep(lseg(x1,nil),sep(next(x2,x3),emp)))). [ur(83,b,11,a,c,19,a),rewrite([2(12),2(13)])].
% 0.75/1.05 453 $F. [resolve(276,a,3,a),unit_del(a,14),unit_del(b,433)].
% 0.75/1.05
% 0.75/1.05 % SZS output end Refutation
% 0.75/1.05 ============================== end of proof ==========================
% 0.75/1.05
% 0.75/1.05 ============================== STATISTICS ============================
% 0.75/1.05
% 0.75/1.05 Given=91. Generated=1448. Kept=445. proofs=1.
% 0.75/1.05 Usable=91. Sos=301. Demods=2. Limbo=0, Disabled=73. Hints=0.
% 0.75/1.05 Megabytes=0.39.
% 0.75/1.05 User_CPU=0.06, System_CPU=0.00, Wall_clock=1.
% 0.75/1.05
% 0.75/1.05 ============================== end of statistics =====================
% 0.75/1.05
% 0.75/1.05 ============================== end of search =========================
% 0.75/1.05
% 0.75/1.05 THEOREM PROVED
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05
% 0.75/1.05 Exiting with 1 proof.
% 0.75/1.05
% 0.75/1.05 Process 7517 exit (max_proofs) Sat Jun 4 10:32:22 2022
% 0.75/1.05 Prover9 interrupted
%------------------------------------------------------------------------------