TSTP Solution File: PLA009-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PLA009-2 : 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 : art06.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 49.5s
% Output : Assurance 49.5s
% 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/PLA009-2+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)
%
%
% START OF PROOF
% 1014 [] holds(and(X,Y),Z) | -holds(X,Z) | -holds(Y,Z).
% 1015 [] holds(holding(X),do(pickup(X),Y)) | -holds(clear(X),Y) | -differ(X,table) | -holds(empty,Y).
% 1016 [] holds(clear(X),do(pickup(Y),Z)) | -holds(on(Y,X),Z) | -holds(clear(Y),Z) | -holds(empty,Z).
% 1017 [] holds(on(X,Y),do(pickup(Z),U)) | -holds(on(X,Y),U) | -differ(X,Z).
% 1018 [] holds(clear(X),do(pickup(Y),Z)) | -holds(clear(X),Z) | -differ(X,Y).
% 1019 [] holds(empty,do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 1020 [] holds(on(X,Y),do(putdown(X,Y),Z)) | -holds(holding(X),Z) | -holds(clear(Y),Z).
% 1022 [] holds(on(X,Y),do(putdown(Z,U),V)) | -holds(on(X,Y),V).
% 1023 [] holds(clear(X),do(putdown(Y,Z),U)) | -holds(clear(X),U) | -differ(X,Z).
% 1024 [] -differ(X,Y) | differ(Y,X).
% 1025 [] differ(a,b).
% 1026 [] differ(a,c).
% 1028 [] differ(a,table).
% 1029 [] differ(b,c).
% 1037 [] holds(on(c,d),s0).
% 1039 [] holds(clear(a),s0).
% 1040 [] holds(clear(b),s0).
% 1041 [] holds(clear(c),s0).
% 1042 [] holds(empty,s0).
% 1044 [] -holds(and(clear(d),on(a,b)),X).
% 1048 [hyper:1024,1025] differ(b,a).
% 1052 [hyper:1024,1026] differ(c,a).
% 1065 [hyper:1024,1029] differ(c,b).
% 1142 [hyper:1015,1039,cut:1028,cut:1042] holds(holding(a),do(pickup(a),s0)).
% 1175 [hyper:1018,1040,1048] holds(clear(b),do(pickup(a),s0)).
% 1203 [hyper:1018,1041,1052] holds(clear(c),do(pickup(a),s0)).
% 1284 [hyper:1017,1037,1052] holds(on(c,d),do(pickup(a),s0)).
% 2373 [hyper:1019,1175,1142] holds(empty,do(putdown(a,b),do(pickup(a),s0))).
% 2375 [hyper:1020,1175,1142] holds(on(a,b),do(putdown(a,b),do(pickup(a),s0))).
% 3099 [hyper:1023,1203,1065] holds(clear(c),do(putdown(X,b),do(pickup(a),s0))).
% 7945 [hyper:1022,1284] holds(on(c,d),do(putdown(X,Y),do(pickup(a),s0))).
% 66327 [binary:1014,1044] -holds(on(a,b),X) | -holds(clear(d),X).
% 66350 [binary:1017,66327] -holds(clear(d),do(pickup(X),Y)) | -holds(on(a,b),Y) | -differ(a,X).
% 66702 [binary:1026,66350.3] -holds(clear(d),do(pickup(c),X)) | -holds(on(a,b),X).
% 66717 [binary:1016,66702] -holds(on(a,b),X) | -holds(on(c,d),X) | -holds(clear(c),X) | -holds(empty,X).
% 66718 [binary:2375,66717,cut:7945,cut:3099,cut:2373] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 4
% seconds given: 57
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6532
% derived clauses: 172457
% kept clauses: 60623
% kept size sum: 0
% kept mid-nuclei: 5958
% kept new demods: 0
% forw unit-subs: 63224
% forw double-subs: 39
% forw overdouble-subs: 81
% backward subs: 0
% fast unit cutoff: 213
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime : 50.80
% process. runtime: 50.26
% specific non-discr-tree subsumption statistics:
% tried: 275
% length fails: 0
% strength fails: 87
% predlist fails: 16
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 172
% full subs fail: 91
%
% ; 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/PLA009-2+noeq.in")
%
%------------------------------------------------------------------------------