TSTP Solution File: GRP192-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP192-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 : art08.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/GRP192-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,1,36,0,1)
%
%
% START OF PROOF
% 20 [] equal(multiply(identity,X),X).
% 21 [] equal(multiply(inverse(X),X),identity).
% 22 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 23 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 24 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 28 [] equal(greatest_lower_bound(X,X),X).
% 29 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 32 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 35 [] equal(least_upper_bound(identity,X),X).
% 36 [] -equal(multiply(a,b),multiply(b,a)).
% 37 [para:24.1.1,35.1.1] equal(least_upper_bound(X,identity),X).
% 38 [para:29.1.1,35.1.1] equal(identity,greatest_lower_bound(identity,X)).
% 41 [para:21.1.1,22.1.1.1,demod:20] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 42 [para:38.1.2,23.1.1] equal(identity,greatest_lower_bound(X,identity)).
% 72 [para:21.1.1,32.1.2.1,demod:38] equal(multiply(inverse(X),greatest_lower_bound(X,Y)),identity).
% 75 [para:42.1.2,72.1.1.2] equal(multiply(inverse(X),identity),identity).
% 76 [para:72.1.1,41.1.2.2,demod:75] equal(greatest_lower_bound(X,Y),identity).
% 77 [para:76.1.1,28.1.1] equal(identity,X).
% 79 [para:77.1.1,35.1.1.1] equal(least_upper_bound(X,Y),Y).
% 82 [para:77.1.1,37.1.1.2,demod:79,slowcut:36] 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 3
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 39
% derived clauses: 1011
% kept clauses: 44
% kept size sum: 381
% kept mid-nuclei: 0
% kept new demods: 46
% forw unit-subs: 683
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% 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/GRP192-1+eq_r.in")
%
%------------------------------------------------------------------------------