TSTP Solution File: PUZ012-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ012-1 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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/PUZ/PUZ012-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 1 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f 1 5)
% (binary 54 #t 1 5)
% (binary-order 27 #f 1 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)
%
%
% SOS clause
% -contains(boxa,bananas) | -contains(boxc,oranges).
% was split for some strategies as:
% -contains(boxa,bananas).
% -contains(boxc,oranges).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(18,40,0,36,0,0)
%
%
% START OF PROOF
% 21 [] -contains(X,Y) | -label(X,Y).
% 22 [] contains(boxb,X) | contains(boxc,X) | contains(boxa,X).
% 23 [] contains(X,bananas) | contains(X,oranges) | contains(X,apples).
% 24 [] -contains(X,Z) | -contains(X,Y) | equal_fruits(Y,Z).
% 29 [] -equal_fruits(apples,bananas).
% 30 [] -equal_fruits(bananas,oranges).
% 32 [] label(boxa,apples).
% 33 [] label(boxb,oranges).
% 34 [] label(boxc,bananas).
% 35 [] contains(boxb,apples).
% 36 [] -contains(boxa,bananas) | -contains(boxc,oranges).
% 60 [hyper:21,22,33] contains(boxa,oranges) | contains(boxc,oranges).
% 62 [hyper:21,22,34] contains(boxa,bananas) | contains(boxb,bananas).
% 108 [hyper:21,23,32] contains(boxa,bananas) | contains(boxa,oranges).
% 161 [hyper:36,60,binarycut:108] contains(boxa,oranges).
% 199 [hyper:24,62,161,cut:30] contains(boxb,bananas).
% 204 [hyper:24,199,35,cut:29] 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 1
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22
% derived clauses: 483
% kept clauses: 48
% kept size sum: 555
% kept mid-nuclei: 110
% kept new demods: 0
% forw unit-subs: 183
% forw double-subs: 22
% forw overdouble-subs: 111
% backward subs: 2
% fast unit cutoff: 28
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 537
% length fails: 0
% strength fails: 145
% predlist fails: 128
% aux str. fails: 4
% by-lit fails: 28
% full subs tried: 223
% full subs fail: 121
%
% ; 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/PUZ/PUZ012-1+noeq.in")
%
%------------------------------------------------------------------------------