TSTP Solution File: CAT006-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT006-3 : 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 20.0s
% Output : Assurance 20.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/CAT006-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,0,44,0,0,28470,4,1878,57374,5,2501,57374,1,2501,57374,50,2502,57374,40,2502,57396,0,2502)
%
%
% START OF PROOF
% 57375 [] equal(X,X).
% 57379 [] -there_exists(domain(X)) | there_exists(X).
% 57381 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 57382 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 57385 [] equal(compose(X,domain(X)),X).
% 57393 [] there_exists(compose(d,a)).
% 57395 [] equal(compose(d,X),X) | -there_exists(compose(d,X)).
% 57396 [] -equal(codomain(a),d).
% 57411 [para:57385.1.1,57395.1.1,demod:57385] equal(d,domain(d)) | -there_exists(d).
% 57425 [binary:57393,57381,binarydemod:57379] there_exists(d).
% 57430 [binary:57411.2,57425] equal(d,domain(d)).
% 57434 [binary:57393,57382.2,demod:57430] equal(d,codomain(a)).
% 57446 [para:57434.1.2,57396.1.1,cut:57375] 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
% clause length limited to 7
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 460
% derived clauses: 326895
% kept clauses: 50033
% kept size sum: 194
% kept mid-nuclei: 1763
% kept new demods: 19
% forw unit-subs: 11154
% forw double-subs: 6344
% forw overdouble-subs: 38339
% backward subs: 11
% fast unit cutoff: 1739
% full unit cutoff: 0
% dbl unit cutoff: 630
% real runtime : 25.4
% process. runtime: 25.2
% specific non-discr-tree subsumption statistics:
% tried: 13721715
% length fails: 1285593
% strength fails: 2315064
% predlist fails: 1993831
% aux str. fails: 619917
% by-lit fails: 925412
% full subs tried: 5082334
% full subs fail: 5045417
%
% ; 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/CAT006-3+eq_r.in")
%
%------------------------------------------------------------------------------