TSTP Solution File: PLA015-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA015-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 : 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 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/PLA015-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,0,62,0,0,1013,50,5,1044,0,5,66326,4,4206,66856,5,5608,66857,1,5608,66857,50,5613,66857,40,5613,66888,0,5613,67913,50,5629,67944,0,5629,91707,3,6980,92259,4,7655,93561,5,8330,93561,1,8330,93561,50,8332,93561,40,8332,93592,0,8332,252113,3,9733,311172,4,10433,311326,5,11134,311326,5,11136,311327,1,11136,311327,50,11145,311327,40,11145,311358,0,11145,312111,50,11166,312142,0,11166,329987,3,12517,331235,4,13192,331965,5,13867,331965,1,13867,331965,50,13869,331965,40,13869,331996,0,13869)
%
%
% START OF PROOF
% 312160 [?] ?
% 312165 [?] ?
% 312171 [?] ?
% 313063 [?] ?
% 331966 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 331967 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 331969 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 331970 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 331971 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 331972 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 331973 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 331974 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 331975 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 331977 [] differ(a,b).
% 331978 [] differ(a,c).
% 331979 [] differ(a,d).
% 331980 [] differ(a,table).
% 331983 [] differ(b,table).
% 331985 [] differ(c,table).
% 331986 [] differ(d,table).
% 331991 [] holds(clear(a),s0).
% 331993 [] holds(clear(c),s0).
% 331994 [] holds(empty,s0).
% 331995 [] holds(clear(table),X).
% 331996 [] -holds(and(on(a,b),on(b,d)),X).
% 331997 [binary:331966,331996] -holds(on(a,b),X) | -holds(on(b,d),X).
% 332004 [binary:331974,331997.2] -holds(on(a,b),do(putdown(X,Y),Z)) | -holds(on(b,d),Z).
% 332017 [binary:331972,332004] -holds(on(b,d),X) | -holds(holding(a),X) | -holds(clear(b),X).
% 332025 [binary:331967,332017.2,cut:331980] -holds(on(b,d),do(pickup(a),X)) | -holds(clear(b),do(pickup(a),X)) | -holds(clear(a),X) | -holds(empty,X).
% 332153 [binary:331969,332025,cut:312160] -holds(clear(b),do(pickup(a),X)) | -holds(on(b,d),X) | -holds(clear(a),X) | -holds(empty,X).
% 332159 [binary:331970,332153,cut:312160] -holds(on(b,d),X) | -holds(clear(b),X) | -holds(clear(a),X) | -holds(empty,X).
% 332166 [binary:331971,332159.4] -holds(on(b,d),do(putdown(X,Y),Z)) | -holds(clear(a),do(putdown(X,Y),Z)) | -holds(clear(b),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 332529 [binary:331972,332166] -holds(clear(a),do(putdown(b,d),X)) | -holds(clear(b),do(putdown(b,d),X)) | -holds(holding(b),X) | -holds(clear(d),X).
% 332794 [binary:331973,332529.2] -holds(clear(a),do(putdown(b,d),X)) | -holds(holding(b),X) | -holds(clear(d),X).
% 332797 [binary:331975,332794,cut:331979] -holds(clear(d),X) | -holds(clear(a),X) | -holds(holding(b),X).
% 332802 [binary:331970,332797] -holds(clear(a),do(pickup(X),Y)) | -holds(holding(b),do(pickup(X),Y)) | -holds(clear(d),Y) | -differ(d,X).
% 332813 [binary:331967,332802.2,cut:312165,cut:331983] -holds(clear(a),do(pickup(b),X)) | -holds(clear(b),X) | -holds(clear(d),X) | -holds(empty,X).
% 332821 [binary:331970,332813,cut:331977] -holds(clear(a),X) | -holds(clear(b),X) | -holds(clear(d),X) | -holds(empty,X).
% 332834 [binary:331975,332821] -holds(clear(b),do(putdown(X,Y),Z)) | -holds(clear(d),do(putdown(X,Y),Z)) | -holds(empty,do(putdown(X,Y),Z)) | -holds(clear(a),Z) | -differ(a,Y).
% 335019 [binary:331980,332834.5] -holds(clear(d),do(putdown(X,table),Y)) | -holds(clear(b),do(putdown(X,table),Y)) | -holds(empty,do(putdown(X,table),Y)) | -holds(clear(a),Y).
% 337969 [binary:331975,335019,cut:331986] -holds(clear(b),do(putdown(X,table),Y)) | -holds(empty,do(putdown(X,table),Y)) | -holds(clear(a),Y) | -holds(clear(d),Y).
% 337974 [binary:331975,337969,cut:331983] -holds(empty,do(putdown(X,table),Y)) | -holds(clear(d),Y) | -holds(clear(b),Y) | -holds(clear(a),Y).
% 337976 [binary:331971,337974,cut:331995] -holds(clear(a),X) | -holds(clear(d),X) | -holds(clear(b),X) | -holds(holding(Y),X).
% 337982 [binary:331970,337976] -holds(clear(d),do(pickup(X),Y)) | -holds(clear(b),do(pickup(X),Y)) | -holds(holding(Z),do(pickup(X),Y)) | -holds(clear(a),Y) | -differ(a,X).
% 338510 [binary:331991,337982.4] -holds(clear(d),do(pickup(X),s0)) | -holds(clear(b),do(pickup(X),s0)) | -holds(holding(Y),do(pickup(X),s0)) | -differ(a,X).
% 338517 [binary:331978,338510.4,cut:313063,cut:312171] -holds(holding(X),do(pickup(c),s0)).
% 338521 [binary:331967,338517,cut:331993,cut:331985,cut:331994] 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: 25764
% derived clauses: 1879800
% kept clauses: 190002
% kept size sum: 393060
% kept mid-nuclei: 6025
% kept new demods: 0
% forw unit-subs: 84254
% forw double-subs: 4376
% forw overdouble-subs: 6449
% backward subs: 622
% fast unit cutoff: 5691
% full unit cutoff: 2
% dbl unit cutoff: 133
% real runtime : 143.87
% process. runtime: 143.34
% specific non-discr-tree subsumption statistics:
% tried: 203617
% length fails: 9275
% strength fails: 82973
% predlist fails: 8180
% aux str. fails: 3407
% by-lit fails: 936
% full subs tried: 98180
% full subs fail: 92074
%
% ; 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/PLA015-1+noeq.in")
%
%------------------------------------------------------------------------------