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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET007-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/SET/SET007-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(23,40,0,46,0,0,59371,4,2058,84318,5,2701,84318,1,2701,84318,50,2702,84318,40,2702,84341,0,2702)
% 
% 
% START OF PROOF
% 60091 [?] ?
% 83792 [?] ?
% 84325 [] -union(X,Y,Z) | -member(U,Z) | member(U,X) | member(U,Y).
% 84328 [] member(g(X,Y,Z),Y) | member(g(X,Y,Z),Z) | member(g(X,Y,Z),X) | union(X,Y,Z).
% 84329 [] -member(g(X,Y,Z),Z) | -member(g(X,Y,Z),X) | union(X,Y,Z).
% 84330 [] -member(g(X,Y,Z),Z) | -member(g(X,Y,Z),Y) | union(X,Y,Z).
% 84331 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,X).
% 84332 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,Y).
% 84333 [] -intersection(X,Y,Z) | -member(U,X) | -member(U,Y) | member(U,Z).
% 84337 [] union(b,c,b^uc).
% 84338 [] intersection(a,b,a^ib).
% 84339 [] intersection(a,c,a^ic).
% 84340 [] intersection(a,b^uc,a^i_b^uc).
% 84341 [] -union(a^ib,a^ic,a^i_b^uc).
% 84364 [binary:84337,84325] -member(X,b^uc) | member(X,b) | member(X,c).
% 84373 [binary:84341,84328.4,cut:83792,cut:60091] member(g(a^ib,a^ic,a^i_b^uc),a^i_b^uc).
% 84382 [binary:84340,84331] -member(X,a^i_b^uc) | member(X,a).
% 84387 [binary:84341,84329.3,cut:84373] -member(g(a^ib,a^ic,a^i_b^uc),a^ib).
% 84390 [binary:84373,84382] member(g(a^ib,a^ic,a^i_b^uc),a).
% 84404 [binary:84341,84330.3,cut:84373] -member(g(a^ib,a^ic,a^i_b^uc),a^ic).
% 84428 [binary:84340,84332] -member(X,a^i_b^uc) | member(X,b^uc).
% 84437 [binary:84373,84428] member(g(a^ib,a^ic,a^i_b^uc),b^uc).
% 84440 [binary:84338,84333] -member(X,b) | -member(X,a) | member(X,a^ib).
% 84441 [binary:84339,84333] -member(X,c) | -member(X,a) | member(X,a^ic).
% 84766 [binary:84387,84440.3,cut:84390] -member(g(a^ib,a^ic,a^i_b^uc),b).
% 84850 [binary:84390,84441.2,cut:84404] -member(g(a^ib,a^ic,a^i_b^uc),c).
% 85538 [binary:84364.2,84766,cut:84437,cut:84850] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit 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: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    730
%  derived clauses:   339217
%  kept clauses:      47836
%  kept size sum:     937698
%  kept mid-nuclei:   26292
%  kept new demods:   0
%  forw unit-subs:    58532
%  forw double-subs: 80745
%  forw overdouble-subs: 117898
%  backward subs:     132
%  fast unit cutoff:  13543
%  full unit cutoff:  0
%  dbl  unit cutoff:  835
%  real runtime  :  27.5
%  process. runtime:  27.5
% specific non-discr-tree subsumption statistics: 
%  tried:           18949156
%  length fails:    3296018
%  strength fails:  5556670
%  predlist fails:  5627372
%  aux str. fails:  56731
%  by-lit fails:    94736
%  full subs tried: 4298059
%  full subs fail:  4185335
% 
% ; 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/SET007-1+noeq.in")
% 
%------------------------------------------------------------------------------