TSTP Solution File: GRP185-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP185-4 : 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 : 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 119.1s
% Output : Assurance 119.1s
% 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-4+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(20,40,2,40,0,2,9263,3,3006,11356,4,4503,12873,5,6003,12873,1,6003,12873,50,6003,12873,40,6003,12893,0,6003,17616,3,7510,18871,4,8256,19984,5,9004,19984,1,9004,19984,50,9004,19984,40,9004,20004,0,9004,74449,3,10543,92382,4,11258,103632,5,12005,103632,1,12005,103632,50,12010,103632,40,12010,103652,0,12010)
%
%
% START OF PROOF
% 103634 [] equal(multiply(identity,X),X).
% 103638 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 103640 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 103644 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 103645 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 103647 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 103652 [] -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)).
% 103662 [para:103638.1.1,103652.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)).
% 103667 [para:103638.1.1,103644.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,X)),X).
% 103709 [para:103640.1.2,103667.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(Z,X))),X).
% 103743 [para:103645.1.2,103640.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)).
% 103746 [para:103638.1.1,103709.1.1.2,demod:103640] equal(greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(X,Z))),X).
% 103793 [para:103634.1.1,103647.1.2.2] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(multiply(X,Y),Y)).
% 103821 [para:103640.1.2,103746.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)).
% 105779 [para:103793.1.1,103662.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)).
% 131150 [para:103743.1.1,103821.1.1.2,slowcut:105779] 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
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4661
% derived clauses: 5034962
% kept clauses: 120944
% kept size sum: 532320
% kept mid-nuclei: 0
% kept new demods: 97735
% forw unit-subs: 2189772
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 147
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 126.53
% process. runtime: 125.48
% 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-4+eq_r.in")
%
%------------------------------------------------------------------------------