TSTP Solution File: PUZ016-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ016-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ016-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 3 3)
% (binary-unit 28 #f 3 3)
% (binary-double 28 #f 3 3)
% (binary 45 #t 3 3)
% (hyper 11 #t 3 3)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,0,44,0,1)
%
%
% START OF PROOF
% 25 [] -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)).
% 31 [] achievable(row(successor(X)),squares(complement(Y),complement(Z),complement(U),complement(V),complement(W),complement(X1),complement(X2),complement(X3))) | -achievable(row(X),squares(Y,Z,U,V,W,X1,X2,X3)).
% 32 [] equal(successor(n1),n2).
% 33 [] equal(successor(n2),n3).
% 34 [] equal(successor(n3),n4).
% 35 [] equal(successor(n4),n5).
% 36 [] equal(successor(n5),n6).
% 37 [] equal(successor(n6),n7).
% 38 [] equal(successor(n7),n8).
% 40 [] equal(complement(covered),not_covered).
% 41 [] equal(complement(not_covered),covered).
% 42 [] equal(complement(removed),not_covered).
% 43 [] achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 44 [] -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 60 [binary:43,31.2,demod:42,41,32] achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)).
% 68 [binary:25,60] achievable(row(n2),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 89 [binary:31.2,68,demod:40,33] achievable(row(n3),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 115 [binary:31.2,89,demod:41,34] achievable(row(n4),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 153 [binary:31.2,115,demod:40,35] achievable(row(n5),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 199 [binary:31.2,153,demod:41,36] achievable(row(n6),squares(covered,covered,covered,covered,covered,covered,covered,covered)).
% 249 [binary:31.2,199,demod:40,37] achievable(row(n7),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 306 [binary:31.2,249,demod:41,38,cut:44] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 3
% clause depth limited to 3
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 219
% derived clauses: 623
% kept clauses: 253
% kept size sum: 3036
% kept mid-nuclei: 0
% kept new demods: 11
% forw unit-subs: 361
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ016-1+eq_r.in")
%
%------------------------------------------------------------------------------