TSTP Solution File: PUZ026-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ026-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 : art03.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/PUZ026-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 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (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
% -a_truth(liar(X)) | -a_truth(normal(Y)) | -a_truth(truthteller(Z)).
% was split for some strategies as:
% -a_truth(liar(X)).
% -a_truth(normal(Y)).
% -a_truth(truthteller(Z)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(23,40,1,50,0,1)
%
%
% START OF PROOF
% 24 [] a_truth(liar(X)) | a_truth(normal(X)) | a_truth(truthteller(X)).
% 27 [] -a_truth(liar(X)) | -a_truth(normal(X)).
% 30 [] -a_truth(says(X,Y)) | a_truth(truthteller(X)) | a_truth(normal(X)) | -a_truth(Y).
% 31 [] -a_truth(says(X,Y)) | a_truth(liar(X)) | a_truth(normal(X)) | a_truth(Y).
% 32 [] -a_truth(not_normal(X)) | -a_truth(normal(X)).
% 33 [] a_truth(not_normal(X)) | a_truth(normal(X)).
% 35 [] -a_truth(truthteller(Y)) | -a_truth(truthteller(X)) | -people(Y,Z,X).
% 36 [] -a_truth(liar(Y)) | -a_truth(liar(X)) | -people(Y,X,Z).
% 38 [] -a_truth(normal(X)) | -a_truth(normal(Y)) | -people(X,Y,Z).
% 39 [] -a_truth(normal(X)) | -a_truth(normal(Y)) | -people(X,Z,Y).
% 40 [] -a_truth(normal(Z)) | -a_truth(truthteller(X)) | -a_truth(liar(Y)).
% 41 [] a_truth(says(c,not_normal(c))).
% 43 [] a_truth(says(a,normal(a))).
% 45 [] people(b,c,a).
% 46 [] people(a,b,c).
% 47 [] $spltprd0($spltcnst1) | -a_truth(liar(X)).
% 48 [] $spltprd0($spltcnst2) | -a_truth(normal(X)).
% 49 [] $spltprd0($spltcnst3) | -a_truth(truthteller(X)).
% 50 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst3).
% 76 [hyper:30,41,binarycut:33] a_truth(normal(c)) | a_truth(truthteller(c)).
% 82 [hyper:31,43] a_truth(liar(a)) | a_truth(normal(a)).
% 86 [hyper:48,76] a_truth(truthteller(c)) | $spltprd0($spltcnst2).
% 87 [hyper:49,76] a_truth(normal(c)) | $spltprd0($spltcnst3).
% 339 [hyper:47,82] a_truth(normal(a)) | $spltprd0($spltcnst1).
% 340 [hyper:48,82] a_truth(liar(a)) | $spltprd0($spltcnst2).
% 385 [hyper:39,82,87,slowcut:46] a_truth(liar(a)) | $spltprd0($spltcnst3).
% 586 [hyper:40,33,86,340] $spltprd0($spltcnst2) | a_truth(not_normal(X)).
% 617 [hyper:38,33,45,87] a_truth(not_normal(b)) | $spltprd0($spltcnst3).
% 632 [hyper:38,33,46,339] a_truth(not_normal(b)) | $spltprd0($spltcnst1).
% 686 [?] ?
% 794 [hyper:50,632,617,binarycut:586] a_truth(not_normal(b)).
% 796 [hyper:32,632,binarycut:686] $spltprd0($spltcnst1).
% 805 [hyper:50,796,385,340] a_truth(liar(a)).
% 889 [?] ?
% 985 [hyper:35,46,86,binarycut:889] $spltprd0($spltcnst2).
% 1001 [hyper:50,985,87,cut:796] a_truth(normal(c)).
% 1005 [hyper:40,1001,24,slowcut:805] a_truth(normal(X)) | a_truth(liar(X)).
% 1067 [hyper:32,1005,794] a_truth(liar(b)).
% 1079 [hyper:36,1005,46,cut:805] a_truth(normal(b)).
% 1132 [hyper:27,1067,cut:1079] 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 7
% clause depth limited to 3
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 51
% derived clauses: 2344
% kept clauses: 102
% kept size sum: 802
% kept mid-nuclei: 896
% kept new demods: 0
% forw unit-subs: 238
% forw double-subs: 787
% forw overdouble-subs: 175
% backward subs: 33
% fast unit cutoff: 12
% full unit cutoff: 11
% dbl unit cutoff: 15
% real runtime : 0.5
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 1480
% length fails: 36
% strength fails: 607
% predlist fails: 175
% aux str. fails: 74
% by-lit fails: 20
% full subs tried: 440
% full subs fail: 336
%
% ; 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/PUZ026-1+noeq.in")
%
%------------------------------------------------------------------------------