TSTP Solution File: PLA023-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA023-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 : art09.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.1s
% Output : Assurance 139.1s
% 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/PLA023-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,66845,5,5606,66845,1,5606,66845,50,5617,66845,40,5617,66876,0,5617,67901,50,5632,67932,0,5632,91495,3,6983,92107,4,7658,93358,1,8333,93358,50,8335,93358,40,8335,93389,0,8335,251924,3,9736,314944,4,10436,315152,5,11136,315152,5,11137,315153,1,11137,315153,50,11147,315153,40,11147,315184,0,11147,315937,50,11165,315968,0,11165,333813,3,12516,334953,4,13191,335789,1,13866,335789,50,13868,335789,40,13868,335820,0,13868)
%
%
% START OF PROOF
% 315987 [?] ?
% 315988 [?] ?
% 315993 [?] ?
% 315997 [?] ?
% 335790 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 335791 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 335793 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 335794 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 335795 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 335796 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 335797 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 335798 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 335799 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 335802 [] differ(a,c).
% 335803 [] differ(a,d).
% 335804 [] differ(a,table).
% 335809 [] differ(c,table).
% 335810 [] differ(d,table).
% 335815 [] holds(clear(a),s0).
% 335817 [] holds(clear(c),s0).
% 335818 [] holds(empty,s0).
% 335819 [] holds(clear(table),X).
% 335820 [] -holds(and(on(d,a),on(a,c)),X).
% 335821 [binary:335790,335820] -holds(on(d,a),X) | -holds(on(a,c),X).
% 335828 [binary:335798,335821.2] -holds(on(d,a),do(putdown(X,Y),Z)) | -holds(on(a,c),Z).
% 335847 [binary:335796,335828] -holds(on(a,c),X) | -holds(holding(d),X) | -holds(clear(a),X).
% 335849 [binary:335791,335847.2,cut:335810] -holds(on(a,c),do(pickup(d),X)) | -holds(clear(a),do(pickup(d),X)) | -holds(clear(d),X) | -holds(empty,X).
% 335975 [binary:335793,335849,cut:335803] -holds(clear(a),do(pickup(d),X)) | -holds(on(a,c),X) | -holds(clear(d),X) | -holds(empty,X).
% 335984 [binary:335794,335975,cut:335803] -holds(on(a,c),X) | -holds(clear(a),X) | -holds(clear(d),X) | -holds(empty,X).
% 335998 [binary:335795,335984.4] -holds(on(a,c),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).
% 336383 [binary:335796,335998] -holds(clear(d),do(putdown(a,c),X)) | -holds(clear(a),do(putdown(a,c),X)) | -holds(holding(a),X) | -holds(clear(c),X).
% 336702 [binary:335797,336383.2] -holds(clear(d),do(putdown(a,c),X)) | -holds(holding(a),X) | -holds(clear(c),X).
% 336705 [binary:335799,336702,cut:315993] -holds(clear(c),X) | -holds(clear(d),X) | -holds(holding(a),X).
% 336710 [binary:335794,336705] -holds(clear(d),do(pickup(X),Y)) | -holds(holding(a),do(pickup(X),Y)) | -holds(clear(c),Y) | -differ(c,X).
% 336718 [binary:335791,336710.2,cut:315987,cut:335804] -holds(clear(d),do(pickup(a),X)) | -holds(clear(a),X) | -holds(clear(c),X) | -holds(empty,X).
% 336757 [binary:335794,336718,cut:315988] -holds(clear(d),X) | -holds(clear(a),X) | -holds(clear(c),X) | -holds(empty,X).
% 336765 [binary:335795,336757.4] -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(c),do(putdown(X,Y),Z)) | -holds(clear(a),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 338818 [binary:335797,336765.2] -holds(clear(d),do(putdown(c,X),Y)) | -holds(clear(a),do(putdown(c,X),Y)) | -holds(holding(c),Y) | -holds(clear(X),Y).
% 339338 [binary:335819,338818.4] -holds(clear(a),do(putdown(c,table),X)) | -holds(clear(d),do(putdown(c,table),X)) | -holds(holding(c),X).
% 339369 [binary:335799,339338,cut:335804] -holds(clear(d),do(putdown(c,table),X)) | -holds(holding(c),X) | -holds(clear(a),X).
% 339373 [binary:335799,339369,cut:335810] -holds(clear(a),X) | -holds(clear(d),X) | -holds(holding(c),X).
% 339379 [binary:335794,339373] -holds(clear(d),do(pickup(X),Y)) | -holds(holding(c),do(pickup(X),Y)) | -holds(clear(a),Y) | -differ(a,X).
% 339399 [binary:335815,339379.3] -holds(clear(d),do(pickup(X),s0)) | -holds(holding(c),do(pickup(X),s0)) | -differ(a,X).
% 339401 [binary:335791,339399.2,cut:315997,cut:335802,cut:335817,cut:335809,cut:335818] 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: 24568
% derived clauses: 1859487
% kept clauses: 187266
% kept size sum: 349231
% kept mid-nuclei: 6105
% kept new demods: 0
% forw unit-subs: 82311
% forw double-subs: 4164
% forw overdouble-subs: 3295
% backward subs: 344
% fast unit cutoff: 4075
% full unit cutoff: 0
% dbl unit cutoff: 126
% real runtime : 140.98
% process. runtime: 139.96
% specific non-discr-tree subsumption statistics:
% tried: 72932
% length fails: 2568
% strength fails: 30523
% predlist fails: 3424
% aux str. fails: 1312
% by-lit fails: 361
% full subs tried: 34484
% full subs fail: 31320
%
% ; 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/PLA023-1+noeq.in")
%
%------------------------------------------------------------------------------