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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET847-1 : TPTP v3.4.2. Released v3.2.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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 368.3s
% Output   : Assurance 368.3s
% 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: /tmp/SystemOnTPTP18451/SET/SET847-1+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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 11 #f 5 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 7)
% (binary-order 28 #f 5 7)
% (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(1365,40,6,2730,0,12,1022552,4,2120,1042787,5,2813,1042787,1,2813,1042787,50,2820,1042787,40,2820,1044152,0,2826,1091029,3,4227,1103894,4,4929,1109077,5,5627,1109078,5,5628,1109078,1,5628,1109078,50,5634,1109078,40,5634,1110443,0,5635,1133373,3,6189,1139853,4,6461,1149431,5,6736,1149431,5,6736,1149432,1,6736,1149432,50,6738,1149432,40,6738,1150797,0,6740,1186030,3,7593,1209740,4,8017,1218032,5,8441,1218033,5,8442,1218033,1,8442,1218033,50,8447,1218033,40,8447,1219398,0,8448,1237003,3,9299,1243359,4,9725,1248625,5,10149,1248627,5,10150,1248628,1,10150,1248628,50,10152,1248628,40,10152,1249993,0,10153,1300825,3,14504,1308739,4,16679,1322106,5,18854,1322107,5,18855,1322107,1,18855,1322107,50,18860,1322107,40,18860,1323472,0,18861,1385288,3,20262,1385888,4,20962,1472154,5,21664,1472155,5,21665,1472155,1,21665,1472155,50,21667,1472155,40,21667,1473520,0,21668,1669807,3,24582,1764313,4,26019,1871928,5,27469,1871929,1,27469,1871929,50,27477,1871929,40,27477,1873294,0,27478,1935887,3,28879,1947680,4,29579,1991033,5,30279,1991034,1,30279,1991034,50,30286,1991034,40,30286,1992399,0,30299,2026358,3,30905,2028617,4,31125,2041996,5,31400,2041997,1,31400,2041997,50,31402,2041997,40,31402,2043362,0,31403,2104725,3,32804,2105387,4,33504,2146415,5,34204,2146415,5,34205,2146415,1,34205,2146415,50,34207,2146415,40,34207,2147780,0,34208,2215003,3,35609,2232113,4,36309,2238091,5,37009,2238092,5,37011,2238093,1,37011,2238093,50,37018,2238093,40,37018,2239458,0,37020)
% 
% 
% START OF PROOF
% 2238094 [] equal(X,X).
% 2238253 [] c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Y,U) | c_in(X,Z,U).
% 2238268 [] -c_in(X,c_emptyset,Y).
% 2238393 [] c_lessequals(c_emptyset,X,tc_set(Y)).
% 2238394 [] -c_lessequals(X,Y,tc_set(Z)) | -c_less(Y,X,tc_set(Z)).
% 2238396 [] -c_lessequals(X,Y,tc_set(Z)) | c_less(X,Y,tc_set(Z)) | equal(X,Y).
% 2238401 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 2238404 [] c_lessequals(X,X,tc_set(Y)).
% 2239453 [] -c_lessequals(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(tc_set(Z)))) | c_in(c_^union(X,tc_set(Z)),c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))).
% 2239454 [] -c_in(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | c_in(X,c_^zorn_^ochain(Y,Z),tc_set(tc_set(Z))).
% 2239456 [?] ?
% 2239457 [] -c_in(X,c_minus(c_^zorn_^ochain(Y,Z),c_^zorn_^omaxchain(Y,Z),tc_set(tc_set(tc_set(Z)))),tc_set(tc_set(Z))) | -equal(c_^zorn_^osucc(Y,X,Z),X).
% 2239458 [] -c_in(X,c_^zorn_^omaxchain(v_^s,t_a),tc_set(tc_set(t_a))).
% 2241979 [binary:2238393,2238396] c_less(c_emptyset,X,tc_set(Y)) | equal(c_emptyset,X).
% 2242052 [binary:2239458,2238401] c_lessequals(c_^zorn_^omaxchain(v_^s,t_a),X,tc_set(tc_set(tc_set(t_a)))).
% 2242137 [binary:2238394,2242052] -c_less(X,c_^zorn_^omaxchain(v_^s,t_a),tc_set(tc_set(tc_set(t_a)))).
% 2242159 [binary:2241979,2242137] equal(c_emptyset,c_^zorn_^omaxchain(v_^s,t_a)).
% 2242334 [binary:2238404,2239453] c_in(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^o^t^fin(X,Y),tc_set(tc_set(Y))).
% 2242398 [input:2239456,cut:2242334] equal(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^osucc(X,c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),Y)).
% 2242406 [para:2242159.1.2,2239457.1.2.2] -c_in(X,c_minus(c_^zorn_^ochain(v_^s,t_a),c_emptyset,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))) | -equal(c_^zorn_^osucc(v_^s,X,t_a),X).
% 2242966 [binary:2238253,2242406,cut:2238268] -c_in(X,c_^zorn_^ochain(v_^s,t_a),tc_set(tc_set(t_a))) | -equal(c_^zorn_^osucc(v_^s,X,t_a),X).
% 2243085 [binary:2239454,2242334] c_in(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^ochain(X,Y),tc_set(tc_set(Y))).
% 2243097 [binary:2242966,2243085] -equal(c_^zorn_^osucc(v_^s,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),t_a),c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))).
% 2243100 [para:2242398.1.2,2243097.1.1,cut:2238094] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    36228
%  derived clauses:   3036394
%  kept clauses:      656918
%  kept size sum:     69942
%  kept mid-nuclei:   306811
%  kept new demods:   754
%  forw unit-subs:    401904
%  forw double-subs: 142350
%  forw overdouble-subs: 83678
%  backward subs:     683
%  fast unit cutoff:  47115
%  full unit cutoff:  31164
%  dbl  unit cutoff:  317
%  real runtime  :  373.7
%  process. runtime:  371.7
% specific non-discr-tree subsumption statistics: 
%  tried:           11642672
%  length fails:    781124
%  strength fails:  3587508
%  predlist fails:  2798626
%  aux str. fails:  753778
%  by-lit fails:    1008153
%  full subs tried: 1751112
%  full subs fail:  1666158
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18451/SET/SET847-1+eq_r.in")
% WARNING: TreeLimitedRun lost 368.32s, total lost is 368.32s
% 
%------------------------------------------------------------------------------