TSTP Solution File: ANA022-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA022-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 24.8s
% Output : Assurance 24.8s
% 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/SystemOnTPTP1428/ANA/ANA022-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 4 7)
% (binary-unit 9 #f 4 7)
% (binary-double 9 #f 4 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 7)
% (binary-order 25 #f 4 7)
% (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(28,40,0,56,0,0,68171,4,1900,80647,5,2508,80652,1,2508,80652,50,2510,80652,40,2510,80680,0,2510)
%
%
% START OF PROOF
% 80654 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 80655 [] equal(c_^h^o^l_^oabs(c_uminus(X,Y),Y),c_^h^o^l_^oabs(X,Y)) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 80656 [] equal(c_^h^o^l_^oabs(X,Y),c_uminus(X,Y)) | -c_lessequals(X,c_0,Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 80657 [] -c_lessequals(c_plus(X,Y,Z),c_plus(U,Y,Z),Z) | c_lessequals(X,U,Z) | -class_^ordered^group_^opordered__ab__semigroup__add__imp__le(Z).
% 80658 [] equal(c_plus(c_0,X,Y),X) | -class_^ordered^group_^ocomm__monoid__add(Y).
% 80659 [] equal(c_plus(X,c_minus(Y,Z,U),U),c_minus(c_plus(X,Y,U),Z,U)) | -class_^ordered^group_^oab__group__add(U).
% 80660 [] equal(c_plus(c_minus(X,Y,Z),U,Z),c_minus(c_plus(X,U,Z),Y,Z)) | -class_^ordered^group_^oab__group__add(Z).
% 80661 [] -c_lessequals(X,c_plus(Y,Z,U),U) | c_lessequals(c_minus(X,Z,U),Y,U) | -class_^ordered^group_^opordered__ab__group__add(U).
% 80663 [] equal(c_minus(X,c_uminus(Y,Z),Z),c_plus(X,Y,Z)) | -class_^ordered^group_^oab__group__add(Z).
% 80664 [] equal(c_minus(X,X,Y),c_0) | -class_^ordered^group_^oab__group__add(Y).
% 80665 [] equal(c_uminus(c_minus(X,Y,Z),Z),c_minus(Y,X,Z)) | -class_^ordered^group_^oab__group__add(Z).
% 80666 [] c_less(X,Y,Z) | c_lessequals(Y,X,Z) | -class_^orderings_^olinorder(Z).
% 80667 [] c_lessequals(c_^orderings_^omax(X,Y,Z),U,Z) | -c_lessequals(X,U,Z) | -c_lessequals(Y,U,Z) | -class_^orderings_^olinorder(Z).
% 80668 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 80669 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 80670 [] -class_^l^order_^ojoin__semilorder(X) | class_^orderings_^oorder(X).
% 80671 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 80672 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^ordered^group_^opordered__ab__semigroup__add__imp__le(X).
% 80673 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^ocomm__monoid__add(X).
% 80674 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 80675 [] -class_^ring__and__^field_^oordered__idom(X) | class_^l^order_^ojoin__semilorder(X).
% 80676 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^oab__group__add(X).
% 80677 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 80678 [] c_lessequals(v_k(X),v_f(X),t_b).
% 80679 [] -c_lessequals(c_^orderings_^omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_^h^o^l_^oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 80680 [] class_^ring__and__^field_^oordered__idom(t_b).
% 80686 [binary:80680,80673] class_^ordered^group_^ocomm__monoid__add(t_b).
% 80688 [binary:80680,80674] class_^orderings_^olinorder(t_b).
% 80691 [binary:80680,80675] class_^l^order_^ojoin__semilorder(t_b).
% 80692 [binary:80670,80691] class_^orderings_^oorder(t_b).
% 80694 [binary:80680,80676] class_^ordered^group_^oab__group__add(t_b).
% 80697 [binary:80680,80677] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 80698 [binary:80671,80697] class_^ordered^group_^opordered__ab__group__add(t_b).
% 80699 [binary:80672,80697] class_^ordered^group_^opordered__ab__semigroup__add__imp__le(t_b).
% 80700 [binary:80654.2,80697] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_b),t_b).
% 80701 [binary:80655.2,80697] equal(c_^h^o^l_^oabs(c_uminus(X,t_b),t_b),c_^h^o^l_^oabs(X,t_b)).
% 80705 [binary:80686,80658.2] equal(c_plus(c_0,X,t_b),X).
% 80707 [binary:80694,80664.2] equal(c_minus(X,X,t_b),c_0).
% 80711 [para:80705.1.1,80657.1.1,cut:80699] -c_lessequals(X,c_plus(Y,X,t_b),t_b) | c_lessequals(c_0,Y,t_b).
% 80712 [para:80705.1.1,80657.1.2,cut:80699] -c_lessequals(c_plus(X,Y,t_b),Y,t_b) | c_lessequals(X,c_0,t_b).
% 80723 [binary:80694,80659.2] equal(c_plus(X,c_minus(Y,Z,t_b),t_b),c_minus(c_plus(X,Y,t_b),Z,t_b)).
% 80730 [binary:80694,80660.2,demod:80723] equal(c_plus(c_minus(X,Y,t_b),Z,t_b),c_plus(X,c_minus(Z,Y,t_b),t_b)).
% 80737 [para:80705.1.1,80661.1.2,cut:80698] c_lessequals(c_minus(X,Y,t_b),c_0,t_b) | -c_lessequals(X,Y,t_b).
% 80748 [binary:80694,80663.2] equal(c_minus(X,c_uminus(Y,t_b),t_b),c_plus(X,Y,t_b)).
% 80749 [para:80663.1.1,80707.1.1,cut:80694] equal(c_plus(c_uminus(X,t_b),X,t_b),c_0).
% 80754 [para:80749.1.1,80711.1.2] c_lessequals(c_0,c_uminus(X,t_b),t_b) | -c_lessequals(X,c_0,t_b).
% 80755 [para:80749.1.1,80712.1.1] c_lessequals(c_uminus(X,t_b),c_0,t_b) | -c_lessequals(c_0,X,t_b).
% 80764 [binary:80694,80665.2] equal(c_uminus(c_minus(X,Y,t_b),t_b),c_minus(Y,X,t_b)).
% 80765 [para:80707.1.1,80665.1.1.1,demod:80707,cut:80694] equal(c_uminus(c_0,t_b),c_0).
% 80767 [para:80665.1.1,80749.1.1.1,demod:80730,cut:80694] equal(c_plus(X,c_minus(c_minus(Y,X,t_b),Y,t_b),t_b),c_0).
% 80770 [para:80765.1.1,80663.1.1.2,cut:80694] equal(c_minus(X,c_0,t_b),c_plus(X,c_0,t_b)).
% 80777 [para:80770.1.1,80665.1.1.1,cut:80694] equal(c_uminus(c_plus(X,c_0,t_b),t_b),c_minus(c_0,X,t_b)).
% 80783 [para:80748.1.1,80665.1.1.1,cut:80694] equal(c_uminus(c_plus(X,Y,t_b),t_b),c_minus(c_uminus(Y,t_b),X,t_b)).
% 80784 [para:80665.1.1,80748.1.1.2,cut:80694] equal(c_minus(X,c_minus(Y,Z,t_b),t_b),c_plus(X,c_minus(Z,Y,t_b),t_b)).
% 80789 [binary:80679,80667,cut:80700,cut:80688] -c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_^h^o^l_^oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 80802 [para:80764.1.1,80754.1.2,binarydemod:80737] c_lessequals(c_0,c_minus(X,Y,t_b),t_b) | -c_lessequals(Y,X,t_b).
% 80805 [binary:80678,80802.2] c_lessequals(c_0,c_minus(v_f(X),v_k(X),t_b),t_b).
% 80822 [binary:80678,80668,cut:80692] -c_lessequals(v_f(X),Y,t_b) | c_lessequals(v_k(X),Y,t_b).
% 80827 [binary:80700,80668.2,cut:80692] c_lessequals(X,c_^h^o^l_^oabs(Y,t_b),t_b) | -c_lessequals(X,c_0,t_b).
% 80925 [para:80767.1.1,80657.1.1,cut:80699] -c_lessequals(c_0,c_plus(X,c_minus(c_minus(Y,Z,t_b),Y,t_b),t_b),t_b) | c_lessequals(Z,X,t_b).
% 80967 [para:80664.1.1,80730.1.1.1,demod:80705,cut:80694] equal(X,c_plus(Y,c_minus(X,Y,t_b),t_b)).
% 80979 [para:80967.1.2,80658.1.1,demod:80770,cut:80686] equal(X,c_plus(X,c_0,t_b)).
% 80985 [para:80663.1.1,80967.1.2.2,cut:80694] equal(X,c_plus(c_uminus(Y,t_b),c_plus(X,Y,t_b),t_b)).
% 80987 [para:80979.1.2,80777.1.1.1] equal(c_uminus(X,t_b),c_minus(c_0,X,t_b)).
% 80988 [para:80979.1.2,80723.1.2.1,demod:80987] equal(c_plus(X,c_uminus(Y,t_b),t_b),c_minus(X,Y,t_b)).
% 80989 [para:80987.1.2,80663.1.1,demod:80705,cut:80694] equal(c_uminus(c_uminus(X,t_b),t_b),X).
% 80992 [para:80987.1.2,80730.1.1.1,demod:80705] equal(c_plus(c_uminus(X,t_b),Y,t_b),c_minus(Y,X,t_b)).
% 80994 [para:80989.1.1,80656.1.2,demod:80701,cut:80697,binarydemod:80755] equal(c_^h^o^l_^oabs(X,t_b),X) | -c_lessequals(c_0,X,t_b).
% 81030 [para:80985.1.2,80985.1.2.2,demod:80992] equal(c_uminus(X,t_b),c_minus(Y,c_plus(Y,X,t_b),t_b)).
% 81033 [para:80988.1.1,80659.1.2.1,demod:80988,80783,cut:80694] equal(c_minus(X,c_plus(Y,Z,t_b),t_b),c_minus(c_minus(X,Z,t_b),Y,t_b)).
% 81077 [para:81030.1.2,80730.1.1.1,demod:80992] equal(c_minus(X,Y,t_b),c_plus(Z,c_minus(X,c_plus(Z,Y,t_b),t_b),t_b)).
% 81827 [binary:80827,80789,binarydemod:80737] -c_lessequals(v_k(v_x),v_g(v_x),t_b).
% 81841 [binary:80822.2,81827] -c_lessequals(v_f(v_x),v_g(v_x),t_b).
% 81847 [binary:80666.2,81841,cut:80688] c_less(v_g(v_x),v_f(v_x),t_b).
% 81856 [binary:80669,81847,cut:80692] c_lessequals(v_g(v_x),v_f(v_x),t_b).
% 81880 [binary:80802.2,81856] c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 81985 [binary:80994.2,81880] equal(c_^h^o^l_^oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),c_minus(v_f(v_x),v_g(v_x),t_b)).
% 84656 [binary:80789,80925.2,demod:80988,81030,80730,81077,81033,80723,80784,81985,cut:80805] 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 7
% clause depth limited to 4
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1008
% derived clauses: 383704
% kept clauses: 71722
% kept size sum: 59549
% kept mid-nuclei: 2630
% kept new demods: 120
% forw unit-subs: 50340
% forw double-subs: 88106
% forw overdouble-subs: 95312
% backward subs: 56
% fast unit cutoff: 4620
% full unit cutoff: 0
% dbl unit cutoff: 6
% real runtime : 26.8
% process. runtime: 25.88
% specific non-discr-tree subsumption statistics:
% tried: 10637350
% length fails: 896575
% strength fails: 1979892
% predlist fails: 2164649
% aux str. fails: 703883
% by-lit fails: 184403
% full subs tried: 4552350
% full subs fail: 4456726
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP1428/ANA/ANA022-2+eq_r.in")
% WARNING: TreeLimitedRun lost 24.82s, total lost is 24.82s
%
%------------------------------------------------------------------------------