TSTP Solution File: PLA013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA013-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 : art07.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.6s
% Output : Assurance 138.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/PLA013-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,66852,5,5607,66853,1,5609,66853,50,5614,66853,40,5614,66884,0,5614,67909,50,5630,67940,0,5630,91530,3,6981,92127,4,7660,93558,5,8331,93559,1,8331,93559,50,8334,93559,40,8334,93590,0,8334,253879,3,9735,326413,4,10435,326646,5,11152,326646,5,11153,326647,1,11153,326647,50,11161,326647,40,11161,326678,0,11161,327431,50,11167,327462,0,11167,345307,3,12518,346006,4,13193,347285,5,13868,347285,1,13868,347285,50,13870,347285,40,13870,347316,0,13870)
%
%
% START OF PROOF
% 327481 [?] ?
% 328344 [?] ?
% 347286 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 347287 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 347289 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 347290 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 347291 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 347292 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 347293 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 347294 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 347295 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 347297 [] differ(a,b).
% 347300 [] differ(a,table).
% 347301 [] differ(b,c).
% 347305 [] differ(c,table).
% 347312 [] holds(clear(b),s0).
% 347313 [] holds(clear(c),s0).
% 347314 [] holds(empty,s0).
% 347316 [] -holds(and(on(a,c),on(c,b)),X).
% 347317 [binary:347286,347316] -holds(on(a,c),X) | -holds(on(c,b),X).
% 347324 [binary:347294,347317.2] -holds(on(a,c),do(putdown(X,Y),Z)) | -holds(on(c,b),Z).
% 347349 [binary:347292,347324] -holds(on(c,b),X) | -holds(holding(a),X) | -holds(clear(c),X).
% 347355 [binary:347287,347349.2,cut:347300] -holds(on(c,b),do(pickup(a),X)) | -holds(clear(c),do(pickup(a),X)) | -holds(clear(a),X) | -holds(empty,X).
% 347476 [binary:347289,347355,cut:327481] -holds(clear(c),do(pickup(a),X)) | -holds(on(c,b),X) | -holds(clear(a),X) | -holds(empty,X).
% 347483 [binary:347290,347476,cut:327481] -holds(on(c,b),X) | -holds(clear(c),X) | -holds(clear(a),X) | -holds(empty,X).
% 347496 [binary:347291,347483.4] -holds(on(c,b),do(putdown(X,Y),Z)) | -holds(clear(a),do(putdown(X,Y),Z)) | -holds(clear(c),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 347841 [binary:347292,347496] -holds(clear(a),do(putdown(c,b),X)) | -holds(clear(c),do(putdown(c,b),X)) | -holds(holding(c),X) | -holds(clear(b),X).
% 347903 [binary:347293,347841.2] -holds(clear(a),do(putdown(c,b),X)) | -holds(holding(c),X) | -holds(clear(b),X).
% 347906 [binary:347295,347903,cut:347297] -holds(clear(b),X) | -holds(clear(a),X) | -holds(holding(c),X).
% 347911 [binary:347290,347906] -holds(clear(a),do(pickup(X),Y)) | -holds(holding(c),do(pickup(X),Y)) | -holds(clear(b),Y) | -differ(b,X).
% 347935 [binary:347312,347911.3] -holds(clear(a),do(pickup(X),s0)) | -holds(holding(c),do(pickup(X),s0)) | -differ(b,X).
% 347937 [binary:347287,347935.2,cut:328344,cut:347301,cut:347313,cut:347305,cut:347314] 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: 23340
% derived clauses: 1848844
% kept clauses: 185736
% kept size sum: 306982
% kept mid-nuclei: 6129
% kept new demods: 0
% forw unit-subs: 82254
% forw double-subs: 3164
% forw overdouble-subs: 773
% backward subs: 45
% fast unit cutoff: 2026
% full unit cutoff: 0
% dbl unit cutoff: 125
% real runtime : 140.26
% process. runtime: 138.74
% specific non-discr-tree subsumption statistics:
% tried: 16081
% length fails: 213
% strength fails: 2395
% predlist fails: 1021
% aux str. fails: 69
% by-lit fails: 15
% full subs tried: 12354
% full subs fail: 11588
%
% ; 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/PLA013-1+noeq.in")
%
%------------------------------------------------------------------------------