TSTP Solution File: FLD026-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD026-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 : art09.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/FLD026-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(31,40,0,62,0,0)
%
%
% START OF PROOF
% 32 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 34 [] sum(additive_identity,X,X) | -defined(X).
% 35 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 36 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 37 [] -product(Y,U,V) | -product(Z,U,W) | -product(X,Y,Z) | product(X,V,W).
% 38 [] -product(Y,U,V) | -product(X,V,W) | -product(X,Y,Z) | product(Z,U,W).
% 39 [] product(multiplicative_identity,X,X) | -defined(X).
% 40 [] product(multiplicative_inverse(X),X,multiplicative_identity) | sum(additive_identity,X,additive_identity) | -defined(X).
% 41 [] -product(X,Y,Z) | product(Y,X,Z).
% 42 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(U,W,X) | sum(V,X1,Z).
% 45 [] defined(additive_identity).
% 48 [] defined(multiplicative_identity).
% 49 [] defined(multiplicative_inverse(X)) | sum(additive_identity,X,additive_identity) | -defined(X).
% 58 [] defined(a).
% 59 [] defined(b).
% 60 [] -sum(additive_identity,a,additive_identity).
% 61 [] product(multiplicative_identity,a,b).
% 62 [] -product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(b)).
% 63 [hyper:34,58] sum(additive_identity,a,a).
% 65 [hyper:39,58] product(multiplicative_identity,a,a).
% 66 [hyper:40,58,cut:60] product(multiplicative_inverse(a),a,multiplicative_identity).
% 74 [hyper:49,58,cut:60] defined(multiplicative_inverse(a)).
% 87 [hyper:40,59] product(multiplicative_inverse(b),b,multiplicative_identity) | sum(additive_identity,b,additive_identity).
% 99 [hyper:49,59] defined(multiplicative_inverse(b)) | sum(additive_identity,b,additive_identity).
% 115 [hyper:35,45] sum(additive_inverse(additive_identity),additive_identity,additive_identity).
% 116 [hyper:39,45] product(multiplicative_identity,additive_identity,additive_identity).
% 153 [hyper:39,48] product(multiplicative_identity,multiplicative_identity,multiplicative_identity).
% 209 [hyper:39,74] product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(a)).
% 261 [hyper:41,61] product(a,multiplicative_identity,b).
% 545 [hyper:41,65] product(a,multiplicative_identity,a).
% 1370 [hyper:41,116] product(additive_identity,multiplicative_identity,additive_identity).
% 2077 [hyper:42,1370,63,545,261] sum(additive_identity,a,b).
% 3563 [hyper:37,66,261,153] product(multiplicative_inverse(a),b,multiplicative_identity).
% 3837 [hyper:32,115,2077,63] sum(additive_inverse(additive_identity),b,a).
% 3843 [hyper:36,115] sum(additive_identity,additive_inverse(additive_identity),additive_identity).
% 4022 [hyper:41,3563] product(b,multiplicative_inverse(a),multiplicative_identity).
% 5634 [hyper:37,209,4022,3563] product(multiplicative_inverse(a),multiplicative_identity,multiplicative_inverse(a)).
% 10047 [hyper:32,87,3837,3843,cut:60] product(multiplicative_inverse(b),b,multiplicative_identity).
% 10105 [hyper:41,10047] product(b,multiplicative_inverse(b),multiplicative_identity).
% 10241 [hyper:32,99,3837,3843,cut:60] defined(multiplicative_inverse(b)).
% 10290 [hyper:39,10241] product(multiplicative_identity,multiplicative_inverse(b),multiplicative_inverse(b)).
% 10652 [hyper:38,10105,3563,5634] product(multiplicative_identity,multiplicative_inverse(b),multiplicative_inverse(a)).
% 17235 [hyper:37,10652,10290,153,cut:62] 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 9
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 192
% derived clauses: 30916
% kept clauses: 1369
% kept size sum: 14577
% kept mid-nuclei: 15778
% kept new demods: 0
% forw unit-subs: 7707
% forw double-subs: 2866
% forw overdouble-subs: 123
% backward subs: 5
% fast unit cutoff: 16
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.51
% process. runtime: 0.50
% specific non-discr-tree subsumption statistics:
% tried: 6565
% length fails: 1
% strength fails: 1230
% predlist fails: 4095
% aux str. fails: 957
% by-lit fails: 0
% full subs tried: 159
% full subs fail: 159
%
% ; 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/FLD026-3+noeq.in")
%
%------------------------------------------------------------------------------