TSTP Solution File: PLA021-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA021-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 130.1s
% Output : Assurance 130.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/PLA021-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,66830,5,5607,66831,1,5607,66831,50,5612,66831,40,5612,66862,0,5612,67887,50,5628,67918,0,5628,91894,3,6979,92254,4,7654,93924,5,8329,93925,1,8329,93925,50,8331,93925,40,8331,93956,0,8331,263876,3,9732,337908,4,10436,338073,5,11139,338073,5,11141,338074,1,11141,338074,50,11149,338074,40,11149,338105,0,11149,338858,50,11155,338889,0,11155,356734,3,12506,357427,4,13181,358710,5,13856,358710,1,13856,358710,50,13858,358710,40,13858,358741,0,13858)
%
%
% START OF PROOF
% 338907 [?] ?
% 338909 [?] ?
% 338911 [?] ?
% 338912 [?] ?
% 338918 [?] ?
% 339771 [?] ?
% 339810 [?] ?
% 358711 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 358712 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 358714 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 358715 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 358716 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 358717 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 358719 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 358720 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 358728 [] differ(b,table).
% 358730 [] differ(c,table).
% 358738 [] holds(clear(c),s0).
% 358739 [] holds(empty,s0).
% 358741 [] -holds(and(on(b,d),on(c,a)),X).
% 358742 [binary:358711,358741] -holds(on(b,d),X) | -holds(on(c,a),X).
% 358749 [binary:358719,358742.2] -holds(on(b,d),do(putdown(X,Y),Z)) | -holds(on(c,a),Z).
% 358772 [binary:358717,358749] -holds(on(c,a),X) | -holds(holding(b),X) | -holds(clear(d),X).
% 358774 [binary:358712,358772.2,cut:358728] -holds(on(c,a),do(pickup(b),X)) | -holds(clear(d),do(pickup(b),X)) | -holds(clear(b),X) | -holds(empty,X).
% 358900 [binary:358714,358774,cut:338911] -holds(clear(d),do(pickup(b),X)) | -holds(on(c,a),X) | -holds(clear(b),X) | -holds(empty,X).
% 358911 [binary:358715,358900,cut:338912] -holds(on(c,a),X) | -holds(clear(d),X) | -holds(clear(b),X) | -holds(empty,X).
% 358927 [binary:358716,358911.4] -holds(on(c,a),do(putdown(X,Y),Z)) | -holds(clear(b),do(putdown(X,Y),Z)) | -holds(clear(d),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 359277 [binary:358717,358927] -holds(clear(b),do(putdown(c,a),X)) | -holds(clear(d),do(putdown(c,a),X)) | -holds(holding(c),X) | -holds(clear(a),X).
% 359336 [binary:358720,359277,cut:338907] -holds(clear(d),do(putdown(c,a),X)) | -holds(clear(a),X) | -holds(clear(b),X) | -holds(holding(c),X).
% 359339 [binary:358720,359336,cut:338909] -holds(holding(c),X) | -holds(clear(d),X) | -holds(clear(a),X) | -holds(clear(b),X).
% 359341 [binary:358712,359339,cut:358730] -holds(clear(b),do(pickup(c),X)) | -holds(clear(d),do(pickup(c),X)) | -holds(clear(a),do(pickup(c),X)) | -holds(clear(c),X) | -holds(empty,X).
% 360746 [binary:358738,359341.4,cut:339771,cut:338918,cut:339810,cut:358739] 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: 23982
% derived clauses: 1883837
% kept clauses: 188500
% kept size sum: 329346
% kept mid-nuclei: 6041
% kept new demods: 0
% forw unit-subs: 82967
% forw double-subs: 3956
% forw overdouble-subs: 1894
% backward subs: 89
% fast unit cutoff: 2996
% full unit cutoff: 0
% dbl unit cutoff: 130
% real runtime : 138.92
% process. runtime: 138.90
% specific non-discr-tree subsumption statistics:
% tried: 33628
% length fails: 766
% strength fails: 10507
% predlist fails: 2597
% aux str. fails: 338
% by-lit fails: 107
% full subs tried: 19111
% full subs fail: 17369
%
% ; 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/PLA021-1+noeq.in")
%
%------------------------------------------------------------------------------