TSTP Solution File: GRP184-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP184-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 : 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 59.5s
% Output : Assurance 59.5s
% 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/GRP184-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 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(17,40,1,34,0,1,8633,3,3004,11355,4,4508,13458,5,6004,13458,1,6004,13458,50,6005,13458,40,6005,13475,0,6005)
%
%
% START OF PROOF
% 13460 [] equal(multiply(identity,X),X).
% 13461 [] equal(multiply(inverse(X),X),identity).
% 13462 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 13464 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 13471 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 13472 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 13473 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 13474 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 13475 [] -equal(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 13487 [para:13461.1.1,13462.1.1.1,demod:13460] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 13506 [para:13461.1.1,13487.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 13508 [para:13487.1.2,13487.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 13533 [para:13471.1.2,13464.1.1,demod:13471] equal(multiply(X,least_upper_bound(Y,Z)),multiply(X,least_upper_bound(Z,Y))).
% 13536 [para:13506.1.2,13471.1.2.1,demod:13508] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 13543 [para:13508.1.2,13461.1.1] equal(multiply(X,inverse(X)),identity).
% 13545 [para:13508.1.2,13506.1.2] equal(X,multiply(X,identity)).
% 13561 [para:13460.1.1,13473.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 13578 [para:13460.1.1,13474.1.2.2] equal(multiply(greatest_lower_bound(X,identity),Y),greatest_lower_bound(multiply(X,Y),Y)).
% 14178 [para:13487.1.2,13536.1.2.2] equal(multiply(inverse(X),least_upper_bound(identity,multiply(X,Y))),least_upper_bound(inverse(X),Y)).
% 14385 [para:13464.1.1,13561.1.1.1] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(Y,multiply(X,Y))).
% 14580 [para:13578.1.2,13472.1.2,demod:13578] equal(multiply(X,multiply(greatest_lower_bound(X,identity),Y)),multiply(greatest_lower_bound(X,identity),multiply(X,Y))).
% 14782 [para:14385.1.1,13475.1.1,demod:13545,13543,14580,14178,cut:13533] 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 lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1834
% derived clauses: 2908958
% kept clauses: 14730
% kept size sum: 282694
% kept mid-nuclei: 0
% kept new demods: 6489
% forw unit-subs: 886151
% 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 : 60.88
% process. runtime: 60.37
% 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/GRP184-1+eq_r.in")
%
%------------------------------------------------------------------------------