TSTP Solution File: PLA010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA010-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 : art10.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 138.7s
% Output : Assurance 138.7s
% 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/PLA010-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,66849,5,5607,66850,1,5607,66850,50,5612,66850,40,5612,66881,0,5612,67906,50,5628,67937,0,5628,91647,3,6979,92118,4,7654,93368,1,8329,93368,50,8331,93368,40,8331,93399,0,8331,253139,3,9733,315493,4,10433,315630,5,11160,315630,5,11161,315631,1,11161,315631,50,11170,315631,40,11170,315662,0,11170,316415,50,11176,316446,0,11176,334291,3,12527,335133,4,13202,336267,5,13877,336267,1,13877,336267,50,13879,336267,40,13879,336298,0,13879)
%
%
% START OF PROOF
% 316466 [?] ?
% 316475 [?] ?
% 317367 [?] ?
% 336268 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 336269 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 336271 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 336272 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 336273 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 336274 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 336275 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 336276 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 336277 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 336279 [] differ(a,b).
% 336280 [] differ(a,c).
% 336281 [] differ(a,d).
% 336282 [] differ(a,table).
% 336284 [] differ(b,d).
% 336285 [] differ(b,table).
% 336287 [] differ(c,table).
% 336288 [] differ(d,table).
% 336293 [] holds(clear(a),s0).
% 336295 [] holds(clear(c),s0).
% 336296 [] holds(empty,s0).
% 336297 [] holds(clear(table),X).
% 336298 [] -holds(and(on(a,d),on(d,b)),X).
% 336299 [binary:336268,336298] -holds(on(a,d),X) | -holds(on(d,b),X).
% 336306 [binary:336276,336299.2] -holds(on(a,d),do(putdown(X,Y),Z)) | -holds(on(d,b),Z).
% 336331 [binary:336274,336306] -holds(on(d,b),X) | -holds(holding(a),X) | -holds(clear(d),X).
% 336338 [binary:336271,336331] -holds(holding(a),do(pickup(X),Y)) | -holds(clear(d),do(pickup(X),Y)) | -holds(on(d,b),Y) | -differ(d,X).
% 336496 [binary:336272,336338.2] -holds(holding(a),do(pickup(X),Y)) | -holds(on(d,b),Y) | -holds(clear(d),Y) | -differ(d,X).
% 336501 [binary:336269,336496,cut:316466,cut:336282] -holds(on(d,b),X) | -holds(clear(a),X) | -holds(clear(d),X) | -holds(empty,X).
% 336510 [binary:336273,336501.4] -holds(on(d,b),do(putdown(X,Y),Z)) | -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(a),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 336880 [binary:336274,336510] -holds(clear(d),do(putdown(d,b),X)) | -holds(clear(a),do(putdown(d,b),X)) | -holds(holding(d),X) | -holds(clear(b),X).
% 337146 [binary:336275,336880] -holds(clear(a),do(putdown(d,b),X)) | -holds(holding(d),X) | -holds(clear(b),X).
% 337150 [binary:336277,337146,cut:336279] -holds(clear(b),X) | -holds(clear(a),X) | -holds(holding(d),X).
% 337155 [binary:336272,337150] -holds(clear(a),do(pickup(X),Y)) | -holds(holding(d),do(pickup(X),Y)) | -holds(clear(b),Y) | -differ(b,X).
% 337162 [binary:336269,337155.2,cut:336284,cut:336288] -holds(clear(a),do(pickup(d),X)) | -holds(clear(d),X) | -holds(clear(b),X) | -holds(empty,X).
% 337208 [binary:336272,337162,cut:336281] -holds(clear(a),X) | -holds(clear(d),X) | -holds(clear(b),X) | -holds(empty,X).
% 337220 [binary:336277,337208] -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(b),do(putdown(X,Y),Z)) | -holds(empty,do(putdown(X,Y),Z)) | -holds(clear(a),Z) | -differ(a,Y).
% 339395 [binary:336282,337220.5] -holds(clear(b),do(putdown(X,table),Y)) | -holds(clear(d),do(putdown(X,table),Y)) | -holds(empty,do(putdown(X,table),Y)) | -holds(clear(a),Y).
% 342149 [binary:336277,339395,cut:336285] -holds(clear(d),do(putdown(X,table),Y)) | -holds(empty,do(putdown(X,table),Y)) | -holds(clear(a),Y) | -holds(clear(b),Y).
% 342155 [binary:336277,342149,cut:336288] -holds(empty,do(putdown(X,table),Y)) | -holds(clear(b),Y) | -holds(clear(d),Y) | -holds(clear(a),Y).
% 342157 [binary:336273,342155,cut:336297] -holds(clear(a),X) | -holds(clear(b),X) | -holds(clear(d),X) | -holds(holding(Y),X).
% 342163 [binary:336272,342157] -holds(clear(b),do(pickup(X),Y)) | -holds(clear(d),do(pickup(X),Y)) | -holds(holding(Z),do(pickup(X),Y)) | -holds(clear(a),Y) | -differ(a,X).
% 342494 [binary:336293,342163.4] -holds(clear(b),do(pickup(X),s0)) | -holds(clear(d),do(pickup(X),s0)) | -holds(holding(Y),do(pickup(X),s0)) | -differ(a,X).
% 342504 [binary:336280,342494.4,cut:316475,cut:317367] -holds(holding(X),do(pickup(c),s0)).
% 342507 [binary:336269,342504,cut:336295,cut:336287,cut:336296] 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: 25507
% derived clauses: 1864893
% kept clauses: 188207
% kept size sum: 388931
% kept mid-nuclei: 6025
% kept new demods: 0
% forw unit-subs: 83661
% forw double-subs: 4247
% forw overdouble-subs: 6076
% backward subs: 683
% fast unit cutoff: 5436
% full unit cutoff: 2
% dbl unit cutoff: 127
% real runtime : 144.48
% process. runtime: 142.84
% specific non-discr-tree subsumption statistics:
% tried: 192403
% length fails: 7920
% strength fails: 81471
% predlist fails: 7861
% aux str. fails: 2724
% by-lit fails: 1027
% full subs tried: 90542
% full subs fail: 84926
%
% ; 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/PLA010-1+noeq.in")
%
%------------------------------------------------------------------------------