TSTP Solution File: BOO038-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO038-1 : TPTP v3.4.2. Released v2.5.0.
% 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 : Unknown 546.3s
% Output : None
% 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/BOO/BOO038-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 9 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 9 5)
% (binary-posweight-lex-big-order 30 #f 9 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(add(b,a),add(a,b)) | -equal(add(add(a,b),c),add(a,add(b,c))) | -equal(add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))),a).
% was split for some strategies as:
% -equal(add(b,a),add(a,b)).
% -equal(add(add(a,b),c),add(a,add(b,c))).
% -equal(add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))),a).
%
% Starting a split proof attempt with 3 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(add(b,a),add(a,b)) | -equal(add(add(a,b),c),add(a,add(b,c))) | -equal(add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))),a).
% Split part used next: -equal(add(b,a),add(a,b)).
% END OF PROOFPART
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,8582,4,757,8748,5,1002,8750,1,1003,8750,50,1004,8750,40,1004,8753,0,1004,10446,3,1206,11319,4,1307,12634,5,1405,12634,1,1405,12634,50,1405,12634,40,1405,12637,0,1405,15096,3,1607,15912,4,1709,17688,5,1806,17688,1,1806,17688,50,1806,17688,40,1806,17691,0,1806,27596,3,2825,28984,4,3316,30781,5,3807,30781,1,3807,30781,50,3808,30781,40,3808,30784,0,3808,37049,3,4309,38415,4,4561,40487,5,4809,40487,1,4809,40487,50,4810,40487,40,4810,40490,0,4810,40491,50,4810,40491,40,4810,40494,0,4823,57935,3,7464,61220,4,8729,64495,5,10024,64495,1,10024,64495,50,10025,64495,40,10025,64498,0,10025,83743,3,11735,87813,4,12579,88815,5,13426,88815,1,13426,88815,50,13427,88815,40,13427,88818,0,13427,101497,3,14435,106863,4,14935,112449,5,15428,112449,1,15428,112449,50,15430,112449,40,15430,112452,0,15430,119157,3,15932,122647,4,16185,124978,5,16431,124978,1,16431,124978,50,16432,124978,40,16432,124981,0,16432,138305,3,17234,142780,4,17635,145179,5,18033,145179,1,18033,145179,50,18034,145179,40,18034,145182,0,18034,151180,3,18537,154693,4,18787,157398,5,19035,157398,1,19035,157398,50,19036,157398,40,19036,157398,40,19036,157401,0,19036)
%
%
% START OF PROOF
% 157400 [] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,inverse(add(inverse(Z),inverse(add(Z,U)))))))),Z).
% 157401 [] -equal(add(b,a),add(a,b)).
% 157402 [para:157400.1.1,157400.1.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(inverse(add(Z,U)),X)),inverse(add(inverse(Y),inverse(add(Y,V)))))))),Y).
% 157404 [para:157400.1.1,157402.1.1.1.2] equal(inverse(add(inverse(add(X,inverse(X))),X)),inverse(X)).
% 157405 [para:157404.1.1,157400.1.1.1.1] equal(inverse(add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y)))))))),X).
% 157408 [para:157405.1.1,157400.1.1.1.2.1.2] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,Z)))),Z).
% 157414 [para:157405.1.1,157405.1.1.1.2.1.2] equal(inverse(add(inverse(X),inverse(add(X,X)))),X).
% 157419 [para:157408.1.1,157402.1.1.1.2] equal(inverse(add(inverse(add(inverse(add(X,Y)),X)),inverse(add(X,Y)))),X).
% 157421 [para:157405.1.1,157408.1.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(X),Y)))),Y).
% 157424 [para:157408.1.1,157408.1.1.1.1] equal(inverse(add(X,inverse(add(inverse(add(Y,Z)),inverse(add(Y,X)))))),inverse(add(Y,X))).
% 157427 [para:157404.1.1,157421.1.1.1.2] equal(inverse(add(inverse(add(add(X,inverse(X)),X)),inverse(X))),X).
% 157433 [para:157421.1.1,157408.1.1.1.1] equal(inverse(add(X,inverse(add(Y,inverse(add(inverse(Y),X)))))),inverse(add(inverse(Y),X))).
% 157442 [para:157427.1.1,157408.1.1.1.1] equal(inverse(add(X,inverse(add(add(X,inverse(X)),inverse(X))))),inverse(X)).
% 157455 [para:157442.1.1,157405.1.1.1.2.1.2.1.2,demod:157433] equal(inverse(add(inverse(X),inverse(X))),X).
% 157457 [para:157442.1.1,157408.1.1.1.1.1.1] equal(inverse(add(inverse(add(inverse(X),Y)),inverse(add(X,Y)))),Y).
% 157460 [para:157400.1.1,157455.1.1.1.1,demod:157400] equal(inverse(add(X,X)),add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,inverse(add(inverse(X),inverse(add(X,U)))))))).
% 157465 [para:157404.1.1,157455.1.1.1.1,demod:157455,157404] equal(X,add(inverse(add(X,inverse(X))),X)).
% 157468 [para:157405.1.1,157455.1.1.1.1,demod:157405] equal(inverse(add(X,X)),add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y)))))))).
% 157470 [para:157455.1.1,157414.1.1.1.2] equal(inverse(add(inverse(inverse(X)),X)),inverse(X)).
% 157484 [para:157455.1.1,157455.1.1.1.1,demod:157455] equal(inverse(add(X,X)),add(inverse(X),inverse(X))).
% 157486 [para:157465.1.2,157400.1.1.1.1.1,demod:157468] equal(inverse(inverse(add(X,X))),X).
% 157495 [para:157470.1.1,157421.1.1.1.2] equal(inverse(add(inverse(add(inverse(X),X)),inverse(X))),X).
% 157501 [para:157470.1.1,157455.1.1.1.1,demod:157486,157484,157470] equal(X,add(inverse(inverse(X)),X)).
% 157507 [para:157495.1.1,157408.1.1.1.1,demod:157486,157484] equal(inverse(add(X,X)),inverse(X)).
% 157513 [para:157495.1.1,157455.1.1.1.1,demod:157507,157495] equal(inverse(X),add(inverse(add(inverse(X),X)),inverse(X))).
% 157514 [para:157470.1.1,157495.1.1.1.1.1.1,demod:157513,157501] equal(inverse(inverse(X)),X).
% 157516 [para:157495.1.1,157484.1.2.1,demod:157514,157507,157484,157513] equal(X,add(X,X)).
% 157522 [para:157516.1.2,157408.1.1.1.2.1] equal(inverse(add(inverse(add(inverse(add(X,Y)),X)),inverse(X))),X).
% 157549 [para:157457.1.1,157414.1.1.1.1,demod:157457,157516] equal(inverse(X),add(inverse(add(inverse(Y),X)),inverse(add(Y,X)))).
% 157589 [para:157408.1.1,157522.1.1.1.1,demod:157514] equal(inverse(add(X,add(Y,X))),inverse(add(Y,X))).
% 157597 [para:157589.1.1,157414.1.1.1.1,demod:157514,157484,157589,157516] equal(add(X,Y),add(Y,add(X,Y))).
% 157641 [para:157549.1.2,157597.1.2.2,demod:157549] equal(inverse(X),add(inverse(add(Y,X)),inverse(X))).
% 157651 [para:157400.1.1,157641.1.2.2,demod:157514,157516,157460] equal(X,add(inverse(add(Y,inverse(X))),X)).
% 157653 [para:157651.1.2,157408.1.1.1.1.1] equal(inverse(add(inverse(X),inverse(add(Y,X)))),X).
% 157658 [para:157653.1.1,157414.1.1.1.1,demod:157653,157516] equal(inverse(X),add(inverse(X),inverse(add(Y,X)))).
% 157690 [para:157419.1.1,157658.1.2.2,demod:157514] equal(add(X,Y),add(add(X,Y),X)).
% 157704 [para:157690.1.2,157658.1.2.2.1] equal(inverse(X),add(inverse(X),inverse(add(X,Y)))).
% 157743 [para:157442.1.1,157424.1.1.1.2.1.1,demod:157514,157704] equal(inverse(add(X,Y)),inverse(add(Y,X))).
% 157758 [para:157743.1.1,157405.1.1.1.1,demod:157516,157514,157704] equal(inverse(add(inverse(add(X,Y)),inverse(add(Y,X)))),add(Y,X)).
% 157765 [para:157743.1.1,157455.1.1.1.2,demod:157758,slowcut:157401] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 9
% seconds given: 12
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(add(b,a),add(a,b)) | -equal(add(add(a,b),c),add(a,add(b,c))) | -equal(add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))),a).
% Split part used next: -equal(add(add(a,b),c),add(a,add(b,c))).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 9
% seconds given: 12
%
%
% proof attempt stopped: time limit
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 4
%
%
% proof attempt stopped: time limit
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 4
%
%
% proof attempt stopped: time limit
%
% 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
% clause length limited to 5
% clause depth limited to 9
% seconds given: 26
%
%
% proof attempt stopped: time limit
%
% old unit clauses discarded
%
% 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 5
% clause depth limited to 9
% seconds given: 12
%
%
% proof attempt stopped: time limit
%
% using binary resolution
% 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: 12
%
%
% proof attempt stopped: sos exhausted
%
% 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: 68
%
%
% proof attempt stopped: time limit
%
% old unit clauses discarded
%
% 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
% seconds given: 44
%
%
% proof attempt stopped: time limit
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using first arg depth ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 26
%
%
% proof attempt stopped: time limit
%
% old unit clauses discarded
%
% using binary resolution
% using term-depth-order 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: 12
%
%
% proof attempt stopped: time limit
%
% 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 smaller arities for lex ordering
% using clause demodulation
% seconds given: 20
%
%
% proof attempt stopped: time limit
%
% 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: 130
%
%
% proof attempt stopped: time limit
%
% old unit clauses discarded
%
% Split attempt finished with FAILURE.
%
% time limit exhausted: proof search terminated.
%
% Global statistics over all passes:
%
% given clauses: 9993
% derived clauses: 14314313
% kept clauses: 346146
% kept size sum: 0
% kept mid-nuclei: 2
% kept new demods: 237982
% forw unit-subs: 13826612
% forw double-subs: 216
% forw overdouble-subs: 395
% backward subs: 2507
% fast unit cutoff: 240
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 553.0
% process. runtime: 548.75
% specific non-discr-tree subsumption statistics:
% tried: 395
% 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/BOO/BOO038-1+eq_r.in")
%
%------------------------------------------------------------------------------