TSTP Solution File: PUZ016-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 : Mon Jul 18 18:26:58 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat May 28 22:51:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.14/0.36 Sat May 28 22:51:57 2022
% 0.14/0.36 The command was "./sos". The process ID is 13555.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 Failed to model usable list: disabling FINDER
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 -------------- Softie stats --------------
% 0.14/0.38
% 0.14/0.38 UPDATE_STOP: 300
% 0.14/0.38 SFINDER_TIME_LIMIT: 2
% 0.14/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38 number of clauses in intial UL: 9
% 0.14/0.38 number of clauses initially in problem: 33
% 0.14/0.38 percentage of clauses intially in UL: 27
% 0.14/0.38 percentage of distinct symbols occuring in initial UL: 44
% 0.14/0.38 percent of all initial clauses that are short: 100
% 0.14/0.38 absolute distinct symbol count: 18
% 0.14/0.38 distinct predicate count: 2
% 0.14/0.38 distinct function count: 4
% 0.14/0.38 distinct constant count: 12
% 0.14/0.38
% 0.14/0.38 ---------- no more Softie stats ----------
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 ----> UNIT CONFLICT at 0.06 sec ----> 686 [binary,685.1,9.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 12. Level of proof is 8.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 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)).
% 0.20/0.42 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))).
% 0.20/0.42 9 [] {+} -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 11,10 [] {-} successor(n1)=n2.
% 0.20/0.42 13,12 [] {-} successor(n2)=n3.
% 0.20/0.42 15,14 [] {-} successor(n3)=n4.
% 0.20/0.42 16 [] {-} successor(n4)=n5.
% 0.20/0.42 18 [] {-} successor(n5)=n6.
% 0.20/0.42 21,20 [] {-} successor(n6)=n7.
% 0.20/0.42 23,22 [] {-} successor(n7)=n8.
% 0.20/0.42 27,26 [] {-} complement(covered)=not_covered.
% 0.20/0.42 29,28 [] {-} complement(not_covered)=covered.
% 0.20/0.42 31,30 [] {-} complement(removed)=not_covered.
% 0.20/0.42 32 [] {-} achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 0.20/0.42 37 [para_from,16.1.1,8.2.1.1] {-} -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))).
% 0.20/0.42 38 [para_from,18.1.1,8.2.1.1] {-} -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))).
% 0.20/0.42 46 [para_from,26.1.1,8.2.2.4] {-} -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))).
% 0.20/0.42 54 [para_from,28.1.1,8.2.2.4] {-} -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))).
% 0.20/0.42 66 [hyper,32,8,demod,11,29,31,31,29,29,29,29,29] {-} achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 71 [hyper,66,8,demod,13,27,29,29,27,27,27,27,27] {-} achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 0.20/0.42 104 [hyper,71,8,demod,15,29,27,27,29,29,29,29,29] {-} achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 190 [hyper,104,37,demod,27,29,29,27,27,27,27,27] {-} achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 0.20/0.42 285 [hyper,190,38,demod,29,27,27,29,29,29,29,29] {-} achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 438 [hyper,285,46,demod,21,27,29,29,27,27,27,27] {-} achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 0.20/0.42 584 [hyper,438,54,demod,23,29,27,27,29,29,29,29] {-} achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 685 [hyper,584,2] {-} achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 0.20/0.42 686 [binary,685.1,9.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 13555 finished Sat May 28 22:51:57 2022
%------------------------------------------------------------------------------