TSTP Solution File: ROB023-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB023-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 : art05.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 88.9s
% Output : Assurance 88.9s
% 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/ROB023-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 *********
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,0,12,0,0,946,3,3003,946,4,4524,946,5,6001,946,1,6001,946,50,6001,946,40,6001,952,0,6001,1889,3,7503,1889,4,8255,1889,5,9002,1889,1,9002,1889,50,9002,1889,40,9002,1895,0,9002)
%
%
% START OF PROOF
% 1890 [] equal(X,X).
% 1891 [] equal(add(X,Y),add(Y,X)).
% 1892 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 1893 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 1894 [] equal(add(X,X),X).
% 1895 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 1897 [para:1894.1.1,1892.1.1.1] equal(add(X,Y),add(X,add(X,Y))).
% 1898 [para:1894.1.1,1893.1.1.1.1.1] equal(negate(add(negate(X),negate(add(X,negate(X))))),X).
% 1899 [para:1894.1.1,1893.1.1.1.2.1] equal(negate(add(negate(add(negate(X),X)),negate(negate(X)))),negate(X)).
% 1900 [para:1897.1.2,1891.1.1,demod:1892] equal(add(X,Y),add(X,add(Y,X))).
% 1907 [para:1891.1.1,1898.1.1.1] equal(negate(add(negate(add(X,negate(X))),negate(X))),X).
% 1909 [para:1892.1.1,1898.1.1.1.2.1] equal(negate(add(negate(add(X,Y)),negate(add(X,add(Y,negate(add(X,Y))))))),add(X,Y)).
% 1911 [para:1898.1.1,1893.1.1.1.2,demod:1900] equal(negate(add(negate(add(negate(X),X)),X)),negate(X)).
% 1918 [para:1891.1.1,1907.1.1.1.1.1] equal(negate(add(negate(add(negate(X),X)),negate(X))),X).
% 1935 [para:1891.1.1,1911.1.1.1] equal(negate(add(X,negate(add(negate(X),X)))),negate(X)).
% 1947 [para:1918.1.1,1893.1.1.1.1,demod:1899] equal(negate(add(X,negate(X))),negate(add(negate(X),X))).
% 1952 [para:1891.1.1,1935.1.1.1.2.1] equal(negate(add(X,negate(add(X,negate(X))))),negate(X)).
% 1959 [para:1935.1.1,1907.1.1.1.1.1.2,demod:1952,1892,1947] equal(negate(add(negate(add(X,add(negate(add(X,negate(X))),negate(X)))),negate(X))),add(X,negate(add(X,negate(X))))).
% 1974 [para:1907.1.1,1899.1.1.1.1.1.1,demod:1959,1907] equal(add(X,negate(add(X,negate(X)))),X).
% 1981 [para:1974.1.1,1891.1.1] equal(X,add(negate(add(X,negate(X))),X)).
% 1987 [para:1981.1.2,1892.1.1.1] equal(add(X,Y),add(negate(add(X,negate(X))),add(X,Y))).
% 2207 [para:1898.1.1,1909.1.1.1.1,demod:1974,1947,1981,1898] equal(negate(X),add(negate(X),negate(add(X,negate(X))))).
% 2213 [para:1911.1.1,1909.1.1.1.1,demod:2207,1987,1981,1947] equal(negate(negate(X)),X).
% 2229 [para:1893.1.1,2213.1.1.1] equal(negate(X),add(negate(add(X,Y)),negate(add(X,negate(Y))))).
% 2272 [para:1891.1.1,2229.1.2.1.1] equal(negate(X),add(negate(add(Y,X)),negate(add(X,negate(Y))))).
% 2278 [para:2229.1.2,1897.1.2.2,demod:2229] equal(negate(X),add(negate(add(X,Y)),negate(X))).
% 2305 [para:1891.1.1,2278.1.2.1.1] equal(negate(X),add(negate(add(Y,X)),negate(X))).
% 2308 [para:1893.1.1,2278.1.2.2,demod:2213,2229] equal(X,add(negate(add(negate(X),Y)),X)).
% 2317 [para:2308.1.2,1891.1.1] equal(X,add(X,negate(add(negate(X),Y)))).
% 2331 [para:1891.1.1,2317.1.2.2.1] equal(X,add(X,negate(add(Y,negate(X))))).
% 2353 [para:1893.1.1,2331.1.2.2.1.2,demod:2229] equal(negate(X),add(negate(X),negate(add(Y,X)))).
% 2385 [para:1900.1.2,2305.1.2.1.1] equal(negate(add(X,Y)),add(negate(add(Y,X)),negate(add(X,Y)))).
% 2399 [para:1900.1.2,2353.1.2.2.1,demod:2385] equal(negate(add(X,Y)),negate(add(Y,X))).
% 2410 [para:2399.1.1,1895.1.1.2,demod:2213,2272,cut:1890] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 979
% derived clauses: 5611214
% kept clauses: 2385
% kept size sum: 51101
% kept mid-nuclei: 0
% kept new demods: 648
% forw unit-subs: 1792428
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 91.27
% process. runtime: 90.9
% 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/ROB023-1+eq_r.in")
%
%------------------------------------------------------------------------------