TSTP Solution File: GRP178-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP178-2 : 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 : art10.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 538.1s
% Output : Assurance 538.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/GRP178-2+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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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(21,40,1,42,0,1,426,50,50,447,0,50,37788,3,3002,43337,4,4476,48201,5,5951,48201,1,5951,48201,50,5955,48201,40,5955,48222,0,5955,48643,50,6018,48664,0,6018,67470,3,7469,70241,4,8194,72227,5,8919,72227,1,8919,72227,50,8921,72227,40,8921,72248,0,8921,115252,3,10452,121712,4,11172,136089,1,11923,136089,50,11928,136089,40,11928,136110,0,11928,496354,3,20937,847416,4,25436,1164920,5,29929,1164920,1,29929,1164920,50,29935,1164920,40,29935,1164941,0,29935,1399445,3,35956,1498642,4,38952,1583994,5,41936,1583995,1,41936,1583995,50,41941,1583995,40,41941,1584016,0,41941,1804466,3,44957,1900542,4,46450,2032219,5,47942,2032219,1,47942,2032219,50,47947,2032219,40,47947,2032240,0,47947,2134918,3,50950,2176023,4,52450,2212973,5,53950,2212973,1,53950,2212973,50,53955,2212973,40,53955,2212994,0,53956)
%
%
% START OF PROOF
% 136228 [?] ?
% 136414 [?] ?
% 164507 [?] ?
% 164616 [para:164507.1.2,136228.1.1.2,demod:136414] equal(X,greatest_lower_bound(multiply(X,least_upper_bound(greatest_lower_bound(b,c),Y)),X)).
% 1584022 [?] ?
% 1584081 [?] ?
% 1590191 [para:1584081.1.2,1584022.1.1] -equal(greatest_lower_bound(a,greatest_lower_bound(least_upper_bound(X,a),multiply(b,c))),greatest_lower_bound(c,a)).
% 2212975 [] equal(multiply(identity,X),X).
% 2212978 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 2212979 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 2212984 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 2212989 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 2212993 [] equal(greatest_lower_bound(a,b),identity).
% 2213002 [para:2212978.1.1,2212984.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,X)),X).
% 2213041 [para:2213002.1.1,2212979.1.1] equal(X,least_upper_bound(greatest_lower_bound(Y,X),X)).
% 2213165 [para:2213041.1.2,164616.1.2.1.2] equal(X,greatest_lower_bound(multiply(X,c),X)).
% 2213177 [para:2213165.1.2,2212984.1.1.2] equal(least_upper_bound(multiply(X,c),X),multiply(X,c)).
% 2213310 [para:2213177.1.1,1590191.1.1.2.1,demod:2212975,2212993,2212989,cut:2212978] 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 smaller arities for lex ordering
% using clause demodulation
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21732
% derived clauses: 12963375
% kept clauses: 448796
% kept size sum: 3903
% kept mid-nuclei: 0
% kept new demods: 374848
% forw unit-subs: 9751528
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 487
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 542.6
% process. runtime: 539.57
% 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/GRP178-2+eq_r.in")
%
%------------------------------------------------------------------------------