TSTP Solution File: ROB016-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB016-1 : 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 : 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/ROB/ROB016-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 8 5)
% (binary-unit 28 #f 8 5)
% (binary-double 28 #f 8 5)
% (binary 45 #t 8 5)
% (hyper 11 #t 8 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 13 [] equal(X,X).
% 16 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 21 [] positive_integer(k).
% 22 [] equal(negate(add(X,multiply(Y,add(Z,negate(add(Z,negate(X))))))),negate(X)) | -equal(negate(add(negate(X),negate(add(Z,negate(X))))),Z) | -positive_integer(Y).
% 23 [] equal(negate(add(d,e)),negate(e)).
% 24 [] -equal(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e)).
% 49 [para:23.1.1,16.1.1.1.1] equal(negate(add(negate(e),negate(add(d,negate(e))))),d).
% 110 [para:49.1.1,22.2.1,cut:13] equal(negate(add(e,multiply(X,add(d,negate(add(d,negate(e))))))),negate(e)) | -positive_integer(X).
% 2542 [binary:21,110.2,cut:24] 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 5
% clause depth limited to 8
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 198
% derived clauses: 27294
% kept clauses: 2509
% kept size sum: 58092
% kept mid-nuclei: 0
% kept new demods: 1418
% forw unit-subs: 20021
% forw double-subs: 8
% forw overdouble-subs: 246
% backward subs: 0
% fast unit cutoff: 9
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.44
% process. runtime: 0.43
% specific non-discr-tree subsumption statistics:
% tried: 246
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 246
% 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/ROB/ROB016-1+eq_r.in")
%
%------------------------------------------------------------------------------