TSTP Solution File: ROB014-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB014-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 : art02.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 50.0s
% Output : Assurance 50.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/ROB014-2+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,1,24170,3,2857,39526,4,4295,39526,5,5802,39526,5,5802,39526,1,5802,39526,50,5806,39526,40,5806,39538,0,5806)
%
%
% START OF PROOF
% 39527 [] equal(X,X).
% 39528 [] equal(add(X,Y),add(Y,X)).
% 39529 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 39530 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 39535 [] -equal(negate(add(X,negate(add(Y,Z)))),negate(add(Y,negate(add(X,Z))))) | equal(X,Y).
% 39537 [] equal(negate(add(negate(e),negate(add(d,negate(e))))),d).
% 39538 [] -equal(negate(add(e,add(d,negate(add(d,negate(e)))))),negate(e)).
% 39545 [para:39528.1.1,39537.1.1.1] equal(negate(add(negate(add(d,negate(e))),negate(e))),d).
% 39547 [para:39528.1.1,39545.1.1.1.1.1] equal(negate(add(negate(add(negate(e),d)),negate(e))),d).
% 39553 [para:39529.1.1,39528.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 39557 [para:39553.1.1,39538.1.1.1] -equal(negate(add(negate(add(d,negate(e))),add(e,d))),negate(e)).
% 39568 [para:39528.1.1,39530.1.1.1.1.1] equal(negate(add(negate(add(X,Y)),negate(add(Y,negate(X))))),Y).
% 39569 [para:39528.1.1,39530.1.1.1.2.1] equal(negate(add(negate(add(X,Y)),negate(add(negate(Y),X)))),X).
% 39570 [para:39545.1.1,39530.1.1.1.1] equal(negate(add(d,negate(add(negate(add(d,negate(e))),negate(negate(e)))))),negate(add(d,negate(e)))).
% 39571 [para:39545.1.1,39530.1.1.1.2] equal(negate(add(negate(add(negate(add(d,negate(e))),e)),d)),negate(add(d,negate(e)))).
% 39659 [para:39537.1.1,39535.1.1.1.2] -equal(negate(add(X,d)),negate(add(negate(e),negate(add(X,negate(add(d,negate(e)))))))) | equal(X,negate(e)).
% 39689 [para:39547.1.1,39530.1.1.1.1] equal(negate(add(d,negate(add(negate(add(negate(e),d)),negate(negate(e)))))),negate(add(negate(e),d))).
% 39772 [para:39528.1.1,39568.1.1.1.2.1] equal(negate(add(negate(add(X,Y)),negate(add(negate(X),Y)))),Y).
% 39823 [para:39568.1.1,39569.1.1.1.2] equal(negate(add(negate(add(negate(add(X,negate(Y))),add(Y,X))),X)),negate(add(X,negate(Y)))).
% 41144 [para:39528.1.1,39570.1.1.1.2.1.1.1,demod:39689] equal(negate(add(negate(e),d)),negate(add(d,negate(e)))).
% 41265 [para:39571.1.1,39772.1.1.1.2,demod:39529] equal(negate(add(negate(add(negate(add(d,negate(e))),add(e,d))),negate(add(d,negate(e))))),d).
% 48723 [binary:39557,39659.2,demod:41144,41265,39823,cut:39527] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 948
% derived clauses: 841778
% kept clauses: 48387
% kept size sum: 229633
% kept mid-nuclei: 0
% kept new demods: 3828
% forw unit-subs: 434143
% forw double-subs: 47119
% forw overdouble-subs: 25
% backward subs: 2
% fast unit cutoff: 30
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 59.52
% process. runtime: 59.45
% specific non-discr-tree subsumption statistics:
% tried: 25
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 25
% 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/ROB014-2+eq_r.in")
%
%------------------------------------------------------------------------------