TSTP Solution File: GRP190-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP190-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 : 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/GRP190-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(18,40,0,36,0,0,150,50,12,168,0,12)
%
%
% START OF PROOF
% 151 [] equal(X,X).
% 152 [] equal(multiply(identity,X),X).
% 153 [] equal(multiply(inverse(X),X),identity).
% 154 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 156 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 163 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 165 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 167 [] equal(least_upper_bound(a,b),a).
% 168 [] -equal(least_upper_bound(inverse(a),inverse(b)),inverse(b)).
% 170 [para:156.1.1,168.1.1] -equal(least_upper_bound(inverse(b),inverse(a)),inverse(b)).
% 171 [para:153.1.1,154.1.1.1,demod:152] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 227 [para:153.1.1,163.1.2.1] equal(multiply(inverse(X),least_upper_bound(X,Y)),least_upper_bound(identity,multiply(inverse(X),Y))).
% 232 [para:153.1.1,171.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 236 [para:171.1.2,171.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 257 [para:152.1.1,165.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 316 [para:236.1.2,153.1.1] equal(multiply(X,inverse(X)),identity).
% 318 [para:236.1.2,232.1.2] equal(X,multiply(X,identity)).
% 730 [para:167.1.1,227.1.1.2,demod:153] equal(identity,least_upper_bound(identity,multiply(inverse(a),b))).
% 1628 [para:730.1.2,257.1.1.1,demod:154,152] equal(X,least_upper_bound(X,multiply(inverse(a),multiply(b,X)))).
% 1847 [para:316.1.1,1628.1.2.2.2,demod:318] equal(inverse(b),least_upper_bound(inverse(b),inverse(a))).
% 1855 [para:1847.1.2,170.1.1,cut:151] 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: 352
% derived clauses: 41523
% kept clauses: 1800
% kept size sum: 25568
% kept mid-nuclei: 0
% kept new demods: 1162
% forw unit-subs: 27072
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.46
% process. runtime: 0.44
% 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/GRP190-1+eq_r.in")
%
%------------------------------------------------------------------------------