TSTP Solution File: GRP013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP013-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 : art05.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/GRP013-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(14,40,0,28,0,0)
%
%
% START OF PROOF
% 16 [] product(identity,X,X).
% 17 [] product(X,identity,X).
% 22 [] -product(X,Y,Z) | -product(U,V,X) | -product(V,Y,W) | product(U,W,Z).
% 23 [] -product(X,Y,Z) | -product(X,U,V) | -product(U,W,Y) | product(V,W,Z).
% 24 [] product(X,X,identity).
% 25 [] product(a,b,c).
% 26 [] product(inverse(a),inverse(b),d).
% 27 [] -product(inverse(X),inverse(Y),Z) | product(X,Z,Y).
% 28 [] -product(c,d,identity).
% 111 [hyper:23,25,24,17] product(c,b,a).
% 117 [hyper:27,26] product(a,d,b).
% 215 [hyper:22,111,24,16] product(c,a,b).
% 253 [hyper:22,117,24,16] product(a,b,d).
% 477 [hyper:22,253,215,24,cut:28] 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 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 16
% derived clauses: 731
% kept clauses: 26
% kept size sum: 115
% kept mid-nuclei: 421
% kept new demods: 3
% forw unit-subs: 250
% 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.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 28
% length fails: 0
% strength fails: 22
% predlist fails: 2
% aux str. fails: 4
% 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/GRP013-1+eq_r.in")
%
%------------------------------------------------------------------------------