TSTP Solution File: SET787-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET787-2 : TPTP v3.4.2. Released v2.7.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 99.4s
% Output : Assurance 99.4s
% 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/SET787-2+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 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 11 #f 4 5)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 5)
% (binary-order 28 #f 4 5)
% (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(150,40,1,300,0,1,50742,4,2104,58713,5,2802,58714,1,2802,58714,50,2804,58714,40,2804,58864,0,2804,78307,3,4205,81436,4,4905,87489,5,5605,87490,1,5606,87490,50,5608,87490,40,5608,87640,0,5608,107684,3,6159,111248,4,6434,118616,5,6709,118616,5,6709,118616,1,6709,118616,50,6711,118616,40,6711,118766,0,6711,145466,3,7600,149532,4,7994,155841,5,8412,155842,5,8413,155843,1,8413,155843,50,8415,155843,40,8415,155993,0,8415,188938,3,9274,194191,4,9704)
%
%
% START OF PROOF
% 155860 [] member(X,un(Y,Z)) | -member(X,Z).
% 155861 [] member(X,un(Y,Z)) | -member(X,Y).
% 155938 [] -member(X,cons(Y,eptset)) | equal(X,Y).
% 155939 [] -member(X,cons(Y,Z)) | member(X,Z) | equal(X,Y).
% 155946 [] member(X,union^e_sk1(X,Y)) | -member(X,union(Y)).
% 155947 [] member(union^e_sk1(X,Y),Y) | -member(X,union(Y)).
% 155952 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 155976 [] -equal(X,Y) | subset(X,Y).
% 155992 [] member(sk2,union(cons(a,cons(b,eptset)))).
% 155993 [] -member(sk2,un(a,b)).
% 155995 [binary:155860,155993] -member(sk2,b).
% 155996 [binary:155861,155993] -member(sk2,a).
% 156053 [binary:155952.3,155995] -subset(X,b) | -member(sk2,X).
% 156082 [binary:155952.3,155996] -subset(X,a) | -member(sk2,X).
% 156159 [binary:155946.2,155992] member(sk2,union^e_sk1(sk2,cons(a,cons(b,eptset)))).
% 156160 [binary:155947.2,155992] member(union^e_sk1(sk2,cons(a,cons(b,eptset))),cons(a,cons(b,eptset))).
% 156537 [binary:155976.2,156053] -member(sk2,X) | -equal(X,b).
% 156903 [binary:155976.2,156082] -member(sk2,X) | -equal(X,a).
% 183999 [binary:156537,156159] -equal(union^e_sk1(sk2,cons(a,cons(b,eptset))),b).
% 184001 [binary:156903,156159] -equal(union^e_sk1(sk2,cons(a,cons(b,eptset))),a).
% 184086 [binary:155939,156160,cut:184001] member(union^e_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset)).
% 204636 [binary:184086,155938,cut:183999] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5940
% derived clauses: 1425565
% kept clauses: 155125
% kept size sum: 882735
% kept mid-nuclei: 40892
% kept new demods: 151
% forw unit-subs: 147717
% forw double-subs: 46585
% forw overdouble-subs: 18564
% backward subs: 165
% fast unit cutoff: 1013
% full unit cutoff: 587
% dbl unit cutoff: 32
% real runtime : 100.9
% process. runtime: 99.41
% specific non-discr-tree subsumption statistics:
% tried: 170922
% length fails: 11387
% strength fails: 5329
% predlist fails: 66590
% aux str. fails: 9474
% by-lit fails: 333
% full subs tried: 76830
% full subs fail: 58559
%
% ; 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/SET787-2+eq_r.in")
%
%------------------------------------------------------------------------------