TSTP Solution File: GRP039-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP039-7 : TPTP v3.4.2. Bugfixed v1.0.1.
% 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-7+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(17,40,0,34,0,0,49685,4,1883,70550,5,2501,70550,1,2501,70550,50,2502,70550,40,2502,70567,0,2502)
%
%
% START OF PROOF
% 70551 [] equal(X,X).
% 70552 [] equal(multiply(identity,X),X).
% 70553 [] equal(multiply(inverse(X),X),identity).
% 70554 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 70555 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 70556 [] -equal(multiply(X,Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 70559 [] equal(inverse(inverse(X)),X).
% 70562 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 70563 [] equal(multiply(X,element_in_^o2(X,Y)),Y) | subgroup_member(Y) | subgroup_member(X).
% 70564 [] subgroup_member(b).
% 70565 [] equal(multiply(b,inverse(a)),c).
% 70566 [] equal(multiply(a,c),d).
% 70567 [] -subgroup_member(d).
% 70572 [binary:70564,70555.2] subgroup_member(inverse(b)).
% 70573 [para:70559.1.1,70555.1.1] -subgroup_member(inverse(X)) | subgroup_member(X).
% 70582 [para:70553.1.1,70554.1.1.1,demod:70552] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 70594 [binary:70551,70556] subgroup_member(multiply(X,Y)) | -subgroup_member(Y) | -subgroup_member(X).
% 70598 [binary:70565,70556,cut:70564,binarydemod:70555] -subgroup_member(a) | subgroup_member(c).
% 70603 [binary:70566,70556,cut:70567] -subgroup_member(a) | -subgroup_member(c).
% 70647 [para:70566.1.1,70582.1.2.2] equal(c,multiply(inverse(a),d)).
% 70650 [para:70563.1.1,70582.1.2.2] equal(element_in_^o2(X,Y),multiply(inverse(X),Y)) | subgroup_member(Y) | subgroup_member(X).
% 70709 [binary:70572,70594.3] subgroup_member(multiply(inverse(b),X)) | -subgroup_member(X).
% 70737 [para:70582.1.2,70709.1.1] -subgroup_member(multiply(b,X)) | subgroup_member(X).
% 70742 [para:70565.1.1,70737.1.1,binarydemod:70573,binarycut:70603] -subgroup_member(c).
% 70767 [binary:70598.2,70742] -subgroup_member(a).
% 71568 [para:70650.1.2,70647.1.2,cut:70567,cut:70767] equal(c,element_in_^o2(a,d)).
% 71588 [para:71568.1.2,70562.1.1,cut:70742,cut:70567,cut:70767] 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: 478
% derived clauses: 526291
% kept clauses: 52052
% kept size sum: 935500
% kept mid-nuclei: 6533
% kept new demods: 54
% forw unit-subs: 26927
% forw double-subs: 41711
% forw overdouble-subs: 130508
% backward subs: 168
% fast unit cutoff: 6062
% full unit cutoff: 2
% dbl unit cutoff: 10
% real runtime : 25.5
% process. runtime: 25.5
% specific non-discr-tree subsumption statistics:
% tried: 8567271
% length fails: 576001
% strength fails: 3104611
% predlist fails: 135907
% aux str. fails: 450996
% by-lit fails: 4464
% full subs tried: 4280768
% full subs fail: 4150583
%
% ; 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-7+eq_r.in")
%
%------------------------------------------------------------------------------