TSTP Solution File: SET015-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET015-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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 367.3s
% Output : Assurance 367.3s
% 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-3+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 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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(145,40,1,290,0,1,223477,4,2103,244034,5,2802,244035,1,2802,244035,50,2806,244035,40,2806,244180,0,2807,291372,3,4209,301209,4,4912,321766,5,5608,321766,5,5609,321767,1,5609,321767,50,5612,321767,40,5612,321912,0,5612,348976,3,6163,353660,4,6438,362236,5,6713,362236,5,6713,362237,1,6713,362237,50,6715,362237,40,6715,362382,0,6715,406173,3,7572,417735,4,7996,466110,5,8416,466111,5,8417,466111,1,8417,466111,50,8419,466111,40,8419,466256,0,8420,528539,3,9273,547505,4,9697,567743,5,10121,567743,1,10121,567743,50,10124,567743,40,10124,567888,0,10124,604444,3,15529,612051,4,16651,627130,5,18826,627131,1,18826,627131,50,18828,627131,40,18828,627276,0,18828,632821,3,20229,636436,4,20929,679841,5,21629,679842,5,21629,679842,1,21629,679842,50,21629,679842,40,21629,679987,0,21629,767113,3,24530,787609,4,25980,809325,5,27430,809326,1,27431,809326,50,27436,809326,40,27436,809471,0,27436,875751,3,28837,880568,4,29537,892090,5,30238,892091,1,30238,892091,50,30242,892091,40,30242,892236,0,30242,947698,3,30800,949078,4,31068,954573,5,31343,954574,1,31343,954574,50,31346,954574,40,31346,954719,0,31347,960316,3,32748,968578,4,33448,1000073,5,34148,1000073,1,34148,1000073,50,34148,1000073,40,34148,1000218,0,34149,1071114,3,35550,1088419,4,36252,1114195,5,36950,1114195,1,36951,1114195,50,36956,1114195,40,36956,1114340,0,36956)
%
%
% START OF PROOF
% 1114199 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 1114200 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 1114224 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1114225 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 1114226 [] member(X,intersection(Y,Z)) | -member(X,Y) | -member(X,Z).
% 1114229 [] equal(union(X,Y),complement(intersection(complement(X),complement(Y)))).
% 1114338 [] equal(union(as,bs),cs).
% 1114339 [] equal(union(bs,as),ds).
% 1114340 [] -equal(cs,ds).
% 1114674 [binary:1114199,1114224] member(f1(X,intersection(Y,Z)),X) | member(f1(X,intersection(Y,Z)),Y) | equal(X,intersection(Y,Z)).
% 1114681 [binary:1114199,1114225] member(f1(X,intersection(Y,Z)),X) | member(f1(X,intersection(Y,Z)),Z) | equal(X,intersection(Y,Z)).
% 1114774 [binary:1114200,1114226] -member(f1(X,intersection(Y,Z)),X) | -member(f1(X,intersection(Y,Z)),Y) | -member(f1(X,intersection(Y,Z)),Z) | equal(X,intersection(Y,Z)).
% 1124800 [binary:1114225,1114674,factor] member(f1(intersection(X,Y),intersection(Y,Z)),Y) | equal(intersection(X,Y),intersection(Y,Z)).
% 1125422 [binary:1114224,1114681,factor] member(f1(intersection(X,Y),intersection(Z,X)),X) | equal(intersection(X,Y),intersection(Z,X)).
% 1128794 [binary:1114226,1114774,factor:factor:factor:binarycut:1124800,factor:binarycut:1125422] equal(intersection(X,Y),intersection(Y,X)).
% 1129245 [para:1128794.1.1,1114229.1.2.1,demod:1114229] equal(union(X,Y),union(Y,X)).
% 1129314 [para:1114338.1.1,1129245.1.1,demod:1114339,cut:1114340] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 27317
% derived clauses: 4011937
% kept clauses: 645196
% kept size sum: 233455
% kept mid-nuclei: 253615
% kept new demods: 573
% forw unit-subs: 1430644
% forw double-subs: 262888
% forw overdouble-subs: 174128
% backward subs: 1002
% fast unit cutoff: 64926
% full unit cutoff: 6095
% dbl unit cutoff: 2180
% real runtime : 376.2
% process. runtime: 372.94
% specific non-discr-tree subsumption statistics:
% tried: 134910379
% length fails: 7722144
% strength fails: 34714983
% predlist fails: 14002255
% aux str. fails: 6054350
% by-lit fails: 5129812
% full subs tried: 65497013
% full subs fail: 65283228
%
% ; 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-3+eq_r.in")
%
%------------------------------------------------------------------------------