TSTP Solution File: FLD067-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD067-2 : 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 : art05.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/FLD067-2+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,0,66,0,0,699953,4,2026,699977,50,2056,699977,40,2056,700010,0,2056,747172,3,2557,752742,4,2807)
%
%
% START OF PROOF
% 699980 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 699988 [] defined(additive_identity).
% 699989 [] defined(additive_inverse(X)) | -defined(X).
% 699993 [] -less_or_equal(Y,X) | -less_or_equal(X,Y) | equalish(Y,X).
% 699995 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 699996 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 699999 [] -equalish(X,Y) | equalish(Y,X).
% 700000 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 700003 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 700005 [] defined(a).
% 700007 [] defined(u).
% 700008 [] less_or_equal(a,b).
% 700009 [] equalish(add(b,additive_inverse(a)),u).
% 700010 [] -less_or_equal(additive_identity,u).
% 700028 [input:699995,factor] less_or_equal(X,X) | -defined(X).
% 700040 [binary:700005,699989.2] defined(additive_inverse(a)).
% 700105 [binary:700005,699980.2] equalish(add(a,additive_inverse(a)),additive_identity).
% 700113 [binary:700007,700028.2] less_or_equal(u,u).
% 700218 [binary:700009,699999] equalish(u,add(b,additive_inverse(a))).
% 700405 [binary:700010,699995,cut:699988,cut:700007] less_or_equal(u,additive_identity).
% 700443 [binary:700008,699996.2] less_or_equal(add(a,X),add(b,X)) | -defined(X).
% 700868 [binary:700010,700003.3] -less_or_equal(X,u) | -equalish(X,additive_identity).
% 700899 [binary:700405,700003] -equalish(u,X) | less_or_equal(X,additive_identity).
% 703621 [binary:700003.2,700105] -less_or_equal(add(a,additive_inverse(a)),X) | less_or_equal(additive_identity,X).
% 703704 [binary:700113,700868] -equalish(u,additive_identity).
% 703713 [binary:699999.2,703704] -equalish(additive_identity,u).
% 703759 [binary:700000.3,703713] -equalish(X,u) | -equalish(additive_identity,X).
% 704541 [binary:700009,703759] -equalish(additive_identity,add(b,additive_inverse(a))).
% 704546 [binary:700899,700218] less_or_equal(add(b,additive_inverse(a)),additive_identity).
% 746874 [binary:700040,700443.2] less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))).
% 751303 [binary:699993.3,704541,cut:704546] -less_or_equal(additive_identity,add(b,additive_inverse(a))).
% 764471 [binary:746874,703621,cut:751303] 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: 2862
% derived clauses: 1524419
% kept clauses: 129520
% kept size sum: 798720
% kept mid-nuclei: 18278
% kept new demods: 0
% forw unit-subs: 38469
% forw double-subs: 145849
% forw overdouble-subs: 9372
% backward subs: 12
% fast unit cutoff: 115
% full unit cutoff: 0
% dbl unit cutoff: 24
% real runtime : 28.62
% process. runtime: 28.61
% specific non-discr-tree subsumption statistics:
% tried: 54499
% length fails: 0
% strength fails: 201
% predlist fails: 36838
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 6767
% full subs fail: 5362
%
% ; 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/FLD067-2+noeq.in")
%
%------------------------------------------------------------------------------