TSTP Solution File: PUZ016-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:23:50 EDT 2022
% Result : Unsatisfiable 0.68s 1.01s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat May 28 22:42:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/1.01 ============================== Prover9 ===============================
% 0.68/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.68/1.01 Process 2600 was started by sandbox on n026.cluster.edu,
% 0.68/1.01 Sat May 28 22:42:39 2022
% 0.68/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2447_n026.cluster.edu".
% 0.68/1.01 ============================== end of head ===========================
% 0.68/1.01
% 0.68/1.01 ============================== INPUT =================================
% 0.68/1.01
% 0.68/1.01 % Reading from file /tmp/Prover9_2447_n026.cluster.edu
% 0.68/1.01
% 0.68/1.01 set(prolog_style_variables).
% 0.68/1.01 set(auto2).
% 0.68/1.01 % set(auto2) -> set(auto).
% 0.68/1.01 % set(auto) -> set(auto_inference).
% 0.68/1.01 % set(auto) -> set(auto_setup).
% 0.68/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.68/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/1.01 % set(auto) -> set(auto_limits).
% 0.68/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/1.01 % set(auto) -> set(auto_denials).
% 0.68/1.01 % set(auto) -> set(auto_process).
% 0.68/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.68/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.68/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.68/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.68/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.68/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.68/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.68/1.01 % set(auto2) -> assign(stats, some).
% 0.68/1.01 % set(auto2) -> clear(echo_input).
% 0.68/1.01 % set(auto2) -> set(quiet).
% 0.68/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.68/1.01 % set(auto2) -> clear(print_given).
% 0.68/1.01 assign(lrs_ticks,-1).
% 0.68/1.01 assign(sos_limit,10000).
% 0.68/1.01 assign(order,kbo).
% 0.68/1.01 set(lex_order_vars).
% 0.68/1.01 clear(print_given).
% 0.68/1.01
% 0.68/1.01 % formulas(sos). % not echoed (21 formulas)
% 0.68/1.01
% 0.68/1.01 ============================== end of input ==========================
% 0.68/1.01
% 0.68/1.01 % From the command line: assign(max_seconds, 300).
% 0.68/1.01
% 0.68/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/1.01
% 0.68/1.01 % Formulas that are not ordinary clauses:
% 0.68/1.01
% 0.68/1.01 ============================== end of process non-clausal formulas ===
% 0.68/1.01
% 0.68/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/1.01
% 0.68/1.01 ============================== PREDICATE ELIMINATION =================
% 0.68/1.01
% 0.68/1.01 ============================== end predicate elimination =============
% 0.68/1.01
% 0.68/1.01 Auto_denials:
% 0.68/1.01 % copying label prove_row_8_can_be_covered to answer in negative clause
% 0.68/1.01
% 0.68/1.01 Term ordering decisions:
% 0.68/1.01 Function symbol KB weights: not_covered=1. covered=1. removed=1. n1=1. n2=1. n3=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. row=1. complement=1. successor=1. squares=1.
% 0.68/1.01
% 0.68/1.01 ============================== end of process initial clauses ========
% 0.68/1.01
% 0.68/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.68/1.01
% 0.68/1.01 ============================== end of clauses for search =============
% 0.68/1.01
% 0.68/1.01 ============================== SEARCH ================================
% 0.68/1.01
% 0.68/1.01 % Starting search at 0.01 seconds.
% 0.68/1.01
% 0.68/1.01 ============================== PROOF =================================
% 0.68/1.01 % SZS status Unsatisfiable
% 0.68/1.01 % SZS output start Refutation
% 0.68/1.01
% 0.68/1.01 % Proof 1 at 0.03 (+ 0.00) seconds: prove_row_8_can_be_covered.
% 0.68/1.01 % Length of proof is 23.
% 0.68/1.01 % Level of proof is 8.
% 0.68/1.01 % Maximum clause weight is 33.000.
% 0.68/1.01 % Given clauses 176.
% 0.68/1.01
% 0.68/1.01 1 successor(n1) = n2 # label(successor_of_1_is_2) # label(axiom). [assumption].
% 0.68/1.01 2 successor(n2) = n3 # label(successor_of_2_is_3) # label(axiom). [assumption].
% 0.68/1.01 3 successor(n3) = n4 # label(successor_of_3_is_4) # label(axiom). [assumption].
% 0.68/1.01 4 successor(n4) = n5 # label(successor_of_4_is_5) # label(axiom). [assumption].
% 0.68/1.01 5 successor(n5) = n6 # label(successor_of_5_is_6) # label(axiom). [assumption].
% 0.68/1.01 6 successor(n6) = n7 # label(successor_of_6_is_7) # label(axiom). [assumption].
% 0.68/1.01 7 successor(n7) = n8 # label(successor_of_7_is_8) # label(axiom). [assumption].
% 0.68/1.01 9 complement(covered) = not_covered # label(complement_of_covered_is_not_covered) # label(axiom). [assumption].
% 0.68/1.01 10 complement(not_covered) = covered # label(complement_of_not_covered_is_covered) # label(axiom). [assumption].
% 0.68/1.01 11 complement(removed) = not_covered # label(complement_of_removed_is_not_covered) # label(axiom). [assumption].
% 0.68/1.01 12 achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) # label(first_row_initially) # label(hypothesis). [assumption].
% 0.68/1.01 13 -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) # label(prove_row_8_can_be_covered) # label(negated_conjecture) # answer(prove_row_8_can_be_covered). [assumption].
% 0.68/1.01 15 -achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,V6)) | achievable(row(A),squares(B,covered,covered,C,D,E,F,V6)) # label(cover_columns_2_and_3) # label(axiom). [assumption].
% 0.68/1.01 21 -achievable(row(A),squares(B,C,D,E,F,V6,V7,V8)) | achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(V6),complement(V7),complement(V8))) # label(place_vertical_pieces) # label(axiom). [assumption].
% 0.68/1.01 23 -achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)) # answer(prove_row_8_can_be_covered). [ur(15,b,13,a)].
% 0.68/1.01 33 achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)). [hyper(21,a,12,a),rewrite([1(2),10(4),11(5),11(6),10(7),10(8),10(9),10(10),10(11)])].
% 0.68/1.01 62 achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)). [hyper(21,a,33,a),rewrite([2(2),9(4),10(5),10(6),9(7),9(8),9(9),9(10),9(11)])].
% 0.68/1.01 80 achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)). [hyper(21,a,62,a),rewrite([3(2),10(4),9(5),9(6),10(7),10(8),10(9),10(10),10(11)])].
% 0.68/1.01 102 achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)). [hyper(21,a,80,a),rewrite([4(2),9(4),10(5),10(6),9(7),9(8),9(9),9(10),9(11)])].
% 0.68/1.01 135 achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)). [hyper(21,a,102,a),rewrite([5(2),10(4),9(5),9(6),10(7),10(8),10(9),10(10),10(11)])].
% 0.68/1.01 176 achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)). [hyper(21,a,135,a),rewrite([6(2),9(4),10(5),10(6),9(7),9(8),9(9),9(10),9(11)])].
% 0.68/1.01 223 achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)). [hyper(21,a,176,a),rewrite([7(2),10(4),9(5),9(6),10(7),10(8),10(9),10(10),10(11)])].
% 0.68/1.01 224 $F # answer(prove_row_8_can_be_covered). [resolve(223,a,23,a)].
% 0.68/1.01
% 0.68/1.01 % SZS output end Refutation
% 0.68/1.01 ============================== end of proof ==========================
% 0.68/1.01
% 0.68/1.01 ============================== STATISTICS ============================
% 0.68/1.01
% 0.68/1.01 Given=176. Generated=470. Kept=223. proofs=1.
% 0.68/1.01 Usable=176. Sos=46. Demods=11. Limbo=0, Disabled=21. Hints=0.
% 0.68/1.01 Megabytes=0.22.
% 0.68/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.68/1.01
% 0.68/1.01 ============================== end of statistics =====================
% 0.68/1.01
% 0.68/1.01 ============================== end of search =========================
% 0.68/1.01
% 0.68/1.01 THEOREM PROVED
% 0.68/1.01 % SZS status Unsatisfiable
% 0.68/1.01
% 0.68/1.01 Exiting with 1 proof.
% 0.68/1.01
% 0.68/1.01 Process 2600 exit (max_proofs) Sat May 28 22:42:39 2022
% 0.68/1.01 Prover9 interrupted
%------------------------------------------------------------------------------