TSTP Solution File: GRP300-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP300-1 : TPTP v3.4.2. Released v2.5.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 119.5s
% Output : Assurance 119.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/GRP300-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(sk_c6,sk_c5),sk_c4) | -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6) | -equal(multiply(sk_c4,sk_c6),sk_c5) | -equal(multiply(sk_c5,sk_c4),sk_c6) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(inverse(sk_c6),sk_c4) | -equal(multiply(Z,sk_c4),sk_c5) | -equal(inverse(Z),sk_c4).
% was split for some strategies as:
% -equal(multiply(Z,sk_c4),sk_c5) | -equal(inverse(Z),sk_c4).
% -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6).
% -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% -equal(multiply(sk_c6,sk_c5),sk_c4).
% -equal(multiply(sk_c4,sk_c6),sk_c5).
% -equal(multiply(sk_c5,sk_c4),sk_c6).
% -equal(inverse(sk_c6),sk_c4).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(29,40,0,62,0,1,438,50,3,471,0,3,862,50,6,895,0,6,1297,50,10,1330,0,10,1739,50,15,1772,0,15,2188,50,22,2221,0,22,2645,50,35,2678,0,35,3111,50,62,3144,0,62,3587,50,120,3620,0,120,4074,50,247,4107,0,247,4573,50,461,4606,0,461,5085,50,874,5085,40,874,5118,0,874,16541,3,1175,17265,4,1325,17876,5,1475,17877,1,1475,17877,50,1475,17877,40,1475,17910,0,1475,18066,3,1784,18074,4,1926,18082,5,2076,18082,1,2076,18082,50,2076,18082,40,2076,18115,0,2076,45838,3,3577,46656,4,4327,47153,1,5077,47153,50,5077,47153,40,5077,47186,0,5078,73855,3,5830,74420,4,6204,74916,1,6579,74916,50,6580,74916,40,6580,74949,0,6580,82832,50,7276,82832,40,7276,82865,0,7276,118633,3,11177)
%
%
% START OF PROOF
% 82833 [] equal(X,X).
% 82834 [] equal(multiply(identity,X),X).
% 82835 [] equal(multiply(inverse(X),X),identity).
% 82836 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 82840 [] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(inverse(sk_c6),sk_c4).
% 82841 [] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 82842 [] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(multiply(sk_c2,sk_c6),sk_c5).
% 82846 [] equal(inverse(sk_c1),sk_c6) | equal(inverse(sk_c6),sk_c4).
% 82847 [] equal(inverse(sk_c1),sk_c6) | equal(inverse(sk_c2),sk_c6).
% 82848 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c1),sk_c6).
% 82852 [] equal(multiply(sk_c1,sk_c6),sk_c5) | equal(inverse(sk_c6),sk_c4).
% 82853 [] equal(multiply(sk_c1,sk_c6),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 82854 [] equal(multiply(sk_c1,sk_c6),sk_c5) | equal(multiply(sk_c2,sk_c6),sk_c5).
% 82858 [] equal(multiply(sk_c6,sk_c5),sk_c4) | equal(inverse(sk_c6),sk_c4).
% 82861 [] equal(multiply(sk_c6,sk_c5),sk_c4) | equal(multiply(sk_c5,sk_c4),sk_c6).
% 82862 [] -equal(multiply(sk_c5,sk_c4),sk_c6) | -equal(multiply(sk_c6,sk_c5),sk_c4) | -equal(multiply(sk_c4,sk_c6),sk_c5) | -equal(inverse(sk_c6),sk_c4) | $spltprd0($spltcnst19) | -equal(multiply(X,sk_c4),sk_c5) | -equal(inverse(X),sk_c4).
% 82863 [] $spltprd0($spltcnst20) | -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 82864 [] $spltprd0($spltcnst21) | -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 82865 [] -$spltprd0($spltcnst20) | -$spltprd0($spltcnst19) | -$spltprd0($spltcnst21).
% 82875 [para:82846.2.1,82835.1.1.1] equal(multiply(sk_c4,sk_c6),identity) | equal(inverse(sk_c1),sk_c6).
% 82901 [para:82852.2.1,82835.1.1.1] equal(multiply(sk_c4,sk_c6),identity) | equal(multiply(sk_c1,sk_c6),sk_c5).
% 82956 [para:82853.1.1,82863.2.1,cut:82833,binarycut:82847] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst20).
% 82962 [para:82854.2.1,82863.2.1,cut:82833,binarycut:82956] equal(multiply(sk_c1,sk_c6),sk_c5) | $spltprd0($spltcnst20).
% 82988 [para:82853.1.1,82864.2.1,cut:82833,binarycut:82847] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst21).
% 82994 [para:82854.2.1,82864.2.1,cut:82833,binarycut:82988] equal(multiply(sk_c1,sk_c6),sk_c5) | $spltprd0($spltcnst21).
% 83014 [para:82835.1.1,82836.1.1.1,demod:82834] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 83061 [para:82962.1.1,82863.2.1,cut:82833] -equal(inverse(sk_c1),sk_c6) | $spltprd0($spltcnst20).
% 83065 [para:82848.2.1,83061.1.1,cut:82833] equal(multiply(sk_c2,sk_c6),sk_c5) | $spltprd0($spltcnst20).
% 83074 [para:82994.1.1,82864.2.1,cut:82833] -equal(inverse(sk_c1),sk_c6) | $spltprd0($spltcnst21).
% 83078 [para:82848.2.1,83074.1.1,cut:82833] equal(multiply(sk_c2,sk_c6),sk_c5) | $spltprd0($spltcnst21).
% 83117 [para:83065.1.1,82863.2.1,cut:82833,binarycut:82956] $spltprd0($spltcnst20).
% 83118 [binary:82865,83117] -$spltprd0($spltcnst19) | -$spltprd0($spltcnst21).
% 83125 [para:83078.1.1,82864.2.1,cut:82833,binarycut:82988] $spltprd0($spltcnst21).
% 83128 [para:82835.1.1,83014.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 83187 [para:83014.1.2,83014.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 83207 [para:83187.1.2,82835.1.1] equal(multiply(X,inverse(X)),identity).
% 83232 [para:83187.1.2,83014.1.2] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 83233 [para:83187.1.2,83128.1.2] equal(X,multiply(X,identity)).
% 83235 [para:83233.1.2,83128.1.2] equal(X,inverse(inverse(X))).
% 83248 [para:82841.2.1,83235.1.2.1] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(sk_c2,inverse(sk_c6)).
% 83837 [para:82840.2.2,83248.2.1] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(sk_c2,sk_c4).
% 83856 [para:82842.2.1,83837.2.1.1] equal(multiply(sk_c4,sk_c6),sk_c5).
% 83866 [para:83856.1.1,82875.1.1] equal(inverse(sk_c1),sk_c6) | equal(sk_c5,identity).
% 83868 [para:83856.1.1,82836.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c4,multiply(sk_c6,X))).
% 83870 [para:83856.1.1,83014.1.2.2] equal(sk_c6,multiply(inverse(sk_c4),sk_c5)).
% 83896 [para:83866.1.1,83207.1.1.2] equal(multiply(sk_c1,sk_c6),identity) | equal(sk_c5,identity).
% 85308 [para:82901.2.1,83896.1.1,demod:83856] equal(sk_c5,identity).
% 85322 [para:85308.1.1,83870.1.2.2,demod:83233] equal(sk_c6,inverse(sk_c4)).
% 85326 [para:85322.1.2,83128.1.2.1.1,demod:83233] equal(sk_c4,inverse(sk_c6)).
% 85327 [para:85322.1.2,83232.1.2.2.1,demod:83868] equal(X,multiply(sk_c5,X)).
% 85328 [para:85322.1.2,83870.1.2.1] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 85370 [para:82861.1.2,85327.2.1,demod:85328] equal(sk_c4,sk_c6) | equal(sk_c6,sk_c4).
% 85488 [para:82858.1.2,85370.2.1.1,demod:85328,85322] equal(sk_c6,sk_c4).
% 85544 [para:85488.1.1,82862.1.2,demod:85326,83856,85328,85327,cut:85488,cut:82833,cut:82833] $spltprd0($spltcnst19) | -equal(multiply(X,sk_c4),sk_c5) | -equal(inverse(X),sk_c4).
% 85585 [para:85488.1.1,83856.1.1.2] equal(multiply(sk_c4,sk_c4),sk_c5).
% 119605 [binary:85585,85544.2,demod:85322,cut:85488] $spltprd0($spltcnst19).
% 119606 [binary:83118,119605,cut:83125] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 78
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12992
% derived clauses: 3410249
% kept clauses: 102475
% kept size sum: 472080
% kept mid-nuclei: 2158
% kept new demods: 911
% forw unit-subs: 1802733
% forw double-subs: 1319989
% forw overdouble-subs: 152064
% backward subs: 9266
% fast unit cutoff: 8355
% full unit cutoff: 0
% dbl unit cutoff: 2277
% real runtime : 121.99
% process. runtime: 121.36
% specific non-discr-tree subsumption statistics:
% tried: 4831557
% length fails: 449102
% strength fails: 1190990
% predlist fails: 56860
% aux str. fails: 1265784
% by-lit fails: 767919
% full subs tried: 242396
% full subs fail: 189127
%
% ; 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/GRP300-1+eq_r.in")
%
%------------------------------------------------------------------------------