TSTP Solution File: GRP170-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP170-1 : 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 : art10.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/GRP170-1+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(19,40,0,38,0,0,195,50,15,214,0,15)
%
%
% START OF PROOF
% 196 [] equal(X,X).
% 197 [] equal(multiply(identity,X),X).
% 198 [] equal(multiply(inverse(X),X),identity).
% 199 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 201 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 203 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 208 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 210 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 212 [] equal(least_upper_bound(a,b),b).
% 213 [] equal(least_upper_bound(c,d),d).
% 214 [] -equal(least_upper_bound(multiply(a,c),multiply(b,d)),multiply(b,d)).
% 215 [para:201.1.1,212.1.1] equal(least_upper_bound(b,a),b).
% 216 [para:201.1.1,213.1.1] equal(least_upper_bound(d,c),d).
% 217 [para:201.1.1,214.1.1] -equal(least_upper_bound(multiply(b,d),multiply(a,c)),multiply(b,d)).
% 226 [para:198.1.1,199.1.1.1,demod:197] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 249 [para:198.1.1,226.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 251 [para:226.1.2,226.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 258 [para:216.1.1,203.1.2.1] equal(least_upper_bound(d,least_upper_bound(c,X)),least_upper_bound(d,X)).
% 283 [para:198.1.1,208.1.2.1] equal(multiply(inverse(X),least_upper_bound(X,Y)),least_upper_bound(identity,multiply(inverse(X),Y))).
% 287 [para:226.1.2,208.1.2.2] equal(multiply(inverse(X),least_upper_bound(Y,multiply(X,Z))),least_upper_bound(multiply(inverse(X),Y),Z)).
% 305 [para:197.1.1,210.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 420 [para:251.1.2,249.1.2] equal(X,multiply(X,identity)).
% 422 [para:420.1.2,249.1.2] equal(X,inverse(inverse(X))).
% 968 [para:215.1.1,283.1.1.2,demod:198] equal(identity,least_upper_bound(identity,multiply(inverse(b),a))).
% 1901 [para:968.1.2,305.1.1.1,demod:199,197] equal(X,least_upper_bound(X,multiply(inverse(b),multiply(a,X)))).
% 2164 [para:1901.1.2,258.1.1.2,demod:216] equal(d,least_upper_bound(d,multiply(inverse(b),multiply(a,c)))).
% 2409 [para:2164.1.2,287.1.1.2,demod:422] equal(multiply(b,d),least_upper_bound(multiply(b,d),multiply(a,c))).
% 5868 [para:2409.1.2,217.1.1,cut:196] 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: 799
% derived clauses: 169931
% kept clauses: 5810
% kept size sum: 91898
% kept mid-nuclei: 0
% kept new demods: 4646
% forw unit-subs: 108886
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.57
% process. runtime: 2.54
% 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/GRP170-1+eq_r.in")
%
%------------------------------------------------------------------------------