TSTP Solution File: ANA014-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA014-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 : art01.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/SystemOnTPTP22397/ANA/ANA014-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 5)
% (binary-unit 9 #f 6 5)
% (binary-double 9 #f 6 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 5)
% (binary-order 25 #f 6 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(14,40,0,28,0,0,52,50,0,66,0,0,90,50,0,104,0,0,128,50,0,142,0,0,166,50,0,180,0,0,204,50,0,218,0,0,242,50,1,256,0,1,280,50,1,294,0,1,318,50,1,332,0,1,356,50,1,370,0,1,394,50,1,408,0,1,432,50,1,446,0,1,470,50,2,484,0,2,508,50,2,522,0,2,546,50,2,560,0,2,584,50,2,598,0,2,622,50,2,622,40,2,636,0,2)
%
%
% START OF PROOF
% 624 [] equal(c_times(c_1,X,Y),X) | -class_^ordered^group_^omonoid__mult(Y).
% 625 [] 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).
% 626 [] c_lessequals(X,X,Y) | -class_^orderings_^oorder(Y).
% 627 [] 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).
% 628 [] equal(c_times(c_^h^o^l_^oinverse(X,Y),X,Y),c_1) | equal(X,c_0) | -class_^ring__and__^field_^ofield(Y).
% 629 [] -class_^ring__and__^field_^ofield(X) | class_^ordered^group_^omonoid__mult(X).
% 630 [] -class_^ring__and__^field_^ofield(X) | class_^ordered^group_^osemigroup__mult(X).
% 631 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^ofield(X).
% 632 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^oordered__idom(X).
% 633 [] -class_^ring__and__^field_^oordered__field(X) | class_^orderings_^oorder(X).
% 634 [] -equal(v_c,c_0).
% 635 [] -c_lessequals(c_^h^o^l_^oabs(v_f(v_x(X)),t_a),c_times(X,c_times(c_^h^o^l_^oabs(v_c,t_a),c_^h^o^l_^oabs(v_f(v_x(X)),t_a),t_a),t_a),t_a).
% 636 [] class_^ring__and__^field_^oordered__field(t_a).
% 640 [binary:636,631] class_^ring__and__^field_^ofield(t_a).
% 641 [binary:629,640] class_^ordered^group_^omonoid__mult(t_a).
% 642 [binary:630,640] class_^ordered^group_^osemigroup__mult(t_a).
% 644 [binary:636,632] class_^ring__and__^field_^oordered__idom(t_a).
% 647 [binary:641,624.2] equal(c_times(c_1,X,t_a),X).
% 649 [binary:636,633] class_^orderings_^oorder(t_a).
% 651 [binary:649,626.2] c_lessequals(X,X,t_a).
% 653 [binary:642,625.2] equal(c_times(c_times(X,Y,t_a),Z,t_a),c_times(X,c_times(Y,Z,t_a),t_a)).
% 665 [binary:644,627.2] 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)).
% 668 [para:628.1.1,653.1.1.1,demod:647,cut:640] equal(X,c_times(c_^h^o^l_^oinverse(Y,t_a),c_times(Y,X,t_a),t_a)) | equal(Y,c_0).
% 672 [para:668.1.2,635.1.2,cut:651] equal(c_^h^o^l_^oabs(v_c,t_a),c_0).
% 678 [para:672.1.1,635.1.2.2.1] -c_lessequals(c_^h^o^l_^oabs(v_f(v_x(X)),t_a),c_times(X,c_times(c_0,c_^h^o^l_^oabs(v_f(v_x(X)),t_a),t_a),t_a),t_a).
% 680 [para:672.1.1,627.1.2.2,cut:644] equal(c_^h^o^l_^oabs(c_times(X,v_c,t_a),t_a),c_times(c_^h^o^l_^oabs(X,t_a),c_0,t_a)).
% 690 [para:628.1.1,680.1.1.1,cut:634,cut:640] equal(c_^h^o^l_^oabs(c_1,t_a),c_times(c_^h^o^l_^oabs(c_^h^o^l_^oinverse(v_c,t_a),t_a),c_0,t_a)).
% 699 [para:690.1.2,625.1.1.1,cut:642] equal(c_times(c_^h^o^l_^oabs(c_1,t_a),X,t_a),c_times(c_^h^o^l_^oabs(c_^h^o^l_^oinverse(v_c,t_a),t_a),c_times(c_0,X,t_a),t_a)).
% 934 [para:699.1.2,678.1.2,demod:647,665,cut:651] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 5
% clause depth limited to 6
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 515
% derived clauses: 1805
% kept clauses: 459
% kept size sum: 7029
% kept mid-nuclei: 0
% kept new demods: 128
% forw unit-subs: 836
% forw double-subs: 236
% forw overdouble-subs: 9
% backward subs: 18
% fast unit cutoff: 32
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 9
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 9
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP22397/ANA/ANA014-2+eq_r.in")
%
%------------------------------------------------------------------------------