TSTP Solution File: BOO013-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO013-4 : TPTP v3.4.2. Released v1.1.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/BOO013-4+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(12,40,0,24,0,0)
%
%
% START OF PROOF
% 13 [] equal(X,X).
% 14 [] equal(add(X,Y),add(Y,X)).
% 15 [] equal(multiply(X,Y),multiply(Y,X)).
% 16 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 18 [] equal(add(X,additive_identity),X).
% 19 [] equal(multiply(X,multiplicative_identity),X).
% 20 [] equal(add(X,inverse(X)),multiplicative_identity).
% 21 [] equal(multiply(X,inverse(X)),additive_identity).
% 22 [] equal(add(a,b),multiplicative_identity).
% 23 [] equal(multiply(a,b),additive_identity).
% 24 [] -equal(b,inverse(a)).
% 26 [para:14.1.1,22.1.1] equal(add(b,a),multiplicative_identity).
% 27 [para:14.1.1,20.1.1] equal(add(inverse(X),X),multiplicative_identity).
% 29 [para:15.1.1,19.1.1] equal(multiply(multiplicative_identity,X),X).
% 39 [para:26.1.1,16.1.2.1,demod:29] equal(add(b,multiply(a,X)),add(b,X)).
% 42 [para:27.1.1,16.1.2.1,demod:29] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 68 [para:21.1.1,39.1.1.2,demod:18] equal(b,add(b,inverse(a))).
% 87 [para:68.1.2,14.1.1] equal(b,add(inverse(a),b)).
% 136 [para:23.1.1,42.1.1.2,demod:87,18] equal(inverse(a),b).
% 142 [para:136.1.1,24.1.2,cut:13] 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: 55
% derived clauses: 1220
% kept clauses: 117
% kept size sum: 1099
% kept mid-nuclei: 0
% kept new demods: 94
% forw unit-subs: 812
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% 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/BOO013-4+eq_r.in")
%
%------------------------------------------------------------------------------