TSTP Solution File: PUZ016-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:13 EDT 2022
% Result : Unsatisfiable 1.86s 2.06s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 27 ( 21 unt; 0 nHn; 27 RR)
% Number of literals : 33 ( 10 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-8 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G))
| achievable(row(A),squares(B,covered,covered,C,D,E,F,G)) ),
file('PUZ016-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ achievable(row(A),squares(B,C,D,E,F,G,H,I))
| achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))) ),
file('PUZ016-1.p',unknown),
[] ).
cnf(9,axiom,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('PUZ016-1.p',unknown),
[] ).
cnf(12,axiom,
successor(n1) = n2,
file('PUZ016-1.p',unknown),
[] ).
cnf(14,axiom,
successor(n2) = n3,
file('PUZ016-1.p',unknown),
[] ).
cnf(16,axiom,
successor(n3) = n4,
file('PUZ016-1.p',unknown),
[] ).
cnf(17,axiom,
successor(n4) = n5,
file('PUZ016-1.p',unknown),
[] ).
cnf(19,axiom,
successor(n5) = n6,
file('PUZ016-1.p',unknown),
[] ).
cnf(22,axiom,
successor(n6) = n7,
file('PUZ016-1.p',unknown),
[] ).
cnf(24,axiom,
successor(n7) = n8,
file('PUZ016-1.p',unknown),
[] ).
cnf(28,axiom,
complement(covered) = not_covered,
file('PUZ016-1.p',unknown),
[] ).
cnf(30,axiom,
complement(not_covered) = covered,
file('PUZ016-1.p',unknown),
[] ).
cnf(32,axiom,
complement(removed) = not_covered,
file('PUZ016-1.p',unknown),
[] ).
cnf(33,axiom,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('PUZ016-1.p',unknown),
[] ).
cnf(37,plain,
( ~ achievable(row(n4),squares(A,B,C,D,E,F,G,H))
| achievable(row(n5),squares(complement(A),complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H))) ),
inference(para_from,[status(thm),theory(equality)],[17,8]),
[iquote('para_from,17.1.1,8.2.1.1')] ).
cnf(38,plain,
( ~ achievable(row(n5),squares(A,B,C,D,E,F,G,H))
| achievable(row(n6),squares(complement(A),complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H))) ),
inference(para_from,[status(thm),theory(equality)],[19,8]),
[iquote('para_from,19.1.1,8.2.1.1')] ).
cnf(46,plain,
( ~ achievable(row(A),squares(B,C,D,covered,E,F,G,H))
| achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),not_covered,complement(E),complement(F),complement(G),complement(H))) ),
inference(para_from,[status(thm),theory(equality)],[28,8]),
[iquote('para_from,27.1.1,8.2.2.4')] ).
cnf(54,plain,
( ~ achievable(row(A),squares(B,C,D,not_covered,E,F,G,H))
| achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),covered,complement(E),complement(F),complement(G),complement(H))) ),
inference(para_from,[status(thm),theory(equality)],[30,8]),
[iquote('para_from,29.1.1,8.2.2.4')] ).
cnf(66,plain,
achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[33,8]),12,30,32,32,30,30,30,30,30]),
[iquote('hyper,33,8,demod,12,30,32,32,30,30,30,30,30')] ).
cnf(71,plain,
achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[66,8]),14,28,30,30,28,28,28,28,28]),
[iquote('hyper,66,8,demod,14,28,30,30,28,28,28,28,28')] ).
cnf(104,plain,
achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[71,8]),16,30,28,28,30,30,30,30,30]),
[iquote('hyper,71,8,demod,16,30,28,28,30,30,30,30,30')] ).
cnf(190,plain,
achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[104,37]),28,30,30,28,28,28,28,28]),
[iquote('hyper,104,37,demod,28,30,30,28,28,28,28,28')] ).
cnf(285,plain,
achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[190,38]),30,28,28,30,30,30,30,30]),
[iquote('hyper,190,38,demod,30,28,28,30,30,30,30,30')] ).
cnf(438,plain,
achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[285,46]),22,28,30,30,28,28,28,28]),
[iquote('hyper,285,46,demod,22,28,30,30,28,28,28,28')] ).
cnf(584,plain,
achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[438,54]),24,30,28,28,30,30,30,30]),
[iquote('hyper,438,54,demod,24,30,28,28,30,30,30,30')] ).
cnf(685,plain,
achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(hyper,[status(thm)],[584,2]),
[iquote('hyper,584,2')] ).
cnf(686,plain,
$false,
inference(binary,[status(thm)],[685,9]),
[iquote('binary,685.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 02:09:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.78/2.01 ----- Otter 3.3f, August 2004 -----
% 1.78/2.01 The process was started by sandbox on n016.cluster.edu,
% 1.78/2.01 Wed Jul 27 02:09:52 2022
% 1.78/2.01 The command was "./otter". The process ID is 22720.
% 1.78/2.01
% 1.78/2.01 set(prolog_style_variables).
% 1.78/2.01 set(auto).
% 1.78/2.01 dependent: set(auto1).
% 1.78/2.01 dependent: set(process_input).
% 1.78/2.01 dependent: clear(print_kept).
% 1.78/2.01 dependent: clear(print_new_demod).
% 1.78/2.01 dependent: clear(print_back_demod).
% 1.78/2.01 dependent: clear(print_back_sub).
% 1.78/2.01 dependent: set(control_memory).
% 1.78/2.01 dependent: assign(max_mem, 12000).
% 1.78/2.01 dependent: assign(pick_given_ratio, 4).
% 1.78/2.01 dependent: assign(stats_level, 1).
% 1.78/2.01 dependent: assign(max_seconds, 10800).
% 1.78/2.01 clear(print_given).
% 1.78/2.01
% 1.78/2.01 list(usable).
% 1.78/2.01 0 [] A=A.
% 1.78/2.01 0 [] -achievable(row(X),squares(not_covered,not_covered,Y3,Y4,Y5,Y6,Y7,Y8))|achievable(row(X),squares(covered,covered,Y3,Y4,Y5,Y6,Y7,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,not_covered,not_covered,Y4,Y5,Y6,Y7,Y8))|achievable(row(X),squares(Y1,covered,covered,Y4,Y5,Y6,Y7,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,not_covered,not_covered,Y5,Y6,Y7,Y8))|achievable(row(X),squares(Y1,Y2,covered,covered,Y5,Y6,Y7,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,Y3,not_covered,not_covered,Y6,Y7,Y8))|achievable(row(X),squares(Y1,Y2,Y3,covered,covered,Y6,Y7,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,not_covered,not_covered,Y7,Y8))|achievable(row(X),squares(Y1,Y2,Y3,Y4,covered,covered,Y7,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,not_covered,not_covered,Y8))|achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,covered,covered,Y8)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,not_covered,not_covered))|achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,covered,covered)).
% 1.78/2.01 0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8))|achievable(row(successor(X)),squares(complement(Y1),complement(Y2),complement(Y3),complement(Y4),complement(Y5),complement(Y6),complement(Y7),complement(Y8))).
% 1.78/2.01 0 [] successor(n1)=n2.
% 1.78/2.01 0 [] successor(n2)=n3.
% 1.78/2.01 0 [] successor(n3)=n4.
% 1.78/2.01 0 [] successor(n4)=n5.
% 1.78/2.01 0 [] successor(n5)=n6.
% 1.78/2.01 0 [] successor(n6)=n7.
% 1.78/2.01 0 [] successor(n7)=n8.
% 1.78/2.01 0 [] successor(n8)=n9.
% 1.78/2.01 0 [] complement(covered)=not_covered.
% 1.78/2.01 0 [] complement(not_covered)=covered.
% 1.78/2.01 0 [] complement(removed)=not_covered.
% 1.78/2.01 0 [] achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 1.78/2.01 0 [] -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 1.78/2.01 end_of_list.
% 1.78/2.01
% 1.78/2.01 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.78/2.01
% 1.78/2.01 This is a Horn set with equality. The strategy will be
% 1.78/2.01 Knuth-Bendix and hyper_res, with positive clauses in
% 1.78/2.01 sos and nonpositive clauses in usable.
% 1.78/2.01
% 1.78/2.01 dependent: set(knuth_bendix).
% 1.78/2.01 dependent: set(anl_eq).
% 1.78/2.01 dependent: set(para_from).
% 1.78/2.01 dependent: set(para_into).
% 1.78/2.01 dependent: clear(para_from_right).
% 1.78/2.01 dependent: clear(para_into_right).
% 1.78/2.01 dependent: set(para_from_vars).
% 1.78/2.01 dependent: set(eq_units_both_ways).
% 1.78/2.01 dependent: set(dynamic_demod_all).
% 1.78/2.01 dependent: set(dynamic_demod).
% 1.78/2.01 dependent: set(order_eq).
% 1.78/2.01 dependent: set(back_demod).
% 1.78/2.01 dependent: set(lrpo).
% 1.78/2.01 dependent: set(hyper_res).
% 1.78/2.01 dependent: clear(order_hyper).
% 1.78/2.01
% 1.78/2.01 ------------> process usable:
% 1.78/2.01 ** KEPT (pick-wt=24): 1 [] -achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G))|achievable(row(A),squares(covered,covered,B,C,D,E,F,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 2 [] -achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G))|achievable(row(A),squares(B,covered,covered,C,D,E,F,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 3 [] -achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G))|achievable(row(A),squares(B,C,covered,covered,D,E,F,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 4 [] -achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G))|achievable(row(A),squares(B,C,D,covered,covered,E,F,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 5 [] -achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G))|achievable(row(A),squares(B,C,D,E,covered,covered,F,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 6 [] -achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G))|achievable(row(A),squares(B,C,D,E,F,covered,covered,G)).
% 1.78/2.01 ** KEPT (pick-wt=24): 7 [] -achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered))|achievable(row(A),squares(B,C,D,E,F,G,covered,covered)).
% 1.86/2.06 ** KEPT (pick-wt=33): 8 [] -achievable(row(A),squares(B,C,D,E,F,G,H,I))|achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))).
% 1.86/2.06 ** KEPT (pick-wt=12): 9 [] -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 1.86/2.06
% 1.86/2.06 ------------> process sos:
% 1.86/2.06 ** KEPT (pick-wt=3): 10 [] A=A.
% 1.86/2.06 ** KEPT (pick-wt=4): 11 [] successor(n1)=n2.
% 1.86/2.06 ---> New Demodulator: 12 [new_demod,11] successor(n1)=n2.
% 1.86/2.06 ** KEPT (pick-wt=4): 13 [] successor(n2)=n3.
% 1.86/2.06 ---> New Demodulator: 14 [new_demod,13] successor(n2)=n3.
% 1.86/2.06 ** KEPT (pick-wt=4): 15 [] successor(n3)=n4.
% 1.86/2.06 ---> New Demodulator: 16 [new_demod,15] successor(n3)=n4.
% 1.86/2.06 ** KEPT (pick-wt=4): 17 [] successor(n4)=n5.
% 1.86/2.06 ---> New Demodulator: 18 [new_demod,17] successor(n4)=n5.
% 1.86/2.06 ** KEPT (pick-wt=4): 19 [] successor(n5)=n6.
% 1.86/2.06 ---> New Demodulator: 20 [new_demod,19] successor(n5)=n6.
% 1.86/2.06 ** KEPT (pick-wt=4): 21 [] successor(n6)=n7.
% 1.86/2.06 ---> New Demodulator: 22 [new_demod,21] successor(n6)=n7.
% 1.86/2.06 ** KEPT (pick-wt=4): 23 [] successor(n7)=n8.
% 1.86/2.06 ---> New Demodulator: 24 [new_demod,23] successor(n7)=n8.
% 1.86/2.06 ** KEPT (pick-wt=4): 25 [] successor(n8)=n9.
% 1.86/2.06 ---> New Demodulator: 26 [new_demod,25] successor(n8)=n9.
% 1.86/2.06 ** KEPT (pick-wt=4): 27 [] complement(covered)=not_covered.
% 1.86/2.06 ---> New Demodulator: 28 [new_demod,27] complement(covered)=not_covered.
% 1.86/2.06 ** KEPT (pick-wt=4): 29 [] complement(not_covered)=covered.
% 1.86/2.06 ---> New Demodulator: 30 [new_demod,29] complement(not_covered)=covered.
% 1.86/2.06 ** KEPT (pick-wt=4): 31 [] complement(removed)=not_covered.
% 1.86/2.06 ---> New Demodulator: 32 [new_demod,31] complement(removed)=not_covered.
% 1.86/2.06 ** KEPT (pick-wt=12): 33 [] achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 1.86/2.06 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 1.86/2.06 >>>> Starting back demodulation with 12.
% 1.86/2.06 >>>> Starting back demodulation with 14.
% 1.86/2.06 >>>> Starting back demodulation with 16.
% 1.86/2.06 >>>> Starting back demodulation with 18.
% 1.86/2.06 >>>> Starting back demodulation with 20.
% 1.86/2.06 >>>> Starting back demodulation with 22.
% 1.86/2.06 >>>> Starting back demodulation with 24.
% 1.86/2.06 >>>> Starting back demodulation with 26.
% 1.86/2.06 >>>> Starting back demodulation with 28.
% 1.86/2.06 >>>> Starting back demodulation with 30.
% 1.86/2.06 >>>> Starting back demodulation with 32.
% 1.86/2.06
% 1.86/2.06 ======= end of input processing =======
% 1.86/2.06
% 1.86/2.06 =========== start of search ===========
% 1.86/2.06
% 1.86/2.06 -------- PROOF --------
% 1.86/2.06
% 1.86/2.06 ----> UNIT CONFLICT at 0.05 sec ----> 686 [binary,685.1,9.1] $F.
% 1.86/2.06
% 1.86/2.06 Length of proof is 12. Level of proof is 8.
% 1.86/2.06
% 1.86/2.06 ---------------- PROOF ----------------
% 1.86/2.06 % SZS status Unsatisfiable
% 1.86/2.06 % SZS output start Refutation
% See solution above
% 1.86/2.06 ------------ end of proof -------------
% 1.86/2.06
% 1.86/2.06
% 1.86/2.06 Search stopped by max_proofs option.
% 1.86/2.06
% 1.86/2.06
% 1.86/2.06 Search stopped by max_proofs option.
% 1.86/2.06
% 1.86/2.06 ============ end of search ============
% 1.86/2.06
% 1.86/2.06 -------------- statistics -------------
% 1.86/2.06 clauses given 172
% 1.86/2.06 clauses generated 2483
% 1.86/2.06 clauses kept 674
% 1.86/2.06 clauses forward subsumed 1832
% 1.86/2.06 clauses back subsumed 0
% 1.86/2.06 Kbytes malloced 1953
% 1.86/2.06
% 1.86/2.06 ----------- times (seconds) -----------
% 1.86/2.06 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.86/2.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.06 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.86/2.06
% 1.86/2.06 That finishes the proof of the theorem.
% 1.86/2.06
% 1.86/2.06 Process 22720 finished Wed Jul 27 02:09:53 2022
% 1.86/2.06 Otter interrupted
% 1.86/2.06 PROOF FOUND
%------------------------------------------------------------------------------