TSTP Solution File: GRP039-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP039-6 : 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/GRP039-6+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 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (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(22,40,2,44,0,2)
%
%
% START OF PROOF
% 23 [] -equalish(X,Y) | -subgroup_member(X) | subgroup_member(Y).
% 27 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 28 [] -product(X,Y,Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 29 [] product(identity,X,X).
% 30 [] product(X,identity,X).
% 31 [] product(inverse(X),X,identity).
% 33 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 34 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 37 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(U,Y).
% 39 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 40 [] product(X,element_in_^o2(X,Y),Y) | subgroup_member(Y) | subgroup_member(X).
% 41 [] subgroup_member(b).
% 42 [] product(b,inverse(a),c).
% 43 [] product(a,c,d).
% 44 [] -subgroup_member(d).
% 188 [hyper:34,31,42,30] product(c,a,b).
% 228 [hyper:33,188,29,31] product(inverse(c),b,a).
% 2317 [hyper:44,39] subgroup_member(element_in_^o2(X,d)) | subgroup_member(X).
% 2392 [hyper:27,2317] subgroup_member(element_in_^o2(X,d)) | subgroup_member(inverse(X)).
% 2526 [hyper:28,2392,42,cut:41] subgroup_member(element_in_^o2(a,d)) | subgroup_member(c).
% 2576 [hyper:28,2526,43,39,cut:44,factor:cut:44] subgroup_member(element_in_^o2(a,d)).
% 2751 [hyper:37,40,43,cut:44] equalish(element_in_^o2(a,d),c) | subgroup_member(a).
% 5427 [hyper:23,2751,cut:2576] subgroup_member(a) | subgroup_member(c).
% 5459 [hyper:27,5427] subgroup_member(inverse(a)) | subgroup_member(c).
% 5481 [hyper:28,5459,42,cut:41] subgroup_member(c).
% 5509 [hyper:27,5481] subgroup_member(inverse(c)).
% 5540 [hyper:28,5509,228,cut:41] subgroup_member(a).
% 5547 [hyper:28,5540,43,cut:5481] subgroup_member(d).
% 5553 [hyper:44,5547] 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: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 95
% derived clauses: 21891
% kept clauses: 382
% kept size sum: 3709
% kept mid-nuclei: 5076
% kept new demods: 0
% forw unit-subs: 8627
% forw double-subs: 893
% forw overdouble-subs: 741
% backward subs: 24
% fast unit cutoff: 1077
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.22
% process. runtime: 0.20
% specific non-discr-tree subsumption statistics:
% tried: 3205
% length fails: 332
% strength fails: 372
% predlist fails: 339
% aux str. fails: 162
% by-lit fails: 0
% full subs tried: 1999
% full subs fail: 1258
%
% ; 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/GRP039-6+noeq.in")
%
%------------------------------------------------------------------------------