TSTP Solution File: ANA031-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA031-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 : art10.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/SystemOnTPTP1629/ANA/ANA031-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 6 7)
% (binary-posweight-order 29 #f 6 7)
% (binary-unit 29 #f 6 7)
% (binary-double 29 #f 6 7)
% (binary 29 #t 6 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(12,40,0,24,0,0)
%
%
% START OF PROOF
% 14 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 15 [] 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).
% 16 [] equal(c_times(X,Y,Z),c_times(Y,X,Z)) | -class_^ordered^group_^oab__semigroup__mult(Z).
% 17 [] 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).
% 18 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^oab__semigroup__mult(X).
% 19 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^osemigroup__mult(X).
% 20 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__semiring(X).
% 21 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 22 [] c_lessequals(c_^h^o^l_^oabs(v_b(X),t_b),c_times(v_c,c_^h^o^l_^oabs(v_g(X),t_b),t_b),t_b).
% 23 [] -c_lessequals(c_times(c_^h^o^l_^oabs(v_b(v_x(X)),t_b),c_^h^o^l_^oabs(v_f(v_x(X)),t_b),t_b),c_times(X,c_times(c_^h^o^l_^oabs(v_f(v_x(X)),t_b),c_^h^o^l_^oabs(v_g(v_x(X)),t_b),t_b),t_b),t_b).
% 24 [] class_^ring__and__^field_^oordered__idom(t_b).
% 25 [hyper:18,24] class_^ordered^group_^oab__semigroup__mult(t_b).
% 26 [hyper:19,24] class_^ordered^group_^osemigroup__mult(t_b).
% 27 [hyper:20,24] class_^ring__and__^field_^opordered__semiring(t_b).
% 28 [hyper:21,24] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 29 [hyper:16,25] equal(c_times(X,Y,t_b),c_times(Y,X,t_b)).
% 30 [hyper:15,26] equal(c_times(c_times(X,Y,t_b),Z,t_b),c_times(X,c_times(Y,Z,t_b),t_b)).
% 32 [hyper:14,28] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_b),t_b).
% 38 [hyper:17,32,22,cut:27] c_lessequals(c_times(c_^h^o^l_^oabs(X,t_b),c_^h^o^l_^oabs(v_b(Y),t_b),t_b),c_times(c_^h^o^l_^oabs(X,t_b),c_times(v_c,c_^h^o^l_^oabs(v_g(Y),t_b),t_b),t_b),t_b).
% 50 [para:29.1.1,30.1.1.1,demod:30] equal(c_times(X,c_times(Y,Z,t_b),t_b),c_times(Y,c_times(X,Z,t_b),t_b)).
% 96 [para:29.1.1,38.1.1] c_lessequals(c_times(c_^h^o^l_^oabs(v_b(X),t_b),c_^h^o^l_^oabs(Y,t_b),t_b),c_times(c_^h^o^l_^oabs(Y,t_b),c_times(v_c,c_^h^o^l_^oabs(v_g(X),t_b),t_b),t_b),t_b).
% 796 [para:50.1.1,96.1.2,slowcut:23] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation 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 6
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 55
% derived clauses: 9360
% kept clauses: 739
% kept size sum: 22894
% kept mid-nuclei: 23
% kept new demods: 1
% forw unit-subs: 8589
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 21
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.13
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 2
% 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/SystemOnTPTP1629/ANA/ANA031-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------