TSTP Solution File: FLD058-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD058-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 : art03.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 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD058-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(33,40,1,66,0,1)
%
%
% START OF PROOF
% 49 [] -less_or_equal(X,Y) | -less_or_equal(Y,X) | equalish(X,Y).
% 55 [] -equalish(X,Y) | equalish(Y,X).
% 56 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 59 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 63 [] less_or_equal(additive_identity,a).
% 64 [] less_or_equal(a,b).
% 65 [] -equalish(a,additive_identity).
% 66 [] equalish(b,additive_identity).
% 1044 [hyper:55,66] equalish(additive_identity,b).
% 1228 [hyper:59,1044,63] less_or_equal(b,a).
% 1281 [hyper:49,1228,cut:64] equalish(a,b).
% 1335 [hyper:56,1281,66,cut:65] 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 7
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31
% derived clauses: 1752
% kept clauses: 826
% kept size sum: 6857
% kept mid-nuclei: 439
% kept new demods: 0
% forw unit-subs: 264
% forw double-subs: 34
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 50
% length fails: 0
% strength fails: 40
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 10
% full subs fail: 10
%
% ; 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/FLD058-1+noeq.in")
%
%------------------------------------------------------------------------------