TSTP Solution File: CAT004-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT004-4 : 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 : art06.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-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(18,40,1,36,0,1)
%
%
% START OF PROOF
% 19 [] equal(X,X).
% 23 [] -there_exists(domain(X)) | there_exists(X).
% 25 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 26 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 28 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)).
% 29 [] equal(compose(X,domain(X)),X).
% 30 [] equal(compose(codomain(X),X),X).
% 31 [] there_exists(compose(a,b)).
% 32 [] -equal(compose(Z,a),Y) | -equal(compose(X,a),Y) | equal(X,Z).
% 33 [] -equal(compose(Z,b),Y) | -equal(compose(X,b),Y) | equal(X,Z).
% 34 [] there_exists(h).
% 35 [] equal(compose(h,compose(a,b)),compose(g,compose(a,b))).
% 36 [] -equal(h,g).
% 45 [binary:19,33] -equal(compose(X,b),compose(Y,b)) | equal(X,Y).
% 53 [binary:31,25,binarydemod:23] there_exists(a).
% 55 [para:30.1.1,25.1.1] there_exists(domain(codomain(X))) | -there_exists(X).
% 65 [binary:53,55.2] there_exists(domain(codomain(a))).
% 69 [binary:23,65] there_exists(codomain(a)).
% 86 [para:30.1.1,26.2.1] equal(domain(codomain(X)),codomain(X)) | -there_exists(X).
% 95 [para:28.1.2,32.1.1] -equal(compose(X,compose(Y,a)),Z) | -equal(compose(U,a),Z) | equal(U,compose(X,Y)).
% 108 [para:28.1.2,45.1.1] -equal(compose(X,compose(Y,b)),compose(Z,b)) | equal(compose(X,Y),Z).
% 137 [binary:53,86.2] equal(domain(codomain(a)),codomain(a)).
% 142 [para:137.1.1,29.1.1.2] equal(compose(codomain(a),codomain(a)),codomain(a)).
% 154 [para:142.1.1,26.2.1,demod:137,cut:69] equal(codomain(a),codomain(codomain(a))).
% 218 [para:30.1.1,95.1.1.2] equal(X,compose(Y,codomain(a))) | -equal(compose(X,a),Z) | -equal(compose(Y,a),Z).
% 220 [para:30.1.1,95.1.1.2,factor:slowcut:19] equal(X,compose(X,codomain(a))).
% 221 [para:220.1.2,26.2.1,demod:154] equal(domain(X),codomain(a)) | -there_exists(X).
% 223 [binary:34,221.2] equal(domain(h),codomain(a)).
% 225 [binary:53,221.2,demod:223] equal(domain(a),domain(h)).
% 232 [para:223.1.2,220.1.2.2,demod:225] equal(X,compose(X,domain(a))).
% 297 [para:35.1.2,108.1.1] -equal(compose(h,compose(a,b)),compose(X,b)) | equal(compose(g,a),X).
% 637 [binary:19,218.2,demod:232,225,223] -equal(compose(X,a),compose(Y,a)) | equal(Y,X).
% 658 [binary:28,297,binarydemod:637,cut:36] 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 5
% clause depth limited to 3
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 429
% derived clauses: 6315
% kept clauses: 476
% kept size sum: 4099
% kept mid-nuclei: 0
% kept new demods: 72
% forw unit-subs: 3483
% forw double-subs: 309
% forw overdouble-subs: 29
% backward subs: 6
% fast unit cutoff: 119
% full unit cutoff: 1
% dbl unit cutoff: 2
% real runtime : 0.9
% process. runtime: 0.8
% specific non-discr-tree subsumption statistics:
% tried: 52
% length fails: 12
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 40
% full subs fail: 11
%
% ; 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-4+eq_r.in")
%
%------------------------------------------------------------------------------