TSTP Solution File: ROB004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB004-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 : art01.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/ROB004-1+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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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(8,40,1,16,0,1)
%
%
% START OF PROOF
% 9 [] equal(X,X).
% 10 [] equal(add(X,Y),add(Y,X)).
% 11 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 12 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 13 [] equal(negate(d),c).
% 14 [] equal(add(c,d),d).
% 15 [] equal(add(c,c),c).
% 16 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 18 [para:10.1.1,16.1.1] -equal(add(negate(add(negate(a),negate(b))),negate(add(a,negate(b)))),b).
% 21 [para:14.1.1,11.1.1.1] equal(add(d,X),add(c,add(d,X))).
% 27 [para:21.1.2,10.1.1,demod:11] equal(add(d,X),add(d,add(X,c))).
% 30 [para:13.1.1,12.1.1.1.2.1.2] equal(negate(add(negate(add(X,d)),negate(add(X,c)))),X).
% 34 [para:10.1.1,12.1.1.1.1.1] equal(negate(add(negate(add(X,Y)),negate(add(Y,negate(X))))),Y).
% 35 [para:10.1.1,12.1.1.1.2.1] equal(negate(add(negate(add(X,Y)),negate(add(negate(Y),X)))),X).
% 44 [para:10.1.1,18.1.1.1.1] -equal(add(negate(add(negate(b),negate(a))),negate(add(a,negate(b)))),b).
% 89 [para:10.1.1,30.1.1.1.1.1] equal(negate(add(negate(add(d,X)),negate(add(X,c)))),X).
% 103 [para:27.1.2,34.1.1.1.1.1,demod:89,15,11,13] equal(X,add(X,c)).
% 109 [para:103.1.2,10.1.1] equal(X,add(c,X)).
% 112 [para:103.1.2,34.1.1.1.1.1,demod:109] equal(negate(add(negate(X),negate(negate(X)))),c).
% 117 [para:12.1.1,112.1.1.1.1,demod:12] equal(negate(add(X,negate(X))),c).
% 129 [para:112.1.1,35.1.1.1.2,demod:103] equal(negate(negate(add(negate(negate(X)),X))),negate(negate(X))).
% 130 [para:117.1.1,35.1.1.1.1,demod:129,109] equal(negate(negate(X)),X).
% 134 [para:34.1.1,130.1.1.1] equal(negate(X),add(negate(add(Y,X)),negate(add(X,negate(Y))))).
% 229 [para:10.1.1,44.1.1,demod:130,134,cut:9] 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 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 89
% derived clauses: 5283
% kept clauses: 212
% kept size sum: 2500
% kept mid-nuclei: 0
% kept new demods: 182
% forw unit-subs: 4786
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% 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/ROB/ROB004-1+eq_r.in")
%
%------------------------------------------------------------------------------