TSTP Solution File: ROB022-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ROB022-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 89.5s
% Output : Assurance 89.5s
% 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/ROB022-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,977,3,3013,977,4,4509,977,5,6001,977,1,6001,977,50,6001,977,40,6001,983,0,6001,1946,3,7512,1946,4,8261,1946,5,9002,1946,1,9002,1946,50,9002,1946,40,9002,1952,0,9002)
%
%
% START OF PROOF
% 1947 [] equal(X,X).
% 1948 [] equal(add(X,Y),add(Y,X)).
% 1949 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 1950 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 1951 [] equal(add(c,negate(c)),c).
% 1952 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 1953 [para:1951.1.1,1948.1.1] equal(c,add(negate(c),c)).
% 1954 [para:1951.1.1,1949.1.1.1] equal(add(c,X),add(c,add(negate(c),X))).
% 1956 [para:1951.1.1,1950.1.1.1.2.1] equal(negate(add(negate(add(c,c)),negate(c))),c).
% 1957 [para:1953.1.2,1949.1.1.1] equal(add(c,X),add(negate(c),add(c,X))).
% 1959 [para:1954.1.2,1948.1.1,demod:1949] equal(add(c,X),add(negate(c),add(X,c))).
% 1960 [para:1948.1.1,1954.1.2.2] equal(add(c,X),add(c,add(X,negate(c)))).
% 1962 [para:1957.1.2,1950.1.1.1.1.1] equal(negate(add(negate(add(c,X)),negate(add(negate(c),negate(add(c,X)))))),negate(c)).
% 1966 [para:1959.1.2,1954.1.2.2] equal(add(c,add(X,c)),add(c,add(c,X))).
% 1968 [para:1948.1.1,1952.1.1.1.1] -equal(add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))),b).
% 1973 [para:1948.1.1,1956.1.1.1] equal(negate(add(negate(c),negate(add(c,c)))),c).
% 1976 [para:1956.1.1,1950.1.1.1.2.1.2] equal(negate(add(negate(add(X,add(negate(add(c,c)),negate(c)))),negate(add(X,c)))),X).
% 1978 [para:1973.1.1,1950.1.1.1.2,demod:1957] equal(negate(add(negate(add(c,c)),c)),negate(c)).
% 1980 [para:1948.1.1,1978.1.1.1] equal(negate(add(c,negate(add(c,c)))),negate(c)).
% 1981 [para:1978.1.1,1950.1.1.1.1,demod:1953,1956] equal(negate(c),negate(add(c,c))).
% 1982 [para:1981.1.2,1950.1.1.1.1,demod:1951] equal(negate(add(negate(c),negate(c))),c).
% 1991 [para:1980.1.1,1950.1.1.1.2] equal(negate(add(negate(add(c,add(c,c))),negate(c))),c).
% 1992 [para:1966.1.1,1948.1.1,demod:1949] equal(add(c,add(c,X)),add(X,add(c,c))).
% 2007 [para:1992.1.2,1950.1.1.1.1.1,demod:1981] equal(negate(add(negate(add(c,add(c,X))),negate(add(X,negate(c))))),X).
% 2035 [para:1948.1.1,1991.1.1.1] equal(negate(add(negate(c),negate(add(c,add(c,c))))),c).
% 2048 [para:1992.1.2,1962.1.1.1.1.1,demod:2035] equal(negate(add(negate(add(c,add(c,c))),c)),negate(c)).
% 2055 [para:1948.1.1,2048.1.1.1] equal(negate(add(c,negate(add(c,add(c,c))))),negate(c)).
% 2058 [para:2055.1.1,1950.1.1.1.2] equal(negate(add(negate(add(c,add(c,add(c,c)))),negate(c))),c).
% 2288 [para:1948.1.1,2058.1.1.1] equal(negate(add(negate(c),negate(add(c,add(c,add(c,c)))))),c).
% 2295 [para:1948.1.1,1976.1.1.1.2.1,demod:1981] equal(negate(add(negate(add(X,add(negate(c),negate(c)))),negate(add(c,X)))),X).
% 2306 [para:2288.1.1,1950.1.1.1.2,demod:1957] equal(negate(add(negate(add(c,add(c,add(c,c)))),c)),negate(c)).
% 2309 [para:2306.1.1,1950.1.1.1.1,demod:1953,2058] equal(negate(c),negate(add(c,add(c,add(c,c))))).
% 6527 [para:1992.1.2,2007.1.1.1.1.1.2,demod:1982,1981,1951,1949,2309] equal(c,add(c,c)).
% 6599 [para:6527.1.2,1949.1.1.1] equal(add(c,X),add(c,add(c,X))).
% 6606 [para:6599.1.2,2007.1.1.1.1.1] equal(negate(add(negate(add(c,X)),negate(add(X,negate(c))))),X).
% 6610 [para:1948.1.1,6606.1.1.1] equal(negate(add(negate(add(X,negate(c))),negate(add(c,X)))),X).
% 6668 [para:1960.1.2,6610.1.1.1.2.1,demod:2295,1949] equal(X,add(X,negate(c))).
% 6669 [para:1981.1.2,6610.1.1.1.2,demod:6668,1951] equal(negate(negate(c)),c).
% 6700 [para:6668.1.2,1948.1.1] equal(X,add(negate(c),X)).
% 6704 [para:6700.1.2,1950.1.1.1.1.1,demod:6700] equal(negate(add(negate(X),negate(negate(X)))),negate(c)).
% 6772 [para:1950.1.1,6704.1.1.1.1,demod:1950] equal(negate(add(X,negate(X))),negate(c)).
% 6775 [para:1948.1.1,6772.1.1.1] equal(negate(add(negate(X),X)),negate(c)).
% 6777 [para:6772.1.1,1950.1.1.1.1,demod:6700] equal(negate(negate(add(X,negate(negate(X))))),X).
% 6778 [para:6772.1.1,1950.1.1.1.2,demod:6668] equal(negate(negate(add(X,X))),X).
% 6815 [para:6775.1.1,1950.1.1.1.2,demod:6668] equal(negate(negate(add(negate(negate(X)),X))),negate(negate(X))).
% 6887 [para:1948.1.1,6777.1.1.1.1,demod:6815] equal(negate(negate(X)),X).
% 6899 [para:6778.1.1,6777.1.1.1.1.2,demod:6887,1949] equal(add(X,add(X,X)),add(X,X)).
% 6901 [para:6777.1.1,6777.1.1.1.1.2,demod:6778,6899,1949,6887] equal(X,add(X,X)).
% 6903 [para:1950.1.1,6887.1.1.1] equal(negate(X),add(negate(add(X,Y)),negate(add(X,negate(Y))))).
% 6908 [para:6704.1.1,6887.1.1.1,demod:6887,6669] equal(c,add(negate(X),X)).
% 6909 [para:6772.1.1,6887.1.1.1,demod:6669] equal(c,add(X,negate(X))).
% 6911 [para:6901.1.2,1949.1.1.1] equal(add(X,Y),add(X,add(X,Y))).
% 6922 [para:6908.1.2,1949.1.1.1] equal(add(c,X),add(negate(Y),add(Y,X))).
% 7081 [para:6911.1.2,1948.1.1,demod:1949] equal(add(X,Y),add(X,add(Y,X))).
% 7095 [para:6909.1.2,6911.1.2.2,demod:6909] equal(c,add(X,c)).
% 7096 [para:7095.1.2,1948.1.1] equal(c,add(c,X)).
% 7101 [para:6922.1.2,1948.1.1,demod:1949,7096] equal(c,add(X,add(Y,negate(X)))).
% 7102 [para:1948.1.1,6922.1.2.2,demod:7096] equal(c,add(negate(X),add(Y,X))).
% 7108 [para:7101.1.2,1950.1.1.1.1.1,demod:6887,6700] equal(add(X,negate(add(Y,negate(X)))),X).
% 7111 [para:7102.1.2,1950.1.1.1.1.1,demod:6887,6700] equal(add(negate(X),negate(add(Y,X))),negate(X)).
% 7113 [para:7108.1.1,1948.1.1] equal(X,add(negate(add(Y,negate(X))),X)).
% 7123 [para:1950.1.1,7113.1.2.1.1.2,demod:6903] equal(negate(X),add(negate(add(Y,X)),negate(X))).
% 7134 [para:7081.1.2,7111.1.1.2.1] equal(add(negate(add(X,Y)),negate(add(Y,X))),negate(add(X,Y))).
% 7138 [para:7081.1.2,7123.1.2.1.1,demod:7134] equal(negate(add(X,Y)),negate(add(Y,X))).
% 7144 [para:7138.1.1,1968.1.1.2,demod:6887,6903,cut:1947] 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: 1303
% derived clauses: 8791020
% kept clauses: 7119
% kept size sum: 150994
% kept mid-nuclei: 0
% kept new demods: 1191
% forw unit-subs: 2686492
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 110
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 92.11
% process. runtime: 91.55
% 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/ROB022-1+eq_r.in")
%
%------------------------------------------------------------------------------