%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET844-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/SystemOnTPTP31539/SET/SET844-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(1368,40,6,2736,0,12,462713,4,2113)
%
%
% START OF PROOF
% 1369 [] equal(X,X).
% 2727 [] c_in(c_^main_^o^union__least__1(X,Y,Z),X,tc_set(Z)) | c_lessequals(c_^union(X,Z),Y,tc_set(Z)).
% 2728 [] -c_lessequals(c_^main_^o^union__least__1(X,Y,Z),Y,tc_set(Z)) | c_lessequals(c_^union(X,Z),Y,tc_set(Z)).
% 2733 [] -c_in(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | c_lessequals(U,X,tc_set(tc_set(Z))) | -equal(X,c_^zorn_^osucc(Y,X,Z)).
% 2734 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 2735 [] equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 2736 [] -c_lessequals(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 73176 [hyper:2736,2727] c_in(c_^main_^o^union__least__1(c_^zorn_^o^t^fin(v_^s,t_a),v_m,tc_set(t_a)),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 73522 [hyper:2733,73176,2734,demod:2735,cut:1369] c_lessequals(c_^main_^o^union__least__1(c_^zorn_^o^t^fin(v_^s,t_a),v_m,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 463908 [binary:2728.2,2736,cut:73522] 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: 2199
% derived clauses: 1076101
% kept clauses: 77061
% kept size sum: 0
% kept mid-nuclei: 9366
% kept new demods: 32
% forw unit-subs: 82179
% forw double-subs: 1762
% forw overdouble-subs: 388
% backward subs: 16
% fast unit cutoff: 438
% full unit cutoff: 261
% dbl unit cutoff: 5
% real runtime : 21.62
% process. runtime: 21.42
% specific non-discr-tree subsumption statistics:
% tried: 2536
% length fails: 43
% strength fails: 36
% predlist fails: 115
% aux str. fails: 2
% by-lit fails: 3
% full subs tried: 2329
% full subs fail: 1937
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP31539/SET/SET844-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.81s, total lost is 19.81s
%
%------------------------------------------------------------------------------