TSTP Solution File: PUZ016-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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:33 EDT 2022
% Result : Unsatisfiable 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 22 ( 20 unt; 0 nHn; 22 RR)
% Number of literals : 24 ( 10 equ; 4 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cover_columns_2_and_3,axiom,
( ~ achievable(row(X),squares(Y,not_covered,not_covered,Z,U,V,W,X1))
| achievable(row(X),squares(Y,covered,covered,Z,U,V,W,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cover_columns_2_and_3) ).
cnf(place_vertical_pieces,axiom,
( ~ achievable(row(X),squares(Y,Z,U,V,W,X1,Y1,Z1))
| achievable(row(successor(X)),squares(complement(Y),complement(Z),complement(U),complement(V),complement(W),complement(X1),complement(Y1),complement(Z1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',place_vertical_pieces) ).
cnf(successor_of_1_is_2,axiom,
successor(n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_1_is_2) ).
cnf(successor_of_2_is_3,axiom,
successor(n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_2_is_3) ).
cnf(successor_of_3_is_4,axiom,
successor(n3) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_3_is_4) ).
cnf(successor_of_4_is_5,axiom,
successor(n4) = n5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_4_is_5) ).
cnf(successor_of_5_is_6,axiom,
successor(n5) = n6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_5_is_6) ).
cnf(successor_of_6_is_7,axiom,
successor(n6) = n7,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_6_is_7) ).
cnf(successor_of_7_is_8,axiom,
successor(n7) = n8,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_of_7_is_8) ).
cnf(complement_of_covered_is_not_covered,axiom,
complement(covered) = not_covered,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_covered_is_not_covered) ).
cnf(complement_of_not_covered_is_covered,axiom,
complement(not_covered) = covered,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_not_covered_is_covered) ).
cnf(complement_of_removed_is_not_covered,axiom,
complement(removed) = not_covered,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_removed_is_not_covered) ).
cnf(first_row_initially,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',first_row_initially) ).
cnf(prove_row_8_can_be_covered,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_row_8_can_be_covered) ).
cnf(23,plain,
~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference('UR-RESOLVE',[status(thm)],[cover_columns_2_and_3,prove_row_8_can_be_covered]) ).
cnf(33,plain,
achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,first_row_initially]),complement_of_removed_is_not_covered,complement_of_not_covered_is_covered,successor_of_1_is_2,theory(equality)]) ).
cnf(57,plain,
achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,33]),complement_of_not_covered_is_covered,complement_of_covered_is_not_covered,successor_of_2_is_3,theory(equality)]) ).
cnf(81,plain,
achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,57]),complement_of_covered_is_not_covered,complement_of_not_covered_is_covered,successor_of_3_is_4,theory(equality)]) ).
cnf(105,plain,
achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,81]),complement_of_not_covered_is_covered,complement_of_covered_is_not_covered,successor_of_4_is_5,theory(equality)]) ).
cnf(139,plain,
achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,105]),complement_of_covered_is_not_covered,complement_of_not_covered_is_covered,successor_of_5_is_6,theory(equality)]) ).
cnf(180,plain,
achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,139]),complement_of_not_covered_is_covered,complement_of_covered_is_not_covered,successor_of_6_is_7,theory(equality)]) ).
cnf(228,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[place_vertical_pieces,180]),23,complement_of_covered_is_not_covered,complement_of_not_covered_is_covered,successor_of_7_is_8,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n029.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 : 600
% 0.12/0.34 % DateTime : Sat May 28 22:38:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T22:38:43
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-05-28T22:38:43
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 #||
% 0.20/0.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.57 % SZS output start Refutation
% See solution above
% 0.20/0.57 ||#
% 0.20/0.57
% 0.20/0.57 ; Summary of computation:
% 0.20/0.57 ; 877 formulas have been input or derived (from 181 formulas).
% 0.20/0.57 ; 228 (26%) were retained. Of these,
% 0.20/0.57 ; 228 (100%) are still being kept.
% 0.20/0.57 ;
% 0.20/0.57 ; Run time in seconds excluding printing time:
% 0.20/0.57 ; 0.005 5% Read assertion file (1 call)
% 0.20/0.57 ; 0.001 1% Assert (21 calls)
% 0.20/0.57 ; 0.018 17% Process new row (718 calls)
% 0.20/0.57 ; 0.036 35% Resolution (360 calls)
% 0.20/0.57 ; 0.003 3% Paramodulation (180 calls)
% 0.20/0.57 ; 0.000 0% Condensing (8 calls)
% 0.20/0.57 ; 0.001 1% Forward subsumption (8 calls)
% 0.20/0.57 ; 0.000 0% Backward subsumption (8 calls)
% 0.20/0.57 ; 0.001 1% Clause clause subsumption (42 calls)
% 0.20/0.57 ; 0.010 10% Forward simplification (718 calls)
% 0.20/0.57 ; 0.002 2% Backward simplification (228 calls)
% 0.20/0.57 ; 0.001 1% Ordering (55 calls)
% 0.20/0.57 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.57 ; 0.000 0% Purity testing (1 call)
% 0.20/0.57 ; 0.026 25% Other
% 0.20/0.57 ; 0.104 Total
% 0.20/0.57 ; 0.108 Real time
% 0.20/0.57 ;
% 0.20/0.57 ; Term-hash-array has 357 terms in all.
% 0.20/0.57 ; Feature-vector-row-index has 8 entries (8 at peak, 8 added, 0 deleted).
% 0.20/0.57 ; Feature-vector-row-index has 22 nodes (22 at peak, 22 added, 0 deleted).
% 0.20/0.57 ; Retrieved 21 possibly forward subsuming rows in 8 calls.
% 0.20/0.57 ; Retrieved 21 possibly backward subsumed rows in 8 calls.
% 0.20/0.57 ; Path-index has 369 entries (369 at peak, 369 added, 0 deleted).
% 0.20/0.57 ; Path-index has 181 nodes (181 at peak, 181 added, 0 deleted).
% 0.20/0.57 ; Trie-index has 369 entries (369 at peak, 369 added, 0 deleted).
% 0.20/0.57 ; Trie-index has 1,317 nodes (1,317 at peak, 1,317 added, 0 deleted).
% 0.20/0.57 ; Retrieved 863 generalization terms in 1,206 calls.
% 0.20/0.57 ; Retrieved 219 instance terms in 219 calls.
% 0.20/0.57 ; Retrieved 2,370 unifiable terms in 1,841 calls.
% 0.20/0.57 ;
% 0.20/0.57 ; The agenda of rows to give has 47 entries:
% 0.20/0.57 ; 47 with value (4 21)
% 0.20/0.57 Evaluation took:
% 0.20/0.57 0.108 seconds of real time
% 0.20/0.57 0.101795 seconds of user run time
% 0.20/0.57 0.006758 seconds of system run time
% 0.20/0.57 0 calls to %EVAL
% 0.20/0.57 0 page faults and
% 0.20/0.57 6,167,000 bytes consed.
% 0.20/0.57 :PROOF-FOUND
% 0.20/0.57 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T22:38:43
% 0.20/0.58 :PROOF-FOUND
% 0.20/0.58 *
%------------------------------------------------------------------------------