TSTP Solution File: PUZ021-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ021-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/PUZ021-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 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)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(13,40,1,26,0,1)
%
%
% START OF PROOF
% 14 [] -a_truth(knight(X),Y) | -a_truth(knave(X),Y).
% 15 [] a_truth(knight(X),Y) | a_truth(knave(X),Y).
% 16 [] -a_truth(rich(X),Y) | -a_truth(poor(X),Y).
% 17 [] a_truth(rich(X),Y) | a_truth(poor(X),Y).
% 18 [] -a_truth(knight(X),Y) | -says(X,Z) | a_truth(Z,Y).
% 20 [] -a_truth(knave(X),Y) | -says(X,Z) | -a_truth(Z,Y).
% 21 [] -a_truth(knave(X),Y) | says(X,Z) | a_truth(Z,Y).
% 22 [] -a_truth(and(X,Y),Z) | a_truth(X,Z).
% 23 [] -a_truth(and(X,Y),Z) | a_truth(Y,Z).
% 24 [] a_truth(and(X,Y),Z) | -a_truth(X,Z) | -a_truth(Y,Z).
% 25 [] -a_truth(and(knave(me),rich(me)),X) | -says(me,X).
% 26 [] a_truth(and(knave(me),rich(me)),X) | says(me,X).
% 131 [hyper:22,26] a_truth(knave(me),X) | says(me,X).
% 132 [hyper:23,26] a_truth(rich(me),X) | says(me,X).
% 140 [hyper:18,131,15,factor] a_truth(knave(me),X) | a_truth(X,X).
% 142 [hyper:18,131,15,factor:factor:factor] a_truth(knave(me),knave(me)).
% 174 [hyper:21,131] says(me,Y) | says(me,X) | a_truth(Y,X).
% 175 [hyper:21,131,factor] says(me,X) | a_truth(X,X).
% 388 [hyper:23,140,factor] a_truth(knave(me),and(X,knave(me))).
% 438 [hyper:16,132,175] says(me,poor(me)).
% 468 [hyper:20,132,142,cut:142] a_truth(rich(me),knave(me)).
% 528 [hyper:20,438,17,140,factor] a_truth(rich(me),rich(me)).
% 540 [hyper:20,468,131,cut:142] a_truth(knave(me),rich(me)).
% 725 [hyper:22,174] says(me,and(X,Y)) | says(me,Z) | a_truth(X,Z).
% 1452 [hyper:20,388,438,17] a_truth(rich(me),and(X,knave(me))).
% 1782 [hyper:24,1452,388] a_truth(and(knave(me),rich(me)),and(X,knave(me))).
% 4727 [hyper:25,725,slowcut:1782] says(me,X) | a_truth(Y,X).
% 5144 [hyper:14,4727,4727] says(me,X).
% 5171 [hyper:20,4727,528,cut:540] a_truth(X,rich(me)).
% 5303 [hyper:25,5144,slowcut:5171] 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: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 45
% derived clauses: 22292
% kept clauses: 2391
% kept size sum: 37918
% kept mid-nuclei: 2065
% kept new demods: 0
% forw unit-subs: 6540
% forw double-subs: 5797
% forw overdouble-subs: 4615
% backward subs: 21
% fast unit cutoff: 117
% full unit cutoff: 1
% dbl unit cutoff: 27
% real runtime : 0.53
% process. runtime: 0.53
% specific non-discr-tree subsumption statistics:
% tried: 80769
% length fails: 2123
% strength fails: 16978
% predlist fails: 4409
% aux str. fails: 9105
% by-lit fails: 3791
% full subs tried: 42933
% full subs fail: 38215
%
% ; 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/PUZ021-1+noeq.in")
%
%------------------------------------------------------------------------------