↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP040-4 : 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 : art09.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/GRP040-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 24 [] product(identity,X,X).
% 25 [] product(X,identity,X).
% 26 [] product(inverse(X),X,identity).
% 28 [] product(X,Y,multiply(X,Y)).
% 29 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 30 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 31 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 32 [] -product(X,inverse(Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 33 [] subgroup_member(identity).
% 34 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 35 [] -product(X,U,Z) | -product(X,Y,Z) | equal(U,Y).
% 37 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 38 [] product(X,element_in_^o2(X,Y),Y) | subgroup_member(Y) | subgroup_member(X).
% 39 [] -subgroup_member(a).
% 40 [] subgroup_member(b).
% 41 [] -subgroup_member(d).
% 42 [] product(b,inverse(a),c).
% 43 [] product(a,c,d).
% 44 [] equal(inverse(inverse(X)),X).
% 49 [hyper:34,40] subgroup_member(inverse(b)).
% 178 [hyper:31,26,42,25] product(c,a,b).
% 204 [hyper:30,178,24,26] product(inverse(c),b,a).
% 503 [hyper:29,204,28] equal(multiply(inverse(c),b),a).
% 1548 [hyper:39,37] subgroup_member(element_in_^o2(a,X)) | subgroup_member(X).
% 1758 [hyper:41,1548] subgroup_member(element_in_^o2(a,d)).
% 1840 [hyper:32,1758,24,cut:33] subgroup_member(inverse(element_in_^o2(a,d))).
% 2141 [hyper:35,38,43,cut:41,cut:39] equal(element_in_^o2(a,d),c).
% 2254 [hyper:32,1840,28,49,demod:2141,demod:503,44,cut:39] 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 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    61
%  derived clauses:   5724
%  kept clauses:      575
%  kept size sum:     6602
%  kept mid-nuclei:   1593
%  kept new demods:   18
%  forw unit-subs:    2215
%  forw double-subs: 228
%  forw overdouble-subs: 321
%  backward subs:     0
%  fast unit cutoff:  105
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.10
%  process. runtime:  0.8
% specific non-discr-tree subsumption statistics: 
%  tried:           3225
%  length fails:    149
%  strength fails:  1146
%  predlist fails:  141
%  aux str. fails:  160
%  by-lit fails:    13
%  full subs tried: 1604
%  full subs fail:  1287
% 
% ; 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/GRP040-4+eq_r.in")
% 
%------------------------------------------------------------------------------