TSTP Solution File: PUZ035-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ035-3 : TPTP v3.4.2. Released v2.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/PUZ035-3+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 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f 4 5)
% (binary 54 #t 4 5)
% (binary-order 27 #f 4 5)
% (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)
%
%
% SOS clause
% -truth(isa(asked,X)) | -truth(isa(other,Y)) | -says(asked,Z).
% was split for some strategies as:
% -truth(isa(asked,X)).
% -truth(isa(other,Y)).
% -says(asked,Z).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(16,40,1,36,0,1)
%
%
% START OF PROOF
% 17 [] truth(isa(X,knight)) | truth(isa(X,knave)) | -person(X).
% 23 [] says(asked,not(or(isa(asked,knight),isa(other,knight)))) | says(asked,or(isa(asked,knight),isa(other,knight))).
% 30 [] person(asked).
% 31 [] person(other).
% 33 [] $spltprd0($spltcnst1) | -truth(isa(asked,X)).
% 34 [] $spltprd0($spltcnst2) | -truth(isa(other,X)).
% 35 [] $spltprd0($spltcnst3) | -says(asked,X).
% 36 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst3).
% 37 [hyper:17,30] truth(isa(asked,knave)) | truth(isa(asked,knight)).
% 38 [hyper:17,31] truth(isa(other,knave)) | truth(isa(other,knight)).
% 54 [hyper:33,37] truth(isa(asked,knight)) | $spltprd0($spltcnst1).
% 76 [hyper:33,54] $spltprd0($spltcnst1).
% 90 [hyper:34,38] truth(isa(other,knight)) | $spltprd0($spltcnst2).
% 119 [hyper:34,90] $spltprd0($spltcnst2).
% 149 [hyper:35,23] says(asked,or(isa(asked,knight),isa(other,knight))) | $spltprd0($spltcnst3).
% 188 [hyper:35,149] $spltprd0($spltcnst3).
% 190 [hyper:36,188,cut:76,cut:119] 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 5
% clause depth limited to 4
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28
% derived clauses: 224
% kept clauses: 29
% kept size sum: 378
% kept mid-nuclei: 101
% kept new demods: 0
% forw unit-subs: 35
% forw double-subs: 8
% forw overdouble-subs: 13
% backward subs: 14
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 69
% length fails: 13
% strength fails: 0
% predlist fails: 25
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 6
% full subs fail: 6
%
% ; 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/PUZ035-3+noeq.in")
%
%------------------------------------------------------------------------------