TSTP Solution File: GRP617-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP617-1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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 39.8s
% Output : Assurance 39.8s
% 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/GRP617-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 4 7)
% (binary-posweight-order 29 #f 4 7)
% (binary-unit 29 #f 4 7)
% (binary-double 29 #f 4 7)
% (binary 29 #t 4 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(19,40,0,38,0,0,191767,4,4373)
%
%
% START OF PROOF
% 20 [] equal(X,X).
% 21 [] product(identity,X,X).
% 22 [] product(X,identity,X).
% 23 [] product(inverse(X),X,identity).
% 24 [] product(X,inverse(X),identity).
% 25 [] product(X,Y,multiply(X,Y)).
% 26 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 27 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 28 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 29 [] subgroup1_member(inverse(X)) | -subgroup1_member(X).
% 30 [] -product(X,Y,Z) | -subgroup1_member(X) | -subgroup1_member(Y) | subgroup1_member(Z).
% 31 [] subgroup2_member(inverse(X)) | -subgroup2_member(X).
% 32 [] -product(X,Y,Z) | -subgroup2_member(X) | -subgroup2_member(Y) | subgroup2_member(Z).
% 33 [] -equal(multiply(v,u),multiply(u,v)).
% 34 [] subgroup1_member(multiply(X,multiply(Y,inverse(X)))) | -subgroup1_member(Y).
% 35 [] subgroup2_member(multiply(X,multiply(Y,inverse(X)))) | -subgroup2_member(Y).
% 36 [] equal(X,identity) | -subgroup2_member(X) | -subgroup1_member(X).
% 37 [] subgroup1_member(v).
% 38 [] subgroup2_member(u).
% 41 [hyper:29,37] subgroup1_member(inverse(v)).
% 46 [hyper:31,38] subgroup2_member(inverse(u)).
% 49 [hyper:34,41] subgroup1_member(multiply(X,multiply(inverse(v),inverse(X)))).
% 54 [hyper:35,46] subgroup2_member(multiply(X,multiply(inverse(u),inverse(X)))).
% 111 [hyper:27,23,21,23] product(inverse(inverse(X)),identity,X).
% 206 [hyper:26,25,21] equal(X,multiply(identity,X)).
% 207 [hyper:26,25,22] equal(X,multiply(X,identity)).
% 220 [hyper:27,25,25,23,demod:206] product(inverse(X),multiply(X,Y),Y).
% 221 [hyper:27,25,25,24,demod:206] product(X,multiply(inverse(X),Y),Y).
% 222 [hyper:27,25,25,25] product(X,multiply(Y,Z),multiply(multiply(X,Y),Z)).
% 252 [hyper:28,25,25,23,demod:207] product(multiply(X,inverse(Y)),Y,X).
% 253 [hyper:28,25,25,24,demod:207] product(multiply(X,Y),inverse(Y),X).
% 254 [hyper:28,25,25,25] product(multiply(X,Y),Z,multiply(X,multiply(Y,Z))).
% 255 [hyper:28,25,24,25] product(identity,X,multiply(Y,multiply(inverse(Y),X))).
% 420 [hyper:26,111,22] equal(inverse(inverse(X)),X).
% 914 [para:420.1.1,49.1.1.2.2] subgroup1_member(multiply(inverse(X),multiply(inverse(v),X))).
% 1002 [hyper:26,220,25] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 1067 [hyper:28,220,24,111] product(X,inverse(multiply(inverse(Y),X)),Y).
% 1174 [para:420.1.1,54.1.1.2.2] subgroup2_member(multiply(inverse(X),multiply(inverse(u),X))).
% 1180 [hyper:26,221,25] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 1614 [hyper:27,253,252,21,demod:206] product(inverse(multiply(X,Y)),X,inverse(Y)).
% 1833 [hyper:26,222,25] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 3135 [para:1002.1.1,914.1.1.2] subgroup1_member(multiply(inverse(multiply(v,X)),X)).
% 3136 [para:1002.1.1,1174.1.1.2] subgroup2_member(multiply(inverse(multiply(u,X)),X)).
% 3149 [hyper:30,3135,254,37] subgroup1_member(multiply(inverse(multiply(v,X)),multiply(X,v))).
% 3306 [hyper:32,3136,254,38] subgroup2_member(multiply(inverse(multiply(u,X)),multiply(X,u))).
% 3663 [hyper:27,1067,255,23,demod:1180] product(inverse(X),Y,inverse(multiply(inverse(Y),X))).
% 6538 [hyper:26,3663,25] equal(multiply(inverse(X),Y),inverse(multiply(inverse(Y),X))).
% 9363 [hyper:29,3149,demod:6538] subgroup1_member(multiply(inverse(multiply(X,v)),multiply(v,X))).
% 9441 [hyper:36,9363,3306] equal(multiply(inverse(multiply(u,v)),multiply(v,u)),identity).
% 15481 [para:9441.1.1,1002.1.1.2,demod:207,1833,420] equal(multiply(u,v),multiply(v,u)).
% 15483 [para:15481.1.1,220.1.2] product(inverse(u),multiply(v,u),v).
% 15485 [para:15481.1.1,222.1.3.1,demod:1833] product(u,multiply(v,X),multiply(v,multiply(u,X))).
% 25276 [hyper:27,15485,1614,15483] product(inverse(multiply(u,u)),multiply(v,multiply(u,u)),v).
% 84245 [hyper:26,25276,25] equal(multiply(inverse(multiply(u,u)),multiply(v,multiply(u,u))),v).
% 191768 [para:84245.1.2,33.1.1.1,demod:15481,84245,cut:20] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 4
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 467
% derived clauses: 3427855
% kept clauses: 1285
% kept size sum: 17912
% kept mid-nuclei: 190430
% kept new demods: 36
% forw unit-subs: 2602034
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 145
% full unit cutoff: 2
% dbl unit cutoff: 2
% real runtime : 43.79
% process. runtime: 43.73
% specific non-discr-tree subsumption statistics:
% tried: 1363
% length fails: 0
% strength fails: 114
% predlist fails: 283
% aux str. fails: 232
% by-lit fails: 0
% full subs tried: 734
% full subs fail: 734
%
% ; 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/GRP617-1+eq_r.in")
%
%------------------------------------------------------------------------------