TSTP Solution File: ANA030-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA030-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 : art04.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/SystemOnTPTP4579/ANA/ANA030-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: short
%
% strategies selected:
% (binary-posweight-order 57 #f 6 5)
% (binary-unit 28 #f 6 5)
% (binary-double 28 #f 6 5)
% (binary 45 #t 6 5)
% (hyper 11 #t 6 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(17,40,0,34,0,0)
%
%
% START OF PROOF
% 19 [] equal(c_^h^o^l_^oabs(X,Y),X) | -c_lessequals(c_0,X,Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 20 [] equal(c_plus(X,c_uminus(Y,Z),Z),c_minus(X,Y,Z)) | -class_^ordered^group_^oab__group__add(Z).
% 21 [] -c_lessequals(c_minus(X,Y,Z),U,Z) | c_lessequals(X,c_plus(U,Y,Z),Z) | -class_^ordered^group_^opordered__ab__group__add(Z).
% 23 [] equal(c_uminus(c_plus(X,Y,Z),Z),c_plus(c_uminus(X,Z),c_uminus(Y,Z),Z)) | -class_^ordered^group_^oab__group__add(Z).
% 24 [] equal(c_uminus(c_minus(X,Y,Z),Z),c_minus(Y,X,Z)) | -class_^ordered^group_^oab__group__add(Z).
% 25 [] equal(c_uminus(c_uminus(X,Y),Y),X) | -class_^ordered^group_^oab__group__add(Y).
% 26 [] c_lessequals(X,c_^orderings_^omax(Y,X,Z),Z) | -class_^orderings_^olinorder(Z).
% 27 [] -c_lessequals(c_^orderings_^omax(X,Y,Z),U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^olinorder(Z).
% 28 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 29 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 30 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^oab__group__add(X).
% 31 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 32 [] c_lessequals(c_^h^o^l_^oabs(c_^orderings_^omax(c_minus(v_f(X),v_g(X),t_b),c_0,t_b),t_b),c_times(v_c,c_^h^o^l_^oabs(v_h(X),t_b),t_b),t_b).
% 33 [] -c_lessequals(v_f(v_x(X)),c_plus(v_g(v_x(X)),c_times(X,c_^h^o^l_^oabs(v_h(v_x(X)),t_b),t_b),t_b),t_b).
% 34 [] class_^ring__and__^field_^oordered__idom(t_b).
% 37 [binary:34,29] class_^orderings_^olinorder(t_b).
% 39 [binary:34,30] class_^ordered^group_^oab__group__add(t_b).
% 41 [binary:34,31] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 42 [binary:28,41] class_^ordered^group_^opordered__ab__group__add(t_b).
% 44 [binary:39,25.2] equal(c_uminus(c_uminus(X,t_b),t_b),X).
% 46 [binary:37,26.2] c_lessequals(X,c_^orderings_^omax(Y,X,t_b),t_b).
% 48 [binary:46,19.2,cut:41] equal(c_^h^o^l_^oabs(c_^orderings_^omax(X,c_0,t_b),t_b),c_^orderings_^omax(X,c_0,t_b)).
% 50 [binary:39,20.2] equal(c_plus(X,c_uminus(Y,t_b),t_b),c_minus(X,Y,t_b)).
% 51 [para:44.1.1,50.1.1.2] equal(c_plus(X,Y,t_b),c_minus(X,c_uminus(Y,t_b),t_b)).
% 52 [para:48.1.1,32.1.1] c_lessequals(c_^orderings_^omax(c_minus(v_f(X),v_g(X),t_b),c_0,t_b),c_times(v_c,c_^h^o^l_^oabs(v_h(X),t_b),t_b),t_b).
% 58 [binary:39,24.2] equal(c_uminus(c_minus(X,Y,t_b),t_b),c_minus(Y,X,t_b)).
% 60 [para:51.1.2,58.1.1.1] equal(c_uminus(c_plus(X,Y,t_b),t_b),c_minus(c_uminus(Y,t_b),X,t_b)).
% 63 [binary:52,27,cut:37] c_lessequals(c_minus(v_f(X),v_g(X),t_b),c_times(v_c,c_^h^o^l_^oabs(v_h(X),t_b),t_b),t_b).
% 72 [binary:39,23.2,demod:60,50] equal(c_uminus(c_plus(X,Y,t_b),t_b),c_uminus(c_plus(Y,X,t_b),t_b)).
% 83 [para:72.1.1,44.1.1.1,demod:44] equal(c_plus(X,Y,t_b),c_plus(Y,X,t_b)).
% 88 [para:83.1.1,33.1.2] -c_lessequals(v_f(v_x(X)),c_plus(c_times(X,c_^h^o^l_^oabs(v_h(v_x(X)),t_b),t_b),v_g(v_x(X)),t_b),t_b).
% 117 [binary:21,63,cut:42,slowcut:88] 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 5
% clause depth limited to 6
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 42
% derived clauses: 181
% kept clauses: 66
% kept size sum: 1008
% kept mid-nuclei: 0
% kept new demods: 18
% forw unit-subs: 95
% forw double-subs: 4
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 26
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% 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/SystemOnTPTP4579/ANA/ANA030-2+eq_r.in")
%
%------------------------------------------------------------------------------