TSTP Solution File: CAT005-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT005-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 19.5s
% Output : Assurance 19.5s
% 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/CAT005-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,1,44,0,1,30038,4,1881,57263,5,2502,57264,1,2502,57264,50,2503,57264,40,2503,57286,0,2503)
%
%
% START OF PROOF
% 57265 [] equal(X,X).
% 57270 [] -there_exists(codomain(X)) | there_exists(X).
% 57271 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 57272 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 57276 [] equal(compose(codomain(X),X),X).
% 57283 [] there_exists(compose(a,d)).
% 57284 [] equal(compose(X,d),X) | -there_exists(compose(X,d)).
% 57286 [] -equal(domain(a),d).
% 57302 [para:57276.1.1,57284.1.1,demod:57276] equal(d,codomain(d)) | -there_exists(d).
% 57313 [binary:57283,57271] there_exists(domain(a)).
% 57325 [binary:57283,57272.2] equal(domain(a),codomain(d)).
% 57348 [para:57325.1.2,57270.1.1,cut:57313] there_exists(d).
% 57350 [para:57325.1.2,57302.1.2,cut:57348] equal(d,domain(a)).
% 57368 [para:57350.1.2,57286.1.1,cut:57265] 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: 486
% derived clauses: 263250
% kept clauses: 49472
% kept size sum: 412
% kept mid-nuclei: 1924
% kept new demods: 18
% forw unit-subs: 8012
% forw double-subs: 4745
% forw overdouble-subs: 41622
% backward subs: 8
% fast unit cutoff: 543
% full unit cutoff: 0
% dbl unit cutoff: 532
% real runtime : 25.55
% process. runtime: 25.2
% specific non-discr-tree subsumption statistics:
% tried: 12694230
% length fails: 1179172
% strength fails: 2196919
% predlist fails: 2174539
% aux str. fails: 456718
% by-lit fails: 603354
% full subs tried: 5152892
% full subs fail: 5113116
%
% ; 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/CAT005-3+eq_r.in")
%
%------------------------------------------------------------------------------