%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET820-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 19.8s
% Output : Assurance 19.8s
% 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/SystemOnTPTP30300/SET/SET820-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(1361,40,6,2722,0,12,116466,4,2126)
%
%
% START OF PROOF
% 1363 [] -c_in(X,c_^datatype_^oo2s(Y,Z),Z) | equal(Y,c_^datatype_^ooption_^o^some(X,Z)).
% 1364 [] c_in(X,c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,Y),Y),Y).
% 1369 [] -equal(c_^datatype_^ooption_^o^some(X,Y),c_^datatype_^ooption_^o^some(Z,Y)) | equal(X,Z).
% 1519 [] -c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Z,U).
% 1521 [] c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Y,U) | c_in(X,Z,U).
% 1536 [] -c_in(X,c_emptyset,Y).
% 1668 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 1669 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 2720 [] v_^p(v_a).
% 2721 [] c_in(v_x(X),X,tc_^int^def_^oint) | -c_in(Y,X,tc_^int^def_^oint).
% 2722 [] -v_^p(v_x(X)) | -c_in(Y,X,tc_^int^def_^oint).
% 2726 [hyper:2721,1364] c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint).
% 2756 [hyper:1521,2726] c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),c_minus(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint),Y,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint).
% 2816 [hyper:2721,2756] c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),c_minus(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint),Y,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_x(Y),Y,tc_^int^def_^oint).
% 2898 [hyper:1363,2816] c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),c_minus(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint),c_^datatype_^oo2s(Y,tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | equal(Y,c_^datatype_^ooption_^o^some(v_x(c_^datatype_^oo2s(Y,tc_^int^def_^oint)),tc_^int^def_^oint)).
% 3294 [hyper:1369,2898] c_in(v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint)),c_minus(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint),c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | equal(Y,v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(Y,tc_^int^def_^oint),tc_^int^def_^oint))).
% 5713 [hyper:1519,3294,slowcut:2726] equal(X,v_x(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),tc_^int^def_^oint))).
% 59747 [hyper:1668,1669,1364] c_in(c_^main_^osubset^i__1(c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,Y),Y),Z,Y),c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,Y),Y),Y) | c_in(X,Z,Y).
% 125310 [binary:59747,2722.2,demod:5713,slowcut:1536,slowcut:2720] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1977
% derived clauses: 348777
% kept clauses: 77016
% kept size sum: 0
% kept mid-nuclei: 25026
% kept new demods: 40
% forw unit-subs: 91844
% forw double-subs: 18013
% forw overdouble-subs: 4712
% backward subs: 46
% fast unit cutoff: 1601
% full unit cutoff: 363
% dbl unit cutoff: 17
% real runtime : 22.49
% process. runtime: 22.31
% specific non-discr-tree subsumption statistics:
% tried: 259781
% length fails: 25582
% strength fails: 33803
% predlist fails: 6555
% aux str. fails: 3267
% by-lit fails: 13133
% full subs tried: 173468
% full subs fail: 168156
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP30300/SET/SET820-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.83s, total lost is 19.83s
%
%------------------------------------------------------------------------------