TSTP Solution File: GRP001-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP001-5 : 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 : art01.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/GRP/GRP001-5+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 1 7)
% (binary-unit 28 #f 1 7)
% (binary-double 28 #f 1 7)
% (binary-posweight-order 28 #f 1 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(7,40,0,14,0,0)
%
%
% START OF PROOF
% 8 [] product(identity,X,X).
% 9 [] product(X,identity,X).
% 10 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 11 [] -product(X,Y,Z) | -product(X,U,V) | -product(U,W,Y) | product(V,W,Z).
% 12 [] product(X,X,identity).
% 13 [] product(a,b,c).
% 14 [] -product(b,a,c).
% 78 [hyper:10,13,12,8] product(a,c,b).
% 89 [hyper:11,13,12,9] product(c,b,a).
% 154 [hyper:11,78,12,9] product(b,c,a).
% 253 [hyper:10,154,89,13,cut:14] 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 7
% clause depth limited to 1
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9
% derived clauses: 406
% kept clauses: 4
% kept size sum: 16
% kept mid-nuclei: 233
% kept new demods: 0
% forw unit-subs: 139
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 22
% length fails: 0
% strength fails: 22
% 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/GRP/GRP001-5+noeq.in")
%
%------------------------------------------------------------------------------