TSTP Solution File: GRP475-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP475-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 : art02.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.6s
% Output : Assurance 59.6s
% 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/GRP475-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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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,1,8,0,1,961,3,3015,1025,4,4502,1093,5,6002,1093,1,6002,1093,50,6002,1093,40,6002,1097,0,6002,1104,50,6002,1108,0,6003)
%
%
% START OF PROOF
% 1106 [] equal(divide(inverse(divide(divide(divide(X,Y),Z),divide(U,Z))),divide(Y,X)),U).
% 1108 [] -equal(divide(inverse(a1),inverse(a1)),divide(inverse(b1),inverse(b1))).
% 1109 [para:1106.1.1,1106.1.1.1.1.1.1] equal(divide(inverse(divide(divide(X,Y),divide(Z,Y))),divide(divide(U,V),inverse(divide(divide(divide(V,U),W),divide(X,W))))),Z).
% 1110 [para:1106.1.1,1106.1.1.1.1.2] equal(divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)),inverse(divide(divide(divide(U,Z),W),divide(V,W)))).
% 1112 [para:1110.1.1,1106.1.1] equal(inverse(divide(divide(divide(X,Y),Z),divide(divide(U,divide(Y,X)),Z))),U).
% 1113 [para:1110.1.2,1106.1.1.1] equal(divide(divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)),divide(Z,U)),V).
% 1117 [para:1112.1.1,1109.1.1.1] equal(divide(X,divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(divide(V,W),U))))),divide(X,divide(W,V))).
% 1121 [para:1106.1.1,1113.1.1.1.1.1.1.2,demod:1106] equal(divide(divide(inverse(divide(divide(divide(X,Y),Z),U)),divide(Y,X)),Z),U).
% 1133 [para:1117.1.1,1113.1.1.1.1.1,demod:1113] equal(divide(X,Y),divide(divide(Z,U),inverse(divide(divide(divide(U,Z),V),divide(divide(Y,X),V))))).
% 1144 [para:1133.1.2,1121.1.1.1.1.1] equal(divide(divide(inverse(divide(X,Y)),divide(Z,U)),V),inverse(divide(divide(divide(V,divide(U,Z)),W),divide(divide(Y,X),W)))).
% 1150 [para:1117.1.1,1133.1.2.2.1.1.1,demod:1144,1133] equal(divide(X,Y),divide(divide(divide(Z,U),V),divide(divide(inverse(divide(X,Y)),divide(U,Z)),V))).
% 1153 [para:1106.1.1,1150.1.2.2.1.1.1,demod:1106] equal(X,divide(divide(divide(Y,Z),U),divide(divide(inverse(X),divide(Z,Y)),U))).
% 1222 [para:1153.1.2,1110.1.1.1.1.1] equal(divide(inverse(divide(X,Y)),divide(Z,divide(U,V))),inverse(divide(divide(divide(Z,divide(inverse(X),divide(V,U))),W),divide(Y,W)))).
% 1228 [para:1153.1.2,1112.1.1.1.2.1,demod:1222] equal(divide(inverse(divide(X,X)),divide(Y,divide(Z,U))),divide(divide(Z,U),Y)).
% 1265 [para:1106.1.1,1228.1.1.2.2,demod:1106] equal(divide(inverse(divide(X,X)),divide(Y,Z)),divide(Z,Y)).
% 1319 [para:1228.1.2,1133.1.2,demod:1106] equal(divide(X,Y),divide(inverse(divide(Z,Z)),divide(Y,X))).
% 1326 [para:1228.1.1,1133.1.2.2.1.2.1,demod:1133] equal(divide(divide(X,divide(Y,Z)),inverse(divide(U,U))),divide(X,divide(Y,Z))).
% 1373 [para:1265.1.2,1112.1.1.1.1.1,demod:1326,1144] equal(divide(inverse(divide(divide(X,Y),Z)),divide(Y,X)),Z).
% 1446 [para:1319.1.1,1112.1.1.1.1.1,demod:1373,1144] equal(divide(X,inverse(divide(Y,Y))),X).
% 1469 [para:1446.1.1,1121.1.1.1.1.1,demod:1373] equal(divide(X,X),inverse(divide(Y,Y))).
% 1499 [para:1469.1.1,1108.1.2,cut:1469] 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: 664
% derived clauses: 3140941
% kept clauses: 1482
% kept size sum: 53261
% kept mid-nuclei: 0
% kept new demods: 222
% forw unit-subs: 117032
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 99
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 60.58
% process. runtime: 60.8
% 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/GRP475-1+eq_r.in")
%
%------------------------------------------------------------------------------