TSTP Solution File: COL006-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL006-6 : TPTP v3.4.2. Released v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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 0.0s
% Output : Assurance 0.0s
% 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/COL006-6+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 8 1)
% (binary-posweight-lex-big-order 30 #f 8 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)
%
%
% START OF PROOF
% 7 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 8 [] equal(apply(apply(k,X),Y),X).
% 9 [] equal(strong_fixed_point,apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))))).
% 10 [] -equal(apply(strong_fixed_point,fixed_pt),apply(fixed_pt,apply(strong_fixed_point,fixed_pt))).
% 11 [para:7.1.2,8.1.1] equal(apply(apply(apply(s,k),X),Y),Y).
% 12 [para:8.1.1,7.1.2.1] equal(apply(apply(apply(s,apply(k,X)),Y),Z),apply(X,apply(Y,Z))).
% 13 [para:8.1.1,7.1.2.2] equal(apply(apply(apply(s,X),apply(k,Y)),Z),apply(apply(X,Z),Y)).
% 24 [para:9.1.2,7.1.1.1,demod:12,13,8] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(s,apply(k,X)),apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))).
% 1429 [para:24.1.2,7.1.1,demod:24,12,11,slowcut:10] 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
% clause length limited to 1
% clause depth limited to 8
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 42
% derived clauses: 4239
% kept clauses: 1417
% kept size sum: 42289
% kept mid-nuclei: 0
% kept new demods: 491
% forw unit-subs: 2464
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.17
% process. runtime: 0.16
% 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/COL006-6+eq_r.in")
%
%------------------------------------------------------------------------------