TSTP Solution File: GRP472-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP472-1 : TPTP v3.4.2. Released v2.6.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 59.0s
% Output : Assurance 59.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/GRP472-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(4,40,0,8,0,0,11,50,0,15,0,0,1614,3,3013,1629,4,4504,1662,5,6001,1662,1,6001,1662,50,6001,1662,40,6001,1666,0,6001,1666,50,6001,1670,0,6002,1672,50,6002,1676,0,6003)
%
%
% START OF PROOF
% 1674 [] equal(divide(divide(inverse(divide(X,Y)),divide(divide(Z,U),X)),divide(U,Z)),Y).
% 1676 [] -equal(divide(inverse(a1),inverse(a1)),divide(inverse(b1),inverse(b1))).
% 1677 [para:1674.1.1,1674.1.1.1.1.1] equal(divide(divide(inverse(X),divide(divide(Y,Z),divide(inverse(divide(U,X)),divide(divide(V,W),U)))),divide(Z,Y)),divide(W,V)).
% 1678 [para:1674.1.1,1674.1.1.1.2] equal(divide(divide(inverse(divide(divide(X,Y),Z)),U),divide(divide(divide(Y,X),V),inverse(divide(V,U)))),Z).
% 1688 [para:1677.1.1,1677.1.1.1.2.2.2.1,demod:1677] equal(divide(X,Y),divide(divide(Z,U),divide(inverse(V),divide(divide(U,Z),divide(inverse(divide(W,V)),divide(divide(X,Y),W)))))).
% 1698 [para:1674.1.1,1688.1.2.2.2.2.2.1,demod:1674] equal(X,divide(divide(Y,Z),divide(inverse(U),divide(divide(Z,Y),divide(inverse(divide(V,U)),divide(X,V)))))).
% 1705 [para:1674.1.1,1698.1.2.2.2] equal(X,divide(divide(divide(divide(divide(X,Y),inverse(divide(Y,Z))),U),inverse(divide(U,V))),divide(inverse(Z),V))).
% 1716 [para:1705.1.2,1705.1.2.1.1] equal(divide(divide(X,Y),inverse(divide(Y,Z))),divide(divide(X,inverse(divide(divide(inverse(Z),U),V))),divide(inverse(U),V))).
% 1723 [para:1716.1.1,1677.1.1.1.2.2.2.1,demod:1677] equal(divide(divide(inverse(X),Y),divide(Z,inverse(divide(divide(inverse(U),X),Y)))),divide(inverse(divide(V,U)),divide(Z,V))).
% 1817 [para:1723.1.1,1678.1.1] equal(divide(inverse(divide(X,Y)),divide(divide(divide(Z,U),divide(inverse(Y),divide(divide(U,Z),V))),X)),V).
% 1846 [para:1817.1.1,1674.1.1.1] equal(divide(X,divide(divide(inverse(Y),divide(divide(Z,U),X)),divide(U,Z))),Y).
% 1865 [para:1846.1.1,1674.1.1.1] equal(divide(X,divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),U))),inverse(X))),U).
% 1881 [para:1846.1.1,1698.1.2.2] equal(X,divide(divide(divide(divide(divide(X,Y),inverse(divide(Y,Z))),inverse(Z)),inverse(U)),U)).
% 1895 [para:1846.1.1,1846.1.1.2.1] equal(divide(divide(X,Y),divide(Z,divide(divide(divide(Y,X),inverse(U)),inverse(Z)))),U).
% 1949 [para:1881.1.2,1895.1.1.2.2] equal(divide(divide(inverse(X),divide(divide(Y,Z),inverse(divide(Z,X)))),divide(U,Y)),inverse(U)).
% 2026 [para:1949.1.1,1846.1.1.2] equal(divide(inverse(divide(X,Y)),inverse(X)),Y).
% 2038 [para:2026.1.1,1678.1.1.1] equal(divide(X,divide(divide(divide(Y,Z),U),inverse(divide(U,inverse(divide(Z,Y)))))),X).
% 2088 [para:1865.1.1,2026.1.1.1.1] equal(divide(inverse(X),inverse(Y)),divide(divide(divide(Z,U),inverse(divide(divide(U,Z),X))),inverse(Y))).
% 2298 [para:2026.1.1,2038.1.1.2.2.1,demod:2088] equal(divide(X,divide(inverse(Y),inverse(Y))),X).
% 2379 [para:2298.1.1,2026.1.1.1.1,slowcut:1676] 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 7
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 937
% derived clauses: 4938386
% kept clauses: 2353
% kept size sum: 85106
% kept mid-nuclei: 0
% kept new demods: 385
% forw unit-subs: 111944
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 61.13
% process. runtime: 60.11
% 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/GRP472-1+eq_r.in")
%
%------------------------------------------------------------------------------