TSTP Solution File: PUZ133+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:11:40 EDT 2022
% Result : Unknown 26.83s 26.98s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n006.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 : 300
% 0.13/0.34 % DateTime : Wed Jul 27 01:47:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.05/2.23 ----- Otter 3.3f, August 2004 -----
% 2.05/2.23 The process was started by sandbox on n006.cluster.edu,
% 2.05/2.23 Wed Jul 27 01:47:02 2022
% 2.05/2.23 The command was "./otter". The process ID is 17931.
% 2.05/2.23
% 2.05/2.23 set(prolog_style_variables).
% 2.05/2.23 set(auto).
% 2.05/2.23 dependent: set(auto1).
% 2.05/2.23 dependent: set(process_input).
% 2.05/2.23 dependent: clear(print_kept).
% 2.05/2.23 dependent: clear(print_new_demod).
% 2.05/2.23 dependent: clear(print_back_demod).
% 2.05/2.23 dependent: clear(print_back_sub).
% 2.05/2.23 dependent: set(control_memory).
% 2.05/2.23 dependent: assign(max_mem, 12000).
% 2.05/2.23 dependent: assign(pick_given_ratio, 4).
% 2.05/2.23 dependent: assign(stats_level, 1).
% 2.05/2.23 dependent: assign(max_seconds, 10800).
% 2.05/2.23 clear(print_given).
% 2.05/2.23
% 2.05/2.23 formula_list(usable).
% 2.05/2.23 all A (A=A).
% 2.05/2.23 queens_p-> (all I J (le(s(n0),I)&le(I,n)&le(s(I),J)&le(J,n)->p(I)!=p(J)&plus(p(I),I)!=plus(p(J),J)&minus(p(I),I)!=minus(p(J),J))).
% 2.05/2.23 all I (perm(I)=minus(s(n),I)).
% 2.05/2.23 (all I J (le(s(n0),I)&le(I,n)&le(s(I),J)&le(J,n)& (le(s(I),J)<->le(s(perm(J)),perm(I)))->q(I)!=q(J)&plus(q(I),I)!=plus(q(J),J)&minus(q(I),I)!=minus(q(J),J)))->queens_q.
% 2.05/2.23 -(queens_p& (all I (q(I)=p(perm(I))))->queens_q).
% 2.05/2.23 all I (le(s(n0),I)&le(I,n)->le(s(n0),perm(I))&le(perm(I),n)).
% 2.05/2.23 all J I (minus(I,J)=minus(perm(J),perm(I))).
% 2.05/2.23 all X Y Z (le(X,Y)&le(Y,Z)->le(X,Z)).
% 2.05/2.23 all X le(X,s(X)).
% 2.05/2.23 all I J K L (plus(I,J)=plus(K,L)<->minus(I,K)=minus(L,J)).
% 2.05/2.23 all I J K L (minus(I,J)=minus(K,L)<->minus(I,K)=minus(J,L)).
% 2.05/2.23 end_of_list.
% 2.05/2.23
% 2.05/2.23 -------> usable clausifies to:
% 2.05/2.23
% 2.05/2.23 list(usable).
% 2.05/2.23 0 [] A=A.
% 2.05/2.23 0 [] -queens_p| -le(s(n0),I)| -le(I,n)| -le(s(I),J)| -le(J,n)|p(I)!=p(J).
% 2.05/2.23 0 [] -queens_p| -le(s(n0),I)| -le(I,n)| -le(s(I),J)| -le(J,n)|plus(p(I),I)!=plus(p(J),J).
% 2.05/2.23 0 [] -queens_p| -le(s(n0),I)| -le(I,n)| -le(s(I),J)| -le(J,n)|minus(p(I),I)!=minus(p(J),J).
% 2.05/2.23 0 [] perm(I)=minus(s(n),I).
% 2.05/2.23 0 [] le(s(n0),$c2)|queens_q.
% 2.05/2.23 0 [] le($c2,n)|queens_q.
% 2.05/2.23 0 [] le(s($c2),$c1)|queens_q.
% 2.05/2.23 0 [] le($c1,n)|queens_q.
% 2.05/2.23 0 [] -le(s($c2),$c1)|le(s(perm($c1)),perm($c2))|queens_q.
% 2.05/2.23 0 [] q($c2)=q($c1)|plus(q($c2),$c2)=plus(q($c1),$c1)|minus(q($c2),$c2)=minus(q($c1),$c1)|queens_q.
% 2.05/2.23 0 [] queens_p.
% 2.05/2.23 0 [] q(I)=p(perm(I)).
% 2.05/2.23 0 [] -queens_q.
% 2.05/2.23 0 [] -le(s(n0),I)| -le(I,n)|le(s(n0),perm(I)).
% 2.05/2.23 0 [] -le(s(n0),I)| -le(I,n)|le(perm(I),n).
% 2.05/2.23 0 [] minus(I,J)=minus(perm(J),perm(I)).
% 2.05/2.23 0 [] -le(X,Y)| -le(Y,Z)|le(X,Z).
% 2.05/2.23 0 [] le(X,s(X)).
% 2.05/2.23 0 [] plus(I,J)!=plus(K,L)|minus(I,K)=minus(L,J).
% 2.05/2.23 0 [] plus(I,J)=plus(K,L)|minus(I,K)!=minus(L,J).
% 2.05/2.23 0 [] minus(I,J)!=minus(K,L)|minus(I,K)=minus(J,L).
% 2.05/2.23 0 [] minus(I,J)=minus(K,L)|minus(I,K)!=minus(J,L).
% 2.05/2.23 end_of_list.
% 2.05/2.23
% 2.05/2.23 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.05/2.23
% 2.05/2.23 This ia a non-Horn set with equality. The strategy will be
% 2.05/2.23 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.05/2.23 deletion, with positive clauses in sos and nonpositive
% 2.05/2.23 clauses in usable.
% 2.05/2.23
% 2.05/2.23 dependent: set(knuth_bendix).
% 2.05/2.23 dependent: set(anl_eq).
% 2.05/2.23 dependent: set(para_from).
% 2.05/2.23 dependent: set(para_into).
% 2.05/2.23 dependent: clear(para_from_right).
% 2.05/2.23 dependent: clear(para_into_right).
% 2.05/2.23 dependent: set(para_from_vars).
% 2.05/2.23 dependent: set(eq_units_both_ways).
% 2.05/2.23 dependent: set(dynamic_demod_all).
% 2.05/2.23 dependent: set(dynamic_demod).
% 2.05/2.23 dependent: set(order_eq).
% 2.05/2.23 dependent: set(back_demod).
% 2.05/2.23 dependent: set(lrpo).
% 2.05/2.23 dependent: set(hyper_res).
% 2.05/2.23 dependent: set(unit_deletion).
% 2.05/2.23 dependent: set(factor).
% 2.05/2.23
% 2.05/2.23 ------------> process usable:
% 2.05/2.23 ** KEPT (pick-wt=20): 1 [] -queens_p| -le(s(n0),A)| -le(A,n)| -le(s(A),B)| -le(B,n)|p(A)!=p(B).
% 2.05/2.23 ** KEPT (pick-wt=24): 2 [] -queens_p| -le(s(n0),A)| -le(A,n)| -le(s(A),B)| -le(B,n)|plus(p(A),A)!=plus(p(B),B).
% 2.05/2.23 ** KEPT (pick-wt=24): 3 [] -queens_p| -le(s(n0),A)| -le(A,n)| -le(s(A),B)| -le(B,n)|minus(p(A),A)!=minus(p(B),B).
% 2.05/2.23 ** KEPT (pick-wt=11): 4 [] -le(s($c2),$c1)|le(s(perm($c1)),perm($c2))|queens_q.
% 2.05/2.23 ** KEPT (pick-wt=1): 5 [] -queens_q.
% 2.05/2.23 ** KEPT (pick-wt=12): 6 [] -le(s(n0),A)| -le(A,n)|le(s(n0),perm(A)).
% 2.05/2.23 ** KEPT (pick-wt=11): 7 [] -le(s(n0),A)| -le(A,n)|le(perm(A),n).
% 2.05/2.23 ** KEPT (pick-wt=9): 8 [] -le(A,B)| -le(B,C)|le(A,C).
% 2.05/2.23 ** KEPT (pick-wt=14): 9 [] plus(A,B)!=plus(C,D)|minus(A,C)=minus(D,B).
% 2.05/2.23 ** KEPT (pick-wt=14): 10 [] plus(A,B)=plus(C,D)|minus(A,C)!=minus(D,B).
% 2.05/2.23 ** KEPT (pick-wt=14): 11 [] minus(A,B)!=minus(C,D)|minus(A,C)=minus(B,D).
% 2.05/2.23 Following clause subsumed by 11 during input processing: 0 [] minus(A,B)=minus(C,D)|minus(A,C)!=minus(B,D).
% 26.83/26.98
% 26.83/26.98 ------------> process sos:
% 26.83/26.98 ** KEPT (pick-wt=3): 21 [] A=A.
% 26.83/26.98 ** KEPT (pick-wt=7): 22 [] perm(A)=minus(s(n),A).
% 26.83/26.98 ** KEPT (pick-wt=4): 24 [copy,23,unit_del,5] le(s(n0),$c2).
% 26.83/26.98 ** KEPT (pick-wt=3): 26 [copy,25,unit_del,5] le($c2,n).
% 26.83/26.98 ** KEPT (pick-wt=4): 28 [copy,27,unit_del,5] le(s($c2),$c1).
% 26.83/26.98 ** KEPT (pick-wt=3): 30 [copy,29,unit_del,5] le($c1,n).
% 26.83/26.98 ** KEPT (pick-wt=23): 32 [copy,31,unit_del,5] q($c2)=q($c1)|plus(q($c2),$c2)=plus(q($c1),$c1)|minus(q($c2),$c2)=minus(q($c1),$c1).
% 26.83/26.98 ** KEPT (pick-wt=1): 33 [] queens_p.
% 26.83/26.98 ** KEPT (pick-wt=6): 34 [] q(A)=p(perm(A)).
% 26.83/26.98 ---> New Demodulator: 35 [new_demod,34] q(A)=p(perm(A)).
% 26.83/26.98 ** KEPT (pick-wt=9): 36 [] minus(A,B)=minus(perm(B),perm(A)).
% 26.83/26.98 ** KEPT (pick-wt=4): 37 [] le(A,s(A)).
% 26.83/26.98 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] A=A.
% 26.83/26.98 ** KEPT (pick-wt=7): 38 [copy,22,flip.1] minus(s(n),A)=perm(A).
% 26.83/26.98 >>>> Starting back demodulation with 35.
% 26.83/26.98 >> back demodulating 32 with 35.
% 26.83/26.98 ** KEPT (pick-wt=9): 40 [copy,36,flip.1] minus(perm(A),perm(B))=minus(B,A).
% 26.83/26.98 Following clause subsumed by 22 during input processing: 0 [copy,38,flip.1] perm(A)=minus(s(n),A).
% 26.83/26.98 Following clause subsumed by 36 during input processing: 0 [copy,40,flip.1] minus(A,B)=minus(perm(B),perm(A)).
% 26.83/26.98
% 26.83/26.98 ======= end of input processing =======
% 26.83/26.98
% 26.83/26.98 =========== start of search ===========
% 26.83/26.98
% 26.83/26.98
% 26.83/26.98 Resetting weight limit to 8.
% 26.83/26.98
% 26.83/26.98
% 26.83/26.98 Resetting weight limit to 8.
% 26.83/26.98
% 26.83/26.98 sos_size=1395
% 26.83/26.98
% 26.83/26.98 Search stopped because sos empty.
% 26.83/26.98
% 26.83/26.98
% 26.83/26.98 Search stopped because sos empty.
% 26.83/26.98
% 26.83/26.98 ============ end of search ============
% 26.83/26.98
% 26.83/26.98 -------------- statistics -------------
% 26.83/26.98 clauses given 1613
% 26.83/26.98 clauses generated 1142248
% 26.83/26.98 clauses kept 1663
% 26.83/26.98 clauses forward subsumed 9885
% 26.83/26.98 clauses back subsumed 13
% 26.83/26.98 Kbytes malloced 5859
% 26.83/26.98
% 26.83/26.98 ----------- times (seconds) -----------
% 26.83/26.98 user CPU time 24.75 (0 hr, 0 min, 24 sec)
% 26.83/26.98 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 26.83/26.98 wall-clock time 26 (0 hr, 0 min, 26 sec)
% 26.83/26.98
% 26.83/26.98 Process 17931 finished Wed Jul 27 01:47:28 2022
% 26.83/26.98 Otter interrupted
% 26.83/26.98 PROOF NOT FOUND
%------------------------------------------------------------------------------