TSTP Solution File: MSC001-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MSC001-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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 0.0s
% Output : Assurance 0.0s
% 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/MSC/MSC001-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 16 #f 3 5)
% (binary 54 #t 3 5)
% (binary-order 27 #f 3 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(18,40,0,36,0,0,92,50,0,110,0,0,252,50,0,270,0,0)
%
%
% START OF PROOF
% 254 [] -hold(thing(X),do(let_go,Y)).
% 256 [] at(hand,X,do(go(X),Y)).
% 258 [] -at(thing(X),Y,do(go(Y),Z)) | at(thing(X),Y,Z) | hold(thing(X),Z).
% 259 [] hold(thing(taken(X)),do(pick_up,X)) | -at(thing(Y),Z,X) | -at(hand,Z,X).
% 260 [] at(thing(X),Y,Z) | -hold(thing(X),Z) | -at(hand,Y,Z).
% 262 [] -at(X,there,Y) | -red(X) | answer(Y).
% 264 [] hold(thing(X),do(go(Y),Z)) | -hold(thing(X),Z).
% 265 [] at(thing(taken(X)),Y,X) | -at(hand,Y,X).
% 268 [] -at(X,Y,do(let_go,Z)) | at(X,Y,Z).
% 269 [] -at(X,here,now) | red(X).
% 270 [] -answer(X).
% 284 [hyper:265,256] at(thing(taken(do(go(X),Y))),X,do(go(X),Y)).
% 342 [hyper:259,256,slowcut:284] hold(thing(taken(do(go(X),Y))),do(pick_up,do(go(X),Y))).
% 429 [hyper:258,284] at(thing(taken(do(go(X),Y))),X,Y) | hold(thing(taken(do(go(X),Y))),Y).
% 505 [hyper:264,342] hold(thing(taken(do(go(X),Y))),do(go(Z),do(pick_up,do(go(X),Y)))).
% 592 [hyper:268,429,cut:254] at(thing(taken(do(go(X),do(let_go,Y)))),X,Y).
% 599 [hyper:269,592] red(thing(taken(do(go(here),do(let_go,now))))).
% 832 [hyper:260,505,256] at(thing(taken(do(go(X),Y))),Z,do(go(Z),do(pick_up,do(go(X),Y)))).
% 948 [hyper:262,832,599,cut:270] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 5
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 230
% derived clauses: 2629
% kept clauses: 212
% kept size sum: 2862
% kept mid-nuclei: 617
% kept new demods: 0
% forw unit-subs: 718
% forw double-subs: 23
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 3
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/MSC/MSC001-1+noeq.in")
%
%------------------------------------------------------------------------------