TSTP Solution File: SET842-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET842-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 : art10.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.6s
% Output : Assurance 368.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: /tmp/SystemOnTPTP5494/SET/SET842-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 4 9)
% (binary-unit 28 #f 4 9)
% (binary-double 11 #f 4 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 9)
% (binary-order 28 #f 4 9)
% (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(1364,40,6,2728,0,12,463653,4,2114,481813,5,2813,481815,1,2813,481815,50,2819,481815,40,2819,483179,0,2820,518478,3,4221,520967,4,4921,533235,5,5621,533236,5,5622,533237,1,5622,533237,50,5626,533237,40,5626,534601,0,5627,556045,3,6178,561287,4,6453,577214,5,6728,577216,1,6728,577216,50,6730,577216,40,6730,578580,0,6732,619938,3,7583,641715,4,8008,656855,5,8433,656857,5,8434,656857,1,8434,656857,50,8440,656857,40,8440,658221,0,8440,695668,3,9295,702274,4,9716,706398,5,10141,706399,5,10142,706400,1,10142,706400,50,10145,706400,40,10145,707764,0,10146,809405,3,14497,819060,4,16672,855726,5,18847,855726,1,18848,855726,50,18853,855726,40,18853,857090,0,18854,917955,3,20255,918488,4,20955,975538,5,21655,975538,1,21655,975538,50,21656,975538,40,21656,976902,0,21658,1154798,3,24562,1274921,4,26009,1355320,5,27459,1355321,1,27459,1355321,50,27464,1355321,40,27464,1356685,0,27465,1420323,3,28866,1432013,4,29566,1469177,5,30266,1469178,1,30266,1469178,50,30272,1469178,40,30272,1470542,0,30273,1495438,3,30824,1503883,4,31099,1515718,5,31374,1515718,1,31374,1515718,50,31377,1515718,40,31377,1517082,0,31378,1577575,3,32779,1578152,4,33479,1666744,5,34179,1666746,5,34180,1666746,1,34180,1666746,50,34182,1666746,40,34182,1668110,0,34183,1740509,3,35584,1758769,4,36285,1765080,5,36984,1765081,5,36985,1765082,1,36985,1765082,50,36994,1765082,40,36994,1766446,0,36995)
%
%
% START OF PROOF
% 1765380 [] c_in(c_^main_^o^union^e__1(X,Y,Z),Y,tc_set(Z)) | -c_in(X,c_^union(Y,Z),Z).
% 1765381 [] c_in(X,c_^main_^o^union^e__1(X,Y,Z),Z) | -c_in(X,c_^union(Y,Z),Z).
% 1765389 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 1765390 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 1765391 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 1766445 [] -c_lessequals(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 1766446 [] -c_in(X,v_^y,tc_set(tc_set(t_a))) | c_lessequals(X,v_m,tc_set(tc_set(t_a))).
% 1768793 [binary:1766446,1765380] c_lessequals(c_^main_^o^union^e__1(X,v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) | -c_in(X,c_^union(v_^y,tc_set(t_a)),tc_set(t_a)).
% 1769211 [binary:1765389,1768793] -c_in(X,c_^main_^o^union^e__1(Y,v_^y,tc_set(t_a)),tc_set(t_a)) | -c_in(Y,c_^union(v_^y,tc_set(t_a)),tc_set(t_a)) | c_in(X,v_m,tc_set(t_a)).
% 1769360 [binary:1765381,1769211] -c_in(X,c_^union(v_^y,tc_set(t_a)),tc_set(t_a)) | c_in(X,v_m,tc_set(t_a)).
% 1769389 [binary:1765390,1769360] c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),X,tc_set(t_a)),v_m,tc_set(t_a)) | c_lessequals(c_^union(v_^y,tc_set(t_a)),X,tc_set(tc_set(t_a))).
% 1769551 [binary:1765391,1769389,cut:1766445] 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: 39476
% derived clauses: 3557242
% kept clauses: 648190
% kept size sum: 57206
% kept mid-nuclei: 299167
% kept new demods: 470
% forw unit-subs: 569737
% forw double-subs: 185421
% forw overdouble-subs: 116638
% backward subs: 769
% fast unit cutoff: 53924
% full unit cutoff: 18907
% dbl unit cutoff: 845
% real runtime : 372.37
% process. runtime: 370.64
% specific non-discr-tree subsumption statistics:
% tried: 16537077
% length fails: 1128385
% strength fails: 5097443
% predlist fails: 4240554
% aux str. fails: 869996
% by-lit fails: 1387244
% full subs tried: 2510660
% full subs fail: 2393116
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP5494/SET/SET842-1+eq_r.in")
% WARNING: TreeLimitedRun lost 368.58s, total lost is 368.58s
%
%------------------------------------------------------------------------------