TSTP Solution File: PLA014-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA014-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 : art01.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 129.6s
% Output : Assurance 129.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/PLA014-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,66851,5,5607,66852,1,5607,66852,50,5612,66852,40,5612,66883,0,5612,67908,50,5628,67939,0,5628,91550,3,6979,92126,4,7654,93411,1,8329,93411,50,8331,93411,40,8331,93442,0,8331,253908,3,9733,325395,4,10433,325628,5,11160,325628,5,11161,325629,1,11161,325629,50,11170,325629,40,11170,325660,0,11170,326413,50,11176,326444,0,11176,344289,3,12527,345119,4,13202,346267,5,13877,346267,1,13877,346267,50,13879,346267,40,13879,346298,0,13879)
%
%
% START OF PROOF
% 326462 [?] ?
% 326466 [?] ?
% 327325 [?] ?
% 346268 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 346269 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 346271 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 346272 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 346273 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 346274 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 346275 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 346276 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 346277 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 346280 [] differ(a,c).
% 346282 [] differ(a,table).
% 346285 [] differ(b,table).
% 346294 [] holds(clear(b),s0).
% 346295 [] holds(clear(c),s0).
% 346296 [] holds(empty,s0).
% 346298 [] -holds(and(on(a,b),on(b,c)),X).
% 346299 [binary:346268,346298] -holds(on(a,b),X) | -holds(on(b,c),X).
% 346306 [binary:346276,346299.2] -holds(on(a,b),do(putdown(X,Y),Z)) | -holds(on(b,c),Z).
% 346331 [binary:346274,346306] -holds(on(b,c),X) | -holds(holding(a),X) | -holds(clear(b),X).
% 346338 [binary:346269,346331.2,cut:346282] -holds(on(b,c),do(pickup(a),X)) | -holds(clear(b),do(pickup(a),X)) | -holds(clear(a),X) | -holds(empty,X).
% 346455 [binary:346271,346338,cut:326462] -holds(clear(b),do(pickup(a),X)) | -holds(on(b,c),X) | -holds(clear(a),X) | -holds(empty,X).
% 346460 [binary:346272,346455,cut:326462] -holds(on(b,c),X) | -holds(clear(b),X) | -holds(clear(a),X) | -holds(empty,X).
% 346467 [binary:346273,346460.4] -holds(on(b,c),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).
% 346815 [binary:346274,346467] -holds(clear(a),do(putdown(b,c),X)) | -holds(clear(b),do(putdown(b,c),X)) | -holds(holding(b),X) | -holds(clear(c),X).
% 346908 [binary:346275,346815.2] -holds(clear(a),do(putdown(b,c),X)) | -holds(holding(b),X) | -holds(clear(c),X).
% 346912 [binary:346277,346908,cut:346280] -holds(clear(c),X) | -holds(clear(a),X) | -holds(holding(b),X).
% 346917 [binary:346272,346912] -holds(clear(a),do(pickup(X),Y)) | -holds(holding(b),do(pickup(X),Y)) | -holds(clear(c),Y) | -differ(c,X).
% 346931 [binary:346295,346917.3] -holds(clear(a),do(pickup(X),s0)) | -holds(holding(b),do(pickup(X),s0)) | -differ(c,X).
% 346933 [binary:346269,346931.2,cut:327325,cut:326466,cut:346294,cut:346285,cut:346296] 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: 23328
% derived clauses: 1852155
% kept clauses: 185590
% kept size sum: 307141
% kept mid-nuclei: 6129
% kept new demods: 0
% forw unit-subs: 82249
% forw double-subs: 3176
% forw overdouble-subs: 772
% backward subs: 48
% fast unit cutoff: 2039
% full unit cutoff: 0
% dbl unit cutoff: 125
% real runtime : 139.29
% process. runtime: 138.82
% specific non-discr-tree subsumption statistics:
% tried: 16104
% length fails: 218
% strength fails: 2410
% predlist fails: 1022
% aux str. fails: 70
% by-lit fails: 15
% full subs tried: 12355
% full subs fail: 11590
%
% ; 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/PLA014-1+noeq.in")
%
%------------------------------------------------------------------------------