TSTP Solution File: PUZ001-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ001-2 : 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 : art02.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/PUZ001-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 2 7)
% (binary-unit 9 #f 2 7)
% (binary-double 9 #f 2 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 7)
% (binary-order 25 #f 2 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(16,40,0,32,0,0,62,50,0,78,0,0,108,50,0,124,0,0,154,50,0,170,0,0,200,50,0,216,0,0,246,50,1,262,0,1,292,50,1,308,0,1,338,50,1,354,0,1,384,50,1,400,0,1,430,50,1,446,0,1,476,50,1,492,0,1,522,50,1,538,0,1,568,50,1,584,0,1,614,50,1,630,0,1,660,50,1,676,0,1,706,50,2,722,0,2,752,50,2,768,0,2,798,50,2,814,0,2,844,50,2,860,0,2,890,50,3,906,0,3,936,50,3,936,40,3,952,0,3)
%
%
% START OF PROOF
% 938 [] lives_at_dreadsbury(someone).
% 939 [] killed(someone,aunt_agatha).
% 943 [] equal(X,butler) | equal(X,charles) | equal(X,aunt_agatha) | -lives_at_dreadsbury(X).
% 944 [] -killed(X,Y) | hates(X,Y).
% 945 [] -richer(X,Y) | -killed(X,Y).
% 946 [] -hates(aunt_agatha,X) | -hates(charles,X).
% 947 [] hates(aunt_agatha,X) | equal(X,butler).
% 948 [] richer(X,aunt_agatha) | hates(butler,X).
% 949 [] -hates(aunt_agatha,X) | hates(butler,X).
% 950 [] -hates(X,every_one_but(X)).
% 951 [] -equal(aunt_agatha,butler).
% 952 [] -killed(aunt_agatha,aunt_agatha).
% 954 [binary:939,944] hates(someone,aunt_agatha).
% 958 [para:943.3.2,952.1.1] -killed(X,aunt_agatha) | equal(X,butler) | equal(X,charles) | -lives_at_dreadsbury(X).
% 964 [binary:939,945.2] -richer(someone,aunt_agatha).
% 970 [binary:951,947.2] hates(aunt_agatha,aunt_agatha).
% 974 [binary:964,948] hates(butler,someone).
% 976 [binary:946,970] -hates(charles,aunt_agatha).
% 983 [binary:938,958.4,cut:939] equal(someone,charles) | equal(someone,butler).
% 991 [binary:950,949.2] -hates(aunt_agatha,every_one_but(butler)).
% 1010 [binary:947,991] equal(every_one_but(butler),butler).
% 1018 [para:983.1.2,976.1.1,cut:954] equal(someone,butler).
% 1081 [para:1010.1.1,950.1.2] -hates(butler,butler).
% 1095 [para:1018.1.2,1081.1.2,cut:974] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 7
% clause depth limited to 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 564
% derived clauses: 1241
% kept clauses: 330
% kept size sum: 1932
% kept mid-nuclei: 220
% kept new demods: 44
% forw unit-subs: 425
% forw double-subs: 25
% forw overdouble-subs: 35
% backward subs: 4
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 138
% length fails: 0
% strength fails: 62
% predlist fails: 34
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 22
% full subs fail: 7
%
% ; 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/PUZ001-2+eq_r.in")
%
%------------------------------------------------------------------------------