TSTP Solution File: CAT018-4 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT018-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 : art01.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/CAT018-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(15,40,0,30,0,0)
% 
% 
% START OF PROOF
% 20 [] -there_exists(domain(X)) | there_exists(X).
% 22 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 23 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 24 [] -equal(domain(X),codomain(Y)) | there_exists(compose(X,Y)) | -there_exists(domain(X)).
% 25 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)).
% 27 [] equal(compose(codomain(X),X),X).
% 28 [] there_exists(compose(a,b)).
% 29 [] there_exists(compose(b,c)).
% 30 [] -there_exists(compose(a,compose(b,c))).
% 36 [binary:28,22] there_exists(domain(a)).
% 39 [binary:29,22,binarydemod:20] there_exists(b).
% 50 [binary:28,23.2] equal(domain(a),codomain(b)).
% 53 [para:27.1.1,23.2.1] equal(domain(codomain(X)),codomain(X)) | -there_exists(X).
% 66 [para:50.1.2,27.1.1.1] equal(compose(domain(a),b),b).
% 93 [binary:39,53.2,demod:50] equal(domain(domain(a)),domain(a)).
% 110 [para:66.1.1,25.1.2.1] equal(compose(domain(a),compose(b,X)),compose(b,X)).
% 172 [para:110.1.1,23.2.1,demod:93] equal(domain(a),codomain(compose(b,X))) | -there_exists(compose(b,X)).
% 191 [binary:29,172.2] equal(domain(a),codomain(compose(b,c))).
% 193 [binary:24,191,cut:30,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:    107
%  derived clauses:   718
%  kept clauses:      114
%  kept size sum:     933
%  kept mid-nuclei:   0
%  kept new demods:   23
%  forw unit-subs:    300
%  forw double-subs: 54
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  25
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           12
%  length fails:    9
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 3
%  full subs fail:  3
% 
% ; 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/CAT018-4+eq_r.in")
% 
%------------------------------------------------------------------------------