TSTP Solution File: GRP185-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP185-2 : 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 : 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 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/GRP185-2+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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 22 [] equal(multiply(identity,X),X).
% 25 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 26 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 27 [] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(greatest_lower_bound(X,Y),Z)).
% 28 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 31 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 32 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 33 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 35 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 37 [] equal(inverse(identity),identity).
% 38 [] equal(inverse(inverse(X)),X).
% 39 [] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 40 [] -equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 41 [para:37.1.1,39.1.2.1,demod:22] equal(inverse(multiply(X,identity)),inverse(X)).
% 46 [para:41.1.1,38.1.1.1,demod:38] equal(X,multiply(X,identity)).
% 47 [para:25.1.1,31.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,X)),X).
% 48 [para:31.1.1,26.1.1] equal(X,least_upper_bound(greatest_lower_bound(X,Y),X)).
% 50 [para:26.1.1,32.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,X)),X).
% 51 [para:47.1.1,26.1.1] equal(X,least_upper_bound(greatest_lower_bound(Y,X),X)).
% 64 [para:32.1.1,27.1.2.1] equal(greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Y),Z)),greatest_lower_bound(X,Z)).
% 68 [para:50.1.1,27.1.2.1] equal(greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Y,X),Z)),greatest_lower_bound(X,Z)).
% 77 [para:28.1.2,26.1.1] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Z,least_upper_bound(X,Y))).
% 81 [para:28.1.2,32.1.1.2] equal(greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(Y,Z))),least_upper_bound(X,Y)).
% 83 [para:48.1.2,28.1.2.1] equal(least_upper_bound(greatest_lower_bound(X,Y),least_upper_bound(X,Z)),least_upper_bound(X,Z)).
% 104 [para:46.1.2,33.1.2.1] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 105 [para:46.1.2,33.1.2.2] equal(multiply(X,least_upper_bound(Y,identity)),least_upper_bound(multiply(X,Y),X)).
% 135 [para:22.1.1,35.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 207 [para:104.1.2,32.1.1.2] equal(greatest_lower_bound(X,multiply(X,least_upper_bound(identity,Y))),X).
% 233 [para:26.1.1,207.1.1.2.2] equal(greatest_lower_bound(X,multiply(X,least_upper_bound(Y,identity))),X).
% 260 [para:233.1.1,64.1.1.2,demod:32] equal(X,greatest_lower_bound(X,multiply(least_upper_bound(X,Y),least_upper_bound(Z,identity)))).
% 314 [para:77.1.1,40.1.1] -equal(least_upper_bound(multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),least_upper_bound(multiply(a,b),identity)),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 418 [para:35.1.2,83.1.1.2,demod:35] equal(least_upper_bound(greatest_lower_bound(multiply(X,Y),Z),multiply(least_upper_bound(X,U),Y)),multiply(least_upper_bound(X,U),Y)).
% 449 [para:105.1.2,81.1.1.1] equal(greatest_lower_bound(multiply(X,least_upper_bound(Y,identity)),least_upper_bound(multiply(X,Y),least_upper_bound(X,Z))),least_upper_bound(multiply(X,Y),X)).
% 987 [para:135.1.2,32.1.1.2] equal(greatest_lower_bound(X,multiply(least_upper_bound(identity,Y),X)),X).
% 1071 [para:26.1.1,987.1.1.2.1] equal(greatest_lower_bound(X,multiply(least_upper_bound(Y,identity),X)),X).
% 1105 [para:1071.1.1,68.1.1.2,demod:50] equal(X,greatest_lower_bound(X,multiply(least_upper_bound(Y,identity),least_upper_bound(Z,X)))).
% 1465 [para:260.1.2,51.1.2.1] equal(multiply(least_upper_bound(X,Y),least_upper_bound(Z,identity)),least_upper_bound(X,multiply(least_upper_bound(X,Y),least_upper_bound(Z,identity)))).
% 2008 [para:1105.1.2,51.1.2.1] equal(multiply(least_upper_bound(X,identity),least_upper_bound(Y,Z)),least_upper_bound(Z,multiply(least_upper_bound(X,identity),least_upper_bound(Y,Z)))).
% 5399 [para:26.1.1,314.1.1,demod:2008,28] -equal(least_upper_bound(multiply(a,b),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 8857 [para:449.1.1,418.1.1.1,demod:1465,28,slowcut:5399] 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: 1452
% derived clauses: 1329118
% kept clauses: 8815
% kept size sum: 153658
% kept mid-nuclei: 0
% kept new demods: 6506
% forw unit-subs: 543714
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 27.74
% process. runtime: 27.74
% 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/GRP185-2+eq_r.in")
%
%------------------------------------------------------------------------------