TSTP Solution File: ROB003-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB003-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/ROB003-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(6,40,0,12,0,0)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(add(X,Y),add(Y,X)).
% 9 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 10 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 11 [] equal(add(X,c),c).
% 12 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 13 [para:8.1.1,11.1.1] equal(add(c,X),c).
% 14 [para:9.1.1,8.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 16 [para:8.1.1,9.1.1.1,demod:9] equal(add(X,add(Y,Z)),add(Y,add(X,Z))).
% 20 [para:8.1.1,14.1.2.2] equal(add(X,add(Y,Z)),add(Z,add(Y,X))).
% 40 [para:11.1.1,10.1.1.1.1.1] equal(negate(add(negate(c),negate(add(X,negate(c))))),X).
% 42 [para:8.1.1,10.1.1.1.1.1] equal(negate(add(negate(add(X,Y)),negate(add(Y,negate(X))))),Y).
% 44 [para:13.1.1,10.1.1.1.1.1,demod:13] equal(negate(add(negate(c),negate(c))),c).
% 51 [para:8.1.1,40.1.1.1] equal(negate(add(negate(add(X,negate(c))),negate(c))),X).
% 52 [para:8.1.1,40.1.1.1.2.1] equal(negate(add(negate(c),negate(add(negate(c),X)))),X).
% 53 [para:8.1.1,51.1.1.1.1.1] equal(negate(add(negate(add(negate(c),X)),negate(c))),X).
% 54 [para:51.1.1,10.1.1.1.2,demod:11] equal(negate(add(negate(c),X)),negate(add(X,negate(c)))).
% 102 [para:44.1.1,42.1.1.1.2.1.2,demod:53,11,9] equal(add(negate(c),X),X).
% 104 [para:51.1.1,42.1.1.1.2,demod:102,13] equal(negate(X),negate(add(X,negate(c)))).
% 105 [para:52.1.1,42.1.1.1.2,demod:104,102] equal(negate(add(negate(X),X)),negate(c)).
% 108 [para:54.1.2,42.1.1.1.2,demod:102,13] equal(negate(negate(X)),X).
% 109 [para:10.1.1,108.1.1.1] equal(negate(X),add(negate(add(X,Y)),negate(add(X,negate(Y))))).
% 113 [para:42.1.1,108.1.1.1] equal(negate(X),add(negate(add(Y,X)),negate(add(X,negate(Y))))).
% 143 [para:105.1.1,108.1.1.1,demod:108] equal(c,add(negate(X),X)).
% 153 [para:143.1.2,14.1.1] equal(c,add(X,add(negate(add(Y,X)),Y))).
% 154 [para:143.1.2,14.1.1.2,demod:11] equal(c,add(X,add(Y,negate(X)))).
% 155 [para:143.1.2,14.1.2] equal(add(X,add(Y,negate(add(X,Y)))),c).
% 157 [para:143.1.2,16.1.1.2,demod:11] equal(c,add(negate(X),add(Y,X))).
% 159 [para:143.1.2,20.1.1.2,demod:11] equal(c,add(X,add(negate(X),Y))).
% 234 [para:154.1.2,10.1.1.1.1.1,demod:108,102] equal(add(X,negate(add(Y,negate(X)))),X).
% 250 [para:157.1.2,10.1.1.1.1.1,demod:108,102] equal(add(negate(X),negate(add(Y,X))),negate(X)).
% 260 [para:159.1.2,10.1.1.1.1.1,demod:108,102] equal(add(X,negate(add(negate(X),Y))),X).
% 264 [para:234.1.1,8.1.1] equal(X,add(negate(add(Y,negate(X))),X)).
% 322 [para:260.1.1,8.1.1] equal(X,add(negate(add(negate(X),Y)),X)).
% 330 [para:10.1.1,264.1.2.1.1.2,demod:109] equal(negate(X),add(negate(add(Y,X)),negate(X))).
% 336 [para:10.1.1,322.1.2.1.1.1,demod:109] equal(negate(X),add(negate(add(X,Y)),negate(X))).
% 354 [para:250.1.1,14.1.1.2] equal(add(X,negate(Y)),add(negate(add(Z,Y)),add(X,negate(Y)))).
% 452 [para:153.1.2,42.1.1.1.1.1,demod:108,102,354,9] equal(add(X,negate(Y)),add(negate(add(X,Y)),X)).
% 491 [para:155.1.1,42.1.1.1.1.1,demod:108,102,336,9] equal(add(X,negate(Y)),add(X,negate(add(Y,X)))).
% 683 [para:491.1.2,42.1.1.1.1.1,demod:452,108,330] equal(negate(add(X,Y)),negate(add(Y,X))).
% 686 [para:683.1.1,12.1.1.2,demod:108,113,cut:7] 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: 79
% derived clauses: 12518
% kept clauses: 673
% kept size sum: 12276
% kept mid-nuclei: 0
% kept new demods: 274
% forw unit-subs: 10588
% 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.15
% process. runtime: 0.15
% 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/ROB003-1+eq_r.in")
%
%------------------------------------------------------------------------------