TSTP Solution File: GRP184-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP184-3 : 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 : art09.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 60.0s
% Output : Assurance 60.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/GRP184-3+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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(17,40,1,34,0,1,8633,3,3009,11363,4,4504,13466,5,6002,13466,1,6002,13466,50,6003,13466,40,6003,13483,0,6003)
%
%
% START OF PROOF
% 13468 [] equal(multiply(identity,X),X).
% 13469 [] equal(multiply(inverse(X),X),identity).
% 13470 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 13472 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 13479 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 13480 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 13481 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 13482 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 13483 [] -equal(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 13495 [para:13469.1.1,13470.1.1.1,demod:13468] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 13514 [para:13469.1.1,13495.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 13516 [para:13495.1.2,13495.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 13541 [para:13479.1.2,13472.1.1,demod:13479] equal(multiply(X,least_upper_bound(Y,Z)),multiply(X,least_upper_bound(Z,Y))).
% 13544 [para:13514.1.2,13479.1.2.1,demod:13516] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 13551 [para:13516.1.2,13469.1.1] equal(multiply(X,inverse(X)),identity).
% 13553 [para:13516.1.2,13514.1.2] equal(X,multiply(X,identity)).
% 13569 [para:13468.1.1,13481.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 13586 [para:13468.1.1,13482.1.2.2] equal(multiply(greatest_lower_bound(X,identity),Y),greatest_lower_bound(multiply(X,Y),Y)).
% 14186 [para:13495.1.2,13544.1.2.2] equal(multiply(inverse(X),least_upper_bound(identity,multiply(X,Y))),least_upper_bound(inverse(X),Y)).
% 14393 [para:13472.1.1,13569.1.1.1] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(Y,multiply(X,Y))).
% 14588 [para:13586.1.2,13480.1.2,demod:13586] equal(multiply(X,multiply(greatest_lower_bound(X,identity),Y)),multiply(greatest_lower_bound(X,identity),multiply(X,Y))).
% 14790 [para:14393.1.1,13483.1.1,demod:13553,13551,14588,14186,cut:13541] 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 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1836
% derived clauses: 2916694
% kept clauses: 14738
% kept size sum: 282846
% kept mid-nuclei: 0
% kept new demods: 6489
% forw unit-subs: 888075
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 60.35
% process. runtime: 60.36
% 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/GRP184-3+eq_r.in")
%
%------------------------------------------------------------------------------