%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ023-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 : art04.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/PUZ023-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 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 9)
% (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(22,40,0,44,0,0)
%
%
% START OF PROOF
% 23 [] a_truth(truthteller(X)) | a_truth(liar(X)).
% 26 [] -a_truth(says(X,Y)) | -a_truth(liar(X)) | -a_truth(Y).
% 39 [] a_truth(says(c,liar(b))).
% 41 [] -a_truth(truthteller(c)) | -a_truth(liar(b)) | an_answer(b_liar_and_c_truthteller).
% 42 [] -a_truth(liar(c)) | -a_truth(truthteller(b)) | an_answer(b_truthteller_and_c_liar).
% 43 [] -a_truth(truthteller(c)) | -a_truth(truthteller(b)) | an_answer(b_and_c_truthtellers).
% 44 [] -an_answer(X).
% 78 [hyper:41,23,23,cut:44] a_truth(liar(c)) | a_truth(truthteller(b)).
% 91 [hyper:26,23,39,binarycut:78] a_truth(truthteller(b)).
% 104 [hyper:42,91,23,cut:44] a_truth(truthteller(c)).
% 105 [hyper:43,91,cut:104] an_answer(b_and_c_truthtellers).
% 120 [hyper:44,105] 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 9
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9
% derived clauses: 91
% kept clauses: 13
% kept size sum: 63
% kept mid-nuclei: 56
% kept new demods: 0
% forw unit-subs: 5
% forw double-subs: 4
% forw overdouble-subs: 2
% backward subs: 1
% fast unit cutoff: 7
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 0.0
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 66
% length fails: 0
% strength fails: 37
% predlist fails: 23
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 6
% full subs fail: 4
%
% ; 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/PUZ023-1+noeq.in")
%
%------------------------------------------------------------------------------