TSTP Solution File: CAT006-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT006-1 : 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 30.0s
% Output : Assurance 30.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-1+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: long
%
% strategies selected:
% (hyper 58 #f 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,1,44,0,1,3641,50,16,3663,0,16,45082,50,292,45104,0,292,161611,50,1425,161633,0,1425,361029,50,3779,361029,40,3779,361051,0,3779)
%
%
% START OF PROOF
% 361036 [] -product(X,Y,Z) | -defined(U,Z) | defined(U,X).
% 361041 [] identity_map(codomain(X)).
% 361043 [] defined(codomain(X),X).
% 361046 [] product(X,Y,Y) | -defined(X,Y) | -identity_map(X).
% 361047 [] product(X,Y,X) | -defined(X,Y) | -identity_map(Y).
% 361048 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 361049 [] defined(h,a).
% 361050 [] identity_map(h).
% 361051 [] -equal(codomain(a),h).
% 361062 [binary:361049,361046.2,cut:361050] product(h,a,a).
% 361115 [binary:361062,361036] -defined(X,a) | defined(X,h).
% 361120 [binary:361043,361115] defined(codomain(a),h).
% 361121 [binary:361046.2,361120,cut:361041] product(codomain(a),h,h).
% 361122 [binary:361047.2,361120,cut:361050] product(codomain(a),h,codomain(a)).
% 361208 [binary:361121,361048] -product(codomain(a),h,X) | equal(X,h).
% 361474 [binary:361122,361208,cut:361051] 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 7
% clause depth limited to 2
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2058
% derived clauses: 3811968
% kept clauses: 2180
% kept size sum: 17474
% kept mid-nuclei: 359038
% kept new demods: 50
% forw unit-subs: 2608429
% forw double-subs: 134676
% forw overdouble-subs: 6
% backward subs: 10
% fast unit cutoff: 1530
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 37.82
% process. runtime: 37.80
% specific non-discr-tree subsumption statistics:
% tried: 31896
% length fails: 25
% strength fails: 15264
% predlist fails: 12974
% aux str. fails: 2824
% by-lit fails: 0
% full subs tried: 809
% full subs fail: 803
%
% ; 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-1+eq_r.in")
%
%------------------------------------------------------------------------------