TSTP Solution File: ANA034-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA034-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 : art09.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/SystemOnTPTP3612/ANA/ANA034-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 11)
% (binary-posweight-order 29 #f 5 11)
% (binary-unit 29 #f 5 11)
% (binary-double 29 #f 5 11)
% (binary 29 #t 5 11)
% (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(16,40,0,32,0,0)
%
%
% START OF PROOF
% 18 [] 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).
% 19 [] c_lessequals(c_times(X,Y,Z),c_times(U,V,Z),Z) | -c_lessequals(c_0,U,Z) | -c_lessequals(c_0,Y,Z) | -c_lessequals(Y,V,Z) | -c_lessequals(X,U,Z) | -class_^ring__and__^field_^opordered__semiring(Z).
% 20 [] c_lessequals(c_0,c_times(X,Y,Z),Z) | -c_lessequals(c_0,X,Z) | -c_lessequals(c_0,Y,Z) | -class_^ring__and__^field_^opordered__cancel__semiring(Z).
% 21 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 22 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 23 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^orderings_^oorder(X).
% 24 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__cancel__semiring(X).
% 25 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__semiring(X).
% 26 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 27 [] c_less(c_0,v_c,t_b).
% 28 [] c_lessequals(c_^h^o^l_^oabs(v_a(v_x),t_b),c_times(v_c,c_^h^o^l_^oabs(v_f(v_x),t_b),t_b),t_b).
% 29 [] c_lessequals(c_^h^o^l_^oabs(v_b(v_x),t_b),c_times(v_ca,c_^h^o^l_^oabs(v_g(v_x),t_b),t_b),t_b).
% 30 [] equal(c_times(c_times(v_c,v_ca,t_b),c_^h^o^l_^oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),c_times(c_times(v_c,c_^h^o^l_^oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_^h^o^l_^oabs(v_g(v_x),t_b),t_b),t_b)).
% 31 [] -c_lessequals(c_^h^o^l_^oabs(c_times(v_a(v_x),v_b(v_x),t_b),t_b),c_times(c_times(v_c,v_ca,t_b),c_^h^o^l_^oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),t_b).
% 32 [] class_^ring__and__^field_^oordered__idom(t_b).
% 33 [hyper:18,32] equal(c_^h^o^l_^oabs(c_times(X,Y,t_b),t_b),c_times(c_^h^o^l_^oabs(X,t_b),c_^h^o^l_^oabs(Y,t_b),t_b)).
% 34 [hyper:24,32] class_^ring__and__^field_^opordered__cancel__semiring(t_b).
% 35 [hyper:25,32] class_^ring__and__^field_^opordered__semiring(t_b).
% 36 [hyper:26,32] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 39 [hyper:22,36] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_b),t_b).
% 40 [hyper:23,36] class_^orderings_^oorder(t_b).
% 42 [hyper:21,27,cut:40] c_lessequals(c_0,v_c,t_b).
% 91 [hyper:20,39,42,cut:34] c_lessequals(c_0,c_times(v_c,c_^h^o^l_^oabs(X,t_b),t_b),t_b).
% 196 [hyper:19,91,28,39,29,cut:35,demod:33,demod:30,cut:31] 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 11
% clause depth limited to 5
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 19
% derived clauses: 195
% kept clauses: 35
% kept size sum: 508
% kept mid-nuclei: 123
% kept new demods: 2
% forw unit-subs: 31
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 46
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 15
% length fails: 0
% strength fails: 4
% predlist fails: 11
% 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/SystemOnTPTP3612/ANA/ANA034-2+eq_r.in")
%
%------------------------------------------------------------------------------