TSTP Solution File: GRP299-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP299-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 : art08.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 227.9s
% Output : Assurance 227.9s
% 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/GRP299-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_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(sk_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7) | -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% was split for some strategies as:
% -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c7,sk_c6),sk_c5).
% -equal(multiply(sk_c5,sk_c7),sk_c6).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(29,40,0,62,0,0,742,50,5,775,0,5,2064,50,17,2097,0,17,3667,50,36,3700,0,37,5439,50,55,5472,0,55,7380,50,75,7413,0,75,9545,50,106,9578,0,106,11935,50,154,11968,0,154,14605,50,242,14638,0,242,17556,50,412,17589,0,412,20843,50,670,20876,0,670,24467,50,1157,24467,40,1157,24500,0,1157,34000,3,1458,34857,4,1608,35677,5,1758,35678,1,1758,35678,50,1758,35678,40,1758,35711,0,1758,35997,3,2059,36007,4,2218,36018,5,2359,36018,1,2359,36018,50,2359,36018,40,2359,36051,0,2359,64753,3,3861,65826,4,4610,66819,5,5360,66820,1,5360,66820,50,5361,66820,40,5361,66853,0,5361,85301,3,6113,86283,4,6487,87213,5,6862,87214,1,6862,87214,50,6862,87214,40,6862,87247,0,6862,97090,3,7614,98827,4,7988,100583,1,8363,100583,50,8363,100583,40,8363,100616,0,8363,179670,3,12283,180590,4,14215,181333,5,16164,181334,1,16165,181334,50,16167,181334,40,16167,181367,0,16167,251935,3,18720,252632,4,19993,253215,5,21269,253216,1,21269,253216,50,21271,253216,40,21271,253249,0,21271,278735,3,22772)
%
%
% START OF PROOF
% 183416 [?] ?
% 253217 [] equal(X,X).
% 253218 [] equal(multiply(identity,X),X).
% 253219 [] equal(multiply(inverse(X),X),identity).
% 253220 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 253225 [] equal(multiply(sk_c5,sk_c7),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 253226 [] equal(multiply(sk_c5,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 253229 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c4).
% 253230 [] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 253231 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 253232 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 253235 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c4).
% 253236 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 253237 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 253238 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 253243 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 253244 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c2),sk_c7).
% 253245 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c6,sk_c7),sk_c5).
% 253246 [] -equal(multiply(sk_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(sk_c7,sk_c6),sk_c5) | $spltprd0($spltcnst25) | -equal(multiply(X,sk_c7),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 253247 [] $spltprd0($spltcnst26) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 253248 [] $spltprd0($spltcnst27) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 253249 [] -$spltprd0($spltcnst26) | -$spltprd0($spltcnst25) | -$spltprd0($spltcnst27).
% 253262 [para:253232.1.1,253219.1.1.1] equal(multiply(sk_c7,sk_c1),identity) | equal(inverse(sk_c2),sk_c7).
% 253280 [para:253231.2.1,253219.1.1.1] equal(multiply(sk_c7,sk_c1),identity) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 253335 [para:253231.1.1,253247.2.1,cut:253217] -equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst26).
% 253338 [para:253225.2.1,253247.2.1,cut:253217] equal(multiply(sk_c5,sk_c7),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 253339 [para:253237.2.1,253247.2.1,cut:253217] equal(multiply(sk_c1,sk_c7),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 253343 [para:253243.2.1,253247.2.1,cut:253217] equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 253349 [para:253219.1.1,253248.2.1,cut:183416] -equal(inverse(inverse(sk_c7)),sk_c7) | $spltprd0($spltcnst27).
% 253382 [para:253219.1.1,253220.1.1.1,demod:253218] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 253384 [para:253226.1.1,253220.1.1.1] equal(inverse(sk_c2),sk_c7) | equal(multiply(sk_c6,X),multiply(sk_c5,multiply(sk_c7,X))).
% 253401 [para:253225.1.1,253220.1.1.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(multiply(sk_c6,X),multiply(sk_c5,multiply(sk_c7,X))).
% 253437 [para:253219.1.1,253382.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 253499 [para:253382.1.2,253382.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 253512 [para:253437.1.2,253382.1.2.2] equal(identity,multiply(inverse(inverse(inverse(X))),X)).
% 253542 [para:253512.1.2,253382.1.2.2,demod:253437] equal(X,inverse(inverse(X))).
% 253543 [para:253542.1.2,253219.1.1.1] equal(multiply(X,inverse(X)),identity).
% 253564 [para:253542.1.2,253349.1.1,cut:253217] $spltprd0($spltcnst27).
% 253566 [para:253542.1.2,253437.1.2.1] equal(X,multiply(X,identity)).
% 253568 [para:253229.1.1,253543.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(inverse(sk_c3),sk_c4).
% 253832 [para:253568.1.1,253235.1.1] equal(inverse(sk_c3),sk_c4) | equal(identity,sk_c6).
% 253852 [para:253832.1.1,253543.1.1.2] equal(multiply(sk_c3,sk_c4),identity) | equal(identity,sk_c6).
% 254145 [para:253852.1.1,253230.1.1] equal(inverse(sk_c1),sk_c7) | equal(identity,sk_c6).
% 254147 [para:253236.1.1,253852.2.1] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(identity,sk_c6).
% 254176 [para:254145.2.2,253231.1.1.2,demod:253566] equal(inverse(sk_c1),sk_c7) | equal(sk_c2,sk_c7).
% 254187 [para:254145.1.1,253543.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(identity,sk_c6).
% 254218 [para:253232.2.1,254176.2.1.1] equal(inverse(sk_c7),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 254541 [para:253232.2.1,253335.1.1,cut:253217] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst26).
% 254548 [para:254541.1.1,253543.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | $spltprd0($spltcnst26).
% 254605 [para:253226.2.1,253338.2.1,cut:253217] equal(multiply(sk_c5,sk_c7),sk_c6) | $spltprd0($spltcnst26).
% 254610 [para:254605.1.1,253382.1.2.2] equal(sk_c7,multiply(inverse(sk_c5),sk_c6)) | $spltprd0($spltcnst26).
% 254644 [para:253238.2.1,253339.2.1,cut:253217] equal(multiply(sk_c1,sk_c7),sk_c6) | $spltprd0($spltcnst26).
% 254660 [para:254644.1.1,254548.1.1] equal(sk_c6,identity) | $spltprd0($spltcnst26).
% 254674 [para:254660.1.2,253437.1.2.2,demod:253542] $spltprd0($spltcnst26) | equal(X,multiply(X,sk_c6)).
% 254731 [para:254674.2.2,253499.1.2,demod:253542] $spltprd0($spltcnst26) | equal(multiply(X,sk_c6),X).
% 254736 [para:253244.2.1,253343.2.1,cut:253217] equal(multiply(sk_c7,sk_c6),sk_c5) | $spltprd0($spltcnst26).
% 254781 [para:254736.1.1,254731.2.1] equal(sk_c5,sk_c7) | $spltprd0($spltcnst26).
% 255088 [para:254610.1.2,253247.2.1,demod:253542,cut:253217,binarycut:254781] $spltprd0($spltcnst26).
% 255089 [binary:253249,255088,cut:253564] -$spltprd0($spltcnst25).
% 255541 [para:254187.1.1,254147.1.1] equal(identity,sk_c6).
% 255565 [para:255541.1.1,253218.1.1.1] equal(multiply(sk_c6,X),X).
% 255571 [para:255541.1.2,253245.1.1.2,demod:255565,253566] equal(sk_c7,sk_c5).
% 255574 [para:255541.1.1,253437.1.2.2,demod:253542] equal(X,multiply(X,sk_c6)).
% 255666 [para:253262.1.1,253384.2.2.2,demod:253566,255565] equal(inverse(sk_c2),sk_c7) | equal(sk_c1,sk_c5).
% 255827 [para:255666.2.2,255571.1.2] equal(inverse(sk_c2),sk_c7) | equal(sk_c7,sk_c1).
% 257668 [para:253280.1.1,253401.2.2.2,demod:255574,253566,255565] equal(sk_c1,sk_c5) | equal(sk_c2,sk_c7).
% 257748 [para:257668.1.2,255571.1.2] equal(sk_c7,sk_c1) | equal(sk_c2,sk_c7).
% 257872 [para:257748.2.1,255827.1.1.1] equal(inverse(sk_c7),sk_c7) | equal(sk_c7,sk_c1).
% 265000 [para:254218.2.2,257872.2.1.1] equal(inverse(sk_c7),sk_c7).
% 265003 [para:265000.1.1,253219.1.1.1] equal(multiply(sk_c7,sk_c7),identity).
% 279957 [para:255571.1.2,253246.1.1.1,demod:255574,255565,cut:255571,cut:255089,factor:factor:cut:265000] -equal(multiply(sk_c7,sk_c7),sk_c6).
% 279958 [para:255541.1.2,279957.1.2,demod:265003,cut:253217] 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 first arg depth ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22393
% derived clauses: 4935130
% kept clauses: 230306
% kept size sum: 0
% kept mid-nuclei: 14355
% kept new demods: 1285
% forw unit-subs: 1899705
% forw double-subs: 2385189
% forw overdouble-subs: 374602
% backward subs: 4735
% fast unit cutoff: 15361
% full unit cutoff: 0
% dbl unit cutoff: 12489
% real runtime : 234.47
% process. runtime: 232.13
% specific non-discr-tree subsumption statistics:
% tried: 26289269
% length fails: 2268796
% strength fails: 6990691
% predlist fails: 1410553
% aux str. fails: 5807703
% by-lit fails: 5042569
% full subs tried: 878130
% full subs fail: 777586
%
% ; 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/GRP299-1+eq_r.in")
%
%------------------------------------------------------------------------------