TSTP Solution File: SET031-4 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET031-4 : 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 : art10.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 79.6s
% Output   : Assurance 79.6s
% 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/SET/SET031-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(143,40,2,286,0,2,209345,4,2166,231485,5,2803,231486,1,2803,231486,50,2807,231486,40,2807,231629,0,2807,280792,3,4217,290444,4,4908,312302,5,5608,312303,5,5609,312304,1,5609,312304,50,5612,312304,40,5612,312447,0,5612,342846,3,6163,348070,4,6438,357546,5,6713,357547,5,6713,357548,1,6714,357548,50,6715,357548,40,6715,357691,0,6715,399359,3,7574,411138,4,8002,455728,5,8416,455730,5,8417,455730,1,8417,455730,50,8419,455730,40,8419,455873,0,8419)
% 
% 
% START OF PROOF
% 455745 [] -equal(X,ordered_pair(Y,Z)) | -little_set(Z) | -little_set(Y) | ordered_pair_predicate(X).
% 455808 [] member(f18(X),X) | relation(X).
% 455809 [] -ordered_pair_predicate(f18(X)) | relation(X).
% 455859 [] -member(X,compose(Y,Z)) | little_set(f29(X,Y,Z)).
% 455860 [] -member(X,compose(Y,Z)) | little_set(f30(X,Y,Z)).
% 455862 [] equal(X,ordered_pair(f29(X,Y,Z),f30(X,Y,Z))) | -member(X,compose(Y,Z)).
% 455873 [] -relation(compose(a,b)).
% 455874 [binary:455808.2,455873] member(f18(compose(a,b)),compose(a,b)).
% 455875 [binary:455809.2,455873] -ordered_pair_predicate(f18(compose(a,b))).
% 455898 [binary:455859,455874] little_set(f29(f18(compose(a,b)),a,b)).
% 455899 [binary:455860,455874] little_set(f30(f18(compose(a,b)),a,b)).
% 455901 [binary:455862.2,455874] equal(f18(compose(a,b)),ordered_pair(f29(f18(compose(a,b)),a,b),f30(f18(compose(a,b)),a,b))).
% 457710 [binary:455745,455901,cut:455899,cut:455898,cut:455875] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% 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
% seconds given: 17
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    5152
%  derived clauses:   2426259
%  kept clauses:      220596
%  kept size sum:     34455
%  kept mid-nuclei:   112761
%  kept new demods:   137
%  forw unit-subs:    760192
%  forw double-subs: 178549
%  forw overdouble-subs: 154177
%  backward subs:     121
%  fast unit cutoff:  19438
%  full unit cutoff:  3921
%  dbl  unit cutoff:  320
%  real runtime  :  84.74
%  process. runtime:  84.25
% specific non-discr-tree subsumption statistics: 
%  tried:           12686618
%  length fails:    423448
%  strength fails:  2020379
%  predlist fails:  7630475
%  aux str. fails:  245231
%  by-lit fails:    109803
%  full subs tried: 2177633
%  full subs fail:  2027255
% 
% ; 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/SET/SET031-4+eq_r.in")
% 
%------------------------------------------------------------------------------