TSTP Solution File: PLA012-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA012-1 : TPTP v3.4.2. Released v1.1.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 139.6s
% Output : Assurance 139.6s
% 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/PLA/PLA012-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 3 7)
% (binary-unit 28 #f 3 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 3 7)
% (binary 28 #t 3 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(31,40,1,62,0,1,1013,50,6,1044,0,6,66326,4,4207,66853,5,5607,66853,1,5607,66853,50,5613,66853,40,5613,66884,0,5613,67909,50,5628,67940,0,5628,91548,3,6979,92124,4,7654,93135,5,8329,93135,1,8329,93135,50,8331,93135,40,8331,93166,0,8331,248406,3,9732,309443,4,10432,309648,5,11133,309649,5,11136,309650,1,11136,309650,50,11146,309650,40,11146,309681,0,11146,310434,50,11154,310465,0,11154,328092,3,12505,328350,4,13180,329950,5,13855,329950,1,13855,329950,50,13857,329950,40,13857,329981,0,13857)
%
%
% START OF PROOF
% 310487 [?] ?
% 310488 [?] ?
% 310490 [?] ?
% 310494 [?] ?
% 329951 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 329952 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 329954 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 329955 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 329956 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329957 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329958 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329959 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 329960 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 329966 [] differ(b,c).
% 329967 [] differ(b,d).
% 329968 [] differ(b,table).
% 329970 [] differ(c,table).
% 329971 [] differ(d,table).
% 329977 [] holds(clear(b),s0).
% 329978 [] holds(clear(c),s0).
% 329979 [] holds(empty,s0).
% 329980 [] holds(clear(table),X).
% 329981 [] -holds(and(on(d,b),on(b,c)),X).
% 329982 [binary:329951,329981] -holds(on(d,b),X) | -holds(on(b,c),X).
% 329989 [binary:329959,329982.2] -holds(on(d,b),do(putdown(X,Y),Z)) | -holds(on(b,c),Z).
% 330008 [binary:329957,329989] -holds(on(b,c),X) | -holds(holding(d),X) | -holds(clear(b),X).
% 330010 [binary:329952,330008.2,cut:329971] -holds(on(b,c),do(pickup(d),X)) | -holds(clear(b),do(pickup(d),X)) | -holds(clear(d),X) | -holds(empty,X).
% 330136 [binary:329954,330010,cut:329967] -holds(clear(b),do(pickup(d),X)) | -holds(on(b,c),X) | -holds(clear(d),X) | -holds(empty,X).
% 330145 [binary:329955,330136,cut:329967] -holds(on(b,c),X) | -holds(clear(b),X) | -holds(clear(d),X) | -holds(empty,X).
% 330159 [binary:329956,330145.4] -holds(on(b,c),do(putdown(X,Y),Z)) | -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(b),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 330510 [binary:329957,330159] -holds(clear(d),do(putdown(b,c),X)) | -holds(clear(b),do(putdown(b,c),X)) | -holds(holding(b),X) | -holds(clear(c),X).
% 330812 [binary:329958,330510.2] -holds(clear(d),do(putdown(b,c),X)) | -holds(holding(b),X) | -holds(clear(c),X).
% 330821 [binary:329960,330812,cut:310490] -holds(clear(c),X) | -holds(clear(d),X) | -holds(holding(b),X).
% 330826 [binary:329955,330821] -holds(clear(d),do(pickup(X),Y)) | -holds(holding(b),do(pickup(X),Y)) | -holds(clear(c),Y) | -differ(c,X).
% 330833 [binary:329952,330826.2,cut:310487,cut:329968] -holds(clear(d),do(pickup(b),X)) | -holds(clear(b),X) | -holds(clear(c),X) | -holds(empty,X).
% 330873 [binary:329955,330833,cut:310488] -holds(clear(d),X) | -holds(clear(b),X) | -holds(clear(c),X) | -holds(empty,X).
% 330881 [binary:329956,330873.4] -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(c),do(putdown(X,Y),Z)) | -holds(clear(b),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 332777 [binary:329958,330881.2] -holds(clear(d),do(putdown(c,X),Y)) | -holds(clear(b),do(putdown(c,X),Y)) | -holds(holding(c),Y) | -holds(clear(X),Y).
% 333289 [binary:329980,332777.4] -holds(clear(b),do(putdown(c,table),X)) | -holds(clear(d),do(putdown(c,table),X)) | -holds(holding(c),X).
% 333321 [binary:329960,333289,cut:329968] -holds(clear(d),do(putdown(c,table),X)) | -holds(holding(c),X) | -holds(clear(b),X).
% 333325 [binary:329960,333321,cut:329971] -holds(clear(b),X) | -holds(clear(d),X) | -holds(holding(c),X).
% 333331 [binary:329955,333325] -holds(clear(d),do(pickup(X),Y)) | -holds(holding(c),do(pickup(X),Y)) | -holds(clear(b),Y) | -differ(b,X).
% 333348 [binary:329977,333331.3] -holds(clear(d),do(pickup(X),s0)) | -holds(holding(c),do(pickup(X),s0)) | -differ(b,X).
% 333351 [binary:329952,333348.2,cut:310494,cut:329966,cut:329978,cut:329970,cut:329979] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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 3
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 23902
% derived clauses: 1824258
% kept clauses: 186112
% kept size sum: 339916
% kept mid-nuclei: 6103
% kept new demods: 0
% forw unit-subs: 82372
% forw double-subs: 4041
% forw overdouble-subs: 3105
% backward subs: 327
% fast unit cutoff: 3992
% full unit cutoff: 0
% dbl unit cutoff: 125
% real runtime : 140.27
% process. runtime: 139.68
% specific non-discr-tree subsumption statistics:
% tried: 64340
% length fails: 2116
% strength fails: 26697
% predlist fails: 3358
% aux str. fails: 1121
% by-lit fails: 305
% full subs tried: 30504
% full subs fail: 27524
%
% ; 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/PLA/PLA012-1+noeq.in")
%
%------------------------------------------------------------------------------