TSTP Solution File: FLD054-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD054-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 : art07.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/FLD054-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(37,40,0,74,0,0)
%
%
% START OF PROOF
% 39 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 40 [] sum(additive_identity,X,X) | -defined(X).
% 41 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 42 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 43 [] -product(Y,U,V) | -product(Z,U,W) | -product(X,Y,Z) | product(X,V,W).
% 44 [] -product(Y,U,V) | -product(X,V,W) | -product(X,Y,Z) | product(Z,U,W).
% 45 [] product(multiplicative_identity,X,X) | -defined(X).
% 46 [] product(multiplicative_inverse(X),X,multiplicative_identity) | sum(additive_identity,X,additive_identity) | -defined(X).
% 47 [] -product(X,Y,Z) | product(Y,X,Z).
% 48 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(U,W,X) | sum(V,X1,Z).
% 49 [] -product(X,Y,Z) | -product(U,Y,V) | -sum(V,Z,X1) | -sum(U,X,W) | product(W,Y,X1).
% 64 [] defined(a).
% 65 [] defined(b).
% 66 [] defined(u).
% 68 [] defined(l).
% 69 [] -sum(additive_identity,a,additive_identity).
% 70 [] -sum(additive_identity,b,additive_identity).
% 71 [] sum(multiplicative_inverse(a),multiplicative_inverse(b),u).
% 72 [] sum(a,b,k).
% 73 [] product(a,b,l).
% 74 [] -product(k,multiplicative_inverse(l),u).
% 76 [hyper:41,64] sum(additive_inverse(a),a,additive_identity).
% 77 [hyper:45,64] product(multiplicative_identity,a,a).
% 78 [hyper:46,64,cut:69] product(multiplicative_inverse(a),a,multiplicative_identity).
% 98 [hyper:45,65] product(multiplicative_identity,b,b).
% 99 [hyper:46,65,cut:70] product(multiplicative_inverse(b),b,multiplicative_identity).
% 128 [hyper:45,66] product(multiplicative_identity,u,u).
% 213 [hyper:40,68] sum(additive_identity,l,l).
% 216 [hyper:46,68] product(multiplicative_inverse(l),l,multiplicative_identity) | sum(additive_identity,l,additive_identity).
% 575 [hyper:42,72] sum(b,a,k).
% 589 [hyper:47,73] product(b,a,l).
% 2482 [hyper:47,128] product(u,multiplicative_identity,u).
% 4397 [hyper:42,213] sum(l,additive_identity,l).
% 8438 [hyper:43,78,73,98] product(multiplicative_inverse(a),l,b).
% 10228 [hyper:43,99,589,77] product(multiplicative_inverse(b),l,a).
% 11720 [hyper:47,10228] product(l,multiplicative_inverse(b),a).
% 11734 [hyper:49,10228,71,8438,575] product(u,l,k).
% 28447 [hyper:47,216] product(l,multiplicative_inverse(l),multiplicative_identity) | sum(additive_identity,l,additive_identity).
% 37271 [hyper:44,28447,11734,2482,cut:74] sum(additive_identity,l,additive_identity).
% 37759 [hyper:39,37271,4397,4397] sum(l,l,l).
% 41936 [hyper:48,37759,11720,11720,11720] sum(a,a,a).
% 53997 [hyper:39,41936,76,76,cut:69] 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: 393
% derived clauses: 107679
% kept clauses: 10398
% kept size sum: 124489
% kept mid-nuclei: 43476
% kept new demods: 0
% forw unit-subs: 14700
% forw double-subs: 24183
% forw overdouble-subs: 3464
% backward subs: 9
% fast unit cutoff: 308
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 3.5
% process. runtime: 3.5
% specific non-discr-tree subsumption statistics:
% tried: 27011
% length fails: 879
% strength fails: 3485
% predlist fails: 15910
% aux str. fails: 1724
% by-lit fails: 14
% full subs tried: 869
% full subs fail: 869
%
% ; 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/FLD054-4+noeq.in")
%
%------------------------------------------------------------------------------