TSTP Solution File: ANA015-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA015-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 : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 44.7s
% Output : Assurance 44.7s
% 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/SystemOnTPTP13564/ANA/ANA015-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 5 7)
% (binary-posweight-order 29 #f 5 7)
% (binary-unit 29 #f 5 7)
% (binary-double 29 #f 5 7)
% (binary 29 #t 5 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,68,50,0,81,0,0,150,50,1,163,0,1,288,50,2,301,0,2,557,50,5,570,0,5,1138,50,15,1151,0,15,2468,50,43,2481,0,43,5602,50,176,5615,0,176,13087,50,1015,13100,0,1015,30624,4,4541)
%
%
% START OF PROOF
% 13089 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 13090 [] equal(c_times(c_times(X,Y,Z),U,Z),c_times(X,c_times(Y,U,Z),Z)) | -class_^ordered^group_^osemigroup__mult(Z).
% 13091 [] equal(c_^h^o^l_^oabs(c_times(X,Y,Z),Z),c_times(c_^h^o^l_^oabs(X,Z),c_^h^o^l_^oabs(Y,Z),Z)) | -class_^ring__and__^field_^oordered__idom(Z).
% 13092 [] c_lessequals(c_times(X,Y,Z),c_times(X,U,Z),Z) | -c_lessequals(c_0,X,Z) | -c_lessequals(Y,U,Z) | -class_^ring__and__^field_^opordered__semiring(Z).
% 13093 [] -class_^ring__and__^field_^ofield(X) | class_^ordered^group_^osemigroup__mult(X).
% 13094 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^ofield(X).
% 13095 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^oordered__idom(X).
% 13096 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^opordered__semiring(X).
% 13097 [] -class_^ring__and__^field_^oordered__field(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 13098 [] c_lessequals(c_^h^o^l_^oabs(v_g(X),t_a),c_times(v_d,c_^h^o^l_^oabs(v_f(X),t_a),t_a),t_a).
% 13099 [] -c_lessequals(c_^h^o^l_^oabs(c_times(c_^h^o^l_^oinverse(v_c,t_a),v_g(v_x(X)),t_a),t_a),c_times(X,c_^h^o^l_^oabs(v_f(v_x(X)),t_a),t_a),t_a).
% 13100 [] class_^ring__and__^field_^oordered__field(t_a).
% 13101 [hyper:13094,13100] class_^ring__and__^field_^ofield(t_a).
% 13102 [hyper:13095,13100] class_^ring__and__^field_^oordered__idom(t_a).
% 13103 [hyper:13096,13100] class_^ring__and__^field_^opordered__semiring(t_a).
% 13104 [hyper:13097,13100] class_^ordered^group_^olordered__ab__group__abs(t_a).
% 13105 [hyper:13093,13101] class_^ordered^group_^osemigroup__mult(t_a).
% 13106 [hyper:13091,13102] equal(c_^h^o^l_^oabs(c_times(X,Y,t_a),t_a),c_times(c_^h^o^l_^oabs(X,t_a),c_^h^o^l_^oabs(Y,t_a),t_a)).
% 13108 [hyper:13089,13104] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_a),t_a).
% 13110 [hyper:13090,13105] equal(c_times(c_times(X,Y,t_a),Z,t_a),c_times(X,c_times(Y,Z,t_a),t_a)).
% 13114 [hyper:13092,13108,13098,cut:13103,demod:13106] c_lessequals(c_^h^o^l_^oabs(c_times(X,v_g(Y),t_a),t_a),c_times(c_^h^o^l_^oabs(X,t_a),c_times(v_d,c_^h^o^l_^oabs(v_f(Y),t_a),t_a),t_a),t_a).
% 30628 [para:13110.1.1,13099.1.2,slowcut:13114] 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 13
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 14887
% derived clauses: 294539
% kept clauses: 16688
% kept size sum: 886603
% kept mid-nuclei: 13727
% kept new demods: 27
% forw unit-subs: 156907
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 13710
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 45.83
% process. runtime: 45.48
% specific non-discr-tree subsumption statistics:
% tried: 18
% length fails: 0
% strength fails: 18
% 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/SystemOnTPTP13564/ANA/ANA015-2+eq_r.in")
% WARNING: TreeLimitedRun lost 44.67s, total lost is 44.67s
%
%------------------------------------------------------------------------------