TSTP Solution File: NUM141-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM141-1 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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 249.1s
% Output : Assurance 249.1s
% 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/NUM/NUM141-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(161,40,1,322,0,1,309201,4,2128,310385,5,2804,310386,1,2806,310386,50,2813,310386,40,2813,310547,0,2830,335180,3,4233,338592,4,4932,359930,5,5631,359931,5,5632,359931,1,5632,359931,50,5635,359931,40,5635,360092,0,5635,390413,3,6186,394441,4,6461,408081,5,6736,408083,5,6736,408083,1,6736,408083,50,6739,408083,40,6739,408244,0,6739,440651,3,7614,444237,4,8024,453563,5,8440,453564,5,8440,453564,1,8440,453564,50,8443,453564,40,8443,453725,0,8443,494312,3,9294,498657,4,9720,510389,5,10144,510390,5,10146,510390,1,10146,510390,50,10149,510390,40,10149,510551,0,10149,613292,3,14502,623541,4,16676,651609,5,18866,651610,1,18870,651610,50,18876,651610,40,18876,651771,0,18876,702735,3,20278,703799,4,20978,740473,5,21677,740474,1,21677,740474,50,21679,740474,40,21679,740635,0,21679,863824,3,24585)
%
%
% START OF PROOF
% 740484 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 740487 [] equal(unordered_pair(X,X),singleton(X)).
% 740497 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 740499 [] -member(X,complement(Y)) | -member(X,Y).
% 740500 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 740501 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 740518 [] equal(union(X,singleton(X)),successor(X)).
% 740634 [] member(x,universal_class).
% 740635 [] -member(x,successor(x)).
% 740689 [binary:740634,740484.2] member(x,unordered_pair(x,X)).
% 740696 [para:740487.1.1,740689.1.2] member(x,singleton(x)).
% 740908 [binary:740634,740500.2] member(x,complement(X)) | member(x,X).
% 740949 [binary:740499,740908.2] member(x,complement(complement(X))) | -member(x,X).
% 740952 [binary:740497,740908.2] member(x,complement(intersection(X,Y))) | member(x,Y).
% 745662 [binary:740696,740949.2] member(x,complement(complement(singleton(x)))).
% 745700 [binary:740499,745662] -member(x,complement(singleton(x))).
% 786526 [binary:745700,740952.2] member(x,complement(intersection(X,complement(singleton(x))))).
% 885060 [para:740501.1.1,786526.1.2] member(x,union(X,singleton(x))).
% 885138 [para:740518.1.1,885060.1.2,cut:740635] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 58
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 15393
% derived clauses: 1806942
% kept clauses: 414841
% kept size sum: 0
% kept mid-nuclei: 142931
% kept new demods: 987
% forw unit-subs: 666837
% forw double-subs: 190234
% forw overdouble-subs: 60156
% backward subs: 1335
% fast unit cutoff: 23766
% full unit cutoff: 6512
% dbl unit cutoff: 1041
% real runtime : 255.4
% process. runtime: 253.91
% specific non-discr-tree subsumption statistics:
% tried: 4844105
% length fails: 68662
% strength fails: 1125704
% predlist fails: 1938189
% aux str. fails: 330798
% by-lit fails: 396027
% full subs tried: 704572
% full subs fail: 645387
%
% ; 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/NUM/NUM141-1+eq_r.in")
%
%------------------------------------------------------------------------------