TSTP Solution File: GRP039-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP039-5 : 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 19.5s
% Output : Assurance 19.5s
% 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-5+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(15,40,1,30,0,2,40103,4,1908,48695,5,2507,48695,1,2507,48695,50,2508,48695,40,2508,48710,0,2508)
%
%
% START OF PROOF
% 48696 [] equal(X,X).
% 48697 [] equal(multiply(identity,X),X).
% 48698 [] equal(multiply(inverse(X),X),identity).
% 48699 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 48700 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 48701 [] -equal(multiply(X,Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 48702 [] equal(multiply(X,identity),X).
% 48705 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 48706 [] equal(multiply(X,element_in_^o2(X,Y)),Y) | subgroup_member(Y) | subgroup_member(X).
% 48707 [] subgroup_member(b).
% 48708 [] equal(multiply(b,inverse(a)),c).
% 48709 [] equal(multiply(a,c),d).
% 48710 [] -subgroup_member(d).
% 48715 [binary:48707,48700.2] subgroup_member(inverse(b)).
% 48724 [para:48698.1.1,48699.1.1.1,demod:48697] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 48735 [binary:48696,48701] subgroup_member(multiply(X,Y)) | -subgroup_member(Y) | -subgroup_member(X).
% 48739 [binary:48708,48701,cut:48707,binarydemod:48700] -subgroup_member(a) | subgroup_member(c).
% 48743 [binary:48709,48701,cut:48710] -subgroup_member(a) | -subgroup_member(c).
% 48798 [para:48709.1.1,48724.1.2.2] equal(c,multiply(inverse(a),d)).
% 48799 [para:48698.1.1,48724.1.2.2,demod:48702] equal(X,inverse(inverse(X))).
% 48802 [para:48706.1.1,48724.1.2.2] equal(element_in_^o2(X,Y),multiply(inverse(X),Y)) | subgroup_member(Y) | subgroup_member(X).
% 48805 [para:48799.1.2,48700.1.1] -subgroup_member(inverse(X)) | subgroup_member(X).
% 48869 [binary:48715,48735.3] subgroup_member(multiply(inverse(b),X)) | -subgroup_member(X).
% 48907 [para:48724.1.2,48869.1.1] -subgroup_member(multiply(b,X)) | subgroup_member(X).
% 48912 [para:48708.1.1,48907.1.1,binarydemod:48805,binarycut:48743] -subgroup_member(c).
% 48922 [binary:48739.2,48912] -subgroup_member(a).
% 49815 [para:48802.1.2,48798.1.2,cut:48710,cut:48922] equal(c,element_in_^o2(a,d)).
% 49827 [para:49815.1.2,48705.1.1,cut:48912,cut:48710,cut:48922] 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: 525
% derived clauses: 698071
% kept clauses: 39719
% kept size sum: 657481
% kept mid-nuclei: 6924
% kept new demods: 62
% forw unit-subs: 67592
% forw double-subs: 74409
% forw overdouble-subs: 168739
% backward subs: 163
% fast unit cutoff: 7621
% full unit cutoff: 2
% dbl unit cutoff: 2
% real runtime : 25.99
% process. runtime: 25.10
% specific non-discr-tree subsumption statistics:
% tried: 5642217
% length fails: 271574
% strength fails: 1877869
% predlist fails: 85746
% aux str. fails: 304829
% by-lit fails: 4503
% full subs tried: 3084984
% full subs fail: 2916307
%
% ; 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-5+eq_r.in")
%
%------------------------------------------------------------------------------