TSTP Solution File: FLD005-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD005-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 : art08.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 19.9s
% Output : Assurance 19.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/FLD005-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(29,40,0,58,0,0,282623,4,2065,309727,5,2701,309729,1,2701,309729,50,2702,309729,40,2702,309758,0,2702)
%
%
% START OF PROOF
% 309730 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 309732 [] sum(additive_identity,X,X) | -defined(X).
% 309733 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 309734 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 309744 [] defined(additive_inverse(X)) | -defined(X).
% 309748 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 309756 [] defined(a).
% 309757 [] defined(b).
% 309758 [] -sum(a,X,b).
% 309795 [binary:309756,309744.2] defined(additive_inverse(a)).
% 309814 [binary:309757,309732.2] sum(additive_identity,b,b).
% 309829 [binary:309730.2,309814] -sum(Z,X,additive_identity) | -sum(X,b,Y) | sum(Z,Y,b).
% 309844 [binary:309756,309733.2] sum(additive_inverse(a),a,additive_identity).
% 309889 [binary:309734,309844] sum(a,additive_inverse(a),additive_identity).
% 312176 [binary:309889,309829,cut:309758] -sum(additive_inverse(a),b,X).
% 312191 [binary:309748,312176,cut:309795,cut:309757] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 9
% clause depth limited to 2
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1126
% derived clauses: 564325
% kept clauses: 24774
% kept size sum: 328806
% kept mid-nuclei: 284180
% kept new demods: 0
% forw unit-subs: 184496
% forw double-subs: 41846
% forw overdouble-subs: 11268
% backward subs: 45
% fast unit cutoff: 2531
% full unit cutoff: 2855
% dbl unit cutoff: 13
% real runtime : 27.19
% process. runtime: 27.15
% specific non-discr-tree subsumption statistics:
% tried: 137950
% length fails: 7874
% strength fails: 4393
% predlist fails: 74537
% aux str. fails: 8127
% by-lit fails: 607
% full subs tried: 24160
% full subs fail: 21894
%
% ; 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/FLD005-3+noeq.in")
%
%------------------------------------------------------------------------------