TSTP Solution File: CAT004-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT004-2 : 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 : art09.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/CAT/CAT004-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 9)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 9)
% (binary-posweight-lex-big-order 30 #f 3 9)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(15,40,0,30,0,0,74,50,0,89,0,0,153,50,0,168,0,1,232,50,1,247,0,1,311,50,2,326,0,2,390,50,2,405,0,2,469,50,3,484,0,3,548,50,3,563,0,3,627,50,3,642,0,3,706,50,4,721,0,4,785,50,4,800,0,4,864,50,4,879,0,4,943,50,5,958,0,5,1022,50,5,1037,0,5,1101,50,6,1116,0,6,1180,50,6,1195,0,6,1259,50,6,1274,0,6,1338,50,7,1353,0,7,1417,50,7,1432,0,7,1496,50,8,1496,40,8,1511,0,8)
%
%
% START OF PROOF
% 1497 [] equal(X,X).
% 1498 [] equal(codomain(domain(X)),domain(X)).
% 1502 [] equal(domain(compose(X,Y)),domain(X)) | -equal(codomain(X),domain(Y)).
% 1503 [] equal(codomain(compose(X,Y)),codomain(Y)) | -equal(codomain(X),domain(Y)).
% 1504 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)) | -equal(codomain(Y),domain(Z)) | -equal(codomain(X),domain(Y)).
% 1505 [] -equal(compose(a,Z),Y) | -equal(codomain(a),domain(Z)) | -equal(codomain(a),domain(X)) | -equal(compose(a,X),Y) | equal(X,Z).
% 1506 [] -equal(compose(b,Z),Y) | -equal(codomain(b),domain(Z)) | -equal(codomain(b),domain(X)) | -equal(compose(b,X),Y) | equal(X,Z).
% 1507 [] equal(codomain(a),domain(b)).
% 1508 [] equal(codomain(compose(a,b)),domain(h)).
% 1509 [] equal(domain(h),domain(g)).
% 1510 [] equal(compose(compose(a,b),h),compose(compose(a,b),g)).
% 1511 [] -equal(h,g).
% 1537 [binary:1497,1506] -equal(compose(b,X),compose(b,Y)) | -equal(codomain(b),domain(Y)) | -equal(codomain(b),domain(X)) | equal(X,Y).
% 1565 [para:1502.1.1,1498.1.1.1,demod:1498] equal(domain(X),domain(compose(X,Y))) | -equal(codomain(X),domain(Y)).
% 1597 [binary:1507,1503.2,demod:1508] equal(domain(h),codomain(b)).
% 1619 [para:1502.1.1,1597.2.2] equal(domain(compose(X,h)),domain(X)) | -equal(codomain(X),codomain(b)).
% 1652 [para:1504.1.2,1510.1.2,demod:1507,1597,1509,cut:1497,cut:1497] equal(compose(compose(a,b),h),compose(a,compose(b,g))).
% 1711 [para:1652.1.1,1504.1.2,demod:1507,1597,cut:1497,cut:1497] equal(compose(a,compose(b,h)),compose(a,compose(b,g))).
% 1772 [para:1509.1.2,1565.2.2,demod:1597] equal(domain(X),domain(compose(X,g))) | -equal(codomain(X),codomain(b)).
% 1816 [binary:1497,1619.2,demod:1507] equal(domain(compose(b,h)),codomain(a)).
% 1862 [binary:1497,1772.2,demod:1507] equal(codomain(a),domain(compose(b,g))).
% 2242 [binary:1511,1537.4,demod:1509,1597,cut:1497] -equal(compose(b,h),compose(b,g)).
% 2269 [binary:1505.5,2242,demod:1711,1862,1816,cut:1497,slowcut:1711] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 692
% derived clauses: 5725
% kept clauses: 1020
% kept size sum: 15158
% kept mid-nuclei: 764
% kept new demods: 533
% forw unit-subs: 3043
% forw double-subs: 226
% forw overdouble-subs: 284
% backward subs: 39
% fast unit cutoff: 266
% full unit cutoff: 2
% dbl unit cutoff: 1
% real runtime : 0.16
% process. runtime: 0.14
% specific non-discr-tree subsumption statistics:
% tried: 3669
% length fails: 214
% strength fails: 1120
% predlist fails: 53
% aux str. fails: 224
% by-lit fails: 86
% full subs tried: 1904
% full subs fail: 1628
%
% ; 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/CAT/CAT004-2+eq_r.in")
%
%------------------------------------------------------------------------------