%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET821-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 54.8s
% Output : Assurance 54.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/SystemOnTPTP17479/SET/SET821-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,320979,4,2114,332891,5,2813,332891,1,2813,332891,50,2818,332891,40,2818,334252,0,2820,368909,3,4221,370204,4,4921,385716,5,5621,385717,5,5622,385717,1,5622,385717,50,5625,385717,40,5625,387078,0,5626)
%
%
% START OF PROOF
% 335312 [?] ?
% 385718 [] equal(X,X).
% 385719 [] -c_in(X,c_^datatype_^oo2s(Y,Z),Z) | equal(Y,c_^datatype_^ooption_^o^some(X,Z)).
% 385720 [] c_in(X,c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(X,Y),Y),Y).
% 385725 [] -equal(c_^datatype_^ooption_^o^some(X,Y),c_^datatype_^ooption_^o^some(Z,Y)) | equal(X,Z).
% 387076 [] c_less(v_a,v_b,tc_^int^def_^oint).
% 387077 [] c_less(v_b,v_c,tc_^int^def_^oint).
% 387078 [] -c_in(v_b,X,tc_^int^def_^oint) | c_in(v_a,X,tc_^int^def_^oint) | c_in(v_c,X,tc_^int^def_^oint).
% 387098 [binary:387078,385720] c_in(v_a,c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint) | c_in(v_c,c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint).
% 387100 [binary:385719,387098] c_in(v_c,c_^datatype_^oo2s(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint) | equal(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_a,tc_^int^def_^oint)).
% 387126 [binary:385719,387100] equal(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_a,tc_^int^def_^oint)) | equal(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_c,tc_^int^def_^oint)).
% 387165 [binary:385725,387126] equal(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_c,tc_^int^def_^oint)) | equal(v_b,v_a).
% 387178 [para:387165.2.2,387076.1.1,cut:335312] equal(c_^datatype_^ooption_^o^some(v_b,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_c,tc_^int^def_^oint)).
% 387195 [para:387178.1.1,385725.1.2] -equal(c_^datatype_^ooption_^o^some(X,tc_^int^def_^oint),c_^datatype_^ooption_^o^some(v_c,tc_^int^def_^oint)) | equal(X,v_b).
% 387255 [binary:385718,387195] equal(v_c,v_b).
% 387292 [para:387255.1.2,387077.1.1,cut:335312] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6476
% derived clauses: 951502
% kept clauses: 111845
% kept size sum: 487209
% kept mid-nuclei: 33260
% kept new demods: 91
% forw unit-subs: 103648
% forw double-subs: 10756
% forw overdouble-subs: 4726
% backward subs: 49
% fast unit cutoff: 6467
% full unit cutoff: 1994
% dbl unit cutoff: 1
% real runtime : 56.45
% process. runtime: 56.24
% specific non-discr-tree subsumption statistics:
% tried: 87586
% length fails: 5870
% strength fails: 12253
% predlist fails: 1220
% aux str. fails: 9975
% by-lit fails: 3730
% full subs tried: 53783
% full subs fail: 49290
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP17479/SET/SET821-1+eq_r.in")
% WARNING: TreeLimitedRun lost 54.83s, total lost is 54.83s
%
%------------------------------------------------------------------------------