TSTP Solution File: CAT009-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT009-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 : art05.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 50.0s
% Output : Assurance 50.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/CAT009-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 3 7)
% (binary-posweight-order 29 #f 3 7)
% (binary-unit 29 #f 3 7)
% (binary-double 29 #f 3 7)
% (binary 29 #t 3 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(21,40,0,42,0,0,36895,50,232,36916,0,232,139778,50,1147,139799,0,1147,293600,50,2776,293621,0,2776,467200,4,5028)
%
%
% START OF PROOF
% 293601 [] equal(X,X).
% 293602 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 293604 [] -product(X,Y,Z) | -defined(Z,U) | defined(Y,U).
% 293605 [] -product(X,Y,Z) | -product(Y,U,V) | -defined(Z,U) | defined(X,V).
% 293607 [] -product(X,Y,Z) | -defined(U,Z) | defined(U,X).
% 293611 [] identity_map(domain(X)).
% 293612 [] identity_map(codomain(X)).
% 293613 [] defined(X,domain(X)).
% 293614 [] defined(codomain(X),X).
% 293615 [] product(X,domain(X),X).
% 293616 [] product(codomain(X),X,X).
% 293617 [] product(X,Y,Y) | -defined(X,Y) | -identity_map(X).
% 293618 [] product(X,Y,X) | -defined(X,Y) | -identity_map(Y).
% 293619 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 293620 [] defined(b,a).
% 293621 [] -equal(domain(compose(b,a)),domain(a)).
% 293628 [hyper:293602,293620] product(b,a,compose(b,a)).
% 293650 [hyper:293602,293614] product(codomain(X),X,compose(codomain(X),X)).
% 293739 [hyper:293604,293628,293613] defined(a,domain(compose(b,a))).
% 293743 [hyper:293605,293628,293616,cut:293620] defined(codomain(b),compose(b,a)).
% 296608 [hyper:293604,293739,293615] defined(domain(a),domain(compose(b,a))).
% 296671 [hyper:293607,293743,293616] defined(codomain(b),codomain(compose(b,a))).
% 298372 [hyper:293619,293650,293616] equal(X,compose(codomain(X),X)).
% 310704 [hyper:293617,296608,cut:293611] product(domain(a),domain(compose(b,a)),domain(compose(b,a))).
% 310705 [hyper:293618,296608,cut:293611] product(domain(a),domain(compose(b,a)),domain(a)).
% 310749 [hyper:293617,296671,cut:293612] product(codomain(b),codomain(compose(b,a)),codomain(compose(b,a))).
% 310750 [hyper:293618,296671,cut:293612] product(codomain(b),codomain(compose(b,a)),codomain(b)).
% 455205 [hyper:293619,310704,310705] equal(domain(a),domain(compose(b,a))).
% 456706 [hyper:293619,310749,310750] equal(codomain(b),codomain(compose(b,a))).
% 456810 [para:456706.1.2,298372.1.2.1] equal(compose(b,a),compose(codomain(b),compose(b,a))).
% 467201 [para:456810.1.1,293621.1.1.1,demod:455205,456810,cut:293601] 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 6
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2433
% derived clauses: 3606237
% kept clauses: 2363
% kept size sum: 20499
% kept mid-nuclei: 464684
% kept new demods: 61
% forw unit-subs: 2270438
% forw double-subs: 150493
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2259
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 50.30
% process. runtime: 50.28
% specific non-discr-tree subsumption statistics:
% tried: 40420
% length fails: 16
% strength fails: 448
% predlist fails: 30788
% aux str. fails: 7096
% by-lit fails: 0
% full subs tried: 2072
% full subs fail: 2072
%
% ; 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/CAT009-1+eq_r.in")
%
%------------------------------------------------------------------------------