TSTP Solution File: COM002-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COM002-2 : 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 : 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 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/COM/COM002-2+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(19,40,0,38,0,0)
%
%
% START OF PROOF
% 20 [] -follows(X,Y) | -fails(X,Y).
% 21 [] -fails(X,Y) | fails(X,Z) | fails(Z,Y).
% 22 [] -has(X,goto(Y)) | -labels(Y,Z) | -fails(Z,X).
% 27 [] labels(loop,p3).
% 32 [] follows(p6,p3).
% 34 [] follows(p7,p6).
% 36 [] follows(p8,p7).
% 37 [] has(p8,goto(loop)).
% 38 [] fails(p3,p3).
% 47 [hyper:21,38] fails(p3,X) | fails(X,p3).
% 65 [hyper:20,47,32] fails(p3,p6).
% 82 [hyper:21,65] fails(p3,X) | fails(X,p6).
% 133 [hyper:20,82,34] fails(p3,p7).
% 145 [hyper:21,133] fails(p3,X) | fails(X,p7).
% 379 [hyper:20,145,36] fails(p3,p8).
% 429 [hyper:22,379,37,cut:27] 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 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 49
% derived clauses: 671
% kept clauses: 51
% kept size sum: 306
% kept mid-nuclei: 308
% kept new demods: 0
% forw unit-subs: 164
% forw double-subs: 66
% forw overdouble-subs: 60
% backward subs: 0
% fast unit cutoff: 10
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 348
% length fails: 43
% strength fails: 19
% predlist fails: 86
% aux str. fails: 17
% by-lit fails: 0
% full subs tried: 183
% full subs fail: 119
%
% ; 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/COM/COM002-2+noeq.in")
%
%------------------------------------------------------------------------------