TSTP Solution File: FLD021-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD021-1 : 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 : art07.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 20.0s
% Output : Assurance 20.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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD021-1+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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (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(31,40,1,62,0,1,665118,4,2028,665354,50,2061,665354,40,2061,665385,0,2061,709596,3,2562,716978,4,2814)
%
%
% START OF PROOF
% 665356 [] equalish(add(additive_identity,X),X) | -defined(X).
% 665365 [] defined(additive_identity).
% 665370 [] -less_or_equal(Y,X) | -less_or_equal(X,Y) | equalish(Y,X).
% 665372 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 665373 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 665376 [] -equalish(X,Y) | equalish(Y,X).
% 665377 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 665380 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 665382 [] defined(a).
% 665383 [] defined(m).
% 665384 [] equalish(m,additive_identity).
% 665385 [] -equalish(add(m,a),a).
% 665403 [input:665372,factor] less_or_equal(X,X) | -defined(X).
% 665437 [binary:665382,665356.2] equalish(add(additive_identity,a),a).
% 665465 [binary:665383,665403.2] less_or_equal(m,m).
% 665466 [binary:665365,665403.2] less_or_equal(additive_identity,additive_identity).
% 665536 [binary:665384,665376] equalish(additive_identity,m).
% 665769 [binary:665382,665373.3] less_or_equal(add(X,a),add(Y,a)) | -less_or_equal(X,Y).
% 665935 [binary:665385,665377.3] -equalish(add(m,a),X) | -equalish(X,a).
% 666187 [binary:665384,665380.2] -less_or_equal(m,X) | less_or_equal(additive_identity,X).
% 666190 [binary:665466,665380] -equalish(additive_identity,X) | less_or_equal(X,additive_identity).
% 667819 [binary:665465,666187] less_or_equal(additive_identity,m).
% 667873 [binary:665536,666190] less_or_equal(m,additive_identity).
% 701662 [binary:667819,665769.2] less_or_equal(add(additive_identity,a),add(m,a)).
% 701670 [binary:667873,665769.2] less_or_equal(add(m,a),add(additive_identity,a)).
% 716796 [binary:665370.2,701662,cut:701670] equalish(add(m,a),add(additive_identity,a)).
% 727147 [binary:716796,665935,cut:665437] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation 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 3
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2884
% derived clauses: 1430440
% kept clauses: 128325
% kept size sum: 870370
% kept mid-nuclei: 16098
% kept new demods: 0
% forw unit-subs: 28688
% forw double-subs: 175073
% forw overdouble-subs: 10286
% backward subs: 5
% fast unit cutoff: 672
% full unit cutoff: 0
% dbl unit cutoff: 88
% real runtime : 29.13
% process. runtime: 28.86
% specific non-discr-tree subsumption statistics:
% tried: 55511
% length fails: 0
% strength fails: 192
% predlist fails: 32846
% aux str. fails: 0
% by-lit fails: 367
% full subs tried: 6740
% full subs fail: 5365
%
% ; 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/FLD021-1+noeq.in")
%
%------------------------------------------------------------------------------