%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA023-2 : 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 0.0s
% Output : Assurance 0.0s
% 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/SystemOnTPTP26238/ANA/ANA023-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 3 7)
% (binary-posweight-order 29 #f 3 7)
% (binary-unit 29 #f 3 7)
% (binary-double 29 #f 3 7)
% (binary 29 #t 3 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(13,40,0,26,0,0,69,50,0,82,0,0,125,50,0,138,0,0,181,50,0,194,0,0,237,50,0,250,0,0,293,50,0,306,0,0,349,50,1,362,0,1,405,50,1,418,0,1,461,50,1,474,0,1,517,50,1,530,0,1,573,50,1,586,0,1,629,50,1,642,0,1,685,50,1,698,0,1,741,50,1,754,0,1,797,50,1,810,0,1,853,50,2,866,0,2,909,50,2,922,0,2,965,50,2,978,0,2,1021,50,2,1034,0,2,1077,50,2,1077,40,2,1090,0,2)
%
%
% START OF PROOF
% 1079 [] equal(c_plus(c_0,X,Y),X) | -class_^ordered^group_^ocomm__monoid__add(Y).
% 1080 [] -c_lessequals(X,c_minus(Y,Z,U),U) | c_lessequals(c_plus(X,Z,U),Y,U) | -class_^ordered^group_^opordered__ab__group__add(U).
% 1081 [] -c_lessequals(c_plus(X,Y,Z),U,Z) | c_lessequals(X,c_minus(U,Y,Z),Z) | -class_^ordered^group_^opordered__ab__group__add(Z).
% 1082 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 1083 [] -class_^orderings_^olinorder(X) | class_^orderings_^oorder(X).
% 1084 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^ocomm__monoid__add(X).
% 1085 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 1086 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 1087 [] c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 1088 [] c_lessequals(v_k(v_x),v_f(v_x),t_b).
% 1089 [] -c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 1090 [] class_^ring__and__^field_^oordered__idom(t_b).
% 1093 [binary:1090,1084] class_^ordered^group_^ocomm__monoid__add(t_b).
% 1095 [binary:1090,1085] class_^orderings_^olinorder(t_b).
% 1096 [binary:1083,1095] class_^orderings_^oorder(t_b).
% 1098 [binary:1090,1086] class_^ordered^group_^opordered__ab__group__add(t_b).
% 1100 [binary:1093,1079.2] equal(c_plus(c_0,X,t_b),X).
% 1106 [binary:1087,1080,demod:1100,cut:1098] c_lessequals(v_g(v_x),v_k(v_x),t_b).
% 1107 [binary:1082,1106,cut:1096] -c_lessequals(v_k(v_x),X,t_b) | c_lessequals(v_g(v_x),X,t_b).
% 1109 [binary:1088,1107] c_lessequals(v_g(v_x),v_f(v_x),t_b).
% 1114 [para:1100.1.1,1081.1.1,cut:1098] c_lessequals(c_0,c_minus(X,Y,t_b),t_b) | -c_lessequals(Y,X,t_b).
% 1117 [binary:1109,1114.2,cut:1089] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred 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
% clause length limited to 7
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 405
% derived clauses: 1058
% kept clauses: 146
% kept size sum: 583
% kept mid-nuclei: 532
% kept new demods: 20
% forw unit-subs: 212
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 330
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 38
% length fails: 0
% strength fails: 38
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP26238/ANA/ANA023-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------