TSTP Solution File: SET014-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET014-2 : 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 20.0s
% Output : Assurance 20.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/SET014-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(24,40,0,48,0,0,29292,4,2042,71570,5,2701,71571,1,2701,71571,50,2702,71571,40,2702,71595,0,2702,71777,50,2703,71801,0,2703)
%
%
% START OF PROOF
% 71779 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 71780 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 71781 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 71786 [] -member(X,union(Y,Z)) | member(X,Y) | member(X,Z).
% 71799 [] subset(as,cs).
% 71800 [] subset(bs,cs).
% 71801 [] -subset(union(as,bs),cs).
% 71811 [binary:71799,71779] -member(X,as) | member(X,cs).
% 71812 [binary:71800,71779] -member(X,bs) | member(X,cs).
% 71820 [binary:71801,71780.2] member(member_of_1_not_of_2(union(as,bs),cs),union(as,bs)).
% 71830 [binary:71801,71781.2] -member(member_of_1_not_of_2(union(as,bs),cs),cs).
% 71861 [binary:71811.2,71830] -member(member_of_1_not_of_2(union(as,bs),cs),as).
% 71862 [binary:71812.2,71830] -member(member_of_1_not_of_2(union(as,bs),cs),bs).
% 72185 [binary:71820,71786,cut:71861,cut:71862] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 5
% clause depth limited to 3
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 760
% derived clauses: 704848
% kept clauses: 54026
% kept size sum: 3540
% kept mid-nuclei: 9602
% kept new demods: 0
% forw unit-subs: 52590
% forw double-subs: 133164
% forw overdouble-subs: 117017
% backward subs: 109
% fast unit cutoff: 27693
% full unit cutoff: 967
% dbl unit cutoff: 140
% real runtime : 27.8
% process. runtime: 27.4
% specific non-discr-tree subsumption statistics:
% tried: 11207981
% length fails: 601121
% strength fails: 3668910
% predlist fails: 2660492
% aux str. fails: 111019
% by-lit fails: 231760
% full subs tried: 3754864
% full subs fail: 3640635
%
% ; 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/SET014-2+noeq.in")
%
%------------------------------------------------------------------------------