TSTP Solution File: CAT005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT005-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 : art02.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/CAT005-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,3640,50,17,3662,0,17,44015,50,284,44037,0,284,158925,50,1377,158947,0,1377,356297,50,3641,356297,40,3641,356319,0,3641)
%
%
% START OF PROOF
% 356301 [] -product(X,Y,Z) | -defined(Z,U) | defined(Y,U).
% 356308 [] identity_map(domain(X)).
% 356312 [] product(X,domain(X),X).
% 356314 [] product(X,Y,Y) | -defined(X,Y) | -identity_map(X).
% 356315 [] product(X,Y,X) | -defined(X,Y) | -identity_map(Y).
% 356316 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 356317 [] defined(a,d).
% 356318 [] identity_map(d).
% 356319 [] -equal(domain(a),d).
% 356336 [binary:356312,356301] defined(domain(X),Y) | -defined(X,Y).
% 356339 [binary:356317,356336.2] defined(domain(a),d).
% 356341 [binary:356314.2,356339,cut:356308] product(domain(a),d,d).
% 356354 [binary:356339,356315.2,cut:356318] product(domain(a),d,domain(a)).
% 356473 [binary:356341,356316] -product(domain(a),d,X) | equal(X,d).
% 356730 [binary:356354,356473,cut:356319] 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: 2042
% derived clauses: 3732924
% kept clauses: 2160
% kept size sum: 17288
% kept mid-nuclei: 354317
% kept new demods: 50
% forw unit-subs: 2545774
% forw double-subs: 135045
% forw overdouble-subs: 6
% backward subs: 10
% fast unit cutoff: 1526
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 36.43
% process. runtime: 36.42
% specific non-discr-tree subsumption statistics:
% tried: 31683
% length fails: 26
% strength fails: 15124
% predlist fails: 12926
% aux str. fails: 2824
% by-lit fails: 0
% full subs tried: 783
% full subs fail: 777
%
% ; 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-1+eq_r.in")
%
%------------------------------------------------------------------------------