TSTP Solution File: PUZ005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ005-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 : art08.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/PUZ005-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 13)
% (binary-unit 10 #f 2 13)
% (binary-double 16 #f 2 13)
% (binary 54 #t 2 13)
% (binary-order 27 #f 2 13)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(51,40,0,102,0,0)
%
%
% START OF PROOF
% 58 [] -sunday(X) | -monday(X).
% 59 [] -wednesday(X) | -tuesday(X).
% 63 [] -sunday(X) | -tuesday(X).
% 66 [] -saturday(X) | -wednesday(X).
% 67 [] -sunday(X) | -wednesday(X).
% 71 [] -saturday(X) | -friday(X).
% 72 [] -sunday(X) | -friday(X).
% 73 [] -sunday(X) | -saturday(X).
% 74 [] -monday(yesterday(X)) | tuesday(X).
% 75 [] -tuesday(yesterday(X)) | wednesday(X).
% 77 [] -thursday(yesterday(X)) | friday(X).
% 78 [] -friday(yesterday(X)) | saturday(X).
% 79 [] -saturday(yesterday(X)) | sunday(X).
% 84 [] thursday(yesterday(X)) | -friday(X).
% 85 [] friday(yesterday(X)) | -saturday(X).
% 88 [] -member(X,lying_days(lion)) | wednesday(X) | tuesday(X) | monday(X).
% 89 [] -member(X,lying_days(unicorn)) | saturday(X) | friday(X) | thursday(X).
% 93 [] member(X,lying_days(unicorn)) | -thursday(X).
% 94 [] member(X,lying_days(unicorn)) | -friday(X).
% 95 [] member(X,lying_days(unicorn)) | -saturday(X).
% 96 [] member(Z,lying_days(Y)) | member(X,lying_days(Y)) | -admits(Y,X,Z).
% 98 [] -member(Z,lying_days(Y)) | -member(X,lying_days(Y)) | -admits(Y,X,Z).
% 100 [] admits(lion,today,yesterday(today)).
% 101 [] admits(unicorn,today,yesterday(today)).
% 102 [] -thursday(today).
% 197 [hyper:96,100] member(yesterday(today),lying_days(lion)) | member(today,lying_days(lion)).
% 200 [hyper:96,101] member(yesterday(today),lying_days(unicorn)) | member(today,lying_days(unicorn)).
% 222 [hyper:88,197] member(yesterday(today),lying_days(lion)) | wednesday(today) | tuesday(today) | monday(today).
% 237 [hyper:89,200,cut:102] member(yesterday(today),lying_days(unicorn)) | saturday(today) | friday(today).
% 281 [hyper:89,237,binarycut:78,binarycut:77] saturday(yesterday(today)) | saturday(today) | friday(today).
% 315 [hyper:79,281] sunday(today) | saturday(today) | friday(today).
% 340 [hyper:84,315] thursday(yesterday(today)) | sunday(today) | saturday(today).
% 341 [hyper:85,315] friday(yesterday(today)) | sunday(today) | friday(today).
% 342 [hyper:94,315] member(today,lying_days(unicorn)) | sunday(today) | saturday(today).
% 365 [hyper:93,340] member(yesterday(today),lying_days(unicorn)) | sunday(today) | saturday(today).
% 504 [hyper:95,342] member(today,lying_days(unicorn)) | sunday(today).
% 627 [hyper:98,365,101,binarycut:504] sunday(today) | saturday(today).
% 640 [hyper:71,627,341] friday(yesterday(today)) | sunday(today).
% 642 [hyper:72,627,281] saturday(yesterday(today)) | saturday(today).
% 675 [hyper:94,640] member(yesterday(today),lying_days(unicorn)) | sunday(today).
% 781 [hyper:98,675,101,binarycut:504] sunday(today).
% 787 [hyper:73,781,642] saturday(yesterday(today)).
% 1103 [hyper:58,222,cut:781] member(yesterday(today),lying_days(lion)) | wednesday(today) | tuesday(today).
% 1137 [hyper:88,1103,binarycut:75,binarycut:74] wednesday(yesterday(today)) | wednesday(today) | tuesday(today).
% 1203 [hyper:66,1137,cut:787] wednesday(today) | tuesday(today).
% 1211 [hyper:63,1203,cut:781] wednesday(today).
% 1214 [hyper:67,1203,cut:781] tuesday(today).
% 1216 [hyper:59,1211,cut:1214] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 13
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 108
% derived clauses: 5183
% kept clauses: 373
% kept size sum: 5781
% kept mid-nuclei: 604
% kept new demods: 0
% forw unit-subs: 559
% forw double-subs: 890
% forw overdouble-subs: 1201
% backward subs: 72
% fast unit cutoff: 234
% full unit cutoff: 0
% dbl unit cutoff: 37
% real runtime : 0.12
% process. runtime: 0.10
% specific non-discr-tree subsumption statistics:
% tried: 17571
% length fails: 154
% strength fails: 1275
% predlist fails: 12955
% aux str. fails: 0
% by-lit fails: 380
% full subs tried: 2296
% full subs fail: 1577
%
% ; 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/PUZ005-1+noeq.in")
%
%------------------------------------------------------------------------------