TSTP Solution File: SET839-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET839-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 : art07.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 109.7s
% Output : Assurance 109.7s
% 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/SystemOnTPTP31295/SET/SET839-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 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 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(1360,40,6,2720,0,12,463250,4,2119,483793,5,2813,483794,1,2813,483794,50,2819,483794,40,2819,485154,0,2820,521928,3,4221,523409,4,4921,542051,5,5621,542052,5,5622,542052,1,5622,542052,50,5626,542052,40,5626,543412,0,5627,566153,3,6178,568096,4,6453,579641,5,6728,579643,5,6728,579644,1,6728,579644,50,6730,579644,40,6730,581004,0,6731,619441,3,7582,638126,4,8008,652732,5,8432,652733,5,8433,652733,1,8433,652733,50,8438,652733,40,8438,654093,0,8439,701060,3,9293,712142,4,9715,713840,5,10141,713841,5,10143,713842,1,10143,713842,50,10148,713842,40,10148,715202,0,10149)
%
%
% START OF PROOF
% 713868 [] -equal(c_emptyset,c_^equiv__^relations_^oquotient(X,Y,Z)) | equal(X,c_emptyset).
% 713869 [] equal(c_emptyset,c_^equiv__^relations_^oquotient(c_emptyset,X,Y)).
% 713871 [] equal(c_emptyset,c_emptyset).
% 714017 [] -c_in(X,c_emptyset,Y).
% 714143 [] -c_lessequals(X,Y,tc_set(Z)) | -c_less(Y,X,tc_set(Z)).
% 714145 [] -c_lessequals(X,Y,tc_set(Z)) | c_less(X,Y,tc_set(Z)) | equal(X,Y).
% 714147 [] c_in(X,c_insert(X,c_emptyset,Y),Y).
% 714149 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 714150 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 714151 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 715201 [] -c_lessequals(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))).
% 715202 [] -c_in(Y,v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)) | c_lessequals(X,Y,tc_set(t_a)).
% 715203 [para:713868.2.2,715201.1.2.2] -c_lessequals(v_^s,c_insert(X,Y,tc_set(t_a)),tc_set(tc_set(t_a))) | -equal(c_emptyset,c_^equiv__^relations_^oquotient(Y,Z,U)).
% 715219 [binary:714150.2,715201] c_in(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_^s,tc_set(t_a)).
% 715362 [binary:714143,715202.3] -c_in(Y,v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)) | -c_less(Y,X,tc_set(t_a)).
% 715363 [binary:714145,715202.3] -c_in(X,v_^s,tc_set(t_a)) | -c_in(Y,v_^s,tc_set(t_a)) | c_less(X,Y,tc_set(t_a)) | equal(X,Y).
% 715424 [binary:714149.2,715219] c_in(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),Y,tc_set(t_a)) | -c_lessequals(v_^s,Y,tc_set(tc_set(t_a))).
% 715474 [binary:714151.2,715203] -c_in(c_^main_^osubset^i__1(v_^s,c_insert(X,Y,tc_set(t_a)),tc_set(t_a)),c_insert(X,Y,tc_set(t_a)),tc_set(t_a)) | -equal(c_emptyset,c_^equiv__^relations_^oquotient(Y,Z,U)).
% 737065 [binary:715362.3,715363.3] -c_in(Y,v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)) | equal(X,Y).
% 749952 [binary:714017,715424] -c_lessequals(v_^s,c_emptyset,tc_set(tc_set(t_a))).
% 749980 [binary:714150.2,749952] c_in(c_^main_^osubset^i__1(v_^s,c_emptyset,tc_set(t_a)),v_^s,tc_set(t_a)).
% 750096 [binary:737065,749980] equal(X,c_^main_^osubset^i__1(v_^s,c_emptyset,tc_set(t_a))) | -c_in(X,v_^s,tc_set(t_a)).
% 750703 [binary:715219,750096.2] equal(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_^main_^osubset^i__1(v_^s,c_emptyset,tc_set(t_a))).
% 757045 [para:713869.1.2,715474.2.2,demod:750703,cut:713871,slowcut:714147] 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 4
% seconds given: 87
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13687
% derived clauses: 1615787
% kept clauses: 283853
% kept size sum: 945258
% kept mid-nuclei: 50166
% kept new demods: 140
% forw unit-subs: 152837
% forw double-subs: 36944
% forw overdouble-subs: 7825
% backward subs: 78
% fast unit cutoff: 21661
% full unit cutoff: 7484
% dbl unit cutoff: 44
% real runtime : 111.27
% process. runtime: 110.87
% specific non-discr-tree subsumption statistics:
% tried: 360387
% length fails: 13466
% strength fails: 34308
% predlist fails: 122212
% aux str. fails: 10958
% by-lit fails: 39040
% full subs tried: 93980
% full subs fail: 86078
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP31295/SET/SET839-1+eq_r.in")
% WARNING: TreeLimitedRun lost 109.68s, total lost is 109.68s
%
%------------------------------------------------------------------------------