TSTP Solution File: MSC004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MSC004-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 : 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/MSC/MSC004-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 16 #f)
% (binary 16 #t 3 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 3 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(8,40,0,16,0,0)
%
%
% START OF PROOF
% 9 [] in(object_in(X,Y,Z,U,V),Y) | has_parts(X,times(U,V),Z) | -has_parts(X,U,Y).
% 10 [] -has_parts(object_in(X,Y,Z,U,V),V,Z) | has_parts(X,times(U,V),Z) | -has_parts(X,U,Y).
% 11 [] in(john,boy).
% 12 [] -in(X,boy) | in(X,human).
% 13 [] has_parts(X,n5,fingers) | -in(X,hand).
% 14 [] has_parts(X,n2,arm) | -in(X,human).
% 15 [] has_parts(X,n1,hand) | -in(X,arm).
% 16 [] -has_parts(john,times(times(n2,n1),n5),fingers).
% 17 [hyper:12,11] in(john,human).
% 18 [hyper:14,17] has_parts(john,n2,arm).
% 19 [hyper:9,18] in(object_in(john,arm,X,n2,Y),arm) | has_parts(john,times(n2,Y),X).
% 26 [hyper:15,19] has_parts(object_in(john,arm,X,n2,Y),n1,hand) | has_parts(john,times(n2,Y),X).
% 32 [hyper:10,26,cut:18] has_parts(john,times(n2,n1),hand).
% 35 [hyper:9,32] in(object_in(john,hand,X,times(n2,n1),Y),hand) | has_parts(john,times(times(n2,n1),Y),X).
% 40 [hyper:16,35] in(object_in(john,hand,fingers,times(n2,n1),n5),hand).
% 41 [hyper:13,40] has_parts(object_in(john,hand,fingers,times(n2,n1),n5),n5,fingers).
% 42 [hyper:10,41,cut:32] has_parts(john,times(times(n2,n1),n5),fingers).
% 43 [hyper:16,42] 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: 16
% derived clauses: 44
% kept clauses: 13
% kept size sum: 191
% kept mid-nuclei: 5
% kept new demods: 0
% forw unit-subs: 4
% forw double-subs: 4
% forw overdouble-subs: 3
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 14
% length fails: 1
% strength fails: 0
% predlist fails: 7
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 5
% full subs fail: 2
%
% ; 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/MSC/MSC004-1+noeq.in")
%
%------------------------------------------------------------------------------