TSTP Solution File: PLA018-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA018-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 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/PLA018-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,66858,5,5606,66858,1,5606,66858,50,5611,66858,40,5611,66889,0,5611,67914,50,5627,67945,0,5627,91630,3,6978,92129,4,7657,93309,5,8328,93309,1,8328,93309,50,8330,93309,40,8330,93340,0,8330,245930,3,9732,309370,4,10431,309576,5,11132,309577,5,11135,309578,1,11135,309578,50,11145,309578,40,11145,309609,0,11145,310362,50,11153,310393,0,11153,328129,3,12504,328278,4,13179,329880,5,13854,329880,1,13854,329880,50,13856,329880,40,13856,329911,0,13856)
%
%
% START OF PROOF
% 310412 [?] ?
% 310415 [?] ?
% 311317 [?] ?
% 311356 [?] ?
% 329881 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 329882 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 329883 [] holds(clear(X),do(pickup(Y),Z)) | -holds(on(Y,X),Z) | -holds(clear(Y),Z) | -holds(empty,Z).
% 329884 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 329885 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 329886 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329887 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329888 [] holds(clear(X),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 329889 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 329890 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 329893 [] differ(a,c).
% 329894 [] differ(a,d).
% 329895 [] differ(a,table).
% 329899 [] differ(c,d).
% 329900 [] differ(c,table).
% 329901 [] differ(d,table).
% 329904 [] holds(on(c,d),s0).
% 329906 [] holds(clear(a),s0).
% 329909 [] holds(empty,s0).
% 329910 [] holds(clear(table),X).
% 329911 [] -holds(and(on(a,b),on(d,c)),X).
% 329912 [binary:329881,329911] -holds(on(a,b),X) | -holds(on(d,c),X).
% 329918 [binary:329889,329912] -holds(on(d,c),do(putdown(X,Y),Z)) | -holds(on(a,b),Z).
% 329921 [binary:329887,329918] -holds(on(a,b),X) | -holds(holding(d),X) | -holds(clear(c),X).
% 329923 [binary:329882,329921.2,cut:329901] -holds(on(a,b),do(pickup(d),X)) | -holds(clear(c),do(pickup(d),X)) | -holds(clear(d),X) | -holds(empty,X).
% 329975 [binary:329884,329923,cut:329894] -holds(clear(c),do(pickup(d),X)) | -holds(on(a,b),X) | -holds(clear(d),X) | -holds(empty,X).
% 329983 [binary:329885,329975,cut:329899] -holds(on(a,b),X) | -holds(clear(c),X) | -holds(clear(d),X) | -holds(empty,X).
% 329990 [binary:329886,329983.4] -holds(on(a,b),do(putdown(X,Y),Z)) | -holds(clear(d),do(putdown(X,Y),Z)) | -holds(clear(c),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 330269 [binary:329888,329990.3] -holds(on(a,b),do(putdown(c,X),Y)) | -holds(clear(d),do(putdown(c,X),Y)) | -holds(holding(c),Y) | -holds(clear(X),Y).
% 330651 [binary:329889,330269] -holds(clear(d),do(putdown(c,X),Y)) | -holds(on(a,b),Y) | -holds(holding(c),Y) | -holds(clear(X),Y).
% 330673 [binary:329910,330651.4] -holds(clear(d),do(putdown(c,table),X)) | -holds(on(a,b),X) | -holds(holding(c),X).
% 330675 [binary:329890,330673,cut:329901] -holds(on(a,b),X) | -holds(holding(c),X) | -holds(clear(d),X).
% 330679 [binary:329884,330675] -holds(holding(c),do(pickup(X),Y)) | -holds(clear(d),do(pickup(X),Y)) | -holds(on(a,b),Y) | -differ(a,X).
% 330721 [binary:329882,330679,cut:329893,cut:329900] -holds(clear(d),do(pickup(c),X)) | -holds(on(a,b),X) | -holds(clear(c),X) | -holds(empty,X).
% 330732 [binary:329883,330721] -holds(on(a,b),X) | -holds(on(c,d),X) | -holds(clear(c),X) | -holds(empty,X).
% 330739 [binary:329886,330732.4] -holds(on(a,b),do(putdown(X,Y),Z)) | -holds(on(c,d),do(putdown(X,Y),Z)) | -holds(clear(c),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 332513 [binary:329887,330739] -holds(on(c,d),do(putdown(a,b),X)) | -holds(clear(c),do(putdown(a,b),X)) | -holds(holding(a),X) | -holds(clear(b),X).
% 332533 [binary:329889,332513] -holds(clear(c),do(putdown(a,b),X)) | -holds(on(c,d),X) | -holds(clear(b),X) | -holds(holding(a),X).
% 332536 [binary:329890,332533,cut:310415] -holds(on(c,d),X) | -holds(holding(a),X) | -holds(clear(c),X) | -holds(clear(b),X).
% 332541 [binary:329884,332536] -holds(clear(b),do(pickup(X),Y)) | -holds(holding(a),do(pickup(X),Y)) | -holds(clear(c),do(pickup(X),Y)) | -holds(on(c,d),Y) | -differ(c,X).
% 335519 [binary:329904,332541.4] -holds(clear(b),do(pickup(X),s0)) | -holds(clear(c),do(pickup(X),s0)) | -holds(holding(a),do(pickup(X),s0)) | -differ(c,X).
% 335521 [binary:329882,335519.3,cut:311356,cut:311317,cut:310412,cut:329906,cut:329895,cut:329909] 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: 24888
% derived clauses: 1842020
% kept clauses: 188168
% kept size sum: 384464
% kept mid-nuclei: 6108
% kept new demods: 0
% forw unit-subs: 83883
% forw double-subs: 4401
% forw overdouble-subs: 4803
% backward subs: 350
% fast unit cutoff: 5584
% full unit cutoff: 2
% dbl unit cutoff: 125
% real runtime : 142.84
% process. runtime: 141.77
% specific non-discr-tree subsumption statistics:
% tried: 106084
% length fails: 4997
% strength fails: 40675
% predlist fails: 11147
% aux str. fails: 1462
% by-lit fails: 630
% full subs tried: 46725
% full subs fail: 42186
%
% ; 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/PLA018-1+noeq.in")
%
%------------------------------------------------------------------------------