%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN014-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 20.0s
% Output : Assurance 20.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/SYN/SYN014-1+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 2 11)
% (binary-unit 9 #f 2 11)
% (binary-double 9 #f 2 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 11)
% (binary-order 25 #f 2 11)
% (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(18,40,0,36,0,0,21115,4,1876,36479,5,2501,36479,1,2501,36479,50,2501,36479,40,2501,36497,0,2501,36589,50,2501,36607,0,2501,36699,50,2502,36717,0,2504,36809,50,2504,36827,0,2504,36919,50,2504,36937,0,2504,37029,50,2504,37047,0,2506,37139,50,2506,37157,0,2506,37249,50,2506,37267,0,2508,37359,50,2508,37377,0,2508,37469,50,2508,37487,0,2508,37579,50,2509,37597,0,2510,37689,50,2510,37707,0,2510,37799,50,2511,37817,0,2512,37909,50,2512,37927,0,2512,38019,50,2513,38037,0,2513,38129,50,2513,38147,0,2514,38239,50,2515,38257,0,2515,38349,50,2515,38367,0,2516,38459,50,2517,38477,0,2517,38569,50,2517,38587,0,2517,38679,50,2517,38679,40,2517,38697,0,2519)
%
%
% START OF PROOF
% 38680 [] equal(X,X).
% 38681 [] -equal(m,n).
% 38682 [] equal(n,k) | equal(m,k).
% 38683 [] -equal(X,k) | element(X,j) | equal(X,j).
% 38684 [] -element(X,j) | equal(X,k) | equal(X,j).
% 38685 [] -equal(f(X),m) | -element(X,m) | equal(X,m).
% 38686 [] -equal(f(X),X) | -element(X,m) | equal(X,m).
% 38687 [] element(X,f(X)) | -element(X,m) | equal(X,m).
% 38688 [] element(f(X),X) | -element(X,m) | equal(X,m).
% 38689 [] element(X,m) | equal(Y,m) | equal(X,m) | -element(X,Y) | -element(Y,X) | equal(Y,X).
% 38690 [] -equal(g(X),n) | element(X,n) | equal(X,n).
% 38691 [] -equal(g(X),X) | element(X,n) | equal(X,n).
% 38693 [] element(g(X),X) | element(X,n) | equal(X,n).
% 38695 [] -equal(X,m) | element(X,k) | equal(X,k).
% 38696 [] -equal(X,n) | element(X,k) | equal(X,k).
% 38697 [] -element(X,k) | equal(X,n) | equal(X,k) | equal(X,m).
% 38700 [binary:38680,38683] element(k,j) | equal(k,j).
% 38713 [para:38682.1.2,38684.2.2] equal(m,k) | -element(X,j) | equal(X,j) | equal(X,n).
% 38716 [para:38684.2.2,38700.2.1] element(k,j) | -element(X,j) | equal(X,j).
% 38719 [binary:38680,38695] element(m,k) | equal(m,k).
% 38721 [para:38682.1.2,38695.2.2,factor:cut:38680] element(m,n) | equal(m,k).
% 38755 [para:38682.2.2,38696.2.2,factor:cut:38680] element(n,m) | equal(n,k).
% 38788 [para:38685.3.2,38681.1.1] -equal(f(X),m) | -element(X,m) | -equal(X,n).
% 38796 [para:38755.2.2,38684.2.2] element(n,m) | -element(X,j) | equal(X,j) | equal(X,n).
% 38801 [para:38755.2.2,38719.2.2,cut:38681] element(n,m) | element(m,k).
% 38828 [para:38700.2.1,38801.2.2] element(n,m) | element(k,j) | element(m,j).
% 38840 [para:38686.3.2,38681.1.1] -equal(f(X),X) | -element(X,m) | -equal(X,n).
% 38874 [para:38687.3.2,38681.1.1] element(X,f(X)) | -element(X,m) | -equal(X,n).
% 38896 [para:38688.3.2,38681.1.1] element(f(X),X) | -element(X,m) | -equal(X,n).
% 38918 [para:38689.2.2,38681.1.1] -equal(X,n) | element(Y,m) | equal(Y,m) | -element(X,Y) | -element(Y,X) | equal(X,Y).
% 38919 [para:38689.3.2,38681.1.1] -equal(X,n) | element(X,m) | equal(Y,m) | -element(Y,X) | -element(X,Y) | equal(Y,X).
% 38956 [binary:38681,38690.3] -equal(g(m),n) | element(m,n).
% 38987 [para:38691.3.2,38681.1.2] -equal(g(X),X) | -equal(m,X) | element(X,n).
% 38988 [binary:38681,38691.3] -equal(g(m),m) | element(m,n).
% 39084 [para:38693.3.2,38681.1.2] element(g(X),X) | -equal(m,X) | element(X,n).
% 39273 [binary:38680,38840.3] -equal(f(n),n) | -element(n,m).
% 39513 [binary:38680,38874.3] element(n,f(n)) | -element(n,m).
% 39698 [para:38713.1.2,38700.1.1,factor:binarycut:38700] element(m,j) | equal(k,n) | equal(k,j).
% 39699 [binary:38700,38713.2] equal(k,n) | equal(k,j) | equal(m,k).
% 39708 [para:39698.3.1,38801.2.2] element(m,j) | element(n,m) | equal(k,n).
% 39714 [para:39699.2.1,38682.1.2] equal(k,n) | equal(m,k) | equal(n,j).
% 39744 [para:39714.3.1,38681.1.2] -equal(m,j) | equal(m,k) | equal(k,n).
% 39765 [para:38755.2.2,39744.2.2,cut:38681] -equal(m,j) | element(n,m) | equal(k,n).
% 39871 [binary:38680,38896.3] element(f(n),n) | -element(n,m).
% 40151 [binary:38721.2,38987.2] -equal(g(k),k) | element(k,n) | element(m,n).
% 40175 [binary:38721.2,39084.2] element(g(k),k) | element(k,n) | element(m,n).
% 40177 [binary:38680,38788.3] -equal(f(n),m) | -element(n,m).
% 40242 [binary:38697.4,40177,binarycut:39273] -element(f(n),k) | equal(f(n),k) | -element(n,m).
% 40758 [para:38721.2.2,40151.2.1] -equal(g(k),k) | element(m,n).
% 40775 [para:38721.2.2,40758.1.1.1] -equal(g(m),k) | element(m,n).
% 41175 [para:38721.2.2,40175.2.1] element(g(k),k) | element(m,n).
% 41187 [para:38721.2.2,41175.1.1.1] element(g(m),k) | element(m,n).
% 41286 [binary:38697,41187,binarycut:40775,binarycut:38988,binarycut:38956] element(m,n).
% 41303 [para:38690.3.2,41286.1.2] -equal(g(X),n) | element(X,n) | element(m,X).
% 41304 [para:38691.3.2,41286.1.2] -equal(g(X),X) | element(X,n) | element(m,X).
% 41306 [para:38693.3.2,41286.1.2] element(g(X),X) | element(X,n) | element(m,X).
% 41786 [binary:38681,38796.4] -element(m,j) | element(n,m) | equal(m,j).
% 41867 [para:38682.1.2,40242.1.2,binarycut:39871] equal(f(n),k) | -element(n,m) | equal(m,k).
% 41878 [para:40242.2.1,40177.1.1] -element(f(n),k) | -element(n,m) | -equal(k,m).
% 41883 [para:41867.1.1,39273.1.1] -element(n,m) | -equal(k,n) | equal(m,k).
% 41888 [para:38682.1.2,41883.2.1,cut:38680] -element(n,m) | equal(m,k).
% 42201 [para:41888.2.2,41878.3.1,cut:38680] -element(f(n),k) | -element(n,m).
% 42426 [para:41888.2.2,42201.1.2] -element(f(n),m) | -element(n,m).
% 43736 [binary:39513,38918.4,cut:38680,binarycut:39871,binarycut:42426,binarycut:40177] equal(n,f(n)) | -element(n,m).
% 43825 [para:43736.1.2,38840.1.1,cut:38680] -element(n,m).
% 43874 [binary:38755,43825] equal(n,k).
% 43892 [binary:38828,43825] element(k,j) | element(m,j).
% 43902 [?] ?
% 43903 [binary:39708.2,43825] element(m,j) | equal(k,n).
% 43907 [binary:39765.2,43825] -equal(m,j) | equal(k,n).
% 43912 [binary:41786.2,43825] -element(m,j) | equal(m,j).
% 44203 [binary:38716.2,43892.2,binarycut:43902] element(k,j).
% 44217 [para:43874.1.2,44203.1.1] element(n,j).
% 44407 [para:43912.2.2,44217.1.2,cut:43825] -element(m,j).
% 44409 [binary:43903,43912,binarycut:43907] equal(k,n).
% 44421 [binary:41304.3,44407] -equal(g(j),j) | element(j,n).
% 44423 [binary:41306.3,44407] element(g(j),j) | element(j,n).
% 44532 [binary:38684.3,44421,binarycut:44423] equal(g(j),k) | element(j,n).
% 44772 [para:44532.1.1,41303.1.1,cut:44409,cut:44407] element(j,n).
% 44787 [binary:38919.4,44772,cut:43825,cut:38680,cut:44217] equal(j,m) | equal(j,n).
% 44832 [para:44787.2.2,41286.1.2,cut:44407] equal(j,m).
% 44841 [para:44832.1.1,44217.1.2,cut:43825] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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 11
% clause depth limited to 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3347
% derived clauses: 1101741
% kept clauses: 23325
% kept size sum: 632967
% kept mid-nuclei: 16232
% kept new demods: 4
% forw unit-subs: 36803
% forw double-subs: 14249
% forw overdouble-subs: 74394
% backward subs: 3094
% fast unit cutoff: 15760
% full unit cutoff: 0
% dbl unit cutoff: 931
% real runtime: 26.10
% process. runtime: 26.9
% specific non-discr-tree subsumption statistics:
% tried: 5051405
% length fails: 219687
% strength fails: 1074752
% predlist fails: 445946
% aux str. fails: 32418
% by-lit fails: 2005905
% full subs tried: 311558
% full subs fail: 303723
%
% ; 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/SYN/SYN014-1+eq_r.in")
%
%------------------------------------------------------------------------------