TSTP Solution File: SWW437-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW437-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 6.23s 6.53s
% Output : Refutation 6.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW437-1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 23:52:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.23/6.53 ============================== Prover9 ===============================
% 6.23/6.53 Prover9 (32) version 2009-11A, November 2009.
% 6.23/6.53 Process 6900 was started by sandbox on n019.cluster.edu,
% 6.23/6.53 Sat Jun 4 23:52:26 2022
% 6.23/6.53 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6737_n019.cluster.edu".
% 6.23/6.53 ============================== end of head ===========================
% 6.23/6.53
% 6.23/6.53 ============================== INPUT =================================
% 6.23/6.53
% 6.23/6.53 % Reading from file /tmp/Prover9_6737_n019.cluster.edu
% 6.23/6.53
% 6.23/6.53 set(prolog_style_variables).
% 6.23/6.53 set(auto2).
% 6.23/6.53 % set(auto2) -> set(auto).
% 6.23/6.53 % set(auto) -> set(auto_inference).
% 6.23/6.53 % set(auto) -> set(auto_setup).
% 6.23/6.53 % set(auto_setup) -> set(predicate_elim).
% 6.23/6.53 % set(auto_setup) -> assign(eq_defs, unfold).
% 6.23/6.53 % set(auto) -> set(auto_limits).
% 6.23/6.53 % set(auto_limits) -> assign(max_weight, "100.000").
% 6.23/6.53 % set(auto_limits) -> assign(sos_limit, 20000).
% 6.23/6.53 % set(auto) -> set(auto_denials).
% 6.23/6.53 % set(auto) -> set(auto_process).
% 6.23/6.53 % set(auto2) -> assign(new_constants, 1).
% 6.23/6.53 % set(auto2) -> assign(fold_denial_max, 3).
% 6.23/6.53 % set(auto2) -> assign(max_weight, "200.000").
% 6.23/6.53 % set(auto2) -> assign(max_hours, 1).
% 6.23/6.53 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 6.23/6.53 % set(auto2) -> assign(max_seconds, 0).
% 6.23/6.53 % set(auto2) -> assign(max_minutes, 5).
% 6.23/6.53 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 6.23/6.53 % set(auto2) -> set(sort_initial_sos).
% 6.23/6.53 % set(auto2) -> assign(sos_limit, -1).
% 6.23/6.53 % set(auto2) -> assign(lrs_ticks, 3000).
% 6.23/6.53 % set(auto2) -> assign(max_megs, 400).
% 6.23/6.53 % set(auto2) -> assign(stats, some).
% 6.23/6.53 % set(auto2) -> clear(echo_input).
% 6.23/6.53 % set(auto2) -> set(quiet).
% 6.23/6.53 % set(auto2) -> clear(print_initial_clauses).
% 6.23/6.53 % set(auto2) -> clear(print_given).
% 6.23/6.53 assign(lrs_ticks,-1).
% 6.23/6.53 assign(sos_limit,10000).
% 6.23/6.53 assign(order,kbo).
% 6.23/6.53 set(lex_order_vars).
% 6.23/6.53 clear(print_given).
% 6.23/6.53
% 6.23/6.53 % formulas(sos). % not echoed (39 formulas)
% 6.23/6.53
% 6.23/6.53 ============================== end of input ==========================
% 6.23/6.53
% 6.23/6.53 % From the command line: assign(max_seconds, 300).
% 6.23/6.53
% 6.23/6.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 6.23/6.53
% 6.23/6.53 % Formulas that are not ordinary clauses:
% 6.23/6.53
% 6.23/6.53 ============================== end of process non-clausal formulas ===
% 6.23/6.53
% 6.23/6.53 ============================== PROCESS INITIAL CLAUSES ===============
% 6.23/6.53
% 6.23/6.53 ============================== PREDICATE ELIMINATION =================
% 6.23/6.53
% 6.23/6.53 ============================== end predicate elimination =============
% 6.23/6.53
% 6.23/6.53 Auto_denials: (non-Horn, no changes).
% 6.23/6.53
% 6.23/6.53 Term ordering decisions:
% 6.23/6.53 Function symbol KB weights: nil=1. x1=1. x16=1. x3=1. emp=1. x10=1. x12=1. x5=1. x7=1. x8=1. x11=1. x15=1. x2=1. x6=1. x13=1. x14=1. x4=1. x9=1. sep=1. lseg=1. next=1.
% 6.23/6.53
% 6.23/6.53 ============================== end of process initial clauses ========
% 6.23/6.53
% 6.23/6.53 ============================== CLAUSES FOR SEARCH ====================
% 6.23/6.53
% 6.23/6.53 ============================== end of clauses for search =============
% 6.23/6.53
% 6.23/6.53 ============================== SEARCH ================================
% 6.23/6.53
% 6.23/6.53 % Starting search at 0.01 seconds.
% 6.23/6.53
% 6.23/6.53 Low Water (keep): wt=20.000, iters=3351
% 6.23/6.53
% 6.23/6.53 Low Water (keep): wt=18.000, iters=3713
% 6.23/6.53
% 6.23/6.53 ============================== PROOF =================================
% 6.23/6.53 % SZS status Unsatisfiable
% 6.23/6.53 % SZS output start Refutation
% 6.23/6.53
% 6.23/6.53 % Proof 1 at 5.25 (+ 0.16) seconds.
% 6.23/6.53 % Length of proof is 14.
% 6.23/6.53 % Level of proof is 5.
% 6.23/6.53 % Maximum clause weight is 46.000.
% 6.23/6.53 % Given clauses 352.
% 6.23/6.53
% 6.23/6.53 1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom). [assumption].
% 6.23/6.53 2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom). [assumption].
% 6.23/6.53 3 heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) # label(premise_27) # label(hypothesis). [assumption].
% 6.23/6.53 4 heap(sep(lseg(x16,x3),sep(lseg(x16,x7),sep(lseg(x3,x16),sep(lseg(x3,x12),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x12,x8),sep(lseg(x5,x1),sep(lseg(x7,x1),sep(lseg(x11,x8),sep(lseg(x2,x6),emp)))))))))))). [copy(3),rewrite([2(37),2(38),2(37),2(39),2(38),2(40),2(39),2(38),2(42),2(43),2(42),2(41),2(40),2(39),2(38),2(37),2(36),2(44),2(43),2(42),2(41),2(40),2(39),2(45),2(44),2(43),2(42),2(41),2(40),2(39)])].
% 6.23/6.53 12 x3 != x8 # label(premise_6) # label(hypothesis). [assumption].
% 6.23/6.53 13 x8 != x3. [copy(12),flip(a)].
% 6.23/6.53 20 x7 != x16 # label(premise_10) # label(hypothesis). [assumption].
% 6.23/6.53 52 -heap(sep(lseg(A,B),sep(lseg(A,C),D))) | A = B | A = C # label(wellformedness_5) # label(axiom). [assumption].
% 6.23/6.53 115 x3 = x16. [resolve(52,a,4,a),flip(a),flip(b),unit_del(b,20)].
% 6.23/6.53 242 x8 != x16. [back_rewrite(13),rewrite([115(2)])].
% 6.23/6.53 244 heap(sep(lseg(x16,x12),sep(lseg(x16,x7),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x12,x8),sep(lseg(x5,x1),sep(lseg(x7,x1),sep(lseg(x11,x8),sep(lseg(x2,x6),emp)))))))))). [back_rewrite(4),rewrite([115(2),115(7),115(10),1(43),2(40),1(41)])].
% 6.23/6.53 310 -heap(sep(lseg(x16,x7),sep(lseg(x16,x8),A))). [ur(52,b,20,a(flip),c,242,a(flip))].
% 6.23/6.53 5234 x12 = x16. [resolve(244,a,52,a),flip(a),flip(b),unit_del(b,20)].
% 6.23/6.53 5235 $F. [para(2(a,1),244(a,1,2,2,2,2,2,2,2)),rewrite([5234(2),5234(13),2(30),2(34),2(35),1(37)]),unit_del(a,310)].
% 6.23/6.53
% 6.23/6.53 % SZS output end Refutation
% 6.23/6.53 ============================== end of proof ==========================
% 6.23/6.53
% 6.23/6.53 ============================== STATISTICS ============================
% 6.23/6.53
% 6.23/6.53 Given=352. Generated=176164. Kept=5216. proofs=1.
% 6.23/6.53 Usable=347. Sos=4605. Demods=4. Limbo=2, Disabled=301. Hints=0.
% 6.23/6.53 Megabytes=4.54.
% 6.23/6.53 User_CPU=5.25, System_CPU=0.16, Wall_clock=5.
% 6.23/6.53
% 6.23/6.53 ============================== end of statistics =====================
% 6.23/6.53
% 6.23/6.53 ============================== end of search =========================
% 6.23/6.53
% 6.23/6.53 THEOREM PROVED
% 6.23/6.53 % SZS status Unsatisfiable
% 6.23/6.53
% 6.23/6.53 Exiting with 1 proof.
% 6.23/6.53
% 6.23/6.53 Process 6900 exit (max_proofs) Sat Jun 4 23:52:31 2022
% 6.23/6.53 Prover9 interrupted
%------------------------------------------------------------------------------