TSTP Solution File: SET015-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET015-4 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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 0.0s
% Output : Assurance 0.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/SET015-4+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 4 5)
% (binary-unit 9 #f 4 5)
% (binary-double 9 #f 4 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 5)
% (binary-order 25 #f 4 5)
% (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(16,40,1,32,0,1)
%
%
% START OF PROOF
% 19 [] little_set(f1(X,Y)) | equal(X,Y).
% 20 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 21 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 22 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 23 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 24 [] member(X,intersection(Y,Z)) | -member(X,Y) | -member(X,Z).
% 25 [] -member(X,complement(Y)) | -member(X,Y).
% 26 [] member(X,complement(Y)) | member(X,Y) | -little_set(X).
% 27 [] equal(union(X,Y),complement(intersection(complement(X),complement(Y)))).
% 30 [] equal(union(as,bs),cs).
% 31 [] equal(union(bs,as),ds).
% 32 [] -equal(cs,ds).
% 36 [hyper:32,19] little_set(f1(cs,ds)).
% 37 [hyper:26,19] member(f1(X,Y),complement(Z)) | member(f1(X,Y),Z) | equal(X,Y).
% 39 [hyper:26,36] member(f1(cs,ds),complement(X)) | member(f1(cs,ds),X).
% 49 [hyper:22,39] member(f1(cs,ds),complement(intersection(X,Y))) | member(f1(cs,ds),X).
% 50 [hyper:23,39] member(f1(cs,ds),complement(intersection(X,Y))) | member(f1(cs,ds),Y).
% 55 [hyper:24,39,39] member(f1(cs,ds),intersection(complement(X),Y)) | member(f1(cs,ds),complement(Y)) | member(f1(cs,ds),X).
% 326 [hyper:22,49] member(f1(cs,ds),complement(intersection(intersection(X,Y),Z))) | member(f1(cs,ds),X).
% 327 [hyper:23,49] member(f1(cs,ds),complement(intersection(intersection(X,Y),Z))) | member(f1(cs,ds),Y).
% 533 [hyper:25,37,20,factor] member(f1(X,complement(complement(X))),X) | equal(X,complement(complement(X))).
% 543 [hyper:25,37,20,factor] member(f1(X,complement(complement(X))),complement(complement(X))) | equal(X,complement(complement(X))).
% 841 [hyper:25,326,50,factor] member(f1(cs,ds),complement(intersection(intersection(X,Y),complement(X)))).
% 1752 [hyper:25,327,50,factor] member(f1(cs,ds),complement(intersection(intersection(X,Y),complement(Y)))).
% 12985 [hyper:21,533,binarycut:543] equal(X,complement(complement(X))).
% 12987 [para:12985.1.2,27.1.2.1.2] equal(union(X,complement(Y)),complement(intersection(complement(X),Y))).
% 12988 [para:27.1.2,12985.1.2.1] equal(intersection(complement(X),complement(Y)),complement(union(X,Y))).
% 13577 [para:12987.1.2,12985.1.2.1] equal(intersection(complement(X),Y),complement(union(X,complement(Y)))).
% 13578 [para:12988.1.1,841.1.2.1.1,demod:12987,12985] member(f1(cs,ds),union(union(X,Y),complement(X))).
% 13579 [para:12988.1.1,1752.1.2.1.1,demod:12987,12985] member(f1(cs,ds),union(union(X,Y),complement(Y))).
% 14795 [para:30.1.1,13578.1.2.1] member(f1(cs,ds),union(cs,complement(as))).
% 14796 [para:31.1.1,13578.1.2.1] member(f1(cs,ds),union(ds,complement(bs))).
% 14980 [hyper:25,14795,55,demod:13577] member(f1(cs,ds),complement(as)) | member(f1(cs,ds),cs).
% 15164 [hyper:25,14796,55,demod:13577] member(f1(cs,ds),complement(bs)) | member(f1(cs,ds),ds).
% 15354 [para:30.1.1,13579.1.2.1] member(f1(cs,ds),union(cs,complement(bs))).
% 15355 [para:31.1.1,13579.1.2.1] member(f1(cs,ds),union(ds,complement(as))).
% 15545 [hyper:25,15354,55,demod:13577] member(f1(cs,ds),complement(bs)) | member(f1(cs,ds),cs).
% 16403 [hyper:25,15355,55,demod:13577] member(f1(cs,ds),complement(as)) | member(f1(cs,ds),ds).
% 18967 [hyper:21,15545,15164,cut:32] member(f1(cs,ds),complement(bs)).
% 21686 [hyper:21,16403,14980,cut:32] member(f1(cs,ds),complement(as)).
% 21965 [hyper:24,21686,18967,demod:30,12988] member(f1(cs,ds),complement(cs)).
% 22054 [hyper:24,21686,18967,demod:31,12988] member(f1(cs,ds),complement(ds)).
% 22262 [hyper:25,21965,20,cut:32] member(f1(cs,ds),ds).
% 22469 [hyper:25,22262,cut:22054] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 4
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 396
% derived clauses: 244900
% kept clauses: 17958
% kept size sum: 401411
% kept mid-nuclei: 2270
% kept new demods: 81
% forw unit-subs: 37110
% forw double-subs: 76609
% forw overdouble-subs: 52226
% backward subs: 43
% fast unit cutoff: 17885
% full unit cutoff: 0
% dbl unit cutoff: 437
% real runtime : 6.95
% process. runtime: 6.95
% specific non-discr-tree subsumption statistics:
% tried: 1476927
% length fails: 127025
% strength fails: 653071
% predlist fails: 17648
% aux str. fails: 255899
% by-lit fails: 7739
% full subs tried: 412907
% full subs fail: 359941
%
% ; 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/SET015-4+eq_r.in")
%
%------------------------------------------------------------------------------