TSTP Solution File: SET010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET010-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 : art08.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 39.5s
% Output : Assurance 39.5s
% 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/SET010-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(29,40,0,58,0,1,73664,4,2032,132579,5,2702,132580,1,2702,132580,50,2704,132580,40,2704,132609,0,2704,132707,50,2704,132736,0,2704,132834,50,2704,132863,0,2709,132961,50,2709,132990,0,2709,133088,50,2709,133117,0,2709,133215,50,2710,133244,0,2714,133342,50,2714,133371,0,2714,133469,50,2714,133498,0,2718,133596,50,2718,133625,0,2719,133723,50,2719,133752,0,2719,133850,50,2719,133879,0,2724,133977,50,2724,134006,0,2724,134104,50,2724,134133,0,2728,134231,50,2729,134260,0,2729,134358,50,2729,134387,0,2729,134485,50,2729,134514,0,2733,134612,50,2733,134641,0,2733,134739,50,2734,134768,0,2738,134866,50,2738,134895,0,2738,134993,50,2738,135022,0,2738,135120,50,2738,135120,40,2738,135149,0,2743,172846,3,3544,178760,4,3944,183111,5,4344,183112,5,4344,183112,1,4344,183112,50,4345,183112,40,4345,183141,0,4345)
%
%
% START OF PROOF
% 183122 [] member(g(X,Y,Z),Y) | member(g(X,Y,Z),Z) | member(g(X,Y,Z),X) | union(X,Y,Z).
% 183123 [] -member(g(X,Y,Z),Z) | -member(g(X,Y,Z),X) | union(X,Y,Z).
% 183124 [] -member(g(X,Y,Z),Z) | -member(g(X,Y,Z),Y) | union(X,Y,Z).
% 183125 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,X).
% 183126 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,Y).
% 183127 [] -intersection(X,Y,Z) | -member(U,X) | -member(U,Y) | member(U,Z).
% 183131 [] -difference(X,Y,Z) | -member(U,Z) | member(U,X).
% 183132 [] -difference(X,Y,Z) | -member(U,Z) | -member(U,Y).
% 183133 [] -difference(X,Y,Z) | -member(U,X) | member(U,Z) | member(U,Y).
% 183137 [] intersection(a,b,a^ib).
% 183138 [] difference(c,a,c^da).
% 183139 [] difference(c,b,c^db).
% 183140 [] difference(c,a^ib,c^d_a^ib).
% 183141 [] -union(c^da,c^db,c^d_a^ib).
% 183142 [binary:183125,183137] -member(X,a^ib) | member(X,a).
% 183143 [binary:183126,183137] -member(X,a^ib) | member(X,b).
% 183144 [binary:183127,183137] -member(X,b) | -member(X,a) | member(X,a^ib).
% 183145 [binary:183131,183138] -member(X,c^da) | member(X,c).
% 183146 [binary:183132,183138] -member(X,c^da) | -member(X,a).
% 183147 [binary:183133,183138] -member(X,c) | member(X,c^da) | member(X,a).
% 183148 [binary:183131,183139] -member(X,c^db) | member(X,c).
% 183149 [binary:183132,183139] -member(X,c^db) | -member(X,b).
% 183150 [binary:183133,183139] -member(X,c) | member(X,c^db) | member(X,b).
% 183151 [binary:183131,183140] -member(X,c^d_a^ib) | member(X,c).
% 183152 [binary:183132,183140] -member(X,c^d_a^ib) | -member(X,a^ib).
% 183153 [binary:183133,183140] -member(X,c) | member(X,c^d_a^ib) | member(X,a^ib).
% 183154 [binary:183122.4,183141] member(g(c^da,c^db,c^d_a^ib),c^d_a^ib) | member(g(c^da,c^db,c^d_a^ib),c^db) | member(g(c^da,c^db,c^d_a^ib),c^da).
% 183155 [binary:183123.3,183141] -member(g(c^da,c^db,c^d_a^ib),c^da) | -member(g(c^da,c^db,c^d_a^ib),c^d_a^ib).
% 183156 [binary:183124.3,183141] -member(g(c^da,c^db,c^d_a^ib),c^db) | -member(g(c^da,c^db,c^d_a^ib),c^d_a^ib).
% 183493 [binary:183142.2,183146.2] -member(X,c^da) | -member(X,a^ib).
% 183660 [binary:183143.2,183149.2] -member(X,c^db) | -member(X,a^ib).
% 185353 [binary:183145,183154.3,binarycut:183151,binarycut:183148] member(g(c^da,c^db,c^d_a^ib),c).
% 185357 [binary:183152,183154,binarycut:183493,binarycut:183660] -member(g(c^da,c^db,c^d_a^ib),a^ib).
% 185469 [binary:183153.2,183155.2,cut:185353,cut:185357] -member(g(c^da,c^db,c^d_a^ib),c^da).
% 185546 [binary:183153.2,183156.2,cut:185353,cut:185357] -member(g(c^da,c^db,c^d_a^ib),c^db).
% 188490 [binary:183147,185353,cut:185469] member(g(c^da,c^db,c^d_a^ib),a).
% 188491 [binary:183150,185353,cut:185546] member(g(c^da,c^db,c^d_a^ib),b).
% 188752 [binary:183144.3,185357,cut:188490,cut:188491] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3709
% derived clauses: 508717
% kept clauses: 126471
% kept size sum: 664123
% kept mid-nuclei: 39138
% kept new demods: 0
% forw unit-subs: 28381
% forw double-subs: 143335
% forw overdouble-subs: 150079
% backward subs: 287
% fast unit cutoff: 1679
% full unit cutoff: 7
% dbl unit cutoff: 1571
% real runtime : 44.36
% process. runtime: 43.80
% specific non-discr-tree subsumption statistics:
% tried: 20090134
% length fails: 4592483
% strength fails: 6262115
% predlist fails: 4707072
% aux str. fails: 104956
% by-lit fails: 257318
% full subs tried: 3961706
% full subs fail: 3821091
%
% ; 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/SET010-1+noeq.in")
%
%------------------------------------------------------------------------------