TSTP Solution File: BOO034-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO034-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/BOO/BOO034-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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(7,40,0,14,0,0)
%
%
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(multiply(multiply(X,Y,Z),U,multiply(X,Y,V)),multiply(X,Y,multiply(Z,U,V))).
% 10 [] equal(multiply(X,Y,Y),Y).
% 11 [] equal(multiply(X,X,Y),X).
% 13 [] equal(multiply(X,Y,inverse(Y)),X).
% 14 [] -equal(multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)),b).
% 15 [para:9.1.1,10.1.1] equal(multiply(X,Y,multiply(Z,multiply(X,Y,U),U)),multiply(X,Y,U)).
% 16 [para:10.1.1,9.1.1.1] equal(multiply(X,Y,multiply(Z,X,U)),multiply(Z,X,multiply(X,Y,U))).
% 17 [para:10.1.1,9.1.1.3] equal(multiply(multiply(X,Y,Z),U,Y),multiply(X,Y,multiply(Z,U,Y))).
% 18 [para:9.1.1,11.1.1] equal(multiply(X,Y,multiply(Z,multiply(X,Y,Z),U)),multiply(X,Y,Z)).
% 19 [para:11.1.1,9.1.1.1,demod:11] equal(multiply(X,Y,X),X).
% 20 [para:13.1.1,9.1.1.1] equal(multiply(X,Y,multiply(X,Z,U)),multiply(X,Z,multiply(inverse(Z),Y,U))).
% 25 [para:19.1.1,9.1.1.3] equal(multiply(multiply(X,Y,Z),U,X),multiply(X,Y,multiply(Z,U,X))).
% 27 [para:13.1.1,15.1.1.3.2,demod:13] equal(multiply(X,Y,multiply(Z,X,inverse(Y))),X).
% 32 [para:27.1.1,9.1.1.3,demod:25] equal(multiply(X,Y,multiply(Z,U,X)),multiply(X,Y,multiply(Z,U,multiply(V,X,inverse(Y))))).
% 35 [para:10.1.1,16.1.2.3] equal(multiply(X,Y,multiply(Z,X,Y)),multiply(Z,X,Y)).
% 50 [para:13.1.1,35.1.1.3,demod:13] equal(multiply(X,inverse(X),Y),Y).
% 59 [para:50.1.1,13.1.1] equal(inverse(inverse(X)),X).
% 62 [para:59.1.1,13.1.1.3] equal(multiply(X,inverse(Y),Y),X).
% 78 [para:17.1.1,27.1.1.3,demod:32] equal(multiply(X,Y,multiply(Z,inverse(Y),X)),X).
% 117 [para:13.1.1,18.1.1.3.2,demod:13] equal(multiply(X,Y,multiply(inverse(Y),X,Z)),X).
% 153 [para:117.1.1,35.1.1] equal(X,multiply(inverse(Y),X,Y)).
% 157 [para:117.1.1,78.1.1.3,demod:35,17,59] equal(multiply(X,Y,Z),multiply(Y,Z,X)).
% 174 [para:10.1.1,20.1.1.3,demod:153] equal(multiply(X,Y,Z),multiply(X,Z,Y)).
% 235 [para:157.1.1,14.1.1.2.1,demod:50] -equal(multiply(b,inverse(multiply(d,multiply(e,f,g),c)),multiply(d,multiply(g,f,e),c)),b).
% 341 [para:174.1.1,157.1.1] equal(multiply(X,Y,Z),multiply(Z,Y,X)).
% 864 [para:341.1.1,235.1.1.2.1.2,demod:62,cut:8] 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 5
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 55
% derived clauses: 4849
% kept clauses: 849
% kept size sum: 17064
% kept mid-nuclei: 0
% kept new demods: 533
% forw unit-subs: 3810
% 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 : 0.10
% process. runtime: 0.9
% 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/BOO/BOO034-1+eq_r.in")
%
%------------------------------------------------------------------------------