TSTP Solution File: GRP039-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP039-2 : 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 20.0s
% Output : Assurance 20.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-2+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(14,40,0,28,0,0,40467,4,1907,49930,5,2501,49930,1,2501,49930,50,2502,49930,40,2502,49944,0,2502)
%
%
% START OF PROOF
% 49931 [] equal(X,X).
% 49932 [] equal(multiply(identity,X),X).
% 49933 [] equal(multiply(inverse(X),X),identity).
% 49934 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 49935 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 49936 [] -equal(multiply(X,Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 49937 [] equal(multiply(X,identity),X).
% 49939 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 49940 [] equal(multiply(X,element_in_^o2(X,Y)),Y) | subgroup_member(Y) | subgroup_member(X).
% 49941 [] subgroup_member(b).
% 49942 [] equal(multiply(b,inverse(a)),c).
% 49943 [] equal(multiply(a,c),d).
% 49944 [] -subgroup_member(d).
% 49949 [binary:49941,49935.2] subgroup_member(inverse(b)).
% 49953 [para:49933.1.1,49934.1.1.1,demod:49932] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 49964 [binary:49931,49936] subgroup_member(multiply(X,Y)) | -subgroup_member(Y) | -subgroup_member(X).
% 49970 [binary:49942,49936,cut:49941,binarydemod:49935] -subgroup_member(a) | subgroup_member(c).
% 49973 [binary:49943,49936,cut:49944] -subgroup_member(a) | -subgroup_member(c).
% 50011 [para:49943.1.1,49953.1.2.2] equal(c,multiply(inverse(a),d)).
% 50012 [para:49933.1.1,49953.1.2.2,demod:49937] equal(X,inverse(inverse(X))).
% 50015 [para:49940.1.1,49953.1.2.2] equal(element_in_^o2(X,Y),multiply(inverse(X),Y)) | subgroup_member(Y) | subgroup_member(X).
% 50017 [para:50012.1.2,49935.1.1] -subgroup_member(inverse(X)) | subgroup_member(X).
% 50081 [binary:49949,49964.3] subgroup_member(multiply(inverse(b),X)) | -subgroup_member(X).
% 50131 [para:49953.1.2,50081.1.1] -subgroup_member(multiply(b,X)) | subgroup_member(X).
% 50136 [para:49942.1.1,50131.1.1,binarydemod:50017,binarycut:49973] -subgroup_member(c).
% 50142 [binary:49970.2,50136] -subgroup_member(a).
% 50629 [para:50015.1.2,50011.1.2,cut:49944,cut:50142] equal(c,element_in_^o2(a,d)).
% 50649 [para:50629.1.2,49939.1.1,cut:50136,cut:49944,cut:50142] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 7
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 460
% derived clauses: 662828
% kept clauses: 40446
% kept size sum: 680205
% kept mid-nuclei: 6964
% kept new demods: 54
% forw unit-subs: 73877
% forw double-subs: 88308
% forw overdouble-subs: 170118
% backward subs: 164
% fast unit cutoff: 10707
% full unit cutoff: 3
% dbl unit cutoff: 3
% real runtime : 25.5
% process. runtime: 25.4
% specific non-discr-tree subsumption statistics:
% tried: 5852836
% length fails: 277425
% strength fails: 1937201
% predlist fails: 89419
% aux str. fails: 311822
% by-lit fails: 4398
% full subs tried: 3219909
% full subs fail: 3049876
%
% ; 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-2+eq_r.in")
%
%------------------------------------------------------------------------------