TSTP Solution File: FLD003-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD003-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 80.0s
% Output : Assurance 80.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/FLD003-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 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 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(30,40,0,60,0,0,1157359,4,2029,1157388,50,2058,1157388,40,2058,1157418,0,2058,1223392,3,2559,1244715,4,2810,1310360,5,3059,1310361,5,3061,1310361,1,3061,1310361,50,3070,1310361,40,3070,1310391,0,3070,1399035,3,3872,1426195,4,4271,1600671,5,4671,1600672,5,4672,1600672,1,4672,1600672,50,4682,1600672,40,4682,1600702,0,4682,1759264,3,7405,1822176,4,8733)
%
%
% START OF PROOF
% 1600674 [] equalish(add(additive_identity,X),X) | -defined(X).
% 1600675 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 1600676 [] equalish(add(X,Y),add(Y,X)) | -defined(X) | -defined(Y).
% 1600682 [] defined(add(X,Y)) | -defined(X) | -defined(Y).
% 1600684 [] defined(additive_inverse(X)) | -defined(X).
% 1600695 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 1600696 [] equalish(add(X,Y),add(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 1600700 [] defined(a).
% 1600701 [] defined(b).
% 1600702 [] -equalish(add(a,add(b,additive_inverse(b))),a).
% 1600706 [binary:1600674.2,1600700] equalish(add(additive_identity,a),a).
% 1600729 [binary:1600696.3,1600700] equalish(add(X,a),add(Y,a)) | -equalish(X,Y).
% 1600735 [binary:1600675.2,1600701] equalish(add(b,additive_inverse(b)),additive_identity).
% 1600748 [binary:1600682.2,1600701] defined(add(b,X)) | -defined(X).
% 1600750 [binary:1600684.2,1600701] defined(additive_inverse(b)).
% 1600819 [binary:1600695.3,1600702] -equalish(add(a,add(b,additive_inverse(b))),X) | -equalish(X,a).
% 1600911 [binary:1600695.2,1600706] -equalish(X,add(additive_identity,a)) | equalish(X,a).
% 1602977 [binary:1600750,1600748.2] defined(add(b,additive_inverse(b))).
% 1605652 [binary:1600729.2,1600735] equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a)).
% 1626561 [binary:1600676,1600819,cut:1600700,cut:1602977] -equalish(add(add(b,additive_inverse(b)),a),a).
% 1868873 [binary:1605652,1600911,cut:1626561] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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 4
% seconds given: 54
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6171
% derived clauses: 5128786
% kept clauses: 308503
% kept size sum: 0
% kept mid-nuclei: 331775
% kept new demods: 0
% forw unit-subs: 180910
% forw double-subs: 32555
% forw overdouble-subs: 5187
% backward subs: 4
% fast unit cutoff: 2999
% full unit cutoff: 0
% dbl unit cutoff: 3263
% real runtime : 88.94
% process. runtime: 88.91
% specific non-discr-tree subsumption statistics:
% tried: 129648
% length fails: 16
% strength fails: 18062
% predlist fails: 26763
% aux str. fails: 100
% by-lit fails: 28
% full subs tried: 83712
% full subs fail: 78446
%
% ; 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/FLD003-1+noeq.in")
%
%------------------------------------------------------------------------------