TSTP Solution File: FLD009-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD009-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 : 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 49.7s
% Output : Assurance 49.7s
% 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/FLD009-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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 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(31,40,0,62,0,0,650532,4,2028,650818,50,2073,650818,40,2073,650849,0,2073,697300,3,2574,705595,4,2824,717921,5,3074,717921,1,3074,717921,50,3078,717921,40,3078,717952,0,3078,776971,3,3879,786762,4,4279,810382,5,4679,810382,1,4679,810382,50,4685,810382,40,4685,810413,0,4685)
%
%
% START OF PROOF
% 810387 [] equalish(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)) | -defined(Y) | -defined(Z) | -defined(X).
% 810388 [] equalish(multiply(multiplicative_identity,X),X) | -defined(X).
% 810389 [] equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity) | equalish(X,additive_identity) | -defined(X).
% 810397 [] defined(multiplicative_inverse(X)) | equalish(X,additive_identity) | -defined(X).
% 810404 [] -equalish(X,Y) | equalish(Y,X).
% 810405 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 810407 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 810410 [] defined(a).
% 810411 [] defined(b).
% 810412 [] -equalish(a,additive_identity).
% 810413 [] -equalish(multiply(a,X),b).
% 810425 [binary:810389.3,810410,cut:810412] equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity).
% 810436 [binary:810397.3,810410,cut:810412] defined(multiplicative_inverse(a)).
% 810450 [binary:810387.3,810411] equalish(multiply(X,multiply(Y,b)),multiply(multiply(X,Y),b)) | -defined(X) | -defined(Y).
% 810452 [binary:810388.2,810411] equalish(multiply(multiplicative_identity,b),b).
% 810535 [binary:810405.3,810413] -equalish(multiply(a,X),Y) | -equalish(Y,b).
% 810576 [binary:810404,810452] equalish(b,multiply(multiplicative_identity,b)).
% 810609 [binary:810405,810576] -equalish(multiply(multiplicative_identity,b),X) | equalish(b,X).
% 811103 [binary:810404,810425] equalish(multiplicative_identity,multiply(a,multiplicative_inverse(a))).
% 818084 [binary:810404.2,810535.2] -equalish(multiply(a,X),Y) | -equalish(b,Y).
% 823698 [binary:810407,810609,cut:810411] equalish(b,multiply(X,b)) | -equalish(multiplicative_identity,X).
% 859287 [binary:810450,818084,cut:810410,binarydemod:823698] -equalish(multiplicative_identity,multiply(a,X)) | -defined(X).
% 859326 [binary:810436,859287.2,cut:811103] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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 3
% seconds given: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6884
% derived clauses: 2947047
% kept clauses: 243416
% kept size sum: 767751
% kept mid-nuclei: 36501
% kept new demods: 0
% forw unit-subs: 52742
% forw double-subs: 188519
% forw overdouble-subs: 17410
% backward subs: 10
% fast unit cutoff: 3871
% full unit cutoff: 3
% dbl unit cutoff: 209
% real runtime : 58.23
% process. runtime: 57.72
% specific non-discr-tree subsumption statistics:
% tried: 271730
% length fails: 213
% strength fails: 16481
% predlist fails: 92422
% aux str. fails: 687
% by-lit fails: 268
% full subs tried: 144519
% full subs fail: 138198
%
% ; 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/FLD009-1+noeq.in")
%
%------------------------------------------------------------------------------