TSTP Solution File: COL049-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL049-1 : TPTP v3.4.2. Released v1.0.0.
% 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 99.1s
% Output : Assurance 99.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/COL/COL049-1+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(5,40,1,10,0,1,576,50,2028,581,0,2028,6092,3,3986,7518,4,4963,8079,5,5929,8079,1,5929,8079,50,5929,8079,40,5929,8084,0,5929,8536,3,7441,8536,50,7633,8536,40,7633,8541,0,7633,25761,3,9142,31428,4,9884,35592,1,10634,35592,50,10636,35592,40,10636,35597,0,10636)
%
%
% START OF PROOF
% 35594 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 35595 [] equal(apply(apply(w,X),Y),apply(apply(X,Y),Y)).
% 35596 [] equal(apply(m,X),apply(X,X)).
% 35597 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 35598 [para:35595.1.1,35596.1.2] equal(apply(m,apply(w,X)),apply(apply(X,apply(w,X)),apply(w,X))).
% 35641 [para:35594.1.1,35597.1.1,demod:35594] -equal(apply(X,apply(Y,f(apply(apply(b,X),Y)))),apply(f(apply(apply(b,X),Y)),apply(X,apply(Y,f(apply(apply(b,X),Y)))))).
% 35671 [para:35598.1.2,35595.1.2] equal(apply(apply(w,X),apply(w,X)),apply(m,apply(w,X))).
% 35676 [para:35598.1.2,35594.1.1,demod:35671] equal(apply(m,apply(w,apply(b,X))),apply(X,apply(m,apply(w,apply(b,X))))).
% 37945 [para:35594.1.1,35641.1.1,demod:35594,slowcut:35676] 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: 8467
% derived clauses: 3388536
% kept clauses: 34874
% kept size sum: 63606
% kept mid-nuclei: 0
% kept new demods: 2089
% forw unit-subs: 1078622
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 215
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 108.22
% process. runtime: 107.26
% 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/COL/COL049-1+eq_r.in")
%
%------------------------------------------------------------------------------