TSTP Solution File: SWW413-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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 : 300s
% DateTime : Wed Jul 27 13:22:31 EDT 2022
% Result : Unsatisfiable 1.78s 1.96s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 6 unt; 1 nHn; 6 RR)
% Number of literals : 9 ( 3 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ heap(sep(next(A,B),sep(lseg(B,C),D)))
| A = B
| heap(sep(lseg(A,C),D)) ),
file('SWW413-1.p',unknown),
[] ).
cnf(14,axiom,
x3 != x2,
file('SWW413-1.p',unknown),
[] ).
cnf(19,axiom,
~ heap(sep(lseg(x2,nil),emp)),
file('SWW413-1.p',unknown),
[] ).
cnf(22,axiom,
sep(A,sep(B,C)) = sep(B,sep(A,C)),
file('SWW413-1.p',unknown),
[] ).
cnf(25,axiom,
heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))),
file('SWW413-1.p',unknown),
[] ).
cnf(169,plain,
heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))),
inference(para_from,[status(thm),theory(equality)],[22,25]),
[iquote('para_from,22.1.1,25.1.1')] ).
cnf(224,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[169,6]),14,19]),
[iquote('hyper,169,6,unit_del,14,19')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n028.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 : 300
% 0.12/0.34 % DateTime : Wed Jul 27 03:11:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.78/1.96 ----- Otter 3.3f, August 2004 -----
% 1.78/1.96 The process was started by sandbox on n028.cluster.edu,
% 1.78/1.96 Wed Jul 27 03:11:18 2022
% 1.78/1.96 The command was "./otter". The process ID is 22375.
% 1.78/1.96
% 1.78/1.96 set(prolog_style_variables).
% 1.78/1.96 set(auto).
% 1.78/1.96 dependent: set(auto1).
% 1.78/1.96 dependent: set(process_input).
% 1.78/1.96 dependent: clear(print_kept).
% 1.78/1.96 dependent: clear(print_new_demod).
% 1.78/1.96 dependent: clear(print_back_demod).
% 1.78/1.96 dependent: clear(print_back_sub).
% 1.78/1.96 dependent: set(control_memory).
% 1.78/1.96 dependent: assign(max_mem, 12000).
% 1.78/1.96 dependent: assign(pick_given_ratio, 4).
% 1.78/1.96 dependent: assign(stats_level, 1).
% 1.78/1.96 dependent: assign(max_seconds, 10800).
% 1.78/1.96 clear(print_given).
% 1.78/1.96
% 1.78/1.96 list(usable).
% 1.78/1.96 0 [] A=A.
% 1.78/1.96 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 1.78/1.96 0 [] sep(lseg(X,X),Sigma)=Sigma.
% 1.78/1.96 0 [] -heap(sep(next(nil,Y),Sigma)).
% 1.78/1.96 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 1.78/1.96 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 1.78/1.96 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 1.78/1.96 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 1.78/1.96 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 1.78/1.96 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 1.78/1.96 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma))))|heap(sep(lseg(X,Z),sep(next(Z,W),Sigma))).
% 1.78/1.96 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(lseg(Z,W),Sigma))))|Z=W|heap(sep(lseg(X,Z),sep(lseg(Z,W),Sigma))).
% 1.78/1.96 0 [] nil!=x1.
% 1.78/1.96 0 [] nil!=x2.
% 1.78/1.96 0 [] x3!=x2.
% 1.78/1.96 0 [] x4!=x1.
% 1.78/1.96 0 [] x4!=x2.
% 1.78/1.96 0 [] x1!=x2.
% 1.78/1.96 0 [] heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))).
% 1.78/1.96 0 [] -heap(sep(lseg(x2,nil),emp)).
% 1.78/1.96 end_of_list.
% 1.78/1.96
% 1.78/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.78/1.96
% 1.78/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.78/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/1.96 deletion, with positive clauses in sos and nonpositive
% 1.78/1.96 clauses in usable.
% 1.78/1.96
% 1.78/1.96 dependent: set(knuth_bendix).
% 1.78/1.96 dependent: set(anl_eq).
% 1.78/1.96 dependent: set(para_from).
% 1.78/1.96 dependent: set(para_into).
% 1.78/1.96 dependent: clear(para_from_right).
% 1.78/1.96 dependent: clear(para_into_right).
% 1.78/1.96 dependent: set(para_from_vars).
% 1.78/1.96 dependent: set(eq_units_both_ways).
% 1.78/1.96 dependent: set(dynamic_demod_all).
% 1.78/1.96 dependent: set(dynamic_demod).
% 1.78/1.96 dependent: set(order_eq).
% 1.78/1.96 dependent: set(back_demod).
% 1.78/1.96 dependent: set(lrpo).
% 1.78/1.96 dependent: set(hyper_res).
% 1.78/1.96 dependent: set(unit_deletion).
% 1.78/1.96 dependent: set(factor).
% 1.78/1.96
% 1.78/1.96 ------------> process usable:
% 1.78/1.96 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 1.78/1.96 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 1.78/1.96 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 1.78/1.96 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 1.78/1.96 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 1.78/1.96 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 1.78/1.96 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 1.78/1.96 ** KEPT (pick-wt=24): 8 [] -heap(sep(lseg(A,B),sep(lseg(B,C),sep(next(C,D),E))))|heap(sep(lseg(A,C),sep(next(C,D),E))).
% 1.78/1.96 ** KEPT (pick-wt=27): 9 [] -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))).
% 1.78/1.96 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] x1!=nil.
% 1.78/1.96 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x2!=nil.
% 1.78/1.96 ** KEPT (pick-wt=3): 14 [] x3!=x2.
% 1.78/1.96 ** KEPT (pick-wt=3): 15 [] x4!=x1.
% 1.78/1.96 ** KEPT (pick-wt=3): 16 [] x4!=x2.
% 1.78/1.96 ** KEPT (pick-wt=3): 18 [copy,17,flip.1] x2!=x1.
% 1.78/1.96 ** KEPT (pick-wt=6): 19 [] -heap(sep(lseg(x2,nil),emp)).
% 1.78/1.96
% 1.78/1.96 ------------> process sos:
% 1.78/1.96 ** KEPT (pick-wt=3): 21 [] A=A.
% 1.78/1.96 ** KEPT (pick-wt=11): 22 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.78/1.96 ** KEPT (pick-wt=7): 23 [] sep(lseg(A,A),B)=B.
% 1.78/1.96 ---> New Demodulator: 24 [new_demod,23] sep(lseg(A,A),B)=B.
% 1.78/1.96 ** KEPT (pick-wt=10): 25 [] heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))).
% 1.78/1.96 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] A=A.
% 1.78/1.96 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.78/1.96 >>>> Starting back demodulation with 24.
% 1.78/1.96
% 1.78/1.96 ======= end of input processing =======
% 1.78/1.96
% 1.78/1.96 =========== start of search ===========
% 1.78/1.96
% 1.78/1.96 -------- PROOF --------
% 1.78/1.96
% 1.78/1.96 -----> EMPTY CLAUSE at 0.01 sec ----> 224 [hyper,169,6,unit_del,14,19] $F.
% 1.78/1.96
% 1.78/1.96 Length of proof is 1. Level of proof is 1.
% 1.78/1.96
% 1.78/1.96 ---------------- PROOF ----------------
% 1.78/1.96 % SZS status Unsatisfiable
% 1.78/1.96 % SZS output start Refutation
% See solution above
% 1.78/1.96 ------------ end of proof -------------
% 1.78/1.96
% 1.78/1.96
% 1.78/1.96 Search stopped by max_proofs option.
% 1.78/1.96
% 1.78/1.96
% 1.78/1.96 Search stopped by max_proofs option.
% 1.78/1.96
% 1.78/1.96 ============ end of search ============
% 1.78/1.96
% 1.78/1.96 -------------- statistics -------------
% 1.78/1.96 clauses given 8
% 1.78/1.96 clauses generated 277
% 1.78/1.96 clauses kept 219
% 1.78/1.96 clauses forward subsumed 71
% 1.78/1.96 clauses back subsumed 0
% 1.78/1.96 Kbytes malloced 2929
% 1.78/1.96
% 1.78/1.96 ----------- times (seconds) -----------
% 1.78/1.96 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.78/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.96 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.78/1.96
% 1.78/1.96 That finishes the proof of the theorem.
% 1.78/1.96
% 1.78/1.96 Process 22375 finished Wed Jul 27 03:11:20 2022
% 1.78/1.96 Otter interrupted
% 1.78/1.96 PROOF FOUND
%------------------------------------------------------------------------------