TSTP Solution File: PUZ035-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ035-7 : 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 : 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/PUZ035-7+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 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 16 #f 3 5)
% (binary 54 #t 3 5)
% (binary-order 27 #f 3 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
% -reply(asked,or(isa(asked,knight),isa(other,knight)),X) | -truth(isa(asked,Y)) | -truth(isa(other,Z)).
% was split for some strategies as:
% -reply(asked,or(isa(asked,knight),isa(other,knight)),X).
% -truth(isa(asked,Y)).
% -truth(isa(other,Z)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(14,40,0,32,0,0)
%
%
% START OF PROOF
% 15 [] truth(isa(X,knight)) | truth(isa(X,knave)).
% 21 [] reply(X,Y,yes) | reply(X,Y,no).
% 29 [] $spltprd0($spltcnst1) | -reply(asked,or(isa(asked,knight),isa(other,knight)),X).
% 30 [] $spltprd0($spltcnst2) | -truth(isa(asked,X)).
% 31 [] $spltprd0($spltcnst3) | -truth(isa(other,X)).
% 32 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst3).
% 148 [hyper:30,15] truth(isa(asked,knave)) | $spltprd0($spltcnst2).
% 150 [hyper:31,15] truth(isa(other,knave)) | $spltprd0($spltcnst3).
% 193 [hyper:30,148] $spltprd0($spltcnst2).
% 200 [hyper:31,150] $spltprd0($spltcnst3).
% 242 [hyper:29,21] reply(asked,or(isa(asked,knight),isa(other,knight)),no) | $spltprd0($spltcnst1).
% 348 [hyper:29,242] $spltprd0($spltcnst1).
% 350 [hyper:32,348,cut:193,cut:200] 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 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31
% derived clauses: 950
% kept clauses: 146
% kept size sum: 1790
% kept mid-nuclei: 142
% kept new demods: 0
% forw unit-subs: 24
% forw double-subs: 121
% forw overdouble-subs: 50
% backward subs: 13
% 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: 350
% length fails: 32
% strength fails: 5
% predlist fails: 67
% aux str. fails: 31
% by-lit fails: 0
% full subs tried: 199
% full subs fail: 157
%
% ; 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-7+noeq.in")
%
%------------------------------------------------------------------------------