TSTP Solution File: COL034-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL034-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 : art04.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 89.1s
% Output : Assurance 89.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/COL034-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 ****
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(5,40,0,10,0,0,27,50,0,32,0,0,6396,3,3003,7050,4,4515,8000,5,6001,8000,1,6001,8000,50,6006,8000,40,6006,8005,0,6006,8668,3,7513,8668,4,8259,8668,5,9007,8668,1,9007,8668,50,9007,8668,40,9007,8673,0,9007)
%
%
% START OF PROOF
% 8670 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 8671 [] equal(apply(m,X),apply(X,X)).
% 8672 [] equal(apply(apply(t,X),Y),apply(Y,X)).
% 8673 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 8674 [para:8670.1.1,8673.1.1,demod:8670] -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)))))).
% 8682 [para:8670.1.1,8674.1.1,demod:8670] -equal(apply(X,apply(Y,apply(Z,f(apply(apply(b,apply(apply(b,X),Y)),Z))))),apply(f(apply(apply(b,apply(apply(b,X),Y)),Z)),apply(X,apply(Y,apply(Z,f(apply(apply(b,apply(apply(b,X),Y)),Z))))))).
% 8703 [para:8671.1.1,8682.1.1] -equal(apply(apply(X,apply(Y,f(apply(apply(b,apply(apply(b,m),X)),Y)))),apply(X,apply(Y,f(apply(apply(b,apply(apply(b,m),X)),Y))))),apply(f(apply(apply(b,apply(apply(b,m),X)),Y)),apply(m,apply(X,apply(Y,f(apply(apply(b,apply(apply(b,m),X)),Y))))))).
% 9003 [para:8672.1.1,8703.1.1.2,demod:8672,slowcut:8670] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% 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: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1360
% derived clauses: 3429476
% kept clauses: 8975
% kept size sum: 293593
% kept mid-nuclei: 0
% kept new demods: 610
% forw unit-subs: 808401
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 243
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 91.8
% process. runtime: 90.8
% 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/COL034-1+eq_r.in")
%
%------------------------------------------------------------------------------