TSTP Solution File: SET149-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET149-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 : art09.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 159.0s
% Output : Assurance 159.0s
% 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/SET149-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,366684,4,2107,367461,5,2802,367462,1,2804,367462,50,2811,367462,40,2811,367576,0,2811,391623,3,4213,395342,4,4915,407765,5,5612,407766,5,5612,407767,1,5612,407767,50,5615,407767,40,5615,407881,0,5615,437928,3,6166,442194,4,6441,454620,5,6716,454621,5,6717,454621,1,6717,454621,50,6719,454621,40,6719,454735,0,6719,490971,3,7570,495856,4,7995,501419,5,8420,501419,5,8422,501419,1,8422,501419,50,8427,501419,40,8427,501533,0,8427,544568,3,9279,549972,4,9703,550992,5,10128,550992,1,10128,550992,50,10130,550992,40,10130,551106,0,10130,652226,3,14486,655353,4,16657)
%
%
% START OF PROOF
% 550995 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 550996 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 551000 [] -subclass(X,Y) | -subclass(Y,X) | equal(Y,X).
% 551014 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 551015 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 551016 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 551106 [] -equal(intersection(x,intersection(x,y)),intersection(x,y)).
% 551107 [binary:551000.3,551106] -subclass(intersection(x,intersection(x,y)),intersection(x,y)) | -subclass(intersection(x,y),intersection(x,intersection(x,y))).
% 551158 [binary:550995.2,551107] member(not_subclass_element(intersection(x,intersection(x,y)),intersection(x,y)),intersection(x,intersection(x,y))) | -subclass(intersection(x,y),intersection(x,intersection(x,y))).
% 551160 [?] ?
% 557860 [binary:551015,551158,binarycut:551160] -subclass(intersection(x,y),intersection(x,intersection(x,y))).
% 557870 [binary:550995.2,557860] member(not_subclass_element(intersection(x,y),intersection(x,intersection(x,y))),intersection(x,y)).
% 557871 [binary:550996.2,557860] -member(not_subclass_element(intersection(x,y),intersection(x,intersection(x,y))),intersection(x,intersection(x,y))).
% 653478 [binary:551014,557870] member(not_subclass_element(intersection(x,y),intersection(x,intersection(x,y))),x).
% 655437 [binary:557871,551016,cut:557870,cut:653478] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9078
% derived clauses: 1083082
% kept clauses: 299838
% kept size sum: 0
% kept mid-nuclei: 36254
% kept new demods: 360
% forw unit-subs: 307547
% forw double-subs: 83667
% forw overdouble-subs: 23390
% backward subs: 658
% fast unit cutoff: 4233
% full unit cutoff: 3672
% dbl unit cutoff: 257
% real runtime : 167.86
% process. runtime: 166.75
% specific non-discr-tree subsumption statistics:
% tried: 34078800
% length fails: 1530351
% strength fails: 3149763
% predlist fails: 20273817
% aux str. fails: 860092
% by-lit fails: 965439
% full subs tried: 6920130
% full subs fail: 6895176
%
% ; 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/SET149-6+eq_r.in")
%
%------------------------------------------------------------------------------