TSTP Solution File: SET216-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET216-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 : art02.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 427.6s
% Output : Assurance 427.6s
% 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/SET216-6+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(114,40,1,228,0,1,320195,4,2105,320871,5,2802,320872,1,2804,320872,50,2811,320872,40,2811,320986,0,2811,347426,3,4212,351156,4,4912,367157,5,5612,367157,5,5612,367158,1,5612,367158,50,5616,367158,40,5616,367272,0,5635,397125,3,6197,400013,4,6461,405527,5,6736,405527,5,6736,405527,1,6736,405527,50,6738,405527,40,6738,405641,0,6738,434581,3,7602,438400,4,8014,447703,5,8439,447704,5,8439,447704,1,8439,447704,50,8442,447704,40,8442,447818,0,8442,492717,3,9293,497765,4,9719,506931,5,10143,506932,5,10144,506932,1,10144,506932,50,10146,506932,40,10146,507046,0,10146,656686,3,14498,660606,4,16673,680245,5,18847,680246,1,18847,680246,50,18851,680246,40,18851,680360,0,18851,735795,3,20252,736984,4,20952,780793,5,21653,780794,1,21653,780794,50,21654,780794,40,21654,780908,0,21654,908412,3,24556,942035,4,26007,1094668,5,27455,1094670,5,27456,1094670,1,27456,1094670,50,27464,1094670,40,27464,1094784,0,27464,1133324,3,28865,1140539,4,29565,1155931,5,30265,1155933,5,30266,1155933,1,30266,1155933,50,30269,1155933,40,30269,1156047,0,30269,1183814,3,30820,1186965,4,31095,1191383,5,31372,1191383,5,31372,1191383,1,31372,1191383,50,31374,1191383,40,31374,1191497,0,31374,1246717,3,32776,1247835,4,33476,1292055,5,34175,1292055,1,34175,1292055,50,34177,1292055,40,34177,1292169,0,34177,1311438,3,35578,1314066,4,36279,1325252,5,36978,1325252,5,36978,1325253,1,36978,1325253,50,36980,1325253,40,36980,1325367,0,36981,1364517,3,38382,1365726,4,39082,1371338,5,39782,1371339,1,39782,1371339,50,39784,1371339,40,39784,1371453,0,39784,1397201,3,40635,1399375,4,41060,1408181,5,41485,1408182,5,41486,1408183,1,41486,1408183,50,41487,1408183,40,41487,1408297,0,41487,1452710,3,42888,1457382,4,43588)
%
%
% START OF PROOF
% 1408186 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 1408187 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 1408198 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 1408199 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 1408200 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 1408201 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 1408205 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1408297 [] -subclass(cross_product(x,intersection(y,z)),cross_product(x,y)).
% 1408323 [binary:1408297,1408186.2] member(not_subclass_element(cross_product(x,intersection(y,z)),cross_product(x,y)),cross_product(x,intersection(y,z))).
% 1408335 [binary:1408297,1408187.2] -member(not_subclass_element(cross_product(x,intersection(y,z)),cross_product(x,y)),cross_product(x,y)).
% 1408608 [para:1408201.1.1,1408198.1.1,factor] -member(X,cross_product(Y,Z)) | member(first(X),Y).
% 1408614 [para:1408201.1.1,1408199.1.1,factor] -member(X,cross_product(Y,Z)) | member(second(X),Z).
% 1408616 [para:1408201.1.1,1408200.1.1] -member(X,cross_product(Y,Z)) | member(X,cross_product(U,V)) | -member(second(X),V) | -member(first(X),U).
% 1437991 [binary:1408323,1408608] member(first(not_subclass_element(cross_product(x,intersection(y,z)),cross_product(x,y))),x).
% 1438660 [binary:1408323,1408614] member(second(not_subclass_element(cross_product(x,intersection(y,z)),cross_product(x,y))),intersection(y,z)).
% 1439141 [binary:1408335,1408616.2,cut:1437991,slowcut:1408323] -member(second(not_subclass_element(cross_product(x,intersection(y,z)),cross_product(x,y))),y).
% 1458773 [binary:1438660,1408205,cut:1439141] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order 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: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 32688
% derived clauses: 3200616
% kept clauses: 652359
% kept size sum: 0
% kept mid-nuclei: 346728
% kept new demods: 1815
% forw unit-subs: 1171381
% forw double-subs: 398076
% forw overdouble-subs: 152486
% backward subs: 4811
% fast unit cutoff: 56680
% full unit cutoff: 5865
% dbl unit cutoff: 1040
% real runtime : 438.93
% process. runtime: 436.16
% specific non-discr-tree subsumption statistics:
% tried: 26018468
% length fails: 994595
% strength fails: 3434127
% predlist fails: 16915217
% aux str. fails: 463333
% by-lit fails: 356571
% full subs tried: 3607191
% full subs fail: 3453362
%
% ; 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/SET216-6+eq_r.in")
%
%------------------------------------------------------------------------------