TSTP Solution File: CAT017-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT017-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 : art08.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.6s
% Output : Assurance 19.6s
% 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/CAT017-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(20,40,1,40,0,1,27235,4,1886)
%
%
% START OF PROOF
% 31 [] equal(compose(X,domain(X)),X).
% 35 [] -there_exists(compose(X,Y)) | there_exists(codomain(X)).
% 39 [] there_exists(a).
% 40 [] -there_exists(codomain(a)).
% 29920 [binary:35.2,40] -there_exists(compose(a,X)).
% 33384 [para:31.1.1,29920.1.1,cut:39] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 409
% derived clauses: 176939
% kept clauses: 25545
% kept size sum: 777185
% kept mid-nuclei: 1792
% kept new demods: 6
% forw unit-subs: 10559
% forw double-subs: 4549
% forw overdouble-subs: 31401
% backward subs: 125
% fast unit cutoff: 464
% full unit cutoff: 0
% dbl unit cutoff: 590
% real runtime : 20.65
% process. runtime: 20.19
% specific non-discr-tree subsumption statistics:
% tried: 10323732
% length fails: 869381
% strength fails: 1701335
% predlist fails: 763928
% aux str. fails: 614310
% by-lit fails: 915865
% full subs tried: 4307160
% full subs fail: 4275680
%
% ; 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/CAT017-3+eq_r.in")
%
%------------------------------------------------------------------------------