TSTP Solution File: COL042-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL042-2 : 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 : art01.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/COL042-2+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 8 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(w1,X),Y),apply(apply(Y,X),X)).
% 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(apply(b,apply(w1,w1)),apply(b,w1))),b)),b)).
% 11 [para:8.1.2,8.1.1] equal(apply(apply(w1,X),w1),apply(apply(X,X),X)).
% 21 [binary:10,9.2,demod:7] -equal(apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt)))),apply(fixed_pt,apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt)))))).
% 22 [para:7.1.1,8.1.2] equal(apply(apply(w1,X),apply(b,Y)),apply(Y,apply(X,X))).
% 26 [para:7.1.1,11.1.2.1] equal(apply(apply(w1,apply(apply(b,X),Y)),w1),apply(apply(X,apply(Y,apply(apply(b,X),Y))),apply(apply(b,X),Y))).
% 38 [para:22.1.2,7.1.1] equal(apply(apply(w1,X),apply(b,apply(apply(b,Y),Z))),apply(Y,apply(Z,apply(X,X)))).
% 40 [para:22.1.2,7.1.1.1.1] equal(apply(apply(apply(apply(w1,X),apply(b,b)),Y),Z),apply(apply(X,X),apply(Y,Z))).
% 42 [para:22.1.2,22.1.1] equal(apply(apply(w1,b),apply(b,apply(w1,X))),apply(b,apply(X,X))).
% 44 [para:22.1.2,22.1.1.2] equal(apply(apply(w1,X),apply(apply(w1,Y),apply(b,b))),apply(apply(Y,Y),apply(X,X))).
% 300 [para:42.1.1,8.1.1,demod:7] equal(apply(b,apply(X,X)),apply(apply(w1,X),apply(b,b))).
% 307 [?] ?
% 501 [para:26.1.2,7.1.1] equal(apply(apply(w1,apply(apply(b,apply(b,X)),Y)),w1),apply(X,apply(apply(Y,apply(apply(b,apply(b,X)),Y)),apply(apply(b,apply(b,X)),Y)))).
% 1487 [para:22.1.2,38.1.2.2] equal(apply(apply(w1,X),apply(b,apply(apply(b,Y),Z))),apply(Y,apply(apply(w1,X),apply(b,Z)))).
% 1563 [para:300.1.2,38.1.2.2,demod:307,1487] equal(apply(X,apply(apply(w1,Y),apply(b,b))),apply(X,apply(b,apply(Y,Y)))).
% 2809 [para:40.1.2,8.1.1] equal(apply(apply(apply(apply(w1,w1),apply(b,b)),X),Y),apply(apply(apply(X,Y),w1),w1)).
% 4641 [para:44.1.1,1563.1.1] equal(apply(apply(X,X),apply(Y,Y)),apply(apply(w1,Y),apply(b,apply(X,X)))).
% 4763 [para:4641.1.1,40.1.1.1.1,demod:2809,307] equal(apply(apply(apply(X,Y),w1),w1),apply(apply(w1,w1),apply(X,Y))).
% 4790 [para:7.1.1,4763.1.1.1] equal(apply(apply(X,apply(Y,w1)),w1),apply(apply(w1,w1),apply(apply(b,X),Y))).
% 4846 [para:4790.1.2,21.1.1,demod:4790] -equal(apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1),apply(fixed_pt,apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1))).
% 5833 [para:8.1.1,4846.1.2.2,demod:501,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: 133
% derived clauses: 39321
% kept clauses: 5821
% kept size sum: 181480
% kept mid-nuclei: 0
% kept new demods: 1651
% forw unit-subs: 33498
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 11
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.24
% process. runtime: 2.22
% 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/COL042-2+eq_r.in")
%
%------------------------------------------------------------------------------