TSTP Solution File: FLD047-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD047-4 : 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 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/FLD047-4+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(38,40,0,76,0,0)
%
%
% START OF PROOF
% 40 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 41 [] sum(additive_identity,X,X) | -defined(X).
% 42 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 43 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 44 [] -product(Y,U,V) | -product(Z,U,W) | -product(X,Y,Z) | product(X,V,W).
% 45 [] -product(Y,U,V) | -product(X,V,W) | -product(X,Y,Z) | product(Z,U,W).
% 46 [] product(multiplicative_identity,X,X) | -defined(X).
% 47 [] product(multiplicative_inverse(X),X,multiplicative_identity) | sum(additive_identity,X,additive_identity) | -defined(X).
% 48 [] -product(X,Y,Z) | product(Y,X,Z).
% 49 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(U,W,X) | sum(V,X1,Z).
% 65 [] defined(a).
% 66 [] defined(b).
% 67 [] defined(c).
% 68 [] defined(u).
% 70 [] defined(t).
% 71 [] -sum(additive_identity,b,additive_identity).
% 72 [] -sum(additive_identity,c,additive_identity).
% 73 [] product(a,multiplicative_inverse(b),u).
% 74 [] product(a,c,s).
% 75 [] product(b,c,t).
% 76 [] -product(s,multiplicative_inverse(t),u).
% 79 [hyper:46,65] product(multiplicative_identity,a,a).
% 99 [hyper:42,66] sum(additive_inverse(b),b,additive_identity).
% 100 [hyper:46,66] product(multiplicative_identity,b,b).
% 101 [hyper:47,66,cut:71] product(multiplicative_inverse(b),b,multiplicative_identity).
% 131 [hyper:47,67,cut:72] product(multiplicative_inverse(c),c,multiplicative_identity).
% 169 [hyper:46,68] product(multiplicative_identity,u,u).
% 272 [hyper:41,70] sum(additive_identity,t,t).
% 275 [hyper:47,70] product(multiplicative_inverse(t),t,multiplicative_identity) | sum(additive_identity,t,additive_identity).
% 737 [hyper:48,75] product(c,b,t).
% 1007 [hyper:48,79] product(a,multiplicative_identity,a).
% 3914 [hyper:48,169] product(u,multiplicative_identity,u).
% 6214 [hyper:43,272] sum(t,additive_identity,t).
% 12579 [hyper:45,101,73,1007] product(u,b,a).
% 15617 [hyper:44,12579,75,74] product(u,t,s).
% 17257 [hyper:44,131,737,100] product(multiplicative_inverse(c),t,b).
% 18490 [hyper:48,17257] product(t,multiplicative_inverse(c),b).
% 43770 [hyper:48,275] product(t,multiplicative_inverse(t),multiplicative_identity) | sum(additive_identity,t,additive_identity).
% 59475 [hyper:45,43770,15617,3914,cut:76] sum(additive_identity,t,additive_identity).
% 60060 [hyper:40,59475,6214,6214] sum(t,t,t).
% 66250 [hyper:49,60060,18490,18490,18490] sum(b,b,b).
% 82982 [hyper:40,66250,99,99,cut:71] 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: 493
% derived clauses: 165746
% kept clauses: 18323
% kept size sum: 220869
% kept mid-nuclei: 64514
% kept new demods: 0
% forw unit-subs: 19819
% forw double-subs: 41612
% forw overdouble-subs: 7050
% backward subs: 8
% fast unit cutoff: 522
% full unit cutoff: 0
% dbl unit cutoff: 5
% real runtime : 5.3
% process. runtime: 5.3
% specific non-discr-tree subsumption statistics:
% tried: 45163
% length fails: 1825
% strength fails: 4075
% predlist fails: 25485
% aux str. fails: 2668
% by-lit fails: 476
% full subs tried: 945
% full subs fail: 945
%
% ; 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/FLD047-4+noeq.in")
%
%------------------------------------------------------------------------------