TSTP Solution File: ANA028-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA028-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 : art02.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/SystemOnTPTP19013/ANA/ANA028-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 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 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(14,40,0,28,0,0)
%
%
% START OF PROOF
% 16 [] equal(c_plus(c_0,X,Y),X) | -class_^ordered^group_^ocomm__monoid__add(Y).
% 17 [] 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).
% 18 [] 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).
% 19 [] equal(c_minus(X,c_minus(Y,Z,U),U),c_minus(c_plus(X,Z,U),Y,U)) | -class_^ordered^group_^oab__group__add(U).
% 20 [] -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).
% 21 [] -c_lessequals(c_plus(X,Y,Z),U,Z) | c_lessequals(X,c_minus(U,Y,Z),Z) | -class_^ordered^group_^opordered__ab__group__add(Z).
% 22 [] equal(c_minus(X,X,Y),c_0) | -class_^ordered^group_^oab__group__add(Y).
% 23 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^ocomm__monoid__add(X).
% 24 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^oab__group__add(X).
% 25 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 26 [] c_lessequals(v_g(X),v_k(X),t_b).
% 27 [] -c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 28 [] class_^ring__and__^field_^oordered__idom(t_b).
% 30 [binary:28,23] class_^ordered^group_^ocomm__monoid__add(t_b).
% 32 [binary:28,24] class_^ordered^group_^oab__group__add(t_b).
% 34 [binary:28,25] class_^ordered^group_^opordered__ab__group__add(t_b).
% 36 [binary:30,16.2] equal(c_plus(c_0,X,t_b),X).
% 38 [binary:32,22.2] equal(c_minus(X,X,t_b),c_0).
% 44 [binary:32,17.2] equal(c_plus(X,c_minus(Y,Z,t_b),t_b),c_minus(c_plus(X,Y,t_b),Z,t_b)).
% 46 [para:36.1.1,21.1.1,cut:34] c_lessequals(c_0,c_minus(X,Y,t_b),t_b) | -c_lessequals(Y,X,t_b).
% 48 [binary:26,46.2] c_lessequals(c_0,c_minus(v_k(X),v_g(X),t_b),t_b).
% 50 [binary:32,18.2,demod:44] equal(c_plus(c_minus(X,Y,t_b),Z,t_b),c_plus(X,c_minus(Z,Y,t_b),t_b)).
% 52 [binary:32,19.2,demod:44] equal(c_minus(X,c_minus(Y,Z,t_b),t_b),c_plus(X,c_minus(Z,Y,t_b),t_b)).
% 53 [para:38.1.1,50.1.1.1,demod:36] equal(X,c_plus(Y,c_minus(X,Y,t_b),t_b)).
% 54 [para:50.1.1,20.1.2,cut:34] -c_lessequals(X,c_plus(Y,c_minus(Z,U,t_b),t_b),t_b) | c_lessequals(c_minus(X,Z,t_b),c_minus(Y,U,t_b),t_b).
% 56 [para:53.1.2,36.1.1] equal(X,c_minus(X,c_0,t_b)).
% 57 [para:38.1.1,53.1.2.2] equal(X,c_plus(X,c_0,t_b)).
% 60 [para:57.1.2,44.1.2.1] equal(c_plus(X,c_minus(c_0,Y,t_b),t_b),c_minus(X,Y,t_b)).
% 61 [para:60.1.1,20.1.2,demod:56,52,cut:34] -c_lessequals(X,c_minus(Y,Z,t_b),t_b) | c_lessequals(c_plus(X,Z,t_b),Y,t_b).
% 67 [para:44.1.2,61.1.2] -c_lessequals(X,c_plus(Y,c_minus(Z,U,t_b),t_b),t_b) | c_lessequals(c_plus(X,U,t_b),c_plus(Y,Z,t_b),t_b).
% 75 [para:36.1.1,54.1.2] c_lessequals(c_minus(X,Y,t_b),c_minus(c_0,Z,t_b),t_b) | -c_lessequals(X,c_minus(Y,Z,t_b),t_b).
% 87 [para:38.1.1,67.1.2.2,demod:57] c_lessequals(c_plus(X,Y,t_b),c_plus(Z,Y,t_b),t_b) | -c_lessequals(X,Z,t_b).
% 98 [binary:48,75.2] c_lessequals(c_minus(c_0,v_k(X),t_b),c_minus(c_0,v_g(X),t_b),t_b).
% 101 [binary:87.2,98,demod:36,50,slowcut:27] 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 3
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 50
% derived clauses: 251
% kept clauses: 43
% kept size sum: 564
% kept mid-nuclei: 0
% kept new demods: 9
% forw unit-subs: 68
% forw double-subs: 18
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 8
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% 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/SystemOnTPTP19013/ANA/ANA028-2+eq_r.in")
%
%------------------------------------------------------------------------------