TSTP Solution File: ANA027-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA027-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 : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% 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/SystemOnTPTP17137/ANA/ANA027-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(14,40,0,28,0,0,75,50,0,89,0,0,136,50,0,150,0,0,197,50,0,211,0,0,258,50,0,272,0,0,319,50,0,333,0,0,380,50,0,394,0,1,441,50,1,455,0,1,502,50,1,516,0,1,563,50,1,577,0,1,624,50,1,638,0,1,685,50,1,699,0,1,746,50,1,760,0,1,807,50,2,821,0,2,868,50,2,882,0,2,929,50,2,943,0,2,990,50,2,1004,0,2,1051,50,2,1065,0,2,1112,50,2,1126,0,3,1173,50,3,1173,40,3,1187,0,3)
%
%
% START OF PROOF
% 1175 [] equal(c_plus(c_0,X,Y),X) | -class_^ordered^group_^ocomm__monoid__add(Y).
% 1176 [] -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).
% 1177 [] -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).
% 1178 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 1179 [] -class_^l^order_^ojoin__semilorder(X) | class_^orderings_^oorder(X).
% 1180 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 1181 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^l^order_^ojoin__semilorder(X).
% 1182 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^ocomm__monoid__add(X).
% 1183 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 1184 [] c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b).
% 1185 [] c_lessequals(v_g(v_x),v_k(v_x),t_b).
% 1186 [] -c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 1187 [] class_^ring__and__^field_^oordered__idom(t_b).
% 1192 [binary:1187,1182] class_^ordered^group_^ocomm__monoid__add(t_b).
% 1194 [binary:1187,1183] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 1195 [binary:1180,1194] class_^ordered^group_^opordered__ab__group__add(t_b).
% 1196 [binary:1181,1194] class_^l^order_^ojoin__semilorder(t_b).
% 1197 [binary:1179,1196] class_^orderings_^oorder(t_b).
% 1199 [binary:1192,1175.2] equal(c_plus(c_0,X,t_b),X).
% 1201 [binary:1184,1176,demod:1199,cut:1195] c_lessequals(v_k(v_x),v_f(v_x),t_b).
% 1204 [binary:1185,1178,cut:1197] -c_lessequals(v_k(v_x),X,t_b) | c_lessequals(v_g(v_x),X,t_b).
% 1207 [binary:1201,1204] c_lessequals(v_g(v_x),v_f(v_x),t_b).
% 1211 [para:1199.1.1,1177.1.1,cut:1195] c_lessequals(c_0,c_minus(X,Y,t_b),t_b) | -c_lessequals(Y,X,t_b).
% 1215 [binary:1207,1211.2,cut:1186] 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: 444
% derived clauses: 1154
% kept clauses: 166
% kept size sum: 623
% kept mid-nuclei: 570
% kept new demods: 20
% forw unit-subs: 231
% 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.3
% 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/SystemOnTPTP17137/ANA/ANA027-2+eq_r.in")
%
%------------------------------------------------------------------------------