TSTP Solution File: BOO010-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO010-2 : TPTP v3.4.2. Released v1.0.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 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/BOO/BOO010-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 3 1)
% (binary-posweight-lex-big-order 30 #f 3 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(16,40,0,32,0,0)
%
%
% START OF PROOF
% 17 [] equal(X,X).
% 18 [] equal(add(X,Y),add(Y,X)).
% 19 [] equal(multiply(X,Y),multiply(Y,X)).
% 20 [] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Y,Z))).
% 22 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 24 [] equal(add(X,inverse(X)),multiplicative_identity).
% 26 [] equal(multiply(X,inverse(X)),additive_identity).
% 29 [] equal(multiply(multiplicative_identity,X),X).
% 30 [] equal(add(X,additive_identity),X).
% 31 [] equal(add(additive_identity,X),X).
% 32 [] -equal(add(a,multiply(a,b)),a).
% 33 [para:24.1.1,31.1.1] equal(multiplicative_identity,inverse(additive_identity)).
% 34 [para:26.1.1,29.1.1] equal(additive_identity,inverse(multiplicative_identity)).
% 36 [para:19.1.1,32.1.1.2] -equal(add(a,multiply(b,a)),a).
% 40 [para:24.1.1,20.1.2.1,demod:29] equal(add(multiply(X,Y),inverse(X)),add(Y,inverse(X))).
% 46 [para:33.1.2,40.1.1.2,demod:33] equal(add(multiply(additive_identity,X),multiplicative_identity),add(X,multiplicative_identity)).
% 58 [para:19.1.1,46.1.1.1] equal(add(multiply(X,additive_identity),multiplicative_identity),add(X,multiplicative_identity)).
% 60 [para:29.1.1,22.1.2.1] equal(multiply(add(multiplicative_identity,X),Y),add(Y,multiply(X,Y))).
% 62 [para:26.1.1,22.1.2.1,demod:31] equal(multiply(add(X,Y),inverse(X)),multiply(Y,inverse(X))).
% 133 [para:34.1.2,62.1.1.2,demod:34] equal(multiply(add(multiplicative_identity,X),additive_identity),multiply(X,additive_identity)).
% 161 [para:18.1.1,133.1.1.1] equal(multiply(add(X,multiplicative_identity),additive_identity),multiply(X,additive_identity)).
% 175 [para:161.1.1,58.1.1.1,demod:58] equal(add(X,multiplicative_identity),add(add(X,multiplicative_identity),multiplicative_identity)).
% 185 [para:60.1.2,36.1.1] -equal(multiply(add(multiplicative_identity,b),a),a).
% 201 [para:18.1.1,185.1.1.1] -equal(multiply(add(b,multiplicative_identity),a),a).
% 228 [para:175.1.2,62.1.1.1,demod:29,26] equal(additive_identity,inverse(add(X,multiplicative_identity))).
% 229 [para:228.1.2,24.1.1.2,demod:30] equal(add(X,multiplicative_identity),multiplicative_identity).
% 234 [para:229.1.1,201.1.1.1,demod:29,cut:17] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not 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 1
% clause depth limited to 3
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 101
% derived clauses: 5269
% kept clauses: 201
% kept size sum: 2038
% kept mid-nuclei: 0
% kept new demods: 114
% forw unit-subs: 3497
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/BOO/BOO010-2+eq_r.in")
%
%------------------------------------------------------------------------------