TSTP Solution File: GRP181-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP181-3 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.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 0.0s
% Output : Assurance 0.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/GRP181-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 3 1)
% (binary-posweight-lex-big-order 30 #f 3 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(21,40,1,42,0,1,165,50,15,186,0,15)
%
%
% START OF PROOF
% 166 [] equal(X,X).
% 167 [] equal(multiply(identity,X),X).
% 168 [] equal(multiply(inverse(X),X),identity).
% 169 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 170 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 171 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 178 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 179 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 182 [] equal(greatest_lower_bound(a,c),greatest_lower_bound(b,c)).
% 183 [] equal(least_upper_bound(a,c),least_upper_bound(b,c)).
% 184 [] equal(inverse(greatest_lower_bound(X,Y)),least_upper_bound(inverse(X),inverse(Y))).
% 186 [] -equal(a,b).
% 187 [para:170.1.1,182.1.2] equal(greatest_lower_bound(a,c),greatest_lower_bound(c,b)).
% 191 [para:183.1.2,171.1.1] equal(least_upper_bound(a,c),least_upper_bound(c,b)).
% 202 [para:187.1.1,170.1.1] equal(greatest_lower_bound(c,b),greatest_lower_bound(c,a)).
% 203 [para:191.1.1,171.1.1] equal(least_upper_bound(c,b),least_upper_bound(c,a)).
% 204 [para:168.1.1,169.1.1.1,demod:167] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 230 [para:168.1.1,204.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 231 [para:169.1.1,204.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 232 [para:204.1.2,204.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 267 [para:204.1.2,178.1.2.1] equal(multiply(inverse(X),least_upper_bound(multiply(X,Y),Z)),least_upper_bound(Y,multiply(inverse(X),Z))).
% 269 [para:230.1.2,178.1.2.1,demod:232] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 272 [para:168.1.1,179.1.2.1] equal(multiply(inverse(X),greatest_lower_bound(X,Y)),greatest_lower_bound(identity,multiply(inverse(X),Y))).
% 309 [para:232.1.2,168.1.1] equal(multiply(X,inverse(X)),identity).
% 310 [para:232.1.2,204.1.2] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 312 [para:232.1.2,230.1.2] equal(X,multiply(X,identity)).
% 328 [para:312.1.2,168.1.1] equal(inverse(identity),identity).
% 329 [para:312.1.2,230.1.2] equal(X,inverse(inverse(X))).
% 330 [para:328.1.1,184.1.2.1] equal(inverse(greatest_lower_bound(identity,X)),least_upper_bound(identity,inverse(X))).
% 881 [para:309.1.1,231.1.2.2.2,demod:312] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 884 [para:310.1.2,881.1.2.1.1] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 1095 [para:309.1.1,269.1.2.2,demod:330] equal(multiply(X,inverse(greatest_lower_bound(identity,X))),least_upper_bound(X,identity)).
% 1204 [para:1095.1.1,881.1.2.1.1,demod:329] equal(greatest_lower_bound(identity,X),multiply(inverse(least_upper_bound(X,identity)),X)).
% 1215 [para:1204.1.2,231.1.2.2,demod:312,267,884] equal(X,multiply(least_upper_bound(X,inverse(Y)),greatest_lower_bound(identity,multiply(Y,X)))).
% 4444 [para:272.1.2,1215.1.2.2,demod:329] equal(X,multiply(least_upper_bound(X,Y),multiply(inverse(Y),greatest_lower_bound(Y,X)))).
% 4451 [para:171.1.1,4444.1.2.1] equal(X,multiply(least_upper_bound(Y,X),multiply(inverse(Y),greatest_lower_bound(Y,X)))).
% 4452 [para:183.1.2,4444.1.2.1,demod:4451,202,203,191] equal(b,a).
% 4488 [para:4452.1.1,186.1.2,cut:166] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 649
% derived clauses: 130162
% kept clauses: 4424
% kept size sum: 68925
% kept mid-nuclei: 0
% kept new demods: 3186
% forw unit-subs: 81670
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.2
% process. runtime: 2.2
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/GRP181-3+eq_r.in")
%
%------------------------------------------------------------------------------