TSTP Solution File: GRP181-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP181-4 : 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-4+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(24,40,1,48,0,1,206,50,19,230,0,19)
%
%
% START OF PROOF
% 207 [] equal(X,X).
% 208 [] equal(multiply(identity,X),X).
% 209 [] equal(multiply(inverse(X),X),identity).
% 210 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 211 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 212 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 219 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 220 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 223 [] equal(inverse(identity),identity).
% 224 [] equal(inverse(inverse(X)),X).
% 225 [] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 226 [] equal(greatest_lower_bound(a,c),greatest_lower_bound(b,c)).
% 227 [] equal(least_upper_bound(a,c),least_upper_bound(b,c)).
% 228 [] equal(inverse(greatest_lower_bound(X,Y)),least_upper_bound(inverse(X),inverse(Y))).
% 230 [] -equal(a,b).
% 231 [para:223.1.1,225.1.2.1,demod:208] equal(inverse(multiply(X,identity)),inverse(X)).
% 232 [?] ?
% 234 [para:224.1.1,225.1.2.2] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 235 [para:224.1.1,209.1.1.1] equal(multiply(X,inverse(X)),identity).
% 236 [para:231.1.1,224.1.1.1,demod:224] equal(X,multiply(X,identity)).
% 237 [para:211.1.1,226.1.2] equal(greatest_lower_bound(a,c),greatest_lower_bound(c,b)).
% 243 [para:227.1.2,212.1.1] equal(least_upper_bound(a,c),least_upper_bound(c,b)).
% 250 [para:223.1.1,228.1.2.1] equal(inverse(greatest_lower_bound(identity,X)),least_upper_bound(identity,inverse(X))).
% 255 [para:237.1.1,211.1.1] equal(greatest_lower_bound(c,b),greatest_lower_bound(c,a)).
% 256 [para:243.1.1,212.1.1] equal(least_upper_bound(c,b),least_upper_bound(c,a)).
% 271 [para:209.1.1,210.1.1.1,demod:208] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 273 [para:225.1.2,271.1.2.2,demod:224] equal(inverse(X),multiply(Y,inverse(multiply(X,Y)))).
% 274 [para:210.1.1,271.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 341 [para:236.1.2,219.1.2.1] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 344 [para:271.1.2,219.1.2.1] equal(multiply(inverse(X),least_upper_bound(multiply(X,Y),Z)),least_upper_bound(Y,multiply(inverse(X),Z))).
% 347 [para:273.1.2,273.1.2.2.1,demod:224] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 376 [para:209.1.1,220.1.2.1] equal(multiply(inverse(X),greatest_lower_bound(X,Y)),greatest_lower_bound(identity,multiply(inverse(X),Y))).
% 567 [para:235.1.1,341.1.2.2,demod:250] equal(multiply(X,inverse(greatest_lower_bound(identity,X))),least_upper_bound(X,identity)).
% 674 [para:567.1.1,347.1.2.1.1,demod:224] equal(greatest_lower_bound(identity,X),multiply(inverse(least_upper_bound(X,identity)),X)).
% 686 [para:674.1.2,274.1.2.2,demod:232,344,234] equal(X,multiply(least_upper_bound(X,inverse(Y)),greatest_lower_bound(identity,multiply(Y,X)))).
% 4344 [para:376.1.2,686.1.2.2,demod:224] equal(X,multiply(least_upper_bound(X,Y),multiply(inverse(Y),greatest_lower_bound(Y,X)))).
% 4355 [para:212.1.1,4344.1.2.1] equal(X,multiply(least_upper_bound(Y,X),multiply(inverse(Y),greatest_lower_bound(Y,X)))).
% 4356 [para:227.1.2,4344.1.2.1,demod:4355,255,256,243] equal(b,a).
% 4378 [para:4356.1.1,230.1.2,cut:207] 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: 680
% derived clauses: 134141
% kept clauses: 4305
% kept size sum: 66681
% kept mid-nuclei: 0
% kept new demods: 3136
% forw unit-subs: 83054
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.3
% process. runtime: 2.3
% 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-4+eq_r.in")
%
%------------------------------------------------------------------------------