TSTP Solution File: SET134-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET134-6 : 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 : art10.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.2s
% Output : Assurance 249.2s
% 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/SET/SET134-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(95,40,2,190,0,2,398194,4,1882,398549,5,2505,398550,1,2508,398550,50,2514,398550,40,2514,398645,0,2514,411609,3,2966,413254,4,3192,421383,5,3415,421384,5,3415,421385,1,3415,421385,50,3417,421385,40,3417,421480,0,3417,449700,3,3868,454077,4,4093,460820,5,4318,460820,1,4318,460820,50,4321,460820,40,4321,460915,0,4321,494795,3,5095,499124,4,5448,505843,5,5822,505844,5,5823,505845,1,5823,505845,50,5825,505845,40,5825,505940,0,5825,538469,3,6580,544257,4,6951,554031,5,7326,554031,5,7327,554032,1,7327,554032,50,7330,554032,40,7330,554127,0,7330,625297,3,9832,628725,4,11082,650442,5,12331,650442,5,12333,650442,1,12333,650442,50,12338,650442,40,12338,650537,0,12339,699352,3,13591,701048,4,14216,744065,5,14840,744065,1,14840,744065,50,14842,744065,40,14842,744160,0,14842,930773,3,19893,1006802,4,22418,1149536,5,24949,1149537,5,24953,1149538,1,24953,1149538,50,24974,1149538,40,24974,1149633,0,24974)
%
%
% START OF PROOF
% 1149548 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 1149560 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1149563 [] -member(X,complement(Y)) | -member(X,Y).
% 1149564 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 1149606 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 1149632 [] member(u,universal_class).
% 1149633 [] equal(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),null_class).
% 1149712 [binary:1149632,1149548.2] member(u,unordered_pair(u,X)).
% 1149992 [binary:1149632,1149564.2] member(u,complement(X)) | member(u,X).
% 1150014 [binary:1149563,1149992.2] member(u,complement(complement(X))) | -member(u,X).
% 1150016 [binary:1149560,1149992.2] member(u,complement(intersection(X,Y))) | member(u,X).
% 1150074 [binary:1149632,1150014.2] member(u,complement(complement(universal_class))).
% 1150077 [binary:1149712,1150014.2] member(u,complement(complement(unordered_pair(u,X)))).
% 1150083 [binary:1149563,1150074] -member(u,complement(universal_class)).
% 1150097 [binary:1149563,1150077] -member(u,complement(unordered_pair(u,X))).
% 1151032 [para:1149633.1.1,1150016.1.2,cut:1150097] member(u,null_class).
% 1151050 [binary:1150083,1150016.2] member(u,complement(intersection(complement(universal_class),X))).
% 1151094 [binary:1150014.2,1151032] member(u,complement(complement(null_class))).
% 1151097 [binary:1149563,1151094] -member(u,complement(null_class)).
% 1151457 [para:1149606.1.1,1151050.1.2.1,cut:1151097] equal(complement(universal_class),null_class).
% 1151478 [para:1151457.1.1,1150083.1.2,cut:1151032] 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 lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 14174
% derived clauses: 2334743
% kept clauses: 389971
% kept size sum: 24545
% kept mid-nuclei: 245785
% kept new demods: 897
% forw unit-subs: 900617
% forw double-subs: 197796
% forw overdouble-subs: 70611
% backward subs: 1050
% fast unit cutoff: 24267
% full unit cutoff: 2726
% dbl unit cutoff: 482
% real runtime : 251.2
% process. runtime: 249.79
% specific non-discr-tree subsumption statistics:
% tried: 8245327
% length fails: 142640
% strength fails: 1903815
% predlist fails: 5421669
% aux str. fails: 84601
% by-lit fails: 16852
% full subs tried: 664031
% full subs fail: 591731
%
% ; 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/SET/SET134-6+eq_r.in")
%
%------------------------------------------------------------------------------