TSTP Solution File: SWW438-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWW438-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:33 EDT 2022
% Result : Unknown 26.42s 26.62s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW438-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n013.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:00:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.04/2.21 ----- Otter 3.3f, August 2004 -----
% 2.04/2.21 The process was started by sandbox on n013.cluster.edu,
% 2.04/2.21 Wed Jul 27 03:00:45 2022
% 2.04/2.21 The command was "./otter". The process ID is 24477.
% 2.04/2.21
% 2.04/2.21 set(prolog_style_variables).
% 2.04/2.21 set(auto).
% 2.04/2.21 dependent: set(auto1).
% 2.04/2.21 dependent: set(process_input).
% 2.04/2.21 dependent: clear(print_kept).
% 2.04/2.21 dependent: clear(print_new_demod).
% 2.04/2.21 dependent: clear(print_back_demod).
% 2.04/2.21 dependent: clear(print_back_sub).
% 2.04/2.21 dependent: set(control_memory).
% 2.04/2.21 dependent: assign(max_mem, 12000).
% 2.04/2.21 dependent: assign(pick_given_ratio, 4).
% 2.04/2.21 dependent: assign(stats_level, 1).
% 2.04/2.21 dependent: assign(max_seconds, 10800).
% 2.04/2.21 clear(print_given).
% 2.04/2.21
% 2.04/2.21 list(usable).
% 2.04/2.21 0 [] A=A.
% 2.04/2.21 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 2.04/2.21 0 [] sep(lseg(X,X),Sigma)=Sigma.
% 2.04/2.21 0 [] -heap(sep(next(nil,Y),Sigma)).
% 2.04/2.21 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 2.04/2.21 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 2.04/2.21 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 2.04/2.21 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 2.04/2.21 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 2.04/2.21 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 2.04/2.21 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))).
% 2.04/2.21 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))).
% 2.04/2.21 0 [] x6!=x11.
% 2.04/2.21 0 [] x6!=x7.
% 2.04/2.21 0 [] x3!=x10.
% 2.04/2.21 0 [] x3!=x14.
% 2.04/2.21 0 [] x7!=x15.
% 2.04/2.21 0 [] x9!=x15.
% 2.04/2.21 0 [] x9!=x14.
% 2.04/2.21 0 [] x2!=x16.
% 2.04/2.21 0 [] x2!=x5.
% 2.04/2.21 0 [] x14!=x16.
% 2.04/2.21 0 [] x10!=x11.
% 2.04/2.21 0 [] x13!=x15.
% 2.04/2.21 0 [] x5!=x9.
% 2.04/2.21 0 [] x5!=x16.
% 2.04/2.21 0 [] x5!=x15.
% 2.04/2.21 0 [] heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x3,x14),sep(lseg(x11,x4),sep(lseg(x6,x14),sep(lseg(x6,x16),emp))))))))))))).
% 2.04/2.21 0 [] x1=x1| -heap(emp).
% 2.04/2.21 end_of_list.
% 2.04/2.21
% 2.04/2.21 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.04/2.21
% 2.04/2.21 This ia a non-Horn set with equality. The strategy will be
% 2.04/2.21 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.04/2.21 deletion, with positive clauses in sos and nonpositive
% 2.04/2.21 clauses in usable.
% 2.04/2.21
% 2.04/2.21 dependent: set(knuth_bendix).
% 2.04/2.21 dependent: set(anl_eq).
% 2.04/2.21 dependent: set(para_from).
% 2.04/2.21 dependent: set(para_into).
% 2.04/2.21 dependent: clear(para_from_right).
% 2.04/2.21 dependent: clear(para_into_right).
% 2.04/2.21 dependent: set(para_from_vars).
% 2.04/2.21 dependent: set(eq_units_both_ways).
% 2.04/2.21 dependent: set(dynamic_demod_all).
% 2.04/2.21 dependent: set(dynamic_demod).
% 2.04/2.21 dependent: set(order_eq).
% 2.04/2.21 dependent: set(back_demod).
% 2.04/2.21 dependent: set(lrpo).
% 2.04/2.21 dependent: set(hyper_res).
% 2.04/2.21 dependent: set(unit_deletion).
% 2.04/2.21 dependent: set(factor).
% 2.04/2.21
% 2.04/2.21 ------------> process usable:
% 2.04/2.21 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 2.04/2.21 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 2.04/2.21 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 2.04/2.21 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 2.04/2.21 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 2.04/2.21 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 2.04/2.21 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 2.04/2.21 ** 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))).
% 2.04/2.21 ** 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))).
% 2.04/2.21 ** KEPT (pick-wt=3): 10 [] x6!=x11.
% 2.04/2.21 ** KEPT (pick-wt=3): 12 [copy,11,flip.1] x7!=x6.
% 2.04/2.21 ** KEPT (pick-wt=3): 13 [] x3!=x10.
% 2.04/2.21 ** KEPT (pick-wt=3): 14 [] x3!=x14.
% 2.04/2.21 ** KEPT (pick-wt=3): 15 [] x7!=x15.
% 2.04/2.21 ** KEPT (pick-wt=3): 16 [] x9!=x15.
% 2.04/2.21 ** KEPT (pick-wt=3): 17 [] x9!=x14.
% 2.04/2.21 ** KEPT (pick-wt=3): 18 [] x2!=x16.
% 2.04/2.21 ** KEPT (pick-wt=3): 20 [copy,19,flip.1] x5!=x2.
% 2.04/2.21 ** KEPT (pick-wt=3): 22 [copy,21,flip.1] x16!=x14.
% 2.04/2.21 ** KEPT (pick-wt=3): 24 [copy,23,flip.1] x11!=x10.
% 2.04/2.21 ** KEPT (pick-wt=3): 26 [copy,25,flip.1] x15!=x13.
% 2.04/2.21 ** KEPT (pick-wt=3): 28 [copy,27,flip.1] x9!=x5.
% 2.04/2.21 ** KEPT (pick-wt=3): 29 [] x5!=x16.
% 2.04/2.21 ** KEPT (pick-wt=3): 30 [] x5!=x15.
% 2.04/2.21 ** KEPT (pick-wt=5): 31 [] x1=x1| -heap(emp).
% 2.04/2.21
% 2.04/2.21 ------------> process sos:
% 2.04/2.21 ** KEPT (pick-wt=3): 33 [] A=A.
% 26.42/26.62 ** KEPT (pick-wt=11): 34 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 26.42/26.62 ** KEPT (pick-wt=7): 35 [] sep(lseg(A,A),B)=B.
% 26.42/26.62 ---> New Demodulator: 36 [new_demod,35] sep(lseg(A,A),B)=B.
% 26.42/26.62 ** KEPT (pick-wt=50): 37 [] heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x3,x14),sep(lseg(x11,x4),sep(lseg(x6,x14),sep(lseg(x6,x16),emp))))))))))))).
% 26.42/26.62 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] A=A.
% 26.42/26.62 33 back subsumes 31.
% 26.42/26.62 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 26.42/26.62 >>>> Starting back demodulation with 36.
% 26.42/26.62
% 26.42/26.62 ======= end of input processing =======
% 26.42/26.62
% 26.42/26.62 =========== start of search ===========
% 26.42/26.62
% 26.42/26.62
% 26.42/26.62 Resetting weight limit to 15.
% 26.42/26.62
% 26.42/26.62
% 26.42/26.62 Resetting weight limit to 15.
% 26.42/26.62
% 26.42/26.62 sos_size=462
% 26.42/26.62
% 26.42/26.62
% 26.42/26.62 Resetting weight limit to 12.
% 26.42/26.62
% 26.42/26.62
% 26.42/26.62 Resetting weight limit to 12.
% 26.42/26.62
% 26.42/26.62 sos_size=504
% 26.42/26.62
% 26.42/26.62 Search stopped because sos empty.
% 26.42/26.62
% 26.42/26.62
% 26.42/26.62 Search stopped because sos empty.
% 26.42/26.62
% 26.42/26.62 ============ end of search ============
% 26.42/26.62
% 26.42/26.62 -------------- statistics -------------
% 26.42/26.62 clauses given 576
% 26.42/26.62 clauses generated 1280872
% 26.42/26.62 clauses kept 602
% 26.42/26.62 clauses forward subsumed 899
% 26.42/26.62 clauses back subsumed 1
% 26.42/26.62 Kbytes malloced 10742
% 26.42/26.62
% 26.42/26.62 ----------- times (seconds) -----------
% 26.42/26.62 user CPU time 24.39 (0 hr, 0 min, 24 sec)
% 26.42/26.62 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 26.42/26.62 wall-clock time 26 (0 hr, 0 min, 26 sec)
% 26.42/26.62
% 26.42/26.62 Process 24477 finished Wed Jul 27 03:01:11 2022
% 26.42/26.62 Otter interrupted
% 26.42/26.62 PROOF NOT FOUND
%------------------------------------------------------------------------------