TSTP Solution File: FLD013-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD013-3 : TPTP v3.4.2. Bugfixed v2.1.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 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 9.9s
% Output : Assurance 9.9s
% 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD013-3+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(33,40,0,66,0,0)
%
%
% START OF PROOF
% 34 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 36 [] sum(additive_identity,X,X) | -defined(X).
% 37 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 38 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 47 [] defined(additive_identity).
% 52 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 54 [] sum(additive_identity,X,Y) | -less_or_equal(X,Y) | -less_or_equal(Y,X).
% 56 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 57 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 60 [] defined(a).
% 61 [] defined(b).
% 62 [] defined(c).
% 63 [] defined(d).
% 64 [] sum(additive_identity,a,b).
% 65 [] sum(additive_identity,c,d).
% 66 [] -sum(a,c,add(d,b)).
% 67 [hyper:36,60] sum(additive_identity,a,a).
% 88 [hyper:36,61] sum(additive_identity,b,b).
% 118 [hyper:36,62] sum(additive_identity,c,c).
% 157 [hyper:36,63] sum(additive_identity,d,d).
% 183 [hyper:52,63,61] sum(d,b,add(d,b)).
% 206 [hyper:37,47] sum(additive_inverse(additive_identity),additive_identity,additive_identity).
% 258 [hyper:56,47,47] less_or_equal(additive_identity,additive_identity).
% 460 [hyper:57,67,64,cut:258] less_or_equal(a,b).
% 462 [hyper:57,67,64,cut:258] less_or_equal(b,a).
% 463 [hyper:54,460,cut:462] sum(additive_identity,b,a).
% 1487 [hyper:57,118,65,cut:258] less_or_equal(c,d).
% 1489 [hyper:57,118,65,cut:258] less_or_equal(d,c).
% 1500 [hyper:54,1487,cut:1489] sum(additive_identity,d,c).
% 10419 [hyper:34,206,1500,157] sum(additive_inverse(additive_identity),c,d).
% 10427 [hyper:34,206,88,463] sum(additive_inverse(additive_identity),b,a).
% 11754 [hyper:38,10419] sum(c,additive_inverse(additive_identity),d).
% 36164 [hyper:34,183,11754,10427] sum(c,a,add(d,b)).
% 171604 [hyper:38,36164,cut:66] 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 9
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 584
% derived clauses: 308607
% kept clauses: 20054
% kept size sum: 228894
% kept mid-nuclei: 151357
% kept new demods: 0
% forw unit-subs: 63130
% forw double-subs: 51685
% forw overdouble-subs: 13296
% backward subs: 5
% fast unit cutoff: 1799
% full unit cutoff: 0
% dbl unit cutoff: 21
% real runtime : 10.11
% process. runtime: 10.2
% specific non-discr-tree subsumption statistics:
% tried: 104898
% length fails: 8771
% strength fails: 2727
% predlist fails: 55109
% aux str. fails: 5234
% by-lit fails: 264
% full subs tried: 905
% full subs fail: 905
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD013-3+noeq.in")
%
%------------------------------------------------------------------------------