TSTP Solution File: SYN013-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN013-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 : art07.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/SYN013-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(17,40,0,34,0,0,2120,50,104,2137,0,104,18250,4,1835,26975,5,2405,26975,1,2405,26975,50,2405,26975,40,2405,26992,0,2405,27446,50,2408,27463,0,2408,27917,50,2410,27934,0,2410,28388,50,2412,28405,0,2414,28859,50,2416,28876,0,2416,29330,50,2418,29347,0,2418,29801,50,2420,29818,0,2422,30272,50,2424,30289,0,2424,30743,50,2426,30760,0,2428,31214,50,2430,31231,0,2430,31685,50,2432,31702,0,2432,32156,50,2434,32173,0,2436,32627,50,2438,32644,0,2438,33098,50,2440,33115,0,2442,33569,50,2444,33586,0,2444,34040,50,2447,34057,0,2447,34511,50,2449,34528,0,2451,34982,50,2453,34999,0,2453,35453,50,2455,35470,0,2457,35924,50,2459,35941,0,2459,36395,50,2462,36395,40,2462,36412,0,2462)
% 
% 
% START OF PROOF
% 36396 [] equal(X,X).
% 36397 [] -equal(m,n).
% 36398 [] -equal(n,k).
% 36399 [] -equal(k,m).
% 36400 [] -equal(f(X),m) | -element(X,m) | equal(X,m).
% 36401 [] -equal(f(X),X) | -element(X,m) | equal(X,m).
% 36402 [] element(X,f(X)) | -element(X,m) | equal(X,m).
% 36403 [] element(f(X),X) | -element(X,m) | equal(X,m).
% 36404 [] element(X,m) | equal(Y,m) | equal(X,m) | -element(X,Y) | -element(Y,X) | equal(Y,X).
% 36405 [] -equal(g(X),n) | element(X,n) | equal(X,n).
% 36406 [] -equal(g(X),X) | element(X,n) | equal(X,n).
% 36407 [] element(X,g(X)) | element(X,n) | equal(X,n).
% 36408 [] element(g(X),X) | element(X,n) | equal(X,n).
% 36409 [] -element(X,n) | equal(Y,n) | equal(X,n) | -element(X,Y) | -element(Y,X) | equal(Y,X).
% 36410 [] -equal(X,m) | element(X,k) | equal(X,k).
% 36411 [] -equal(X,n) | element(X,k) | equal(X,k).
% 36412 [] -element(X,k) | equal(X,n) | equal(X,k) | equal(X,m).
% 36417 [para:36410.3.2,36399.1.1] -equal(X,m) | element(X,k).
% 36421 [binary:36399,36400.3] -equal(f(k),m) | -element(k,m).
% 36423 [binary:36396,36417] element(m,k).
% 36435 [binary:36399,36401.3] -equal(f(k),k) | -element(k,m).
% 36447 [binary:36396,36411,cut:36398] element(n,k).
% 36482 [binary:36399,36403.3] element(f(k),k) | -element(k,m).
% 36504 [binary:36398,36404.6,cut:36447,cut:36399] -element(k,n) | element(k,m) | equal(n,m).
% 36542 [para:36504.3.1,36397.1.2,cut:36396] -element(k,n) | element(k,m).
% 36782 [binary:36542.2,36409.4,cut:36397,cut:36423] -element(k,n) | equal(m,k) | equal(k,n).
% 36871 [binary:36421,36412.4,binarycut:36482,binarycut:36435] equal(f(k),n) | -element(k,m).
% 36933 [para:36871.1.1,36402.1.2,cut:36399] -element(k,m) | element(k,n).
% 37567 [para:36782.3.1,36398.1.2,cut:36396] -element(k,n) | equal(m,k).
% 37570 [para:37567.2.2,36399.1.1,cut:36396] -element(k,n).
% 37587 [binary:36405.2,37570] -equal(g(k),n) | equal(k,n).
% 37591 [binary:36407.2,37570] element(k,g(k)) | equal(k,n).
% 37593 [binary:36408.2,37570] element(g(k),k) | equal(k,n).
% 37600 [binary:36933.2,37570] -element(k,m).
% 37613 [para:37587.2.1,36398.1.2,cut:36396] -equal(g(k),n).
% 37636 [para:36406.3.2,37613.1.2,factor:cut:37570] -equal(g(k),k).
% 37651 [para:37591.2.1,36398.1.2,cut:36396] element(k,g(k)).
% 37661 [para:37593.2.1,36398.1.2,cut:36396] element(g(k),k).
% 37669 [binary:36404.5,37661,cut:37651,cut:36399,cut:37600,cut:37636] equal(g(k),m).
% 37677 [para:37669.1.1,37651.1.2,cut:37600] 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:    5020
%  derived clauses:   952662
%  kept clauses:      14475
%  kept size sum:     388683
%  kept mid-nuclei:   16422
%  kept new demods:   2
%  forw unit-subs:    92049
%  forw double-subs: 15063
%  forw overdouble-subs: 141029
%  backward subs:     1105
%  fast unit cutoff:  40813
%  full unit cutoff:  0
%  dbl  unit cutoff:  892
%  real runtime:  24.70
%  process. runtime:  24.67
% specific non-discr-tree subsumption statistics: 
%  tried:           3593153
%  length fails:    43045
%  strength fails:  389143
%  predlist fails:  706724
%  aux str. fails:  22509
%  by-lit fails:    931788
%  full subs tried: 1313619
%  full subs fail:  1283686
% 
% ; 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/SYN013-1+eq_r.in")
% 
%------------------------------------------------------------------------------