TSTP Solution File: COL003-8 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL003-8 : TPTP v3.4.2. Released v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.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/COL003-8+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 6 3)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] equal(X,X).
% 7 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 8 [] equal(apply(apply(w,X),Y),apply(apply(X,Y),Y)).
% 9 [] -equal(apply(X,fixed_pt),apply(fixed_pt,apply(X,fixed_pt))) | fixed_point(X).
% 10 [] -fixed_point(apply(apply(b,apply(apply(b,apply(w,w)),apply(b,w))),apply(apply(b,b),b))).
% 11 [para:8.1.2,8.1.1] equal(apply(apply(w,w),X),apply(apply(X,X),X)).
% 12 [para:8.1.1,8.1.2.1] equal(apply(apply(w,apply(w,X)),Y),apply(apply(apply(X,Y),Y),Y)).
% 13 [para:8.1.2,8.1.2.1] equal(apply(apply(w,apply(X,Y)),Y),apply(apply(apply(w,X),Y),Y)).
% 24 [binary:10,9.2,demod:7] -equal(apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt)))),apply(fixed_pt,apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt)))))).
% 27 [para:7.1.1,8.1.2] equal(apply(apply(w,apply(b,X)),Y),apply(X,apply(Y,Y))).
% 28 [para:7.1.1,8.1.2.1] equal(apply(apply(w,apply(apply(b,X),Y)),Z),apply(apply(X,apply(Y,Z)),Z)).
% 31 [para:7.1.1,11.1.2.1] equal(apply(apply(w,w),apply(apply(b,X),Y)),apply(apply(X,apply(Y,apply(apply(b,X),Y))),apply(apply(b,X),Y))).
% 46 [para:27.1.2,7.1.1.1] equal(apply(apply(apply(w,apply(b,apply(b,X))),Y),Z),apply(X,apply(apply(Y,Y),Z))).
% 57 [para:12.1.2,8.1.2] equal(apply(apply(w,apply(X,Y)),Y),apply(apply(w,apply(w,X)),Y)).
% 467 [para:28.1.2,57.1.1] equal(apply(apply(w,apply(apply(b,w),X)),Y),apply(apply(w,apply(w,X)),Y)).
% 861 [para:31.1.2,57.1.1] equal(apply(apply(w,w),apply(apply(b,w),X)),apply(apply(w,apply(w,X)),apply(apply(b,w),X))).
% 2245 [para:8.1.2,46.1.2.2,demod:13] equal(apply(apply(w,apply(apply(b,apply(b,X)),Y)),Y),apply(X,apply(apply(w,Y),Y))).
% 2295 [para:46.1.1,13.1.2,demod:2245] equal(apply(X,apply(apply(w,Y),Y)),apply(X,apply(apply(Y,Y),Y))).
% 2550 [para:8.1.2,2295.1.1.2] equal(apply(X,apply(apply(w,w),Y)),apply(X,apply(apply(Y,Y),Y))).
% 2778 [para:2550.1.1,24.1.2,demod:861,467,2245,7] -equal(apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt)))),apply(fixed_pt,apply(fixed_pt,apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt))))))).
% 5918 [para:11.1.1,2778.1.1,demod:861,467,2245,7] -equal(apply(fixed_pt,apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt))))),apply(fixed_pt,apply(fixed_pt,apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,fixed_pt))))))).
% 10790 [para:11.1.1,5918.1.1.2,demod:861,467,2245,7,cut:6] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% 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: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 201
% derived clauses: 110557
% kept clauses: 10778
% kept size sum: 367857
% kept mid-nuclei: 0
% kept new demods: 3594
% forw unit-subs: 99777
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 19
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 6.28
% process. runtime: 6.27
% 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/COL003-8+eq_r.in")
%
%------------------------------------------------------------------------------