TSTP Solution File: SET839-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET839-2 : TPTP v3.4.2. Released v3.2.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 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP22801/SET/SET839-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 10 #f 3 5)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 5)
% (binary-order 27 #f 3 5)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(7,40,0,14,0,0,127,50,1,134,0,1,291,50,3,298,0,3,455,50,5,462,0,5,619,50,7,626,0,7,783,50,9,790,0,9,947,50,11,954,0,11,1111,50,13,1118,0,14,1275,50,16,1282,0,16,1439,50,20,1446,0,20,1603,50,22,1610,0,22,1767,50,24,1774,0,24,1931,50,25,1938,0,25,2095,50,27,2102,0,27,2259,50,29,2266,0,29,2423,50,31,2430,0,31,2587,50,33,2594,0,33,2751,50,36,2758,0,36,2915,50,38,2922,0,38,3079,50,41,3079,40,41,3086,0,41,3092,50,41,3099,0,41)
%
%
% START OF PROOF
% 3094 [] c_in(X,c_insert(X,Y,Z),Z).
% 3095 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 3096 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 3097 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 3098 [] -c_lessequals(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))).
% 3099 [] -c_in(Y,v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)) | c_lessequals(X,Y,tc_set(t_a)).
% 3103 [binary:3098,3095.2] c_in(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_^s,tc_set(t_a)).
% 3109 [binary:3099,3103] c_lessequals(X,c_^main_^osubset^i__1(v_^s,c_insert(Y,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)).
% 3112 [binary:3103,3109.2] c_lessequals(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_^main_^osubset^i__1(v_^s,c_insert(Y,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)).
% 3114 [binary:3097,3112,cut:3112] equal(c_^main_^osubset^i__1(v_^s,c_insert(X,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_^main_^osubset^i__1(v_^s,c_insert(Y,c_emptyset,tc_set(t_a)),tc_set(t_a))).
% 3116 [para:3114.1.1,3096.1.1,cut:3098,slowcut:3094] 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 4
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 805
% derived clauses: 22093
% kept clauses: 696
% kept size sum: 19196
% kept mid-nuclei: 1599
% kept new demods: 0
% forw unit-subs: 9754
% forw double-subs: 288
% forw overdouble-subs: 2383
% backward subs: 38
% fast unit cutoff: 20
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.43
% process. runtime: 0.41
% specific non-discr-tree subsumption statistics:
% tried: 15820
% length fails: 1216
% strength fails: 532
% predlist fails: 5064
% aux str. fails: 288
% by-lit fails: 0
% full subs tried: 8720
% full subs fail: 6337
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP22801/SET/SET839-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------