TSTP Solution File: GRP185-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP185-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 : 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 88.9s
% Output : Assurance 88.9s
% 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/GRP185-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,0,34,0,0,8607,3,3004,11364,4,4501,13485,5,6001,13485,1,6001,13485,50,6001,13485,40,6001,13502,0,6001,18124,3,7507,19338,4,8252,20534,5,9002,20534,1,9002,20534,50,9002,20534,40,9002,20551,0,9002,20582,50,9003,20582,40,9003,20599,0,9013)
%
%
% START OF PROOF
% 20584 [] equal(multiply(identity,X),X).
% 20588 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 20590 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 20594 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 20595 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 20597 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 20599 [] -equal(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),least_upper_bound(multiply(a,b),identity)).
% 20603 [para:20588.1.1,20599.1.1.2.2] -equal(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(identity,b))),least_upper_bound(multiply(a,b),identity)).
% 20608 [para:20588.1.1,20594.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,X)),X).
% 20650 [para:20590.1.2,20608.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(Z,X))),X).
% 20674 [para:20595.1.2,20590.1.2.1] equal(least_upper_bound(multiply(X,Y),least_upper_bound(multiply(X,Z),U)),least_upper_bound(multiply(X,least_upper_bound(Y,Z)),U)).
% 20708 [para:20584.1.1,20597.1.2.2] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(multiply(X,Y),Y)).
% 20721 [para:20588.1.1,20650.1.1.2,demod:20590] equal(greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(X,Z))),X).
% 20770 [para:20590.1.2,20721.1.1.2.2] equal(greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(Z,least_upper_bound(X,least_upper_bound(Y,U)))),least_upper_bound(X,Y)).
% 22773 [para:20708.1.1,20603.1.1.2] -equal(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(a,least_upper_bound(identity,b)),least_upper_bound(identity,b))),least_upper_bound(multiply(a,b),identity)).
% 40693 [para:20674.1.1,20770.1.1.2,slowcut:22773] 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
% seconds given: 180
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3306
% derived clauses: 4520299
% kept clauses: 40604
% kept size sum: 0
% kept mid-nuclei: 0
% kept new demods: 25501
% forw unit-subs: 1418411
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 28
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 95.65
% process. runtime: 94.52
% 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/GRP185-3+eq_r.in")
%
%------------------------------------------------------------------------------